Cornelis A. Middelburg

156 papers A* 1B 1C 2Journal 139Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Complementing an imperative process algebra with a rely/guarantee logic. CoRR Cornelis A. Middelburg
2025	J	`jnl`	Formalizing the Notions of Non-Interactive and Interactive Algorithms. Sci. Ann. Comput. Sci. Cornelis A. Middelburg
2024	J	`jnl`	Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis. Theor. Comput. Sci. Cornelis A. Middelburg
2024	J	`jnl`	Imperative Process Algebra and Models of Parallel Computation. Theory Comput. Syst. Cornelis A. Middelburg
2024	—	`ch.`	On the Formalization of the Notion of an Algorithm. The Practice of Formal Methods (II) Cornelis A. Middelburg
2024	J	`jnl`	On the formalization of the notion of an algorithm. CoRR Cornelis A. Middelburg
2024	J	`jnl`	On the formalization of the notion of an interactive algorithm. CoRR Cornelis A. Middelburg
2024	J	`jnl`	Paraconsistent logic and query answering in inconsistent databases. J. Appl. Non Class. Logics Cornelis A. Middelburg
2024	J	`jnl`	Space-time process algebra with asynchronous communication. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2024	J	`jnl`	The interdefinability of expansions of Belnap-Dunn logic. CoRR Cornelis A. Middelburg
2023	J	`jnl`	A Conventional Expansion of First-Order Belnap-Dunn Logic. CoRR Cornelis A. Middelburg
2023	J	`jnl`	Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values. Sci. Ann. Comput. Sci. Cornelis A. Middelburg
2023	J	`jnl`	Belnap-Dunn logic and query answering in inconsistent databases with null values. CoRR Cornelis A. Middelburg
2022	J	`jnl`	Imperative Process Algebra with Abstraction. Sci. Ann. Comput. Sci. Cornelis A. Middelburg
2022	J	`jnl`	Imperative process algebra and models of parallel computation. CoRR Cornelis A. Middelburg
2022	J	`jnl`	Paraconsistent logic and query answering in inconsistent databases. CoRR Cornelis A. Middelburg
2022	J	`jnl`	Program Algebra for Random Access Machine Programs. Sci. Ann. Comput. Sci. Cornelis A. Middelburg
2021	J	`jnl`	Dormancy-aware timed branching bisimilarity. CoRR Cornelis A. Middelburg
2021	J	`jnl`	Imperative process algebra with abstraction. CoRR Cornelis A. Middelburg
2021	J	`jnl`	On the strongest three-valued paraconsistent logic contained in classical logic and its dual. J. Log. Comput. Cornelis A. Middelburg
2021	J	`jnl`	Using Hoare Logic in a Process Algebra Setting. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2020	J	`jnl`	A classical-logic view of a paraconsistent logic. CoRR Cornelis A. Middelburg
2020	J	`jnl`	On infinite guarded recursive specifications in process algebra. CoRR Rob J. van Glabbeek, Cornelis A. Middelburg
2020	J	`jnl`	On the complexity of the correctness problem for non-zeroness test instruction sequences. Theor. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2020	J	`jnl`	Probabilistic Process Algebra and Strategic Interleaving. Sci. Ann. Comput. Sci. Cornelis A. Middelburg
2020	J	`jnl`	Process algebra, process scheduling, and mutual exclusion. CoRR Cornelis A. Middelburg
2020	J	`jnl`	Program algebra for random access machine programs. CoRR Cornelis A. Middelburg
2019	J	`jnl`	Probabilistic process algebra and strategic interleaving. CoRR Cornelis A. Middelburg
2019	J	`jnl`	Process Algebra with Strategic Interleaving. Theory Comput. Syst. Jan A. Bergstra, Cornelis A. Middelburg
2019	J	`jnl`	Program Algebra for Turing-Machine Programs. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2019	J	`jnl`	Program algebra for Turing-machine programs. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2019	J	`jnl`	Using Hoare logic in a process algebra setting. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2018	J	`jnl`	A Short Introduction to Program Algebra with Instructions for Boolean Registers. Comput. Sci. J. Moldova Jan A. Bergstra, Cornelis A. Middelburg
2018	J	`jnl`	A short introduction to program algebra with instructions for Boolean registers. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2018	J	`jnl`	Instruction Sequences Expressing Multiplication Algorithms. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2018	J	`jnl`	On the complexity of the correctness problem for non-zeroness test instruction sequences. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2017	J	`jnl`	Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2017	J	`jnl`	Axioms for behavioural congruence of single-pass instruction sequences. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2017	J	`jnl`	Contradiction-Tolerant Process Algebra with Propositional Signals. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2017	J	`jnl`	On the strongest three-valued paraconsistent logic contained in classical logic. CoRR Cornelis A. Middelburg
2017	J	`jnl`	Process algebra with strategic interleaving. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2016	J	`jnl`	A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2016	J	`jnl`	A short introduction to process theory. CoRR Cornelis A. Middelburg
2016	J	`jnl`	Instruction Sequence Size Complexity of Parity. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2016	J	`jnl`	On Instruction Sets for Boolean Registers in Program Algebra. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2016	J	`jnl`	Transformation of fractions into simple fractions in divisive meadows. J. Appl. Log. Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	Contradiction-tolerant process algebra with propositional signals. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	Division by zero in non-involutive meadows. J. Appl. Log. Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	On instruction sets for Boolean registers in program algebra. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	Probabilistic Thread Algebra. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2015	J	`jnl`	Transformation of fractions into simple fractions in divisive meadows. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	A Hoare-like logic of asserted single-pass instruction sequences. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	A Thread Algebra with Probabilistic Features. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	Division by zero in non-involutive meadows. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	Instruction Sequence Based Non-uniform Complexity Classes. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	Instruction sequence size complexity of parity. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2014	J	`jnl`	On algorithmic equivalence of instruction sequences for computing bit string functions. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Instruction sequence based non-uniform complexity classes CoRR Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Instruction sequence expressions for the Karatsuba multiplication algorithm. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Instruction sequence expressions for the secure hash algorithm SHA-256. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Long multiplication by instruction sequences with backward jump instructions. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2013	J	`jnl`	Network algebra for synchronous dataflow CoRR Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu
2013	J	`jnl`	Timed Tuplix Calculus and the Wesseling and van den Bergh Equation. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	Indirect Jumps Improve Instruction Sequence Performance. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2012	—	`book`	Instruction Sequences for Computer Science. Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	Instruction sequence processing operators. Acta Informatica Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	Process algebra with conditionals in the presence of epsilon CoRR Jan A. Bergstra, Cornelis A. Middelburg
2012	J	`jnl`	Turing Impossibility Properties for Stack Machine Programming CoRR Jan A. Bergstra, Cornelis A. Middelburg
2011	J	`jnl`	A Survey of Paraconsistent Logics CoRR Cornelis A. Middelburg
2011	J	`jnl`	Inversive meadows and divisive meadows. J. Appl. Log. Jan A. Bergstra, Cornelis A. Middelburg
2011	J	`jnl`	On the behaviours produced by instruction sequences under execution CoRR Jan A. Bergstra, Cornelis A. Middelburg
2011	J	`jnl`	Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2011	J	`jnl`	Thread algebra for poly-threading. Formal Aspects Comput. Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	A thread calculus with molecular dynamics. Inf. Comput. Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	An Interface Group for Process Components. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	Data Linkage Dynamics with Shedding. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	On the definition of a theoretical concept of an operating system CoRR Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	On the operating unit size of load/store architectures. Math. Struct. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2010	J	`jnl`	Searching publications on operating systems CoRR Cornelis A. Middelburg
2010	J	`jnl`	Searching publications on software testing CoRR Cornelis A. Middelburg
2009	J	`jnl`	A process calculus with finitary comprehended terms CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	A protocol for instruction stream processing CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Arithmetical meadows CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Autosolvability of halting problem instances for instruction sequences CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Functional units for natural numbers CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Indirect jumps improve instruction sequence performance CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Instruction Sequences with Dynamically Instantiated Instructions. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Instruction sequence notations with probabilistic instructions CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Instruction sequence processing operators CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Inversive Meadows and Divisive Meadows. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Machine structure oriented control code logic. Acta Informatica Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Meadow Enriched ACP Process Algebras CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Partial Komori fields and imperative Komori fields. CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Timed tuplix calculus and the Wesseling and van den Berg equation CoRR Jan A. Bergstra, Cornelis A. Middelburg
2009	C	`conf`	Transmission Protocols for Instruction Streams. ICTAC Jan A. Bergstra, Cornelis A. Middelburg
2009	J	`jnl`	Transmission protocols for instruction streams CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Data linkage algebra, data linkage dynamics, and priority rewriting CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Data linkage dynamics with shedding CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Distributed strategic interleaving with load balancing. Future Gener. Comput. Syst. Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Instruction sequences and non-uniform complexity theory CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Instruction sequences for the production of processes CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Maurer computers for pipelined instruction processing. Math. Struct. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	On the expressiveness of single-pass instruction sequences CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Program algebra with a jump-shift instruction. J. Appl. Log. Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Programming an interpreter using molecular dynamics CoRR Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Simulating Turing machines on Maurer machines. J. Appl. Log. Jan A. Bergstra, Cornelis A. Middelburg
2008	J	`jnl`	Thread algebra for sequential poly-threading CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	A thread calculus with molecular dynamics CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	An interface group for process components CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Instruction Sequences with Dynamically Instantiated Instructions CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Instruction Sequences with Indirect Jumps. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Instruction sequences with indirect jumps CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Machine structure oriented control code logic CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Maurer Computers with Single-Thread Control. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	On the operating unit size of load/store architectures CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Preferential choice and coordination conditions. J. Log. Algebraic Methods Program. Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Program algebra with a jump-shift instruction CoRR Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Programming an Interpreter Using Molecular Dynamics. Sci. Ann. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Synchronous cooperation for explicit multi-threading. Acta Informatica Jan A. Bergstra, Cornelis A. Middelburg
2007	J	`jnl`	Thread algebra for strategic interleaving. Formal Aspects Comput. Jan A. Bergstra, Cornelis A. Middelburg
2006	J	`jnl`	Continuity controlled hybrid automata. J. Log. Algebraic Methods Program. Jan A. Bergstra, Cornelis A. Middelburg
2006	—	`conf`	Parallel Processes with Implicit Computational Capital. LIX Jan A. Bergstra, Cornelis A. Middelburg
2006	J	`jnl`	Splitting bisimulations and retrospective conditions. Inf. Comput. Jan A. Bergstra, Cornelis A. Middelburg
2006	J	`jnl`	Thread Algebra with Multi-Level Strategies. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2005	C	`conf`	A Thread Algebra with Multi-level Strategic Interleaving. CiE Jan A. Bergstra, Cornelis A. Middelburg
2005	—	`conf`	Conditionals in Algebraic Process Calculi. APC 25 Cornelis A. Middelburg
2005	—	`conf`	Model Theory for Process Algebra. Processes, Terms and Cycles Jan A. Bergstra, Cornelis A. Middelburg
2005	J	`jnl`	Process algebra for hybrid systems. Theor. Comput. Sci. Jan A. Bergstra, Cornelis A. Middelburg
2005	B	`conf`	Strong Splitting Bisimulation Equivalence. CALCO Jan A. Bergstra, Cornelis A. Middelburg
2004	J	`jnl`	Located Actions in Process Algebra with Timing. Fundam. Informaticae Jan A. Bergstra, Cornelis A. Middelburg
2003	J	`jnl`	An alternative formulation of operational conservativity with binding terms. J. Log. Algebraic Methods Program. Cornelis A. Middelburg
2003	J	`jnl`	Revisiting timing in process algebra. J. Log. Algebraic Methods Program. Cornelis A. Middelburg
2002	—	`book`	Process Algebra with Timing Jos C. M. Baeten, Cornelis A. Middelburg
2001	—	`ch.`	Discrete Time Process Algebra and the Semantics of SDL. Handbook of Process Algebra Jan A. Bergstra, Cornelis A. Middelburg, Yaroslav S. Usenko
2001	—	`ch.`	Process Algebra with Timing: Real Time and Discrete Time. Handbook of Process Algebra Jos C. M. Baeten, Cornelis A. Middelburg
2001	J	`jnl`	Real time process algebra with time-dependent conditions. J. Log. Algebraic Methods Program. Jos C. M. Baeten, Cornelis A. Middelburg
2001	J	`jnl`	Variable binding operators in transition system specifications. J. Log. Algebraic Methods Program. Cornelis A. Middelburg
1998	J	`jnl`	Truth of Duration Calculus Formulae in Timed Frames. Fundam. Informaticae Cornelis A. Middelburg
1997	J	`jnl`	Network algebra for asynchronous dataflow. Int. J. Comput. Math. Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu
1996	J	`jnl`	Algebra of timed frames. Int. J. Comput. Math. Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg
1994	J	`jnl`	A Typed Logic of Partial Functions Reconstructed Classically. Acta Informatica Cliff B. Jones, Cornelis A. Middelburg
1994	—	`book`	Notations for software design. Loe M. G. Feijs, Hans Jonkers, Cornelis A. Middelburg
1994	—	`ed.`	Semantics of Specification Languages (SoSL), Proceedings of the International Workshop on Semantics of Specification Languages, Utrecht, The Netherlands, 25-27 October 1993 Semantics of Specification Languages D. J. Andrews, Jan Friso Groote, Cornelis A. Middelburg
1992	J	`jnl`	Modular Structuring of VDM Specifications in VVSL. Formal Aspects Comput. Cornelis A. Middelburg
1992	J	`jnl`	Specification of interfering programs based on interconditions. Softw. Eng. J. Cornelis A. Middelburg
1992	—	`ch.`	VVSL Specification of a Transaction-oriented Access Handler. Specifications of Database Systems Cornelis A. Middelburg
1991	—	`conf`	LPF and MPL VDM Europe (1) Cornelis A. Middelburg, Gerard R. Renardel de Lavalette
1989	—	`conf`	Experiences with Combining Formalisms in VVSL. Algebraic Methods Cornelis A. Middelburg
1989	J	`jnl`	VVSL: A Language for Structured VDM Specifications. Formal Aspects Comput. Cornelis A. Middelburg
1982	A*	`conf`	The Effect of the PDP-11 Architecture on Code Generation for Chill. ASPLOS Cornelis A. Middelburg