C. A. Middelburg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 78 from 78

2021

On the strongest three-valued paraconsistent logic contained in classical logic and its dualC. A. Middelburg. logcom, 31(2):597-611, 2021. [doi]

2019

Process Algebra with Strategic InterleavingJan A. Bergstra, C. A. Middelburg. mst, 63(3):488-505, 2019. [doi]

2017

Axioms for Behavioural Congruence of Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. cuza, 27(2):111-135, 2017. [doi]

Contradiction-Tolerant Process Algebra with Propositional SignalsJan A. Bergstra, C. A. Middelburg. FUIN, 153(1-2):29-55, 2017. [doi]

2016

Transformation of fractions into simple fractions in divisive meadowsJan A. Bergstra, C. A. Middelburg. japll, 16:92-110, 2016. [doi]

On Instruction Sets for Boolean Registers in Program AlgebraJan A. Bergstra, C. A. Middelburg. cuza, 26(1):1-26, 2016. [doi]

Instruction Sequence Size Complexity of ParityJan A. Bergstra, C. A. Middelburg. FUIN, 149(3):297-309, 2016. [doi]

A Hoare-Like Logic of Asserted Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. cuza, 26(2):125-156, 2016. [doi]

2015

On Algorithmic Equivalence of Instruction Sequences for Computing Bit String FunctionsJan A. Bergstra, C. A. Middelburg. FUIN, 138(4):411-434, 2015. [doi]

Division by zero in non-involutive meadowsJan A. Bergstra, C. A. Middelburg. japll, 13(1):1-12, 2015. [doi]

2013

A Process Calculus with Finitary Comprehended TermsJan A. Bergstra, C. A. Middelburg. mst, 53(4):645-668, 2013. [doi]

Data Linkage Algebra, Data Linkage Dynamics, and Priority RewritingJan A. Bergstra, C. A. Middelburg. FUIN, 128(4):367-412, 2013. [doi]

2012

On the Behaviours Produced by Instruction Sequences under ExecutionJan A. Bergstra, C. A. Middelburg. FUIN, 120(2):111-144, 2012. [doi]

Instruction sequence processing operatorsJan A. Bergstra, C. A. Middelburg. ACTA, 49(3):139-172, 2012. [doi]

On the Expressiveness of Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. mst, 50(2):313-328, 2012. [doi]

2010

On the operating unit size of load/store architecturesJan A. Bergstra, C. A. Middelburg. mscs, 20(3):395-417, 2010. [doi]

A thread calculus with molecular dynamicsJan A. Bergstra, C. A. Middelburg. iandc, 208(7):817-844, 2010. [doi]

An Interface Group for Process ComponentsJan A. Bergstra, C. A. Middelburg. FUIN, 99(4):355-382, 2010. [doi]

2009

Instruction sequence notations with probabilistic instructionsJan A. Bergstra, C. A. Middelburg. corr, abs/0906.3083, 2009. [doi]

Timed tuplix calculus and the Wesseling and van den Berg equationJan A. Bergstra, C. A. Middelburg. corr, abs/0901.3003, 2009. [doi]

Meadow Enriched ACP Process AlgebrasJan A. Bergstra, C. A. Middelburg. corr, abs/0901.3012, 2009. [doi]

Machine structure oriented control code logicJan A. Bergstra, C. A. Middelburg. ACTA, 46(5):375-401, 2009. [doi]

Instruction Sequences with Dynamically Instantiated InstructionsJan A. Bergstra, C. A. Middelburg. FUIN, 96(1-2):27-48, 2009. [doi]

A process calculus with finitary comprehended termsJan A. Bergstra, C. A. Middelburg. corr, abs/0903.2914, 2009. [doi]

A protocol for instruction stream processingJan A. Bergstra, C. A. Middelburg. corr, abs/0905.2257, 2009. [doi]

Transmission protocols for instruction streamsJan A. Bergstra, C. A. Middelburg. corr, abs/0902.2859, 2009. [doi]

Transmission Protocols for Instruction StreamsJan A. Bergstra, C. A. Middelburg. ictac 2009: 127-139 [doi]

2008

Data linkage algebra, data linkage dynamics, and priority rewritingJan A. Bergstra, C. A. Middelburg. corr, abs/0804.4565, 2008. [doi]

Parallel Processes with Implicit Computational CapitalJan A. Bergstra, C. A. Middelburg. ENTCS, 209:55-81, 2008. [doi]

Simulating Turing machines on Maurer machinesJan A. Bergstra, C. A. Middelburg. japll, 6(1):1-23, 2008. [doi]

Maurer computers for pipelined instruction processingJan A. Bergstra, C. A. Middelburg. mscs, 18(2):373-409, 2008. [doi]

Distributed strategic interleaving with load balancingJan A. Bergstra, C. A. Middelburg. fgcs, 24(6):530-548, 2008. [doi]

Program algebra with a jump-shift instructionJan A. Bergstra, C. A. Middelburg. japll, 6(4):553-563, 2008. [doi]

Programming an interpreter using molecular dynamicsJan A. Bergstra, C. A. Middelburg. corr, abs/0801.2226, 2008. [doi]

Thread algebra for sequential poly-threadingJan A. Bergstra, C. A. Middelburg. corr, abs/0803.0378, 2008. [doi]

Data linkage dynamics with sheddingJan A. Bergstra, C. A. Middelburg. corr, abs/0806.4034, 2008. [doi]

Instruction sequences and non-uniform complexity theoryJan A. Bergstra, C. A. Middelburg. corr, abs/0809.0352, 2008. [doi]

