C. A. Middelburg

MaRDI QIDQ175864zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the formalization of the notion of a concurrent algorithm Scientific Annals of Computer Science	2026-03-09	Paper
Formalizing the notions of non-interactive and interactive algorithms Scientific Annals of Computer Science	2026-01-21	Paper
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis Theoretical Computer Science	2024-08-20	Paper
Imperative process algebra with abstraction Scientific Annals of Computer Science	2024-08-15	Paper
Program algebra for random access machine programs Scientific Annals of Computer Science	2024-08-15	Paper
Belnap-Dunn logic and query answering in inconsistent databases with null values Scientific Annals of Computer Science	2024-08-15	Paper
Imperative process algebra and models of parallel computation Theory of Computing Systems	2024-07-29	Paper
Paraconsistent logic and query answering in inconsistent databases Journal of Applied Non-Classical Logics	2024-03-20	Paper
Program algebra for Turing-machine programs Scientific Annals of Computer Science	2022-07-19	Paper
Probabilistic process algebra and strategic interleaving Scientific Annals of Computer Science	2022-07-19	Paper
Using Hoare logic in a process algebra setting Fundamenta Informaticae	2021-11-15	Paper
On the strongest three-valued paraconsistent logic contained in classical logic and its dual Journal Of Logic And Computation	2021-04-09	Paper
A short introduction to program algebra with instructions for Boolean registers Computer Science Journal of Moldova	2020-11-02	Paper
A short introduction to program algebra with instructions for Boolean registers Computer Science Journal of Moldova	2020-11-02	Paper
A classical-logic view of a paraconsistent logic	2020-08-17	Paper
On the complexity of the correctness problem for non-zeroness test instruction sequences Theoretical Computer Science	2019-11-22	Paper
Process algebra with strategic interleaving Theory of Computing Systems	2019-06-27	Paper
Thread extraction for polyadic instruction sequences	2019-02-08	Paper
Probabilistic thread algebra Scientific Annals of Computer Science	2019-02-08	Paper
On instruction sets for Boolean registers in program algebra Scientific Annals of Computer Science	2019-02-08	Paper
Instruction sequence based non-uniform complexity classes Scientific Annals of Computer Science	2019-02-08	Paper
Axioms for behavioural congruence of single-pass instruction sequences Scientific Annals of Computer Science	2019-02-08	Paper
Indirect jumps improve instruction sequence performance Scientific Annals of Computer Science	2019-02-08	Paper
Timed tuplix calculus and the Wesseling and van den Bergh equation Scientific Annals of Computer Science	2019-02-08	Paper
A Hoare-like logic of asserted single-pass instruction sequences Scientific Annals of Computer Science	2019-02-08	Paper
Instruction sequences expressing multiplication algorithms Scientific Annals of Computer Science	2019-02-08	Paper
Contradiction-Tolerant Process Algebra with Propositional Signals Fundamenta Informaticae	2018-01-05	Paper
Instruction sequence size complexity of parity Fundamenta Informaticae	2017-11-09	Paper
Instruction sequences with indirect jumps	2016-08-05	Paper
Programming an interpreter using molecular dynamics	2016-08-05	Paper
Transformation of fractions into simple fractions in divisive meadows Journal of Applied Logic	2016-06-30	Paper
On algorithmic equivalence of instruction sequences for computing bit string functions Fundamenta Informaticae	2016-04-28	Paper
Division by zero in non-involutive meadows Journal of Applied Logic	2015-03-24	Paper
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting Fundamenta Informaticae	2014-04-25	Paper
Parallel processes with implicit computational capital Electronic Notes in Theoretical Computer Science	2014-01-17	Paper
A process calculus with finitary comprehended terms Theory of Computing Systems	2013-12-02	Paper
On the behaviours produced by instruction sequences under execution Fundamenta Informaticae	2013-01-14	Paper
On the expressiveness of single-pass instruction sequences Theory of Computing Systems	2012-12-06	Paper
Instruction sequence processing operators Acta Informatica	2012-10-15	Paper
Instruction sequences for computer science. Atlantis Studies in Computing	2012-08-20	Paper
Inversive meadows and divisive meadows Journal of Applied Logic	2012-05-23	Paper
Thread algebra for poly-threading Formal Aspects of Computing	2011-10-18	Paper
Data linkage dynamics with shedding Fundamenta Informaticae	2011-05-18	Paper
An Interface Group for Process Components Fundamenta Informaticae	2010-10-01	Paper
A thread calculus with molecular dynamics Information and Computation	2010-08-18	Paper
On the operating unit size of load/store architectures Mathematical Structures in Computer Science	2010-06-02	Paper
Instruction sequences with dynamically instantiated instructions Fundamenta Informaticae	2010-02-05	Paper
Machine structure oriented control code logic Acta Informatica	2009-10-02	Paper
Partial Komori fields and imperative Komori fields	2009-09-29	Paper
Transmission Protocols for Instruction Streams Theoretical Aspects of Computing - ICTAC 2009	2009-08-20	Paper
Program algebra with a jump-shift instruction Journal of Applied Logic	2008-12-11	Paper
Maurer computers for pipelined instruction processing Mathematical Structures in Computer Science	2008-04-10	Paper
Simulating Turing machines on Maurer machines Journal of Applied Logic	2008-04-07	Paper
scientific article; zbMATH DE number 5222378 (Why is no real title available?)	2008-01-02	Paper
Synchronous cooperation for explicit multi-threading Acta Informatica	2007-12-10	Paper
Thread algebra for strategic interleaving Formal Aspects of Computing	2007-11-28	Paper
A thread algebra with multi-level strategic interleaving Theory of Computing Systems	2007-09-06	Paper
Preferential choice and coordination conditions The Journal of Logic and Algebraic Programming	2007-02-09	Paper
Processes, Terms and Cycles: Steps on the Road to Infinity Lecture Notes in Computer Science	2006-11-13	Paper
Algebra and Coalgebra in Computer Science Lecture Notes in Computer Science	2006-10-20	Paper
Splitting bisimulations and retrospective conditions Information and Computation	2006-08-16	Paper
Thread algebra with multi-level strategies	2006-08-03	Paper
Continuity controlled hybrid automata The Journal of Logic and Algebraic Programming	2006-04-28	Paper
New Computational Paradigms Lecture Notes in Computer Science	2006-01-11	Paper
Process algebra for hybrid systems Theoretical Computer Science	2005-06-10	Paper
scientific article; zbMATH DE number 2113973 (Why is no real title available?)	2004-11-05	Paper
Discrete time process algebra and the semantics of SDL	2003-09-30	Paper
An alternative formulation of operational conservativity with binding terms. The Journal of Logic and Algebraic Programming	2003-08-13	Paper
Revisiting timing in process algebra. The Journal of Logic and Algebraic Programming	2003-06-25	Paper
Algebra of timed frames International Journal of Computer Mathematics	2002-12-19	Paper
Process algebra with timing Monographs in Theoretical Computer Science. An EATCS Series	2002-11-17	Paper
Real time process algebra with time-dependent conditions The Journal of Logic and Algebraic Programming	2002-09-11	Paper
Process algebra with timing: Real time and discrete time	2002-03-21	Paper
Variable binding operators in transition system specifications The Journal of Logic and Algebraic Programming	2001-10-21	Paper
Network algebra for asynchronous dataflow<sup>∗</sup> International Journal of Computer Mathematics	1998-03-04	Paper
scientific article; zbMATH DE number 714071 (Why is no real title available?)	1995-01-22	Paper
Modular structuring of VDM specifications in VVSL Formal Aspects of Computing	1992-06-28	Paper
A conventional expansion of first-order Belnap-Dunn logic (available as arXiv preprint)	N/A	Paper
The interdefinability of expansions of Belnap-Dunn logic (available as arXiv preprint)	N/A	Paper

Research outcomes over time

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