Alban Ponse

CoRR, 2024

2023

Conditional logic as a short-circuit logic.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Non-commutative propositional logic with short-circuited biconditional and NAND.

[BibT_eX]

[DOI]

Dalia Papuc

CoRR, 2022

2021

Datatype defining rewrite systems for naturals and integers.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Non-commutative propositional logic with short-circuit evaluation.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2021

2020

Arithmetical datatypes with true fractions.

[BibT_eX]

[DOI]

Acta Informatica, 2020

2018

An independent axiomatisation for free short-circuit logic.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2018

Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant.

[BibT_eX]

[DOI]

CoRR, 2018

2017

An independent axiomatization for free short-circuit logic.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view.

[BibT_eX]

[DOI]

CoRR, 2016

Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2016

2015

Equations for formally real meadows.

[BibT_eX]

[DOI]

J. Appl. Log., 2015

Evaluation trees for proposition algebra.

[BibT_eX]

[DOI]

CoRR, 2015

Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence.

[BibT_eX]

[DOI]

Proceedings of the Correct System Design, 2015

Division by Zero in Common Meadows.

[BibT_eX]

[DOI]

Proceedings of the Software, 2015

2014

Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Cancellation Meadows: A Generic Basis Theorem and Some Applications.

[BibT_eX]

[DOI]

Comput. J., 2013

2011

Proposition algebra.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday.

[BibT_eX]

[DOI]

Piet Rodenburg

Theor. Comput. Sci., 2011

Proposition Algebra and Short-Circuit Logic.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010

On Hoare-McCarthy algebras

[BibT_eX]

[DOI]

CoRR, 2010

Short-circuit logic

[BibT_eX]

[DOI]

CoRR, 2010

2009

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2009

A progression ring for interfaces of instruction sequences, threads, and services

[BibT_eX]

[DOI]

CoRR, 2009

2008

Risk Assessment for One-Counter Threads.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Tuplix Calculus.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2008

An Instruction Sequence Semigroup with Repeaters

[BibT_eX]

[DOI]

CoRR, 2008

Proposition Algebra with Projective Limits

[BibT_eX]

[DOI]

CoRR, 2008

Differential Meadows.

[BibT_eX]

[DOI]

CoRR, 2008

2007

Belnap's logic and conditional composition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Execution architectures for program algebra.

[BibT_eX]

[DOI]

J. Appl. Log., 2007

Interface groups and financial transfer architectures

[BibT_eX]

[DOI]

CoRR, 2007

Projection semantics for rigid loops

[BibT_eX]

[DOI]

CoRR, 2007

Decision problems for pushdown threads.

[BibT_eX]

[DOI]

Acta Informatica, 2007

2006

An Introduction to Program and Thread Algebra.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

A Generalization of ACP Using Belnap's Logic.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

A Bypass of Cohen's Impossibility Result.

[BibT_eX]

[DOI]

Proceedings of the Advances in Grid Computing, 2005

2003

Branching time and orthogonal bisimulation equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Program algebra with unit instruction operators.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2002

Combining programs and state machines.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2002

2001

Non-regular iterators in process algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Linearization in parallel pCRL.

[BibT_eX]

[DOI]

Yaroslav S. Usenko

J. Log. Algebraic Methods Program., 2001

[BibT_eX]

[DOI]

J. ACM, 2001

Equivalence of recursive specifications in process algebra.

[BibT_eX]

[DOI]

Yaroslav S. Usenko

Inf. Process. Lett., 2001

Process algebra and conditional composition.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Process Algebra with Recursive Operations.

[BibT_eX]

[DOI]

Wan J. Fokkink

Proceedings of the Handbook of Process Algebra, 2001

2000

Process Algebra with Four-Valued Logic.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2000

1998

Bochvar-McCarthy Logic and Process Algebra.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1998

Kleene's Three-Valued Logic and Process Algebra.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Grid Protocol Specifications.

[BibT_eX]

[DOI]

Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1997

Algebra of Communicating Processes - Preface to the Special Issue.

[BibT_eX]

[DOI]

Chris Verhoef

Bas van Vlijmen

Theor. Comput. Sci., 1997

Two Finite Specifications of a Queue.

[BibT_eX]

[DOI]

Marc Bezem

Theor. Comput. Sci., 1997

Grid Protocols Based on Synchronous Communication.

[BibT_eX]

[DOI]

Joris A. Hillebrand

Sci. Comput. Program., 1997

1996

Computable Processes and Bisimulation Equivalence.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1996

1994

Process Algebra with Guards: Combining Hoare Logic with Process Algebra.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1994

Process Algebra with Iteration and Nesting.

[BibT_eX]

[DOI]

Comput. J., 1994

1993

Proof Theory for µCRL: A Language for Processes with Data.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Specification Languages (SoSL), 1993

Process Algebra with Backtracking.

[BibT_eX]

[DOI]

Jos van Wamel

Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Process Algebra with Combinators.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1991

Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule

[BibT_eX]

[DOI]

Inf. Comput., December, 1991

Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract).

[BibT_eX]

[DOI]