On the expressiveness of single-pass instruction sequencesJan A. Bergstra, C. A. Middelburg. corr, abs/0810.1106, 2008. [doi]

Instruction sequences for the production of processesJan A. Bergstra, C. A. Middelburg. corr, abs/0811.0436, 2008. [doi]

2007

Program algebra with a jump-shift instructionJan A. Bergstra, C. A. Middelburg. corr, abs/0712.1658, 2007. [doi]

Preferential choice and coordination conditionsJan A. Bergstra, C. A. Middelburg. jlp, 70(2):172-200, 2007. [doi]

An interface group for process componentsJan A. Bergstra, C. A. Middelburg. corr, abs/0711.0834, 2007. [doi]

Instruction sequences with indirect jumpsJan A. Bergstra, C. A. Middelburg. corr, abs/0711.0829, 2007. [doi]

Thread algebra for strategic interleavingJan A. Bergstra, C. A. Middelburg. fac, 19(4):445-474, 2007. [doi]

Instruction Sequences with Indirect JumpsJan A. Bergstra, C. A. Middelburg. cuza, 17:19-46, 2007. [doi]

Maurer Computers with Single-Thread ControlJan A. Bergstra, C. A. Middelburg. FUIN, 80(4):333-362, 2007. [doi]

A thread calculus with molecular dynamicsJan A. Bergstra, C. A. Middelburg. corr, abs/0711.0840, 2007. [doi]

Machine structure oriented control code logicJan A. Bergstra, C. A. Middelburg. corr, abs/0711.0836, 2007. [doi]

Synchronous cooperation for explicit multi-threadingJan A. Bergstra, C. A. Middelburg. ACTA, 44(7-8):525-569, 2007. [doi]

On the operating unit size of load/store architecturesJan A. Bergstra, C. A. Middelburg. corr, abs/0711.0838, 2007. [doi]

Instruction Sequences with Dynamically Instantiated InstructionsJan A. Bergstra, C. A. Middelburg. corr, abs/0711.4217, 2007. [doi]

A Thread Algebra with Multi-Level Strategic InterleavingJan A. Bergstra, C. A. Middelburg. mst, 41(1):3-32, 2007. [doi]

2006

Continuity controlled hybrid automataJan A. Bergstra, C. A. Middelburg. jlp, 68(1-2):5-53, 2006. [doi]

Thread Algebra with Multi-Level StrategiesJan A. Bergstra, C. A. Middelburg. FUIN, 71(2-3):153-182, 2006. [doi]

Splitting bisimulations and retrospective conditionsJan A. Bergstra, C. A. Middelburg. iandc, 204(7):1083-1138, 2006. [doi]

Conditionals in Algebraic Process CalculiC. A. Middelburg. ENTCS, 162:237-241, 2006. [doi]

2005

2004

Located Actions in Process Algebra with TimingJan A. Bergstra, C. A. Middelburg. FUIN, 61(3-4):183-211, 2004. [doi]

2003

An alternative formulation of operational conservativity with binding termsC. A. Middelburg. jlp, 55(1-2):1-19, 2003. [doi]

Revisiting timing in process algebraC. A. Middelburg. jlp, 54(1-2):109-127, 2003. [doi]

2001

Real time process algebra with time-dependent conditionsJos C. M. Baeten, C. A. Middelburg. jlp, 48(1-2):1-38, 2001.

Process Algebra with Timing: Real Time and Discrete TimeJos C. M. Baeten, C. A. Middelburg. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 627-684, North-Holland / Elsevier, 2001. [doi]

Discrete Time Process Algebra and the Semantics of SDLJan A. Bergstra, C. A. Middelburg, Yaroslav S. Usenko. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 1209-1268, North-Holland / Elsevier, 2001. [doi]

Variable binding operators in transition system specificationsC. A. Middelburg. jlp, 47(1):15-45, 2001.

1998

Truth of Duration Calculus Formulae in Timed FramesC. A. Middelburg. FUIN, 36(2-3):235-263, 1998.

1997

Network algebra for asynchronous dataflowJan A. Bergstra, C. A. Middelburg, Gheorghe Stefanescu. ijcm, 65(1-2):57-88, 1997. [doi]

1996

Algebra of timed framesJan A. Bergstra, Wan J. Fokkink, C. A. Middelburg. ijcm, 61(3-4):227-255, 1996. [doi]

1994

Notations for software designLoe M. G. Feijs, Hans Jonkers, C. A. Middelburg. FACIT: Formal approaches to computing and information technology, Springer, 1994.

A Typed Logic of Partial Functions Reconstructed ClassicallyCliff B. Jones, C. A. Middelburg. ACTA, 31(5):399-430, 1994.

1992

Modular Structuring of VDM Specifications in VVSLC. A. Middelburg. fac, 4(1):13-47, 1992.

Specification of interfering programs based on interconditionsC. A. Middelburg. iee, 7(3):205-217, 1992. [doi]

VVSL Specification of a Transaction-oriented Access HandlerC. A. Middelburg. In David J. Harper, Moira C. Norrie, editors, Specifications of Database Systems. Workshops in Computing, pages 188-212, Springer, 1992. [doi]

1991

LPF and MPL::omega:: - A Logical Comparison of VDM SL and COLD-KC. A. Middelburg, Gerard R. Renardel de Lavalette. FM 1991: 279-308

1989

VVSL: A Language for Structured VDM SpecificationsC. A. Middelburg. fac, 1(1):115-135, 1989.

Experiences with Combining Formalisms in VVSLC. A. Middelburg. am 1991: 83-103

Sign in or sign up to see more results.

runs on WebDSL