Kees Middelburg

According to our database1, Kees Middelburg authored at least 121 papers between 1982 and 2018.

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



In proceedings 
PhD thesis 





Instruction Sequences Expressing Multiplication Algorithms.
Sci. Ann. Comp. Sci., 2018

A short introduction to program algebra with instructions for Boolean registers.
CoRR, 2018

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

Contradiction-Tolerant Process Algebra with Propositional Signals.
Fundam. Inform., 2017

Axioms for Behavioural Congruence of Single-Pass Instruction Sequences.
Sci. Ann. Comp. Sci., 2017

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

Process algebra with strategic interleaving.
CoRR, 2017

Axioms for behavioural congruence of single-pass instruction sequences.
CoRR, 2017

Transformation of fractions into simple fractions in divisive meadows.
J. Applied Logic, 2016

Instruction Sequence Size Complexity of Parity.
Fundam. Inform., 2016

A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences.
Sci. Ann. Comp. Sci., 2016

On Instruction Sets for Boolean Registers in Program Algebra.
Sci. Ann. Comp. Sci., 2016

A short introduction to process theory.
CoRR, 2016

Division by zero in non-involutive meadows.
J. Applied Logic, 2015

On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions.
Fundam. Inform., 2015

Probabilistic Thread Algebra.
Sci. Ann. Comp. Sci., 2015

Transformation of fractions into simple fractions in divisive meadows.
CoRR, 2015

Contradiction-tolerant process algebra with propositional signals.
CoRR, 2015

On instruction sets for Boolean registers in program algebra.
CoRR, 2015

Instruction Sequence Based Non-uniform Complexity Classes.
Sci. Ann. Comp. Sci., 2014

Division by zero in non-involutive meadows.
CoRR, 2014

Instruction sequence size complexity of parity.
CoRR, 2014

A Thread Algebra with Probabilistic Features.
CoRR, 2014

A Hoare-like logic of asserted single-pass instruction sequences.
CoRR, 2014

On algorithmic equivalence of instruction sequences for computing bit string functions.
CoRR, 2014

A Process Calculus with Finitary Comprehended Terms.
Theory Comput. Syst., 2013

Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.
Fundam. Inform., 2013

Timed Tuplix Calculus and the Wesseling and van den Bergh Equation.
Sci. Ann. Comp. Sci., 2013

Network algebra for synchronous dataflow
CoRR, 2013

Instruction sequence based non-uniform complexity classes
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

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. Inform., 2012

Indirect Jumps Improve Instruction Sequence Performance.
Sci. Ann. Comp. 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 Inf., 2012

Inversive meadows and divisive meadows.
J. Applied Logic, 2011

Thread algebra for poly-threading.
Formal Asp. Comput., 2011

Thread Extraction for Polyadic Instruction Sequences.
Sci. Ann. Comp. Sci., 2011

On the behaviours produced by instruction sequences under execution
CoRR, 2011

A Survey of Paraconsistent Logics
CoRR, 2011

On the operating unit size of load/store architectures.
Mathematical Structures in Computer Science, 2010

A thread calculus with molecular dynamics.
Inf. Comput., 2010

Data Linkage Dynamics with Shedding.
Fundam. Inform., 2010

An Interface Group for Process Components.
Fundam. Inform., 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

Instruction Sequences with Dynamically Instantiated Instructions.
Fundam. Inform., 2009

Autosolvability of halting problem instances for instruction sequences
CoRR, 2009

Functional units for natural numbers
CoRR, 2009

Instruction sequence processing operators
CoRR, 2009

Indirect jumps improve instruction sequence performance
CoRR, 2009

Arithmetical meadows
CoRR, 2009

Instruction sequence notations with probabilistic instructions
CoRR, 2009

A protocol for instruction stream processing
CoRR, 2009

A process calculus with finitary comprehended terms
CoRR, 2009

Transmission protocols for instruction streams
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

Inversive Meadows and Divisive Meadows.
CoRR, 2009

