default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKees Middelburg
Cornelis A. Middelburg
Person information
- affiliation: University of Amsterdam, Informatics Institute, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j68]Cornelis A. Middelburg
:
Paraconsistent logic and query answering in inconsistent databases. J. Appl. Non Class. Logics 34(1): 133-154 (2024)- [j67]Cornelis A. Middelburg:
Imperative Process Algebra and Models of Parallel Computation. Theory Comput. Syst. 68(3): 529-570 (2024) - [j66]Cornelis A. Middelburg:
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis. Theor. Comput. Sci. 1008: 114681 (2024) - [i71]Cornelis A. Middelburg:
On the formalization of the notion of an algorithm. CoRR abs/2401.08366 (2024) - [i70]Cornelis A. Middelburg:
The interdefinability of expansions of Belnap-Dunn logic. CoRR abs/2403.04641 (2024) - [i69]Cornelis A. Middelburg:
On the formalization of the notion of an interactive algorithm. CoRR abs/2405.19037 (2024) - [i68]Jan A. Bergstra, Cornelis A. Middelburg:
Space-time process algebra with asynchronous communication. CoRR abs/2409.15120 (2024) - 2023
- [j65]Cornelis A. Middelburg:
Belnap-Dunn Logic and Query Answering in Inconsistent Databases with Null Values. Sci. Ann. Comput. Sci. 33(2): 159-192 (2023) - [i67]Cornelis A. Middelburg:
A Conventional Expansion of First-Order Belnap-Dunn Logic. CoRR abs/2301.10555 (2023) - [i66]Cornelis A. Middelburg:
Belnap-Dunn logic and query answering in inconsistent databases with null values. CoRR abs/2303.05264 (2023) - 2022
- [j64]Cornelis A. Middelburg:
Imperative Process Algebra with Abstraction. Sci. Ann. Comput. Sci. 32(1): 137-179 (2022) - [j63]Cornelis A. Middelburg:
Program Algebra for Random Access Machine Programs. Sci. Ann. Comput. Sci. 32(2): 285-319 (2022) - [i65]Cornelis A. Middelburg:
Imperative process algebra and models of parallel computation. CoRR abs/2206.02472 (2022) - [i64]Cornelis A. Middelburg:
Paraconsistent logic and query answering in inconsistent databases. CoRR abs/2208.12976 (2022) - 2021
- [j62]Jan A. Bergstra, Cornelis A. Middelburg:
Using Hoare Logic in a Process Algebra Setting. Fundam. Informaticae 179(4): 321-344 (2021) - [j61]Cornelis A. Middelburg:
On the strongest three-valued paraconsistent logic contained in classical logic and its dual. J. Log. Comput. 31(2): 597-611 (2021) - [i63]Cornelis A. Middelburg:
Imperative process algebra with abstraction. CoRR abs/2103.07863 (2021) - [i62]Cornelis A. Middelburg:
Dormancy-aware timed branching bisimilarity. CoRR abs/2107.08921 (2021) - 2020
- [j60]Cornelis A. Middelburg:
Probabilistic Process Algebra and Strategic Interleaving. Sci. Ann. Comput. Sci. 30(2): 205-243 (2020) - [j59]Jan A. Bergstra, Cornelis A. Middelburg:
On the complexity of the correctness problem for non-zeroness test instruction sequences. Theor. Comput. Sci. 802: 1-18 (2020) - [i61]Cornelis A. Middelburg:
Process algebra, process scheduling, and mutual exclusion. CoRR abs/2003.00473 (2020) - [i60]Rob J. van Glabbeek, Cornelis A. Middelburg:
On infinite guarded recursive specifications in process algebra. CoRR abs/2005.00746 (2020) - [i59]Cornelis A. Middelburg:
Program algebra for random access machine programs. CoRR abs/2007.09946 (2020) - [i58]Cornelis A. Middelburg:
A classical-logic view of a paraconsistent logic. CoRR abs/2008.07292 (2020)
2010 – 2019
- 2019
- [j58]Jan A. Bergstra, Cornelis A. Middelburg:
Program Algebra for Turing-Machine Programs. Sci. Ann. Comput. Sci. 29(2): 113-139 (2019) - [j57]Jan A. Bergstra, Cornelis A. Middelburg:
Process Algebra with Strategic Interleaving. Theory Comput. Syst. 63(3): 488-505 (2019) - [i57]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra for Turing-machine programs. CoRR abs/1901.08840 (2019) - [i56]Jan A. Bergstra, Cornelis A. Middelburg:
Using Hoare logic in a process algebra setting. CoRR abs/1906.04491 (2019) - [i55]Cornelis A. Middelburg:
Probabilistic process algebra and strategic interleaving. CoRR abs/1912.10041 (2019) - 2018
- [j56]Jan A. Bergstra, Cornelis A. Middelburg:
A Short Introduction to Program Algebra with Instructions for Boolean Registers. Comput. Sci. J. Moldova 26(3): 199-232 (2018) - [j55]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences Expressing Multiplication Algorithms. Sci. Ann. Comput. Sci. 28(1): 39-66 (2018) - [i54]Jan A. Bergstra, Cornelis A. Middelburg:
On the complexity of the correctness problem for non-zeroness test instruction sequences. CoRR abs/1805.05845 (2018) - [i53]Jan A. Bergstra, Cornelis A. Middelburg:
A short introduction to program algebra with instructions for Boolean registers. CoRR abs/1808.04264 (2018) - 2017
- [j54]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 27(2): 111-135 (2017) - [j53]Jan A. Bergstra, Cornelis A. Middelburg:
Contradiction-Tolerant Process Algebra with Propositional Signals. Fundam. Informaticae 153(1-2): 29-55 (2017) - [i52]Cornelis A. Middelburg:
On the strongest three-valued paraconsistent logic contained in classical logic. CoRR abs/1702.03414 (2017) - [i51]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for behavioural congruence of single-pass instruction sequences. CoRR abs/1702.03511 (2017) - [i50]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with strategic interleaving. CoRR abs/1703.06822 (2017) - 2016
- [j52]Jan A. Bergstra, Cornelis A. Middelburg:
On Instruction Sets for Boolean Registers in Program Algebra. Sci. Ann. Comput. Sci. 26(1): 1-26 (2016) - [j51]Jan A. Bergstra, Cornelis A. Middelburg:
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 26(2): 125-156 (2016) - [j50]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequence Size Complexity of Parity. Fundam. Informaticae 149(3): 297-309 (2016) - [j49]Jan A. Bergstra, Cornelis A. Middelburg:
Transformation of fractions into simple fractions in divisive meadows. J. Appl. Log. 16: 92-110 (2016) - [i49]Cornelis A. Middelburg:
A short introduction to process theory. CoRR abs/1610.01412 (2016) - 2015
- [j48]Jan A. Bergstra, Cornelis A. Middelburg:
Probabilistic Thread Algebra. Sci. Ann. Comput. Sci. 25(2): 211-243 (2015) - [j47]Jan A. Bergstra, Cornelis A. Middelburg:
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. Fundam. Informaticae 138(4): 411-434 (2015) - [j46]Jan A. Bergstra, Cornelis A. Middelburg:
Division by zero in non-involutive meadows. J. Appl. Log. 13(1): 1-12 (2015) - [i48]Jan A. Bergstra, Cornelis A. Middelburg:
On instruction sets for Boolean registers in program algebra. CoRR abs/1502.00238 (2015) - [i47]Jan A. Bergstra, Cornelis A. Middelburg:
Contradiction-tolerant process algebra with propositional signals. CoRR abs/1508.06899 (2015) - [i46]Jan A. Bergstra, Cornelis A. Middelburg:
Transformation of fractions into simple fractions in divisive meadows. CoRR abs/1510.06233 (2015) - 2014
- [j45]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequence Based Non-uniform Complexity Classes. Sci. Ann. Comput. Sci. 24(1): 47-89 (2014) - [i45]Jan A. Bergstra, Cornelis A. Middelburg:
On algorithmic equivalence of instruction sequences for computing bit string functions. CoRR abs/1402.4950 (2014) - [i44]Jan A. Bergstra, Cornelis A. Middelburg:
Division by zero in non-involutive meadows. CoRR abs/1406.2092 (2014) - [i43]Jan A. Bergstra, Cornelis A. Middelburg:
A Hoare-like logic of asserted single-pass instruction sequences. CoRR abs/1408.2955 (2014) - [i42]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Probabilistic Features. CoRR abs/1409.6873 (2014) - [i41]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence size complexity of parity. CoRR abs/1412.6787 (2014) - 2013
- [j44]Jan A. Bergstra, Cornelis A. Middelburg:
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation. Sci. Ann. Comput. Sci. 23(2): 169-190 (2013) - [j43]Jan A. Bergstra, Cornelis A. Middelburg:
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundam. Informaticae 128(4): 367-412 (2013) - [j42]Jan A. Bergstra, Cornelis A. Middelburg:
A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. 53(4): 645-668 (2013) - [i40]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence based non-uniform complexity classes. CoRR abs/1301.3297 (2013) - [i39]Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu:
Network algebra for synchronous dataflow. CoRR abs/1303.0382 (2013) - [i38]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the secure hash algorithm SHA-256. CoRR abs/1308.0219 (2013) - [i37]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the Karatsuba multiplication algorithm. CoRR abs/1312.1529 (2013) - [i36]Jan A. Bergstra, Cornelis A. Middelburg:
Long multiplication by instruction sequences with backward jump instructions. CoRR abs/1312.1812 (2013) - 2012
- [b3]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences for Computer Science. Atlantis Studies in Computing 2, Atlantis Press 2012, ISBN 978-94-91216-64-0, pp. i-xvi, 1-229 - [j41]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence processing operators. Acta Informatica 49(3): 139-172 (2012) - [j40]Jan A. Bergstra, Cornelis A. Middelburg:
Indirect Jumps Improve Instruction Sequence Performance. Sci. Ann. Comput. Sci. 22(2): 253-265 (2012) - [j39]Jan A. Bergstra, Cornelis A. Middelburg:
On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Informaticae 120(2): 111-144 (2012) - [j38]Jan A. Bergstra, Cornelis A. Middelburg:
On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50(2): 313-328 (2012) - [i35]Jan A. Bergstra, Cornelis A. Middelburg:
Turing Impossibility Properties for Stack Machine Programming. CoRR abs/1201.6028 (2012) - [i34]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with conditionals in the presence of epsilon. CoRR abs/1204.3249 (2012) - 2011
- [j37]Jan A. Bergstra, Cornelis A. Middelburg:
Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comput. Sci. 21(2): 283-310 (2011) - [j36]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for poly-threading. Formal Aspects Comput. 23(4): 567-583 (2011) - [j35]Jan A. Bergstra, Cornelis A. Middelburg:
Inversive meadows and divisive meadows. J. Appl. Log. 9(3): 203-220 (2011) - [i33]Cornelis A. Middelburg:
A Survey of Paraconsistent Logics. CoRR abs/1103.4324 (2011) - [i32]Jan A. Bergstra, Cornelis A. Middelburg:
On the behaviours produced by instruction sequences under execution. CoRR abs/1106.6196 (2011) - 2010
- [j34]Jan A. Bergstra, Cornelis A. Middelburg:
An Interface Group for Process Components. Fundam. Informaticae 99(4): 355-382 (2010) - [j33]Jan A. Bergstra, Cornelis A. Middelburg:
Data Linkage Dynamics with Shedding. Fundam. Informaticae 103(1-4): 31-52 (2010) - [j32]Jan A. Bergstra, Cornelis A. Middelburg:
A thread calculus with molecular dynamics. Inf. Comput. 208(7): 817-844 (2010) - [j31]Jan A. Bergstra, Cornelis A. Middelburg:
On the operating unit size of load/store architectures. Math. Struct. Comput. Sci. 20(3): 395-417 (2010) - [i31]Cornelis A. Middelburg:
Searching publications on operating systems. CoRR abs/1003.5525 (2010) - [i30]Jan A. Bergstra, Cornelis A. Middelburg:
On the definition of a theoretical concept of an operating system. CoRR abs/1006.0813 (2010) - [i29]Cornelis A. Middelburg:
Searching publications on software testing. CoRR abs/1008.2647 (2010)
2000 – 2009
- 2009
- [j30]Jan A. Bergstra, Cornelis A. Middelburg:
Machine structure oriented control code logic. Acta Informatica 46(5): 375-401 (2009) - [j29]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Dynamically Instantiated Instructions. Fundam. Informaticae 96(1-2): 27-48 (2009) - [c11]Jan A. Bergstra, Cornelis A. Middelburg:
Transmission Protocols for Instruction Streams. ICTAC 2009: 127-139 - [i28]Jan A. Bergstra, Cornelis A. Middelburg:
Timed tuplix calculus and the Wesseling and van den Berg equation. CoRR abs/0901.3003 (2009) - [i27]Jan A. Bergstra, Cornelis A. Middelburg:
Meadow Enriched ACP Process Algebras. CoRR abs/0901.3012 (2009) - [i26]Jan A. Bergstra, Cornelis A. Middelburg:
Transmission protocols for instruction streams. CoRR abs/0902.2859 (2009) - [i25]Jan A. Bergstra, Cornelis A. Middelburg:
A process calculus with finitary comprehended terms. CoRR abs/0903.2914 (2009) - [i24]Jan A. Bergstra, Cornelis A. Middelburg:
A protocol for instruction stream processing. CoRR abs/0905.2257 (2009) - [i23]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence notations with probabilistic instructions. CoRR abs/0906.3083 (2009) - [i22]Jan A. Bergstra, Cornelis A. Middelburg:
Inversive Meadows and Divisive Meadows. CoRR abs/0907.0540 (2009) - [i21]Jan A. Bergstra, Cornelis A. Middelburg:
Arithmetical meadows. CoRR abs/0909.2088 (2009) - [i20]Jan A. Bergstra, Cornelis A. Middelburg:
Indirect jumps improve instruction sequence performance. CoRR abs/0909.2089 (2009) - [i19]Jan A. Bergstra, Cornelis A. Middelburg:
Partial Komori fields and imperative Komori fields. CoRR abs/0909.5271 (2009) - [i18]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence processing operators. CoRR abs/0910.5564 (2009) - [i17]Jan A. Bergstra, Cornelis A. Middelburg:
Functional units for natural numbers. CoRR abs/0911.1851 (2009) - [i16]Jan A. Bergstra, Cornelis A. Middelburg:
Autosolvability of halting problem instances for instruction sequences. CoRR abs/0911.5018 (2009) - 2008
- [j28]Jan A. Bergstra, Cornelis A. Middelburg:
Distributed strategic interleaving with load balancing. Future Gener. Comput. Syst. 24(6): 530-548 (2008) - [j27]Jan A. Bergstra, Cornelis A. Middelburg:
Simulating Turing machines on Maurer machines. J. Appl. Log. 6(1): 1-23 (2008) - [j26]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra with a jump-shift instruction. J. Appl. Log. 6(4): 553-563 (2008) - [j25]Jan A. Bergstra, Cornelis A. Middelburg:
Maurer computers for pipelined instruction processing. Math. Struct. Comput. Sci. 18(2): 373-409 (2008) - [i15]Jan A. Bergstra, Cornelis A. Middelburg:
Programming an interpreter using molecular dynamics. CoRR abs/0801.2226 (2008) - [i14]Jan A. Bergstra, Kees Middelburg:
Thread extraction for polyadic instruction sequences. CoRR abs/0802.1578 (2008) - [i13]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for sequential poly-threading. CoRR abs/0803.0378 (2008) - [i12]Jan A. Bergstra, Cornelis A. Middelburg:
Data linkage algebra, data linkage dynamics, and priority rewriting. CoRR abs/0804.4565 (2008) - [i11]Jan A. Bergstra, Cornelis A. Middelburg:
Data linkage dynamics with shedding. CoRR abs/0806.4034 (2008) - [i10]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences and non-uniform complexity theory. CoRR abs/0809.0352 (2008) - [i9]Jan A. Bergstra, Cornelis A. Middelburg:
On the expressiveness of single-pass instruction sequences. CoRR abs/0810.1106 (2008) - [i8]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences for the production of processes. CoRR abs/0811.0436 (2008) - 2007
- [j24]Jan A. Bergstra, Cornelis A. Middelburg:
Synchronous cooperation for explicit multi-threading. Acta Informatica 44(7-8): 525-569 (2007) - [j23]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Indirect Jumps. Sci. Ann. Comput. Sci. 17: 19-46 (2007) - [j22]Jan A. Bergstra, Cornelis A. Middelburg:
Programming an Interpreter Using Molecular Dynamics. Sci. Ann. Comput. Sci. 17: 47-81 (2007) - [j21]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for strategic interleaving. Formal Aspects Comput. 19(4): 445-474 (2007) - [j20]Jan A. Bergstra, Cornelis A. Middelburg:
Maurer Computers with Single-Thread Control. Fundam. Informaticae 80(4): 333-362 (2007) - [j19]Jan A. Bergstra, Cornelis A. Middelburg:
Preferential choice and coordination conditions. J. Log. Algebraic Methods Program. 70(2): 172-200 (2007) - [j18]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. 41(1): 3-32 (2007) - [i7]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences with indirect jumps. CoRR abs/0711.0829 (2007) - [i6]Jan A. Bergstra, Cornelis A. Middelburg:
An interface group for process components. CoRR abs/0711.0834 (2007) - [i5]Jan A. Bergstra, Cornelis A. Middelburg:
Machine structure oriented control code logic. CoRR abs/0711.0836 (2007) - [i4]Jan A. Bergstra, Cornelis A. Middelburg:
On the operating unit size of load/store architectures. CoRR abs/0711.0838 (2007) - [i3]Jan A. Bergstra, Cornelis A. Middelburg:
A thread calculus with molecular dynamics. CoRR abs/0711.0840 (2007) - [i2]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Dynamically Instantiated Instructions. CoRR abs/0711.4217 (2007) - [i1]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra with a jump-shift instruction. CoRR abs/0712.1658 (2007) - 2006
- [j17]Jan A. Bergstra, Cornelis A. Middelburg:
Thread Algebra with Multi-Level Strategies. Fundam. Informaticae 71(2-3): 153-182 (2006) - [j16]Jan A. Bergstra, Cornelis A. Middelburg:
Splitting bisimulations and retrospective conditions. Inf. Comput. 204(7): 1083-1138 (2006) - [j15]Jan A. Bergstra, Cornelis A. Middelburg:
Continuity controlled hybrid automata. J. Log. Algebraic Methods Program. 68(1-2): 5-53 (2006) - [c10]Jan A. Bergstra, Cornelis A. Middelburg:
Parallel Processes with Implicit Computational Capital. LIX 2006: 55-81 - 2005
- [j14]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra for hybrid systems. Theor. Comput. Sci. 335(2-3): 215-280 (2005) - [c9]Jan A. Bergstra, Cornelis A. Middelburg:
Model Theory for Process Algebra. Processes, Terms and Cycles 2005: 445-495 - [c8]Jan A. Bergstra, Cornelis A. Middelburg:
Strong Splitting Bisimulation Equivalence. CALCO 2005: 83-97 - [c7]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Multi-level Strategic Interleaving. CiE 2005: 35-48 - [c6]Cornelis A. Middelburg:
Conditionals in Algebraic Process Calculi. APC 25 2005: 237-241 - 2004
- [j13]Jan A. Bergstra, Cornelis A. Middelburg:
Located Actions in Process Algebra with Timing. Fundam. Informaticae 61(3-4): 183-211 (2004) - 2003
- [j12]Cornelis A. Middelburg:
Revisiting timing in process algebra. J. Log. Algebraic Methods Program. 54(1-2): 109-127 (2003) - [j11]Cornelis A. Middelburg:
An alternative formulation of operational conservativity with binding terms. J. Log. Algebraic Methods Program. 55(1-2): 1-19 (2003) - 2002
- [b2]Jos C. M. Baeten, Cornelis A. Middelburg:
Process Algebra with Timing. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2002, ISBN 978-3-642-07788-3, pp. I-XIX, 1-290 - [j10]Kees Middelburg:
Process Algebra with Nonstandard Timing. Fundam. Informaticae 53(1): 55-77 (2002) - 2001
- [j9]Cornelis A. Middelburg:
Variable binding operators in transition system specifications. J. Log. Algebraic Methods Program. 47(1): 15-45 (2001) - [j8]Jos C. M. Baeten, Cornelis A. Middelburg:
Real time process algebra with time-dependent conditions. J. Log. Algebraic Methods Program. 48(1-2): 1-38 (2001) - [p3]Jos C. M. Baeten, Cornelis A. Middelburg:
Process Algebra with Timing: Real Time and Discrete Time. Handbook of Process Algebra 2001: 627-684 - [p2]Jan A. Bergstra, Cornelis A. Middelburg, Yaroslav S. Usenko:
Discrete Time Process Algebra and the Semantics of SDL. Handbook of Process Algebra 2001: 1209-1268
1990 – 1999
- 1998
- [j7]Cornelis A. Middelburg:
Truth of Duration Calculus Formulae in Timed Frames. Fundam. Informaticae 36(2-3): 235-263 (1998) - 1997
- [j6]Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu:
Network algebra for asynchronous dataflow. Int. J. Comput. Math. 65(1-2): 57-88 (1997) - 1996
- [j5]Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg:
Algebra of timed frames. Int. J. Comput. Math. 61(3-4): 227-255 (1996) - 1994
- [b1]Loe M. G. Feijs, Hans Jonkers, Cornelis A. Middelburg:
Notations for software design. FACIT: Formal approaches to computing and information technology, Springer 1994, ISBN 978-3-540-19902-1, pp. I-XII, 1-425 - [j4]Cliff B. Jones, Cornelis A. Middelburg:
A Typed Logic of Partial Functions Reconstructed Classically. Acta Informatica 31(5): 399-430 (1994) - [c5]Wiet Bouma, Willem J. M. Levelt, Alfo Melisse, Kees Middelburg, Louis Verhaard:
Formalisation of Properties for Feature Interaction Detection: Experience in a Real-Life Situation. IS&N 1994: 393-405 - [e1]D. J. Andrews, Jan Friso Groote, Cornelis A. Middelburg:
Semantics of Specification Languages (SoSL), Proceedings of the International Workshop on Semantics of Specification Languages, Utrecht, The Netherlands, 25-27 October 1993. Workshops in Computing, Springer 1994, ISBN 3-540-19854-7 [contents] - 1992
- [j3]Cornelis A. Middelburg:
Modular Structuring of VDM Specifications in VVSL. Formal Aspects Comput. 4(1): 13-47 (1992) - [j2]Cornelis A. Middelburg:
Specification of interfering programs based on interconditions. Softw. Eng. J. 7(3): 205-217 (1992) - [p1]Cornelis A. Middelburg:
VVSL Specification of a Transaction-oriented Access Handler. Specifications of Database Systems 1992: 188-212 - 1991
- [c4]Cornelis A. Middelburg, Gerard R. Renardel de Lavalette:
LPF and MPLomega - A Logical Comparison of VDM SL and COLD-K. VDM Europe (1) 1991: 279-308
1980 – 1989
- 1989
- [j1]Cornelis A. Middelburg:
VVSL: A Language for Structured VDM Specifications. Formal Aspects Comput. 1(1): 115-135 (1989) - [c3]Cornelis A. Middelburg:
Experiences with Combining Formalisms in VVSL. Algebraic Methods 1989: 83-103 - 1988
- [c2]Kees Middelburg:
The VIP VDM Specification Language. VDM Europe 1988: 187-201 - 1982
- [c1]Cornelis A. Middelburg:
The Effect of the PDP-11 Architecture on Code Generation for Chill. ASPLOS 1982: 149-157
Coauthor Index
[i68] [j62] [j59] [j58] [j57] [i57] [i56] [j56] [j55] [i54] [i53] [j54] [j53] [i51] [i50] [j52] [j51] [j50] [j49] [j48] [j47] [j46] [i48] [i47] [i46] [j45] [i45] [i44] [i43] [i42] [i41] [j44] [j43] [j42] [i40] [i39] [i38] [i37] [i36] [b3] [j41] [j40] [j39] [j38] [i35] [i34] [j37] [j36] [j35] [i32] [j34] [j33] [j32] [j31] [i30] [j30] [j29] [c11] [i28] [i27] [i26] [i25] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [i17] [i16] [j28] [j27] [j26] [j25] [i15] [i14] [i13] [i12] [i11] [i10] [i9] [i8] [j24] [j23] [j22] [j21] [j20] [j19] [j18] [i7] [i6] [i5] [i4] [i3] [i2] [i1] [j17] [j16] [j15] [c10] [j14] [c9] [c8] [c7] [j13] [p2] [j6] [j5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
