Kees Middelburg

According to our database, Kees Middelburg authored at least 120 papers between 1982 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Complementing an imperative process algebra with a rely/guarantee logic.

Cornelis A. Middelburg

CoRR, February, 2025

Formalizing the Notions of Non-Interactive and Interactive Algorithms.

Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2025

2024

Imperative Process Algebra and Models of Parallel Computation.

Cornelis A. Middelburg

Theory Comput. Syst., June, 2024

Paraconsistent logic and query answering in inconsistent databases.

Cornelis A. Middelburg

J. Appl. Non Class. Logics, January, 2024

On the Formalization of the Notion of an Algorithm.

Cornelis A. Middelburg

Proceedings of the Practice of Formal Methods: Essays in Honour of Cliff Jones, Part II, 2024

Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis.

Cornelis A. Middelburg

Theor. Comput. Sci., 2024

Space-time process algebra with asynchronous communication.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2024

On the formalization of the notion of an interactive algorithm.

Cornelis A. Middelburg

CoRR, 2024

The interdefinability of expansions of Belnap-Dunn logic.

Cornelis A. Middelburg

CoRR, 2024

On the formalization of the notion of an algorithm.

Cornelis A. Middelburg

CoRR, 2024

2023

Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values.

Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2023

A Conventional Expansion of First-Order Belnap-Dunn Logic.

Cornelis A. Middelburg

CoRR, 2023

2022

Program Algebra for Random Access Machine Programs.

Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2022

Imperative Process Algebra with Abstraction.

Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2022

2021

On the strongest three-valued paraconsistent logic contained in classical logic and its dual.

Cornelis A. Middelburg

J. Log. Comput., 2021

Using Hoare Logic in a Process Algebra Setting.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2021

Dormancy-aware timed branching bisimilarity.

Cornelis A. Middelburg

CoRR, 2021

2020

On the complexity of the correctness problem for non-zeroness test instruction sequences.

Jan A. Bergstra, Cornelis A. Middelburg

Theor. Comput. Sci., 2020

Probabilistic Process Algebra and Strategic Interleaving.

Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2020

A classical-logic view of a paraconsistent logic.

Cornelis A. Middelburg

CoRR, 2020

On infinite guarded recursive specifications in process algebra.

Rob J. van Glabbeek, Cornelis A. Middelburg

CoRR, 2020

Process algebra, process scheduling, and mutual exclusion.

Cornelis A. Middelburg

CoRR, 2020

2019

Process Algebra with Strategic Interleaving.

Jan A. Bergstra, Cornelis A. Middelburg

Theory Comput. Syst., 2019

Program Algebra for Turing-Machine Programs.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2019

2018

Instruction Sequences Expressing Multiplication Algorithms.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2018

A Short Introduction to Program Algebra with Instructions for Boolean Registers.

Jan A. Bergstra, Cornelis A. Middelburg

Comput. Sci. J. Moldova, 2018

2017

Contradiction-Tolerant Process Algebra with Propositional Signals.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2017

Axioms for Behavioural Congruence of Single-Pass Instruction Sequences.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2017

On the strongest three-valued paraconsistent logic contained in classical logic.

Cornelis A. Middelburg

CoRR, 2017

2016

Transformation of fractions into simple fractions in divisive meadows.

Jan A. Bergstra, Cornelis A. Middelburg

J. Appl. Log., 2016

Instruction Sequence Size Complexity of Parity.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2016

A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2016

On Instruction Sets for Boolean Registers in Program Algebra.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2016

A short introduction to process theory.

Cornelis A. Middelburg

CoRR, 2016

2015

Division by zero in non-involutive meadows.

Jan A. Bergstra, Cornelis A. Middelburg

J. Appl. Log., 2015

On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2015

Probabilistic Thread Algebra.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2015

2014

Instruction Sequence Based Non-uniform Complexity Classes.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2014

A Thread Algebra with Probabilistic Features.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2014

2013

A Process Calculus with Finitary Comprehended Terms.

Jan A. Bergstra, Cornelis A. Middelburg

Theory Comput. Syst., 2013

Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2013

Timed Tuplix Calculus and the Wesseling and van den Bergh Equation.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2013

Network algebra for synchronous dataflow

Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu

CoRR, 2013

