C. A. Middelburg

From MaRDI portal
Person:175864

Available identifiers

zbMath Open middelburg.cornelis-aMaRDI QIDQ175864

List of research outcomes





PublicationDate of PublicationType
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis2024-08-20Paper
Imperative process algebra with abstraction2024-08-15Paper
Program algebra for random access machine programs2024-08-15Paper
Belnap-Dunn logic and query answering in inconsistent databases with null values2024-08-15Paper
Imperative process algebra and models of parallel computation2024-07-29Paper
Paraconsistent logic and query answering in inconsistent databases2024-03-20Paper
Program Algebra for Turing-Machine Programs2022-07-19Paper
Probabilistic Process Algebra and Strategic Interleaving2022-07-19Paper
Using Hoare Logic in a Process Algebra Setting2021-11-15Paper
On the strongest three-valued paraconsistent logic contained in classical logic and its dual2021-04-09Paper
A short introduction to program algebra with instructions for Boolean registers2020-11-02Paper
A classical-logic view of a paraconsistent logic2020-08-17Paper
On the complexity of the correctness problem for non-zeroness test instruction sequences2019-11-22Paper
Process algebra with strategic interleaving2019-06-27Paper
Probabilistic Thread Algebra2019-02-08Paper
On Instruction Sets for Boolean Registers in Program Algebra2019-02-08Paper
Instruction Sequence Based Non-uniform Complexity Classes2019-02-08Paper
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences2019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q46211542019-02-08Paper
Indirect Jumps Improve Instruction Sequence Performance2019-02-08Paper
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation2019-02-08Paper
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences2019-02-08Paper
Instruction Sequences Expressing Multiplication Algorithms2019-02-08Paper
Contradiction-Tolerant Process Algebra with Propositional Signals2018-01-05Paper
Instruction Sequence Size Complexity of Parity2017-11-09Paper
https://portal.mardi4nfdi.de/entity/Q31858422016-08-05Paper
https://portal.mardi4nfdi.de/entity/Q31858432016-08-05Paper
Transformation of fractions into simple fractions in divisive meadows2016-06-30Paper
On algorithmic equivalence of instruction sequences for computing bit string functions2016-04-28Paper
Division by zero in non-involutive meadows2015-03-24Paper
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting2014-04-25Paper
Parallel processes with implicit computational capital2014-01-17Paper
A process calculus with finitary comprehended terms2013-12-02Paper
On the Behaviours Produced by Instruction Sequences under Execution2013-01-14Paper
On the expressiveness of single-pass instruction sequences2012-12-06Paper
Instruction sequence processing operators2012-10-15Paper
Instruction sequences for computer science.2012-08-20Paper
Inversive meadows and divisive meadows2012-05-23Paper
Thread algebra for poly-threading2011-10-18Paper
Data Linkage Dynamics with Shedding2011-05-18Paper
An Interface Group for Process Components2010-10-01Paper
A thread calculus with molecular dynamics2010-08-18Paper
On the operating unit size of load/store architectures2010-06-02Paper
Instruction Sequences with Dynamically Instantiated Instructions2010-02-05Paper
Machine structure oriented control code logic2009-10-02Paper
Partial Komori fields and imperative Komori fields2009-09-29Paper
Transmission Protocols for Instruction Streams2009-08-20Paper
Program algebra with a jump-shift instruction2008-12-11Paper
Maurer computers for pipelined instruction processing2008-04-10Paper
Simulating Turing machines on Maurer machines2008-04-07Paper
https://portal.mardi4nfdi.de/entity/Q54319262008-01-02Paper
Synchronous cooperation for explicit multi-threading2007-12-10Paper
Thread algebra for strategic interleaving2007-11-28Paper
A thread algebra with multi-level strategic interleaving2007-09-06Paper
Preferential choice and coordination conditions2007-02-09Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
Algebra and Coalgebra in Computer Science2006-10-20Paper
Splitting bisimulations and retrospective conditions2006-08-16Paper
https://portal.mardi4nfdi.de/entity/Q54806522006-08-03Paper
Continuity controlled hybrid automata2006-04-28Paper
New Computational Paradigms2006-01-11Paper
Process algebra for hybrid systems2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q48257072004-11-05Paper
Discrete time process algebra and the semantics of SDL2003-09-30Paper
An alternative formulation of operational conservativity with binding terms.2003-08-13Paper
Revisiting timing in process algebra.2003-06-25Paper
Algebra of timed frames2002-12-19Paper
Process algebra with timing2002-11-17Paper
Real time process algebra with time-dependent conditions2002-09-11Paper
Process algebra with timing: Real time and discrete time2002-03-21Paper
Variable binding operators in transition system specifications2001-10-21Paper
Network algebra for asynchronous dataflow1998-03-04Paper
https://portal.mardi4nfdi.de/entity/Q43212881995-01-22Paper
Modular structuring of VDM specifications in VVSL1992-06-28Paper
A conventional expansion of first-order Belnap-Dunn logicN/APaper
The interdefinability of expansions of Belnap-Dunn logicN/APaper

Research outcomes over time

This page was built for person: C. A. Middelburg