Machine structure oriented control code logic.
Acta Inf., 2009

Transmission Protocols for Instruction Streams.
Proceedings of the Theoretical Aspects of Computing, 2009

Maurer computers for pipelined instruction processing.
Mathematical Structures in Computer Science, 2008

Program algebra with a jump-shift instruction.
J. Applied Logic, 2008

Simulating Turing machines on Maurer machines.
J. Applied Logic, 2008

Distributed strategic interleaving with load balancing.
Future Generation Comp. Syst., 2008

Parallel Processes with Implicit Computational Capital.
Electr. Notes Theor. Comput. Sci., 2008

Instruction sequences for the production of processes
CoRR, 2008

On the expressiveness of single-pass instruction sequences
CoRR, 2008

Instruction sequences and non-uniform complexity theory
CoRR, 2008

Data linkage dynamics with shedding
CoRR, 2008

Data linkage algebra, data linkage dynamics, and priority rewriting
CoRR, 2008

Thread algebra for sequential poly-threading
CoRR, 2008

Thread extraction for polyadic instruction sequences
CoRR, 2008

Programming an interpreter using molecular dynamics
CoRR, 2008

A Thread Algebra with Multi-Level Strategic Interleaving.
Theory Comput. Syst., 2007

Preferential choice and coordination conditions.
J. Log. Algebr. Program., 2007

Maurer Computers with Single-Thread Control.
Fundam. Inform., 2007

Thread algebra for strategic interleaving.
Formal Asp. Comput., 2007

Programming an Interpreter Using Molecular Dynamics.
Sci. Ann. Comp. Sci., 2007

Instruction Sequences with Indirect Jumps.
Sci. Ann. Comp. Sci., 2007

Program algebra with a jump-shift instruction
CoRR, 2007

Instruction Sequences with Dynamically Instantiated Instructions
CoRR, 2007

A thread calculus with molecular dynamics
CoRR, 2007

On the operating unit size of load/store architectures
CoRR, 2007

Machine structure oriented control code logic
CoRR, 2007

An interface group for process components
CoRR, 2007

Instruction sequences with indirect jumps
CoRR, 2007

Synchronous cooperation for explicit multi-threading.
Acta Inf., 2007

Continuity controlled hybrid automata.
J. Log. Algebr. Program., 2006

Splitting bisimulations and retrospective conditions.
Inf. Comput., 2006

Thread Algebra with Multi-Level Strategies.
Fundam. Inform., 2006

Conditionals in Algebraic Process Calculi.
Electr. Notes Theor. Comput. Sci., 2006

Process algebra for hybrid systems.
Theor. Comput. Sci., 2005

A Thread Algebra with Multi-level Strategic Interleaving.
Proceedings of the New Computational Paradigms, 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

Located Actions in Process Algebra with Timing.
Fundam. Inform., 2004

Revisiting timing in process algebra.
J. Log. Algebr. Program., 2003

An alternative formulation of operational conservativity with binding terms.
J. Log. Algebr. Program., 2003

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. Inform., 2002

Variable binding operators in transition system specifications.
J. Log. Algebr. Program., 2001

Real time process algebra with time-dependent conditions.
J. Log. Algebr. Program., 2001

Truth of Duration Calculus Formulae in Timed Frames.
Fundam. Inform., 1998

A Typed Logic of Partial Functions Reconstructed Classically.
Acta Inf., 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

Specification of interfering programs based on interconditions.
Software Engineering Journal, 1992

Modular Structuring of VDM Specifications in VVSL.
Formal Asp. Comput., 1992

LPF and MPLomega - A Logical Comparison of VDM SL and COLD-K.
Proceedings of the VDM '91, 1991

VVSL: A Language for Structured VDM Specifications.
Formal Asp. Comput., 1989

Experiences with Combining Formalisms in VVSL.
Proceedings of the Algebraic Methods II: Theory, 1989

The VIP VDM Specification Language.
Proceedings of the VDM '88, 1988

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