Cornelis A. Middelburg

ORCID

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 42

Top Venues

CoRR

Sci. Ann. Comput. Sci.

Fundam. Informaticae

Theory Comput. Syst.

Publications

Cornelis A. Middelburg
On the formalization of the notion of an interactive algorithm. CoRR (2024)
Cornelis A. Middelburg
On the formalization of the notion of an algorithm. CoRR (2024)
Cornelis A. Middelburg
Imperative Process Algebra and Models of Parallel Computation. Theory Comput. Syst. 68 (3) (2024)
Cornelis A. Middelburg
Paraconsistent logic and query answering in inconsistent databases. J. Appl. Non Class. Logics 34 (1) (2024)
Cornelis A. Middelburg
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis. Theor. Comput. Sci. 1008 (2024)
Cornelis A. Middelburg
The interdefinability of expansions of Belnap-Dunn logic. CoRR (2024)
Cornelis A. Middelburg
Belnap-Dunn logic and query answering in inconsistent databases with null values. CoRR (2023)
Cornelis A. Middelburg
A Conventional Expansion of First-Order Belnap-Dunn Logic. CoRR (2023)
Cornelis A. Middelburg
Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values. Sci. Ann. Comput. Sci. 33 (2) (2023)
Cornelis A. Middelburg
Imperative process algebra and models of parallel computation. CoRR (2022)
Cornelis A. Middelburg
Imperative Process Algebra with Abstraction. Sci. Ann. Comput. Sci. 32 (1) (2022)
Cornelis A. Middelburg
Program Algebra for Random Access Machine Programs. Sci. Ann. Comput. Sci. 32 (2) (2022)
Cornelis A. Middelburg
Paraconsistent logic and query answering in inconsistent databases. CoRR (2022)
Jan A. Bergstra, Cornelis A. Middelburg
Using Hoare Logic in a Process Algebra Setting. Fundam. Informaticae 179 (4) (2021)
Cornelis A. Middelburg
Imperative process algebra with abstraction. CoRR (2021)
Cornelis A. Middelburg
On the strongest three-valued paraconsistent logic contained in classical logic and its dual. J. Log. Comput. 31 (2) (2021)
Cornelis A. Middelburg
Dormancy-aware timed branching bisimilarity. CoRR (2021)
Jan A. Bergstra, Cornelis A. Middelburg
On the complexity of the correctness problem for non-zeroness test instruction sequences. Theor. Comput. Sci. 802 (2020)
Cornelis A. Middelburg
Program algebra for random access machine programs. CoRR (2020)
Cornelis A. Middelburg
Process algebra, process scheduling, and mutual exclusion. CoRR (2020)
Cornelis A. Middelburg
A classical-logic view of a paraconsistent logic. CoRR (2020)
Cornelis A. Middelburg
Probabilistic Process Algebra and Strategic Interleaving. Sci. Ann. Comput. Sci. 30 (2) (2020)
Rob J. van Glabbeek, Cornelis A. Middelburg
On infinite guarded recursive specifications in process algebra. CoRR (2020)
Jan A. Bergstra, Cornelis A. Middelburg
Process Algebra with Strategic Interleaving. Theory Comput. Syst. 63 (3) (2019)
Cornelis A. Middelburg
Probabilistic process algebra and strategic interleaving. CoRR (2019)
Jan A. Bergstra, Cornelis A. Middelburg
Program Algebra for Turing-Machine Programs. Sci. Ann. Comput. Sci. 29 (2) (2019)
Jan A. Bergstra, Cornelis A. Middelburg
Program algebra for Turing-machine programs. CoRR (2019)
Jan A. Bergstra, Cornelis A. Middelburg
Using Hoare logic in a process algebra setting. CoRR (2019)
Jan A. Bergstra, Cornelis A. Middelburg
A Short Introduction to Program Algebra with Instructions for Boolean Registers. Comput. Sci. J. Moldova 26 (3) (2018)
Jan A. Bergstra, Cornelis A. Middelburg
A short introduction to program algebra with instructions for Boolean registers. CoRR (2018)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction Sequences Expressing Multiplication Algorithms. Sci. Ann. Comput. Sci. 28 (1) (2018)
Jan A. Bergstra, Cornelis A. Middelburg
On the complexity of the correctness problem for non-zeroness test instruction sequences. CoRR (2018)
Jan A. Bergstra, Cornelis A. Middelburg
Axioms for behavioural congruence of single-pass instruction sequences. CoRR (2017)
Jan A. Bergstra, Cornelis A. Middelburg
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 27 (2) (2017)
Jan A. Bergstra, Cornelis A. Middelburg
Contradiction-Tolerant Process Algebra with Propositional Signals. Fundam. Informaticae 153 (1-2) (2017)
Cornelis A. Middelburg
On the strongest three-valued paraconsistent logic contained in classical logic. CoRR (2017)
Jan A. Bergstra, Cornelis A. Middelburg
Process algebra with strategic interleaving. CoRR (2017)
Jan A. Bergstra, Cornelis A. Middelburg
On Instruction Sets for Boolean Registers in Program Algebra. Sci. Ann. Comput. Sci. 26 (1) (2016)
Jan A. Bergstra, Cornelis A. Middelburg
Transformation of fractions into simple fractions in divisive meadows. J. Appl. Log. 16 (2016)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction Sequence Size Complexity of Parity. Fundam. Informaticae 149 (3) (2016)
Jan A. Bergstra, Cornelis A. Middelburg
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 26 (2) (2016)
Cornelis A. Middelburg
A short introduction to process theory. CoRR (2016)
Jan A. Bergstra, Cornelis A. Middelburg
On instruction sets for Boolean registers in program algebra. CoRR (2015)
Jan A. Bergstra, Cornelis A. Middelburg
Division by zero in non-involutive meadows. J. Appl. Log. 13 (1) (2015)
Jan A. Bergstra, Cornelis A. Middelburg
Probabilistic Thread Algebra. Sci. Ann. Comput. Sci. 25 (2) (2015)
Jan A. Bergstra, Cornelis A. Middelburg
Contradiction-tolerant process algebra with propositional signals. CoRR (2015)
Jan A. Bergstra, Cornelis A. Middelburg
Transformation of fractions into simple fractions in divisive meadows. CoRR (2015)
Jan A. Bergstra, Cornelis A. Middelburg
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. Fundam. Informaticae 138 (4) (2015)
Jan A. Bergstra, Cornelis A. Middelburg
A Hoare-like logic of asserted single-pass instruction sequences. CoRR (2014)
Jan A. Bergstra, Cornelis A. Middelburg
A Thread Algebra with Probabilistic Features. CoRR (2014)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction Sequence Based Non-uniform Complexity Classes. Sci. Ann. Comput. Sci. 24 (1) (2014)
Jan A. Bergstra, Cornelis A. Middelburg
On algorithmic equivalence of instruction sequences for computing bit string functions. CoRR (2014)
Jan A. Bergstra, Cornelis A. Middelburg
Division by zero in non-involutive meadows. CoRR (2014)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence size complexity of parity. CoRR (2014)
Jan A. Bergstra, Cornelis A. Middelburg
Long multiplication by instruction sequences with backward jump instructions. CoRR (2013)
Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu
Network algebra for synchronous dataflow CoRR (2013)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence expressions for the Karatsuba multiplication algorithm. CoRR (2013)
Jan A. Bergstra, Cornelis A. Middelburg
A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. 53 (4) (2013)
Jan A. Bergstra, Cornelis A. Middelburg
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation. Sci. Ann. Comput. Sci. 23 (2) (2013)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence expressions for the secure hash algorithm SHA-256. CoRR (2013)
Jan A. Bergstra, Cornelis A. Middelburg
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundam. Informaticae 128 (4) (2013)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence based non-uniform complexity classes CoRR (2013)
Jan A. Bergstra, Cornelis A. Middelburg
On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Informaticae 120 (2) (2012)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence processing operators. Acta Informatica 49 (3) (2012)
Jan A. Bergstra, Cornelis A. Middelburg
Process algebra with conditionals in the presence of epsilon CoRR (2012)
Jan A. Bergstra, Cornelis A. Middelburg
On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50 (2) (2012)
Jan A. Bergstra, Cornelis A. Middelburg
Indirect Jumps Improve Instruction Sequence Performance. Sci. Ann. Comput. Sci. 22 (2) (2012)
Jan A. Bergstra, Cornelis A. Middelburg
Turing Impossibility Properties for Stack Machine Programming CoRR (2012)
Jan A. Bergstra, Cornelis A. Middelburg
On the behaviours produced by instruction sequences under execution CoRR (2011)
Jan A. Bergstra, Cornelis A. Middelburg
Inversive meadows and divisive meadows. J. Appl. Log. 9 (3) (2011)
Cornelis A. Middelburg
A Survey of Paraconsistent Logics CoRR (2011)
Jan A. Bergstra, Cornelis A. Middelburg
Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comput. Sci. 21 (2) (2011)
Jan A. Bergstra, Cornelis A. Middelburg
Thread algebra for poly-threading. Formal Aspects Comput. 23 (4) (2011)
Jan A. Bergstra, Cornelis A. Middelburg
An Interface Group for Process Components. Fundam. Informaticae 99 (4) (2010)
Jan A. Bergstra, Cornelis A. Middelburg
On the operating unit size of load/store architectures. Math. Struct. Comput. Sci. 20 (3) (2010)
Cornelis A. Middelburg
Searching publications on operating systems CoRR (2010)
Jan A. Bergstra, Cornelis A. Middelburg
A thread calculus with molecular dynamics. Inf. Comput. 208 (7) (2010)
Jan A. Bergstra, Cornelis A. Middelburg
Data Linkage Dynamics with Shedding. Fundam. Informaticae 103 (1-4) (2010)
Jan A. Bergstra, Cornelis A. Middelburg
On the definition of a theoretical concept of an operating system CoRR (2010)
Cornelis A. Middelburg
Searching publications on software testing CoRR (2010)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence processing operators CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Transmission Protocols for Instruction Streams. ICTAC (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Timed tuplix calculus and the Wesseling and van den Berg equation CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Arithmetical meadows CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Functional units for natural numbers CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Partial Komori fields and imperative Komori fields. CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Machine structure oriented control code logic. Acta Informatica 46 (5) (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction Sequences with Dynamically Instantiated Instructions. Fundam. Informaticae 96 (1-2) (2009)
Jan A. Bergstra, Cornelis A. Middelburg
A protocol for instruction stream processing CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
A process calculus with finitary comprehended terms CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Autosolvability of halting problem instances for instruction sequences CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Meadow Enriched ACP Process Algebras CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Indirect jumps improve instruction sequence performance CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Instruction sequence notations with probabilistic instructions CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Transmission protocols for instruction streams CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Inversive Meadows and Divisive Meadows. CoRR (2009)
Jan A. Bergstra, Cornelis A. Middelburg
Maurer computers for pipelined instruction processing. Math. Struct. Comput. Sci. 18 (2) (2008)
Jan A. Bergstra, Cornelis A. Middelburg
Program algebra with a jump-shift instruction. J. Appl. Log. 6 (4) (2008)
Jan A. Bergstra, Cornelis A. Middelburg
On the expressiveness of single-pass instruction sequences CoRR (2008)
Jan A. Bergstra, Cornelis A. Middelburg
Thread algebra for sequential poly-threading CoRR (2008)

Cornelis A. Middelburg.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Cornelis A. Middelburg