Long multiplication by instruction sequences with backward jump instructions.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2013

Instruction sequence expressions for the Karatsuba multiplication algorithm.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2013

Instruction sequence expressions for the secure hash algorithm SHA-256.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2013

2012

Instruction Sequences for Computer Science.

Jan A. Bergstra, Cornelis A. Middelburg

Atlantis Studies in Computing 2, Atlantis Press, ISBN: 978-94-91216-65-7, 2012

On the Expressiveness of Single-Pass Instruction Sequences.

Jan A. Bergstra, Cornelis A. Middelburg

Theory Comput. Syst., 2012

On the Behaviours Produced by Instruction Sequences under Execution.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2012

Indirect Jumps Improve Instruction Sequence Performance.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2012

Process algebra with conditionals in the presence of epsilon

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2012

Turing Impossibility Properties for Stack Machine Programming

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2012

Instruction sequence processing operators.

Jan A. Bergstra, Cornelis A. Middelburg

Acta Informatica, 2012

2011

Inversive meadows and divisive meadows.

Jan A. Bergstra, Cornelis A. Middelburg

J. Appl. Log., 2011

Thread algebra for poly-threading.

Jan A. Bergstra, Cornelis A. Middelburg

Formal Aspects Comput., 2011

Thread Extraction for Polyadic Instruction Sequences.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2011

A Survey of Paraconsistent Logics

Cornelis A. Middelburg

CoRR, 2011

2010

On the operating unit size of load/store architectures.

Jan A. Bergstra, Cornelis A. Middelburg

Math. Struct. Comput. Sci., 2010

A thread calculus with molecular dynamics.

Jan A. Bergstra, Cornelis A. Middelburg

Inf. Comput., 2010

Data Linkage Dynamics with Shedding.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2010

An Interface Group for Process Components.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2010

Searching publications on software testing

Cornelis A. Middelburg

CoRR, 2010

On the definition of a theoretical concept of an operating system

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2010

Searching publications on operating systems

Cornelis A. Middelburg

CoRR, 2010

2009

Instruction Sequences with Dynamically Instantiated Instructions.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2009

Autosolvability of halting problem instances for instruction sequences

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Functional units for natural numbers

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Arithmetical meadows

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Instruction sequence notations with probabilistic instructions

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

A protocol for instruction stream processing

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Meadow Enriched ACP Process Algebras

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Timed tuplix calculus and the Wesseling and van den Berg equation

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Partial Komori fields and imperative Komori fields.

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2009

Machine structure oriented control code logic.

Jan A. Bergstra, Cornelis A. Middelburg

Acta Informatica, 2009

Transmission Protocols for Instruction Streams.

Jan A. Bergstra, Cornelis A. Middelburg

Proceedings of the Theoretical Aspects of Computing, 2009

2008

Maurer computers for pipelined instruction processing.

Jan A. Bergstra, Cornelis A. Middelburg

Math. Struct. Comput. Sci., 2008

Program algebra with a jump-shift instruction.

Jan A. Bergstra, Cornelis A. Middelburg

J. Appl. Log., 2008

Simulating Turing machines on Maurer machines.

Jan A. Bergstra, Cornelis A. Middelburg

J. Appl. Log., 2008

Distributed strategic interleaving with load balancing.

Jan A. Bergstra, Cornelis A. Middelburg

Future Gener. Comput. Syst., 2008

Instruction sequences for the production of processes

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2008

Instruction sequences and non-uniform complexity theory

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2008

Thread algebra for sequential poly-threading

Jan A. Bergstra, Cornelis A. Middelburg

CoRR, 2008

2007

Preferential choice and coordination conditions.

Jan A. Bergstra, Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2007

Maurer Computers with Single-Thread Control.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2007

Thread algebra for strategic interleaving.

Jan A. Bergstra, Cornelis A. Middelburg

Formal Aspects Comput., 2007

Programming an Interpreter Using Molecular Dynamics.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2007

Instruction Sequences with Indirect Jumps.

Jan A. Bergstra, Cornelis A. Middelburg

Sci. Ann. Comput. Sci., 2007

Synchronous cooperation for explicit multi-threading.

Jan A. Bergstra, Cornelis A. Middelburg

Acta Informatica, 2007

2006

Continuity controlled hybrid automata.

