Alban Ponse

According to our database1, Alban Ponse authored at least 59 papers between 1991 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 





An independent axiomatisation for free short-circuit logic.
Journal of Applied Non-Classical Logics, 2018

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

An independent axiomatization for free short-circuit logic.
CoRR, 2017

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

Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract).
Proceedings of the Recent Trends in Algebraic Development Techniques, 2016

Equations for formally real meadows.
J. Applied Logic, 2015

Evaluation trees for proposition algebra.
CoRR, 2015

Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence.
Proceedings of the Correct System Design, 2015

Division by Zero in Common Meadows.
Proceedings of the Software, 2015

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

Equations for formally real meadows.
CoRR, 2013

Cancellation Meadows: A Generic Basis Theorem and Some Applications.
Comput. J., 2013

Proposition algebra.
ACM Trans. Comput. Log., 2011

Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday.
Theor. Comput. Sci., 2011

Proposition Algebra and Short-Circuit Logic.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

On Hoare-McCarthy algebras
CoRR, 2010

Short-circuit logic
CoRR, 2010

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms.
Sci. Ann. Comp. Sci., 2009

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

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
CoRR, 2009

Risk Assessment for One-Counter Threads.
Theory Comput. Syst., 2008

Tuplix Calculus.
Sci. Ann. Comp. Sci., 2008

An Instruction Sequence Semigroup with Repeaters
CoRR, 2008

Proposition Algebra with Projective Limits
CoRR, 2008

Differential Meadows.
CoRR, 2008

Cancellation Meadows: a Generic Basis Theorem and Some Applications.
CoRR, 2008

Belnap's logic and conditional composition.
Theor. Comput. Sci., 2007

A generalization of ACP using Belnap's logic.
J. Log. Algebr. Program., 2007

Execution architectures for program algebra.
J. Applied Logic, 2007

Tuplix Calculus
CoRR, 2007

Interface groups and financial transfer architectures
CoRR, 2007

Projection semantics for rigid loops
CoRR, 2007

Decision problems for pushdown threads.
Acta Inf., 2007

A Generalization of ACP Using Belnap's Logic.
Electr. Notes Theor. Comput. Sci., 2006

An Introduction to Program and Thread Algebra.
Proceedings of the Logical Approaches to Computational Barriers, 2006

A Bypass of Cohen's Impossibility Result.
Proceedings of the Advances in Grid Computing, 2005

Branching time and orthogonal bisimulation equivalence.
Theor. Comput. Sci., 2003

Program algebra with unit instruction operators.
J. Log. Algebr. Program., 2002

Combining programs and state machines.
J. Log. Algebr. Program., 2002

Non-regular iterators in process algebra.
Theor. Comput. Sci., 2001

Linearization in parallel pCRL.
J. Log. Algebr. Program., 2001

Register-machine based processes.
J. ACM, 2001

Equivalence of recursive specifications in process algebra.
Inf. Process. Lett., 2001

Process algebra and conditional composition.
Inf. Process. Lett., 2001

Process Algebra with Four-Valued Logic.
Journal of Applied Non-Classical Logics, 2000

Bochvar-McCarthy Logic and Process Algebra.
Notre Dame Journal of Formal Logic, 1998

Kleene's Three-Valued Logic and Process Algebra.
Inf. Process. Lett., 1998

Grid Protocol Specifications.
Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

Algebra of Communicating Processes - Preface to the Special Issue.
Theor. Comput. Sci., 1997

Two Finite Specifications of a Queue.
Theor. Comput. Sci., 1997

Grid Protocols Based on Synchronous Communication.
Sci. Comput. Program., 1997

Computable Processes and Bisimulation Equivalence.
Formal Asp. Comput., 1996

Process Algebra with Guards: Combining Hoare Logic with Process Algebra.
Formal Asp. Comput., 1994

Process Algebra with Iteration and Nesting.
Comput. J., 1994

Proof Theory for muCRL: A Language for Processes with Data.
Proceedings of the Semantics of Specification Languages (SoSL), 1993

Process Algebra with Backtracking.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Process Algebra with Combinators.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule
Inf. Comput., December, 1991

Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract).
Proceedings of the CONCUR '91, 1991