2024
The interdefinability of expansions of Belnap-Dunn logic.
CoRR, 2024
On the formalization of the notion of an algorithm.
CoRR, 2024
2023
Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values.
Sci. Ann. Comput. Sci., 2023
A Conventional Expansion of First-Order Belnap-Dunn Logic.
CoRR, 2023
2022
Program Algebra for Random Access Machine Programs.
Sci. Ann. Comput. Sci., 2022
Imperative Process Algebra with Abstraction.
Sci. Ann. Comput. Sci., 2022
Paraconsistent logic and query answering in inconsistent databases.
CoRR, 2022
Imperative process algebra and models of parallel computation.
CoRR, 2022
2021
On the strongest three-valued paraconsistent logic contained in classical logic and its dual.
J. Log. Comput., 2021
Using Hoare Logic in a Process Algebra Setting.
Fundam. Informaticae, 2021
Dormancy-aware timed branching bisimilarity.
CoRR, 2021
2020
On the complexity of the correctness problem for non-zeroness test instruction sequences.
Theor. Comput. Sci., 2020
Probabilistic Process Algebra and Strategic Interleaving.
Sci. Ann. Comput. Sci., 2020
A classical-logic view of a paraconsistent logic.
CoRR, 2020
On infinite guarded recursive specifications in process algebra.
CoRR, 2020
Process algebra, process scheduling, and mutual exclusion.
CoRR, 2020
2019
Process Algebra with Strategic Interleaving.
Theory Comput. Syst., 2019
Program Algebra for Turing-Machine Programs.
Sci. Ann. Comput. Sci., 2019
2018
Instruction Sequences Expressing Multiplication Algorithms.
Sci. Ann. Comput. Sci., 2018
A Short Introduction to Program Algebra with Instructions for Boolean Registers.
Comput. Sci. J. Moldova, 2018
2017
Contradiction-Tolerant Process Algebra with Propositional Signals.
Fundam. Informaticae, 2017
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences.
Sci. Ann. Comput. Sci., 2017
On the strongest three-valued paraconsistent logic contained in classical logic.
CoRR, 2017
2016
Transformation of fractions into simple fractions in divisive meadows.
J. Appl. Log., 2016
Instruction Sequence Size Complexity of Parity.
Fundam. Informaticae, 2016
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences.
Sci. Ann. Comput. Sci., 2016
On Instruction Sets for Boolean Registers in Program Algebra.
Sci. Ann. Comput. Sci., 2016
A short introduction to process theory.
CoRR, 2016
2015
Division by zero in non-involutive meadows.
J. Appl. Log., 2015
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions.
Fundam. Informaticae, 2015
Probabilistic Thread Algebra.
Sci. Ann. Comput. Sci., 2015
2014
Instruction Sequence Based Non-uniform Complexity Classes.
Sci. Ann. Comput. Sci., 2014
A Thread Algebra with Probabilistic Features.
CoRR, 2014
2013
A Process Calculus with Finitary Comprehended Terms.
Theory Comput. Syst., 2013
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.
Fundam. Informaticae, 2013
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation.
Sci. Ann. Comput. Sci., 2013
Network algebra for synchronous dataflow
CoRR, 2013
Long multiplication by instruction sequences with backward jump instructions.
CoRR, 2013
Instruction sequence expressions for the Karatsuba multiplication algorithm.
CoRR, 2013
Instruction sequence expressions for the secure hash algorithm SHA-256.
CoRR, 2013
2012
Instruction Sequences for Computer Science.
Atlantis Studies in Computing 2, Atlantis Press, ISBN: 978-94-91216-65-7, 2012
On the Expressiveness of Single-Pass Instruction Sequences.
Theory Comput. Syst., 2012
On the Behaviours Produced by Instruction Sequences under Execution.
Fundam. Informaticae, 2012
Indirect Jumps Improve Instruction Sequence Performance.
Sci. Ann. Comput. Sci., 2012
Process algebra with conditionals in the presence of epsilon
CoRR, 2012
Turing Impossibility Properties for Stack Machine Programming
CoRR, 2012
Instruction sequence processing operators.
Acta Informatica, 2012
2011
Inversive meadows and divisive meadows.
J. Appl. Log., 2011
Thread algebra for poly-threading.
Formal Aspects Comput., 2011
Thread Extraction for Polyadic Instruction Sequences.
Sci. Ann. Comput. Sci., 2011
A Survey of Paraconsistent Logics
CoRR, 2011
2010
On the operating unit size of load/store architectures.
Math. Struct. Comput. Sci., 2010
A thread calculus with molecular dynamics.
Inf. Comput., 2010
Data Linkage Dynamics with Shedding.
Fundam. Informaticae, 2010
An Interface Group for Process Components.
Fundam. Informaticae, 2010
Searching publications on software testing
CoRR, 2010
On the definition of a theoretical concept of an operating system
CoRR, 2010
Searching publications on operating systems
CoRR, 2010
2009
Instruction Sequences with Dynamically Instantiated Instructions.
Fundam. Informaticae, 2009
Autosolvability of halting problem instances for instruction sequences
CoRR, 2009
Functional units for natural numbers
CoRR, 2009
Instruction sequence notations with probabilistic instructions
CoRR, 2009
A protocol for instruction stream processing
CoRR, 2009
Meadow Enriched ACP Process Algebras
CoRR, 2009
Timed tuplix calculus and the Wesseling and van den Berg equation
CoRR, 2009
Partial Komori fields and imperative Komori fields.
CoRR, 2009
Machine structure oriented control code logic.
Acta Informatica, 2009
Transmission Protocols for Instruction Streams.
Proceedings of the Theoretical Aspects of Computing, 2009
2008
Maurer computers for pipelined instruction processing.
Math. Struct. Comput. Sci., 2008
Program algebra with a jump-shift instruction.
J. Appl. Log., 2008
Simulating Turing machines on Maurer machines.
J. Appl. Log., 2008
Distributed strategic interleaving with load balancing.
Future Gener. Comput. Syst., 2008
Instruction sequences for the production of processes
CoRR, 2008
Instruction sequences and non-uniform complexity theory
CoRR, 2008
Thread algebra for sequential poly-threading
CoRR, 2008
2007
A Thread Algebra with Multi-Level Strategic Interleaving.
Theory Comput. Syst., 2007
Preferential choice and coordination conditions.
J. Log. Algebraic Methods Program., 2007
Maurer Computers with Single-Thread Control.
Fundam. Informaticae, 2007
Thread algebra for strategic interleaving.
Formal Aspects Comput., 2007
Programming an Interpreter Using Molecular Dynamics.
Sci. Ann. Comput. Sci., 2007
Instruction Sequences with Indirect Jumps.
Sci. Ann. Comput. Sci., 2007
Synchronous cooperation for explicit multi-threading.
Acta Informatica, 2007
2006
Continuity controlled hybrid automata.
J. Log. Algebraic Methods Program., 2006
Splitting bisimulations and retrospective conditions.
Inf. Comput., 2006
Thread Algebra with Multi-Level Strategies.
Fundam. Informaticae, 2006
Parallel Processes with Implicit Computational Capital.
Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006
2005
Process algebra for hybrid systems.
Theor. Comput. Sci., 2005
Conditionals in Algebraic Process Calculi.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005
Strong Splitting Bisimulation Equivalence.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005
Model Theory for Process Algebra.
Proceedings of the Processes, 2005
2004
Located Actions in Process Algebra with Timing.
Fundam. Informaticae, 2004
2003
Revisiting timing in process algebra.
J. Log. Algebraic Methods Program., 2003
An alternative formulation of operational conservativity with binding terms.
J. Log. Algebraic Methods Program., 2003
2002
Process Algebra with Timing
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04995-2, 2002
Process Algebra with Nonstandard Timing.
Fundam. Informaticae, 2002
2001
Variable binding operators in transition system specifications.
J. Log. Algebraic Methods Program., 2001
Real time process algebra with time-dependent conditions.
J. Log. Algebraic Methods Program., 2001
Discrete Time Process Algebra and the Semantics of SDL.
Proceedings of the Handbook of Process Algebra, 2001
Process Algebra with Timing: Real Time and Discrete Time.
Proceedings of the Handbook of Process Algebra, 2001
1998
Truth of Duration Calculus Formulae in Timed Frames.
Fundam. Informaticae, 1998
1997
Network algebra for asynchronous dataflow.
Int. J. Comput. Math., 1997
1996
Int. J. Comput. Math., 1996
1994
A Typed Logic of Partial Functions Reconstructed Classically.
Acta Informatica, 1994
Formalisation of Properties for Feature Interaction Detection: Experience in a Real-Life Situation.
Proceedings of the Towards a Pan-European Telecommunication Service Infrastructure, 1994
Notations for software design.
FACIT: Formal approaches to computing and information technology, Springer, ISBN: 978-3-540-19902-1, 1994
1992
Specification of interfering programs based on interconditions.
Softw. Eng. J., 1992
Modular Structuring of VDM Specifications in VVSL.
Formal Aspects Comput., 1992
VVSL Specification of a Transaction-oriented Access Handler.
Proceedings of the Specifications of Database Systems, 1992
1991
LPF and MPL<sub>omega</sub> - A Logical Comparison of VDM SL and COLD-K.
Proceedings of the VDM '91, 1991
1989
VVSL: A Language for Structured VDM Specifications.
Formal Aspects Comput., 1989
Experiences with Combining Formalisms in VVSL.
Proceedings of the Algebraic Methods II: Theory, 1989
1988
The VIP VDM Specification Language.
Proceedings of the VDM '88, 1988
1982
The Effect of the PDP-11 Architecture on Code Generation for Chill.
Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, 1982