Jan A. Bergstra, Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2006

Splitting bisimulations and retrospective conditions.

Jan A. Bergstra, Cornelis A. Middelburg

Inf. Comput., 2006

Thread Algebra with Multi-Level Strategies.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2006

Parallel Processes with Implicit Computational Capital.

Jan A. Bergstra, Cornelis A. Middelburg

Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

2005

Process algebra for hybrid systems.

Jan A. Bergstra, Cornelis A. Middelburg

Theor. Comput. Sci., 2005

Conditionals in Algebraic Process Calculi.

Cornelis A. Middelburg

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

A Thread Algebra with Multi-level Strategic Interleaving.

Jan A. Bergstra, Cornelis A. Middelburg

Proceedings of the New Computational Paradigms, 2005

Strong Splitting Bisimulation Equivalence.

Jan A. Bergstra, Cornelis A. Middelburg

Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

Model Theory for Process Algebra.

Jan A. Bergstra, Cornelis A. Middelburg

Proceedings of the Processes, 2005

2004

Located Actions in Process Algebra with Timing.

Jan A. Bergstra, Cornelis A. Middelburg

Fundam. Informaticae, 2004

2003

Revisiting timing in process algebra.

Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2003

An alternative formulation of operational conservativity with binding terms.

Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2003

2002

Process Algebra with Timing

Jos C. M. Baeten, Cornelis A. Middelburg

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04995-2, 2002

Process Algebra with Nonstandard Timing.

Kees Middelburg

Fundam. Informaticae, 2002

2001

Variable binding operators in transition system specifications.

Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2001

Real time process algebra with time-dependent conditions.

Jos C. M. Baeten, Cornelis A. Middelburg

J. Log. Algebraic Methods Program., 2001

Discrete Time Process Algebra and the Semantics of SDL.

Jan A. Bergstra, Cornelis A. Middelburg, Yaroslav S. Usenko

Proceedings of the Handbook of Process Algebra, 2001

Process Algebra with Timing: Real Time and Discrete Time.

Jos C. M. Baeten, Cornelis A. Middelburg

Proceedings of the Handbook of Process Algebra, 2001

1998

Truth of Duration Calculus Formulae in Timed Frames.

Cornelis A. Middelburg

Fundam. Informaticae, 1998

1997

Network algebra for asynchronous dataflow.

Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu

Int. J. Comput. Math., 1997

1996

Algebra of timed frames.

Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg

Int. J. Comput. Math., 1996

1994

A Typed Logic of Partial Functions Reconstructed Classically.

Cliff B. Jones, Cornelis A. Middelburg

Acta Informatica, 1994

Formalisation of Properties for Feature Interaction Detection: Experience in a Real-Life Situation.

Wiet Bouma, Willem J. M. Levelt, Alfo Melisse, Kees Middelburg, Louis Verhaard

Proceedings of the Towards a Pan-European Telecommunication Service Infrastructure, 1994

Notations for software design.

Loe M. G. Feijs, Hans Jonkers, Cornelis A. Middelburg

FACIT: Formal approaches to computing and information technology, Springer, ISBN: 978-3-540-19902-1, 1994

1992

Specification of interfering programs based on interconditions.

Cornelis A. Middelburg

Softw. Eng. J., 1992

Modular Structuring of VDM Specifications in VVSL.

Cornelis A. Middelburg

Formal Aspects Comput., 1992

VVSL Specification of a Transaction-oriented Access Handler.

Cornelis A. Middelburg

Proceedings of the Specifications of Database Systems, 1992

1991

LPF and MPL_omega - A Logical Comparison of VDM SL and COLD-K.

Cornelis A. Middelburg, Gerard R. Renardel de Lavalette

Proceedings of the VDM '91, 1991

1989

VVSL: A Language for Structured VDM Specifications.

Cornelis A. Middelburg

Formal Aspects Comput., 1989

Experiences with Combining Formalisms in VVSL.

Cornelis A. Middelburg

Proceedings of the Algebraic Methods II: Theory, 1989

1988

The VIP VDM Specification Language.

Kees Middelburg

Proceedings of the VDM '88, 1988

1982

The Effect of the PDP-11 Architecture on Code Generation for Chill.

Cornelis A. Middelburg

Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, 1982