default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan A. Bergstra
Person information
- affiliation: University of Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j173]Jan A. Bergstra
, John V. Tucker:
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. Comput. J. 67(5): 1866-1871 (2024)- [j172]Jan A. Bergstra, John V. Tucker:
Synthetic Fracterm Calculus. J. Univers. Comput. Sci. 30(3): 289-307 (2024) - [i111]Jan A. Bergstra, John V. Tucker:
Rings with common division, common meadows and their conditional equational theories. CoRR abs/2405.01733 (2024) - [i110]Jan A. Bergstra, Cornelis A. Middelburg:
Space-time process algebra with asynchronous communication. CoRR abs/2409.15120 (2024) - 2023
- [j171]Jan A. Bergstra, John V. Tucker:
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. Comput. J. 66(7): 1565-1572 (2023) - [j170]Jan A. Bergstra, John V. Tucker:
Naive Fracterm Calculus. J. Univers. Comput. Sci. 29(9): 961-987 (2023) - [j169]Jan A. Bergstra, John V. Tucker:
Eager Equality for Rational Number Arithmetic. ACM Trans. Comput. Log. 24(3): 22:1-22:28 (2023) - [i109]Jan A. Bergstra, Alban Ponse:
Conditional logic as a short-circuit logic. CoRR abs/2304.14821 (2023) - [i108]Jan A. Bergstra, John V. Tucker:
A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows. CoRR abs/2307.04270 (2023) - 2022
- [j168]Jan A. Bergstra:
A Survey of Testing for Instruction Sequence Theory. Sci. Ann. Comput. Sci. 32(1): 5-86 (2022) - [j167]Jan A. Bergstra, John V. Tucker:
Which Arithmetical Data Types Admit Fracterm Flattening? Sci. Ann. Comput. Sci. 32(1): 87-107 (2022) - [j166]Jan A. Bergstra:
Four Notions of Fault for Program Specifications. Sci. Ann. Comput. Sci. 32(2): 183-209 (2022) - [j165]Jan A. Bergstra, John V. Tucker:
Partial arithmetical data types of rational numbers and their equational specification. J. Log. Algebraic Methods Program. 128: 100797 (2022) - [c70]Jan A. Bergstra, John V. Tucker:
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 63-80 - 2021
- [j164]Jan A. Bergstra:
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent. Sci. Ann. Comput. Sci. 31(1): 1-50 (2021) - [j163]Jan A. Bergstra, Cornelis A. Middelburg:
Using Hoare Logic in a Process Algebra Setting. Fundam. Informaticae 179(4): 321-344 (2021) - [j162]Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt:
Non-commutative propositional logic with short-circuit evaluation. J. Appl. Non Class. Logics 31(3-4): 234-278 (2021) - [j161]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for naturals and integers. Log. Methods Comput. Sci. 17(1) (2021) - 2020
- [j160]Jan A. Bergstra, Alban Ponse:
Arithmetical datatypes with true fractions. Acta Informatica 57(3-5): 385-402 (2020) - [j159]Jan A. Bergstra:
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers. Sci. Ann. Comput. Sci. 30(1): 1-24 (2020) - [j158]Jan A. Bergstra:
Instruction Sequence Faults with Formal Change Justification. Sci. Ann. Comput. Sci. 30(2): 105-166 (2020) - [j157]Jan A. Bergstra:
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation. Sci. Ann. Comput. Sci. 30(2): 167-203 (2020) - [j156]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) - [c69]Jan A. Bergstra, John V. Tucker:
The Wheel of Rational Numbers as an Abstract Data Type. WADT 2020: 13-30 - [i107]Jan A. Bergstra, Mark Burgess:
A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair. CoRR abs/2001.01543 (2020) - [i106]Jan A. Bergstra, Mark Burgess:
Candidate Software Process Flaws for the Boeing 737 Max MCAS Algorithm and Risks for a Proposed Upgrade. CoRR abs/2001.05690 (2020)
2010 – 2019
- 2019
- [j155]Jan A. Bergstra:
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. Comput. Sci. J. Moldova 27(2): 131-161 (2019) - [j154]Jan A. Bergstra:
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. Sci. Ann. Comput. Sci. 29(1): 1-58 (2019) - [j153]Jan A. Bergstra, Cornelis A. Middelburg:
Program Algebra for Turing-Machine Programs. Sci. Ann. Comput. Sci. 29(2): 113-139 (2019) - [j152]Jan A. Bergstra, Cornelis A. Middelburg:
Process Algebra with Strategic Interleaving. Theory Comput. Syst. 63(3): 488-505 (2019) - [i105]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra for Turing-machine programs. CoRR abs/1901.08840 (2019) - [i104]Jan A. Bergstra:
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. CoRR abs/1904.08722 (2019) - [i103]Jan A. Bergstra, Cornelis A. Middelburg:
Using Hoare logic in a process algebra setting. CoRR abs/1906.04491 (2019) - 2018
- [j151]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) - [j150]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences Expressing Multiplication Algorithms. Sci. Ann. Comput. Sci. 28(1): 39-66 (2018) - [i102]Jan A. Bergstra, Cornelis A. Middelburg:
On the complexity of the correctness problem for non-zeroness test instruction sequences. CoRR abs/1805.05845 (2018) - [i101]Jan A. Bergstra, Cornelis A. Middelburg:
A short introduction to program algebra with instructions for Boolean registers. CoRR abs/1808.04264 (2018) - [i100]Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt:
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. CoRR abs/1810.02142 (2018) - 2017
- [j149]Jan A. Bergstra, Inge Bethke:
Subvarieties of the Variety of Meadows. Sci. Ann. Comput. Sci. 27(1): 1-18 (2017) - [j148]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 27(2): 111-135 (2017) - [j147]Jan A. Bergstra, Cornelis A. Middelburg:
Contradiction-Tolerant Process Algebra with Propositional Signals. Fundam. Informaticae 153(1-2): 29-55 (2017) - [i99]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for behavioural congruence of single-pass instruction sequences. CoRR abs/1702.03511 (2017) - [i98]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with strategic interleaving. CoRR abs/1703.06822 (2017) - [i97]Jan A. Bergstra, Inge Bethke, Dimitri Hendriks:
Universality of Univariate Mixed Fractions in Divisive Meadows. CoRR abs/1707.00499 (2017) - 2016
- [j146]Jan A. Bergstra, Cornelis A. Middelburg:
On Instruction Sets for Boolean Registers in Program Algebra. Sci. Ann. Comput. Sci. 26(1): 1-26 (2016) - [j145]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) - [j144]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequence Size Complexity of Parity. Fundam. Informaticae 149(3): 297-309 (2016) - [j143]Jan A. Bergstra, Cornelis A. Middelburg:
Transformation of fractions into simple fractions in divisive meadows. J. Appl. Log. 16: 92-110 (2016) - [c68]Jan A. Bergstra, Alban Ponse:
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract). WADT 2016: 73-87 - [i96]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. CoRR abs/1608.06212 (2016) - [i95]Jan A. Bergstra:
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. CoRR abs/1611.09351 (2016) - 2015
- [j142]Jan A. Bergstra, Cornelis A. Middelburg:
Probabilistic Thread Algebra. Sci. Ann. Comput. Sci. 25(2): 211-243 (2015) - [j141]Jan A. Bergstra, Cornelis A. Middelburg:
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. Fundam. Informaticae 138(4): 411-434 (2015) - [j140]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and reasoning about fractions. J. Appl. Non Class. Logics 25(2): 120-124 (2015) - [j139]Jan A. Bergstra, Cornelis A. Middelburg:
Division by zero in non-involutive meadows. J. Appl. Log. 13(1): 1-12 (2015) - [j138]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. J. Appl. Log. 13(2): 1-23 (2015) - [c67]Jan A. Bergstra, Alban Ponse:
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence. Correct System Design 2015: 44-61 - [c66]Jan A. Bergstra, Alban Ponse:
Division by Zero in Common Meadows. Software, Services, and Systems 2015: 46-61 - [i94]Jan A. Bergstra, Cornelis A. Middelburg:
On instruction sets for Boolean registers in program algebra. CoRR abs/1502.00238 (2015) - [i93]Jan A. Bergstra:
Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money. CoRR abs/1504.07184 (2015) - [i92]Jan A. Bergstra, Alban Ponse:
Evaluation trees for proposition algebra. CoRR abs/1504.08321 (2015) - [i91]Jan A. Bergstra, Inge Bethke:
A negative result on algebraic specifications of the meadow of rational numbers. CoRR abs/1507.00548 (2015) - [i90]Jan A. Bergstra, Cornelis A. Middelburg:
Contradiction-tolerant process algebra with propositional signals. CoRR abs/1508.06899 (2015) - [i89]Jan A. Bergstra, Inge Bethke:
Subvarieties of the variety of meadows. CoRR abs/1510.04021 (2015) - [i88]Jan A. Bergstra, Cornelis A. Middelburg:
Transformation of fractions into simple fractions in divisive meadows. CoRR abs/1510.06233 (2015) - 2014
- [j137]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequence Based Non-uniform Complexity Classes. Sci. Ann. Comput. Sci. 24(1): 47-89 (2014) - [j136]Jan A. Bergstra, John V. Tucker:
Editor's Note. J. Log. Algebraic Methods Program. 83(2): 82 (2014) - [i87]Jan A. Bergstra, Mark Burgess:
Promises, Impositions, and other Directionals. CoRR abs/1401.3381 (2014) - [i86]Jan A. Bergstra, Peter Weijland:
Bitcoin: a Money-like Informational Commodity. CoRR abs/1402.4778 (2014) - [i85]Jan A. Bergstra, Cornelis A. Middelburg:
On algorithmic equivalence of instruction sequences for computing bit string functions. CoRR abs/1402.4950 (2014) - [i84]Jan A. Bergstra, Cornelis A. Middelburg:
Division by zero in non-involutive meadows. CoRR abs/1406.2092 (2014) - [i83]Jan A. Bergstra, Alban Ponse:
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. CoRR abs/1406.3280 (2014) - [i82]Jan A. Bergstra, Cornelis A. Middelburg:
A Hoare-like logic of asserted single-pass instruction sequences. CoRR abs/1408.2955 (2014) - [i81]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Probabilistic Features. CoRR abs/1409.6873 (2014) - [i80]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and the logic of fractions. CoRR abs/1410.8692 (2014) - [i79]Jan A. Bergstra:
Personal Multi-threading. CoRR abs/1412.3579 (2014) - [i78]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence size complexity of parity. CoRR abs/1412.6787 (2014) - 2013
- [j135]Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer:
Guest Editorial. Comput. J. 56(1): 2 (2013) - [j134]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) - [j133]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) - [j132]Jan A. Bergstra, Jan Willem Klop, Jan Rutten:
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109: 14-16 (2013) - [j131]Jan A. Bergstra, Cornelis A. Middelburg:
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundam. Informaticae 128(4): 367-412 (2013) - [j130]Jan A. Bergstra, Cornelis A. Middelburg:
A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. 53(4): 645-668 (2013) - [j129]Jan A. Bergstra:
Editorial. Sci. Comput. Program. 78(9): 1207 (2013) - [i77]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence based non-uniform complexity classes. CoRR abs/1301.3297 (2013) - [i76]Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu:
Network algebra for synchronous dataflow. CoRR abs/1303.0382 (2013) - [i75]Jan A. Bergstra, Karl de Leeuw:
Bitcoin and Beyond: Exclusively Informational Monies. CoRR abs/1304.4758 (2013) - [i74]Jan A. Bergstra, Karl de Leeuw:
Questions related to Bitcoin and other Informational Money. CoRR abs/1305.5956 (2013) - [i73]Jan A. Bergstra:
Decision Taking versus Promise Issuing. CoRR abs/1306.6412 (2013) - [i72]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the secure hash algorithm SHA-256. CoRR abs/1308.0219 (2013) - [i71]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. CoRR abs/1310.5011 (2013) - [i70]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the Karatsuba multiplication algorithm. CoRR abs/1312.1529 (2013) - [i69]Jan A. Bergstra, Cornelis A. Middelburg:
Long multiplication by instruction sequences with backward jump instructions. CoRR abs/1312.1812 (2013) - 2012
- [b1]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 - [j128]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence processing operators. Acta Informatica 49(3): 139-172 (2012) - [j127]Jan A. Bergstra, Cornelis A. Middelburg:
Indirect Jumps Improve Instruction Sequence Performance. Sci. Ann. Comput. Sci. 22(2): 253-265 (2012) - [j126]Jan A. Bergstra, Cornelis A. Middelburg:
On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Informaticae 120(2): 111-144 (2012) - [j125]Jan A. Bergstra, Cornelis A. Middelburg:
On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50(2): 313-328 (2012) - [j124]Jan A. Bergstra, Inge Bethke:
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012) - [i68]Jan A. Bergstra:
About Instruction Sequence Testing. CoRR abs/1201.3929 (2012) - [i67]Jan A. Bergstra, Cornelis A. Middelburg:
Turing Impossibility Properties for Stack Machine Programming. CoRR abs/1201.6028 (2012) - [i66]Jan A. Bergstra:
Four Conceptions of Instruction Sequence Faults. CoRR abs/1204.1881 (2012) - [i65]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with conditionals in the presence of epsilon. CoRR abs/1204.3249 (2012) - [i64]Jan A. Bergstra:
Decision Taking as a Service. CoRR abs/1205.4194 (2012) - [i63]Jan A. Bergstra:
Decision Taking versus Action Determination. CoRR abs/1205.6177 (2012) - [i62]Jan A. Bergstra:
Decision Taking for Selling Thread Startup. CoRR abs/1208.2460 (2012) - [i61]Jan A. Bergstra:
Informaticology: combining Computer Science, Data Science, and Fiction Science. CoRR abs/1210.6636 (2012) - 2011
- [j123]Jan A. Bergstra, Cornelis A. Middelburg:
Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comput. Sci. 21(2): 283-310 (2011) - [j122]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for poly-threading. Formal Aspects Comput. 23(4): 567-583 (2011) - [j121]Jan A. Bergstra, Cornelis A. Middelburg:
Inversive meadows and divisive meadows. J. Appl. Log. 9(3): 203-220 (2011) - [j120]Jan A. Bergstra, Inge Bethke:
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) - [j119]Jan A. Bergstra:
Editorial. Sci. Comput. Program. 76(7): 541 (2011) - [j118]Jan A. Bergstra, Jaco van de Pol:
A calculus for four-valued sequential logic. Theor. Comput. Sci. 412(28): 3122-3128 (2011) - [j117]Jan A. Bergstra, Alban Ponse:
Proposition algebra. ACM Trans. Comput. Log. 12(3): 21:1-21:36 (2011) - [c65]Jan A. Bergstra, Alban Ponse:
Proposition Algebra and Short-Circuit Logic. FSEN 2011: 15-31 - [i60]Jan A. Bergstra:
Real Islamic Logic. CoRR abs/1103.4515 (2011) - [i59]Jan A. Bergstra, Cornelis A. Middelburg:
On the behaviours produced by instruction sequences under execution. CoRR abs/1106.6196 (2011) - [i58]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Introducing Sourcements. CoRR abs/1107.4684 (2011) - [i57]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Outsourcing Competence. CoRR abs/1109.6536 (2011) - [i56]Jan A. Bergstra:
Putting Instruction Sequences into Effect. CoRR abs/1110.1866 (2011) - [i55]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Stratified Outsourcing Theory. CoRR abs/1110.1957 (2011) - [i54]Jan A. Bergstra:
Informatics Perspectives on Decision Taking. CoRR abs/1112.5840 (2011) - 2010
- [j116]Jan A. Bergstra, Cornelis A. Middelburg:
An Interface Group for Process Components. Fundam. Informaticae 99(4): 355-382 (2010) - [j115]Jan A. Bergstra, Cornelis A. Middelburg:
Data Linkage Dynamics with Shedding. Fundam. Informaticae 103(1-4): 31-52 (2010) - [j114]Jan A. Bergstra, Cornelis A. Middelburg:
A thread calculus with molecular dynamics. Inf. Comput. 208(7): 817-844 (2010) - [j113]Jan A. Bergstra, Cornelis A. Middelburg:
On the operating unit size of load/store architectures. Math. Struct. Comput. Sci. 20(3): 395-417 (2010) - [i53]Jan A. Bergstra, Inge Bethke:
On the contribution of backward jumps to instruction sequence expressiveness. CoRR abs/1005.5662 (2010) - [i52]Jan A. Bergstra, Cornelis A. Middelburg:
On the definition of a theoretical concept of an operating system. CoRR abs/1006.0813 (2010) - [i51]Jan A. Bergstra:
Formaleuros, formalcoins and virtual monies. CoRR abs/1008.0616 (2010) - [i50]Jan A. Bergstra:
Informal Control code logic. CoRR abs/1009.2902 (2010) - [i49]Jan A. Bergstra:
Steering Fragments of Instruction Sequences. CoRR abs/1010.2850 (2010) - [i48]Jan A. Bergstra, Alban Ponse:
Short-circuit logic. CoRR abs/1010.3674 (2010) - [i47]Jan A. Bergstra, Alban Ponse:
On Hoare-McCarthy algebras. CoRR abs/1012.5059 (2010) - [i46]Jan A. Bergstra, S. F. M. van Vlijmen:
Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations. CoRR abs/1012.5739 (2010)
2000 – 2009
- 2009
- [j112]Jan A. Bergstra, Cornelis A. Middelburg:
Machine structure oriented control code logic. Acta Informatica 46(5): 375-401 (2009) - [j111]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. Sci. Ann. Comput. Sci. 19: 57-92 (2009) - [j110]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Dynamically Instantiated Instructions. Fundam. Informaticae 96(1-2): 27-48 (2009) - [j109]Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker:
Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) - [c64]Jan A. Bergstra, Cornelis A. Middelburg:
Transmission Protocols for Instruction Streams. ICTAC 2009: 127-139 - [i45]Jan A. Bergstra, Cornelis A. Middelburg:
Timed tuplix calculus and the Wesseling and van den Berg equation. CoRR abs/0901.3003 (2009) - [i44]Jan A. Bergstra, Cornelis A. Middelburg:
Meadow Enriched ACP Process Algebras. CoRR abs/0901.3012 (2009) - [i43]Jan A. Bergstra, Inge Bethke:
Square root meadows. CoRR abs/0901.4664 (2009) - [i42]Jan A. Bergstra, Cornelis A. Middelburg:
Transmission protocols for instruction streams. CoRR abs/0902.2859 (2009) - [i41]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. CoRR abs/0903.1352 (2009) - [i40]Jan A. Bergstra, Cornelis A. Middelburg:
A process calculus with finitary comprehended terms. CoRR abs/0903.2914 (2009) - [i39]Jan A. Bergstra, Cornelis A. Middelburg:
A protocol for instruction stream processing. CoRR abs/0905.2257 (2009) - [i38]Jan A. Bergstra, Inge Bethke:
Straight-line instruction sequence completeness for total calculation on cancellation meadows. CoRR abs/0905.4612 (2009) - [i37]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence notations with probabilistic instructions. CoRR abs/0906.3083 (2009) - [i36]Jan A. Bergstra, Cornelis A. Middelburg:
Inversive Meadows and Divisive Meadows. CoRR abs/0907.0540 (2009) - [i35]Jan A. Bergstra, Cornelis A. Middelburg:
Arithmetical meadows. CoRR abs/0909.2088 (2009) - [i34]Jan A. Bergstra, Cornelis A. Middelburg:
Indirect jumps improve instruction sequence performance. CoRR abs/0909.2089 (2009) - [i33]Jan A. Bergstra, Alban Ponse:
A progression ring for interfaces of instruction sequences, threads, and services. CoRR abs/0909.2839 (2009) - [i32]Jan A. Bergstra, Cornelis A. Middelburg:
Partial Komori fields and imperative Komori fields. CoRR abs/0909.5271 (2009) - [i31]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence processing operators. CoRR abs/0910.5564 (2009) - [i30]Jan A. Bergstra, Cornelis A. Middelburg:
Functional units for natural numbers. CoRR abs/0911.1851 (2009) - [i29]Jan A. Bergstra, Cornelis A. Middelburg:
Autosolvability of halting problem instances for instruction sequences. CoRR abs/0911.5018 (2009) - [i28]Jan A. Bergstra, Mark Burgess:
Local and Global Trust Based on the Concept of Promises. CoRR abs/0912.4637 (2009) - 2008
- [j108]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Tuplix Calculus. Sci. Ann. Comput. Sci. 18: 35-61 (2008) - [j107]Jan A. Bergstra, Cornelis A. Middelburg:
Distributed strategic interleaving with load balancing. Future Gener. Comput. Syst. 24(6): 530-548 (2008) - [j106]Jan A. Bergstra, Cornelis A. Middelburg:
Simulating Turing machines on Maurer machines. J. Appl. Log. 6(1): 1-23 (2008) - [j105]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra with a jump-shift instruction. J. Appl. Log. 6(4): 553-563 (2008) - [j104]Jan A. Bergstra, Cornelis A. Middelburg:
Maurer computers for pipelined instruction processing. Math. Struct. Comput. Sci. 18(2): 373-409 (2008) - [j103]Jan A. Bergstra, John V. Tucker:
Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008) - [c63]Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker:
Fields, Meadows and Abstract Data Types. Pillars of Computer Science 2008: 166-178 - [i27]Jan A. Bergstra, Cornelis A. Middelburg:
Programming an interpreter using molecular dynamics. CoRR abs/0801.2226 (2008) - [i26]Jan A. Bergstra, Kees Middelburg:
Thread extraction for polyadic instruction sequences. CoRR abs/0802.1578 (2008) - [i25]Jan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag:
Towards a formalization of budgets. CoRR abs/0802.3617 (2008) - [i24]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for sequential poly-threading. CoRR abs/0803.0378 (2008) - [i23]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: a Generic Basis Theorem and Some Applications. CoRR abs/0803.3969 (2008) - [i22]Jan A. Bergstra, Alban Ponse:
Differential Meadows. CoRR abs/0804.3336 (2008) - [i21]Jan A. Bergstra, Cornelis A. Middelburg:
Data linkage algebra, data linkage dynamics, and priority rewriting. CoRR abs/0804.4565 (2008) - [i20]Jan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag:
Tuplix Calculus Specifications of Financial Transfer Networks. CoRR abs/0805.1806 (2008) - [i19]Jan A. Bergstra, Cornelis A. Middelburg:
Data linkage dynamics with shedding. CoRR abs/0806.4034 (2008) - [i18]Jan A. Bergstra, Alban Ponse:
Proposition Algebra with Projective Limits. CoRR abs/0807.3648 (2008) - [i17]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences and non-uniform complexity theory. CoRR abs/0809.0352 (2008) - [i16]Jan A. Bergstra, Mark van der Zwaag:
Mechanistic Behavior of Single-Pass Instruction Sequences. CoRR abs/0809.4635 (2008) - [i15]Jan A. Bergstra, Cornelis A. Middelburg:
On the expressiveness of single-pass instruction sequences. CoRR abs/0810.1106 (2008) - [i14]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Repeaters. CoRR abs/0810.1151 (2008) - [i13]Jan A. Bergstra, Mark Burgess:
A static theory of promises. CoRR abs/0810.3294 (2008) - [i12]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences for the production of processes. CoRR abs/0811.0436 (2008) - 2007
- [j102]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Decision problems for pushdown threads. Acta Informatica 44(2): 75-90 (2007) - [j101]Jan A. Bergstra, Cornelis A. Middelburg:
Synchronous cooperation for explicit multi-threading. Acta Informatica 44(7-8): 525-569 (2007) - [j100]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Indirect Jumps. Sci. Ann. Comput. Sci. 17: 19-46 (2007) - [j99]Jan A. Bergstra, Cornelis A. Middelburg:
Programming an Interpreter Using Molecular Dynamics. Sci. Ann. Comput. Sci. 17: 47-81 (2007) - [j98]Jan A. Bergstra, Cornelis A. Middelburg:
Thread algebra for strategic interleaving. Formal Aspects Comput. 19(4): 445-474 (2007) - [j97]Jan A. Bergstra, Cornelis A. Middelburg:
Maurer Computers with Single-Thread Control. Fundam. Informaticae 80(4): 333-362 (2007) - [j96]Jan A. Bergstra, John V. Tucker:
The rational numbers as an abstract data type. J. ACM 54(2): 7 (2007) - [j95]Jan A. Bergstra, Alban Ponse:
Execution architectures for program algebra. J. Appl. Log. 5(1): 170-192 (2007) - [j94]Jan A. Bergstra, Cornelis A. Middelburg:
Preferential choice and coordination conditions. J. Log. Algebraic Methods Program. 70(2): 172-200 (2007) - [j93]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. 41(1): 3-32 (2007) - [j92]Jan A. Bergstra, Paul Klint:
About "trivial" software patents: The IsNot case. Sci. Comput. Program. 64(3): 264-285 (2007) - [j91]Jan A. Bergstra:
Letter from the editor. Sci. Comput. Program. 65(1) (2007) - [i11]Jan A. Bergstra, Inge Bethke, Mark Burgess:
A process algebra based framework for promise theory. CoRR abs/0707.0744 (2007) - [i10]Jan A. Bergstra, Alban Ponse:
Projection semantics for rigid loops. CoRR abs/0707.1059 (2007) - [i9]Jan A. Bergstra, Alban Ponse:
Interface groups and financial transfer architectures. CoRR abs/0707.1639 (2007) - [i8]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequences with indirect jumps. CoRR abs/0711.0829 (2007) - [i7]Jan A. Bergstra, Cornelis A. Middelburg:
An interface group for process components. CoRR abs/0711.0834 (2007) - [i6]Jan A. Bergstra, Cornelis A. Middelburg:
Machine structure oriented control code logic. CoRR abs/0711.0836 (2007) - [i5]Jan A. Bergstra, Cornelis A. Middelburg:
On the operating unit size of load/store architectures. CoRR abs/0711.0838 (2007) - [i4]Jan A. Bergstra, Cornelis A. Middelburg:
A thread calculus with molecular dynamics. CoRR abs/0711.0840 (2007) - [i3]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences with Dynamically Instantiated Instructions. CoRR abs/0711.4217 (2007) - [i2]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra with a jump-shift instruction. CoRR abs/0712.1658 (2007) - [i1]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Tuplix Calculus. CoRR abs/0712.3423 (2007) - 2006
- [j90]Jan A. Bergstra, Cornelis A. Middelburg:
Thread Algebra with Multi-Level Strategies. Fundam. Informaticae 71(2-3): 153-182 (2006) - [j89]Jan A. Bergstra, Cornelis A. Middelburg:
Splitting bisimulations and retrospective conditions. Inf. Comput. 204(7): 1083-1138 (2006) - [j88]Jan A. Bergstra, Cornelis A. Middelburg:
Continuity controlled hybrid automata. J. Log. Algebraic Methods Program. 68(1-2): 5-53 (2006) - [c62]Jan A. Bergstra, John V. Tucker:
Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475 - [c61]Jan A. Bergstra:
Elementary Algebraic Specifications of the Rational Function Field. CiE 2006: 40-54 - [c60]Jan A. Bergstra, Cornelis A. Middelburg:
Parallel Processes with Implicit Computational Capital. LIX 2006: 55-81 - 2005
- [j87]Jan A. Bergstra, Inge Bethke:
An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94(6): 267-269 (2005) - [j86]Jan A. Bergstra, Inge Bethke:
Network algebra in Java. J. Log. Algebraic Methods Program. 62(2): 247-271 (2005) - [j85]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra for hybrid systems. Theor. Comput. Sci. 335(2-3): 215-280 (2005) - [j84]Jan A. Bergstra, Inge Bethke:
Polarized process algebra with reactive composition. Theor. Comput. Sci. 343(3): 285-304 (2005) - [c59]Jan A. Bergstra, Cornelis A. Middelburg:
Model Theory for Process Algebra. Processes, Terms and Cycles 2005: 445-495 - [c58]Jan A. Bergstra, Cornelis A. Middelburg:
Strong Splitting Bisimulation Equivalence. CALCO 2005: 83-97 - [c57]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Multi-level Strategic Interleaving. CiE 2005: 35-48 - [c56]Jan A. Bergstra, Alban Ponse:
A Bypass of Cohen's Impossibility Result. EGC 2005: 1097-1106 - [c55]Jos C. M. Baeten, Jan A. Bergstra:
Six Themes for Future Concurrency Research. APC 25 2005: 61-64 - [c54]Jan A. Bergstra:
On the Design Rationale of ACP Style Process Algebras. APC 25 2005: 79-85 - 2004
- [j83]Jan A. Bergstra, Cornelis A. Middelburg:
Located Actions in Process Algebra with Timing. Fundam. Informaticae 61(3-4): 183-211 (2004) - 2003
- [j82]Jan A. Bergstra, Pum Walters:
Operator programs and operator processes. Inf. Softw. Technol. 45(10): 681-689 (2003) - [j81]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Branching time and orthogonal bisimulation equivalence. Theor. Comput. Sci. 309(1-3): 313-355 (2003) - [c53]Jan A. Bergstra:
Machine Function Based Control Code Algebras. FMCO 2003: 17-41 - [c52]Jan A. Bergstra, Inge Bethke:
Polarized Process Algebra and Program Equivalence. ICALP 2003: 1-21 - 2002
- [j80]Jan A. Bergstra:
Molecule-oriented programming in Java. Inf. Softw. Technol. 44(11): 617-638 (2002) - [j79]Jan A. Bergstra, M. E. Loots:
Program algebra for sequential code. J. Log. Algebraic Methods Program. 51(2): 125-156 (2002) - [j78]Jan A. Bergstra, Alban Ponse:
Combining programs and state machines. J. Log. Algebraic Methods Program. 51(2): 175-192 (2002) - [j77]Jan A. Bergstra, Inge Bethke:
Molecular dynamics. J. Log. Algebraic Methods Program. 51(2): 193-214 (2002) - 2001
- [j76]Jan A. Bergstra, Alban Ponse:
Process algebra and conditional composition. Inf. Process. Lett. 80(1): 41-49 (2001) - [j75]Jan A. Bergstra, Alban Ponse:
Register-machine based processes. J. ACM 48(6): 1207-1241 (2001) - [j74]Jan A. Bergstra, Alban Ponse:
Non-regular iterators in process algebra. Theor. Comput. Sci. 269(1-2): 203-229 (2001) - [p2]Jan A. Bergstra, Wan J. Fokkink, Alban Ponse:
Process Algebra with Recursive Operations. Handbook of Process Algebra 2001: 333-389 - [p1]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 - [e3]Jan A. Bergstra, Alban Ponse, Scott A. Smolka:
Handbook of Process Algebra. North-Holland / Elsevier 2001, ISBN 978-0-444-82830-9 [contents] - 2000
- [j73]Jan A. Bergstra, M. E. Loots:
Program Algebra for Component Code. Formal Aspects Comput. 12(1): 1-17 (2000) - [j72]Jan A. Bergstra, Alban Ponse:
Process Algebra with Four-Valued Logic. J. Appl. Non Class. Logics 10(1): 27-53 (2000) - [c51]Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers:
Discrete time process algebra with silent step. Proof, Language, and Interaction 2000: 535-570
1990 – 1999
- 1998
- [j71]Jan A. Bergstra, Alban Ponse:
Kleene's Three-Valued Logic and Process Algebra. Inf. Process. Lett. 67(2): 95-103 (1998) - [j70]Jan A. Bergstra, Alban Ponse:
Bochvar-McCarthy Logic and Process Algebra. Notre Dame J. Formal Log. 39(4): 464-484 (1998) - [j69]Jan A. Bergstra, Paul Klint:
The Discrete Time TOOLBUS - A Software Coordination Architecture. Sci. Comput. Program. 31(2-3): 205-229 (1998) - [c50]Jan A. Bergstra, Alban Ponse:
Grid Protocol Specifications. Prospects for Hardware Foundations 1998: 278-308 - [c49]Jos C. M. Baeten, Jan A. Bergstra:
Deadlock Behaviour in Split and ST Bisimulation Semantics. EXPRESS 1998: 61-74 - 1997
- [j68]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. Fundam. Informaticae 29(1-2): 51-76 (1997) - [j67]Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu:
Network algebra for asynchronous dataflow. Int. J. Comput. Math. 65(1-2): 57-88 (1997) - [j66]Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse:
Grid Protocols Based on Synchronous Communication. Sci. Comput. Program. 29(1-2): 199-233 (1997) - [j65]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with Propositional Signals. Theor. Comput. Sci. 177(2): 381-405 (1997) - [j64]Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering:
Toward a Complete Transformational Toolkit for Compilers. ACM Trans. Program. Lang. Syst. 19(5): 639-684 (1997) - [c48]Jos C. M. Baeten, Jan A. Bergstra:
Bounded Stacks, Bags and Queues. CONCUR 1997: 104-118 - [c47]Jan A. Bergstra, Wiet Bouma:
Models for Feature Descriptions and Interactions. FIW 1997: 31-45 - 1996
- [j63]Jos C. M. Baeten, Jan A. Bergstra:
Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. 28(4es): 39 (1996) - [j62]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra. Formal Aspects Comput. 8(2): 188-208 (1996) - [j61]Jan A. Bergstra, Gheorghe Stefanescu:
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. Fundam. Informaticae 27(1): 37-56 (1996) - [j60]Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg:
Algebra of timed frames. Int. J. Comput. Math. 61(3-4): 227-255 (1996) - [c46]Jan A. Bergstra, Paul Klint:
The Discrete Time TOOLBUS. AMAST 1996: 286-305 - [c45]Jan A. Bergstra, Paul Klint:
The TOOLBUS Coordination Architecture. COORDINATION 1996: 75-88 - [c44]Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering:
A Complete Transformational Toolkit for Compilers. ESOP 1996: 92-107 - 1995
- [j59]Jan A. Bergstra, John V. Tucker:
A Data Type Variety of Stack Algebras. Ann. Pure Appl. Log. 73(1): 11-36 (1995) - [j58]Jan A. Bergstra, Jan Heering:
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts. Inf. Comput. 119(1): 119-123 (1995) - [j57]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121(2): 234-255 (1995) - [j56]Jan A. Bergstra, John V. Tucker:
Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995) - [j55]Jan A. Bergstra, Inge Bethke, Piet Rodenburg:
A propositional logic with 4 values: true, false, divergent and meaningless. J. Appl. Non Class. Logics 5(2): 199-217 (1995) - [c43]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra with Abstraction. FCT 1995: 1-15 - [c42]Jan A. Bergstra, Gheorghe Stefanescu:
Processes with Multiple Entries and Exits. FCT 1995: 136-145 - 1994
- [j54]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994) - [j53]Jos C. M. Baeten, Jan A. Bergstra:
On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Aspects Comput. 6(3): 250-268 (1994) - [j52]Jan A. Bergstra, Gheorghe Stefanescu:
Bisimulation is Two-Way Simulation. Inf. Process. Lett. 52(6): 285-287 (1994) - [j51]Johan van Benthem, Jan A. Bergstra:
Logic of Transition Systems. J. Log. Lang. Inf. 3(4): 247-283 (1994) - [j50]Jan A. Bergstra, Jan Heering:
Which Data Types have omega-complete Initial Algebra Specifications? Theor. Comput. Sci. 124(1): 149-168 (1994) - [c41]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with Partial Choice. CONCUR 1994: 465-480 - [c40]Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol:
A Real Time Process Logic. ICTL 1994: 30-47 - 1993
- [j49]Jos C. M. Baeten, Jan A. Bergstra:
Real space process algebra. Formal Aspects Comput. 5(6): 481-529 (1993) - [j48]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. J. ACM 40(3): 653-682 (1993) - [c39]Jos C. M. Baeten, Jan A. Bergstra:
Non Interleaving Process Algebra. CONCUR 1993: 308-323 - [c38]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Combinators. CSL 1993: 36-65 - [c37]Jan A. Bergstra, Gheorghe Stefanescu:
Translations Between Flowchart Schemes and Process Graphs. FCT 1993: 152-161 - [c36]Jan A. Bergstra, Alban Ponse, Jos van Wamel:
Process Algebra with Backtracking. REX School/Symposium 1993: 46-91 - 1992
- [c35]Jos C. M. Baeten, Jan A. Bergstra:
Discrete Time Process Algebra. CONCUR 1992: 401-420 - [c34]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485 - [c33]Jos C. M. Baeten, Jan A. Bergstra:
Asynchronous Communication in Real Space Process Algebra. FTRTFT 1992: 473-492 - 1991
- [j47]Jos C. M. Baeten, Jan A. Bergstra:
Real Time Process Algebra. Formal Aspects Comput. 3(2): 142-188 (1991) - [j46]Jan A. Bergstra, Sjouke Mauw, Freek Wiedijk:
Uniform Algebraic Specifications of Finite Sets with Equality. Int. J. Found. Comput. Sci. 2(1): 43-65 (1991) - [j45]Jos C. M. Baeten, Jan A. Bergstra:
Recursive Process Definitions with the State Operator. Theor. Comput. Sci. 82(2): 285-302 (1991) - [c32]Jos C. M. Baeten, Jan A. Bergstra:
Real Space Process Algebra. CONCUR 1991: 96-110 - [c31]Jos C. M. Baeten, Jan A. Bergstra:
The State Operator in Real Time Process Algebra. REX Workshop 1991: 107-123 - [e2]Jan A. Bergstra, Loe M. G. Feijs:
Algebraic Methods II: Theory, Tools and Applications [papers from a workshop in Mierlo, The Netherlands, September 1989]. Lecture Notes in Computer Science 490, Springer 1991, ISBN 3-540-53912-3 [contents] - 1990
- [j44]Jan A. Bergstra, Jan Heering, Paul Klint:
Module Algebra. J. ACM 37(2): 335-372 (1990) - [c30]Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with a Zero Object. CONCUR 1990: 83-98
1980 – 1989
- 1989
- [j43]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland:
Term-Rewriting Systems with Rule Priorities. Theor. Comput. Sci. 67(2&3): 283-301 (1989) - [c29]Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink:
A Process Specification Formalism Based on Static COLD. Algebraic Methods 1989: 303-335 - [c28]Jos C. M. Baeten, Jan A. Bergstra:
Design of a Specification Language by Abstract Syntax Engineering. Algebraic Methods 1989: 363-394 - [e1]Martin Wirsing, Jan A. Bergstra:
Algebraic Methods: Theory, Tools and Applications [papers from a workshop in Passau, Germany, June 9-11, 1987]. Lecture Notes in Computer Science 394, Springer 1989, ISBN 3-540-51698-0 [contents] - 1988
- [j42]Jos C. M. Baeten, Jan A. Bergstra:
Global Renaming Operators in Concrete Process Algebra. Inf. Comput. 78(3): 205-245 (1988) - [j41]Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog:
Readies and Failures in the Algebra of Communicating Processes. SIAM J. Comput. 17(6): 1134-1177 (1988) - [c27]Jan A. Bergstra:
ACP with Signals. ALP 1988: 11-20 - [c26]Jan A. Bergstra, Jan Willem Klop:
Process theory based on bisimulation semantics. REX Workshop 1988: 50-122 - 1987
- [j40]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. Comput. J. 30(6): 498-506 (1987) - [j39]Jan A. Bergstra, John V. Tucker:
Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987) - [j38]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
On the Consistency of Koomen's Fair Abstraction Rule. Theor. Comput. Sci. 51: 129-176 (1987) - [c25]Jan A. Bergstra, Jan Willem Klop:
ACTtau: A Universal Axiom System for Process Specification. Algebraic Methods 1987: 447-463 - [c24]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts 1987: 53-76 - [c23]Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog:
Failures without chaos: a new process semantics for fair abstraction. Formal Description of Programming Concepts 1987: 77-104 - [c22]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) 1987: 94-111 - [c21]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Term Rewriting Systems with Priorities. RTA 1987: 83-94 - 1986
- [j37]Jan A. Bergstra, Jan Willem Klop:
Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. 32(3): 323-362 (1986) - 1985
- [j36]Jan A. Bergstra, John V. Tucker:
Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985) - [j35]Jan A. Bergstra, Jan Willem Klop:
Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. 37: 77-121 (1985) - [c20]Jan A. Bergstra, Jan Willem Klop:
Verification of an alternating bit protocol by means of process algebra. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 9-23 - 1984
- [j34]Jan A. Bergstra, John V. Tucker:
The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Informatica 21: 293-320 (1984) - [j33]Jan A. Bergstra, John-Jules Ch. Meyer:
On Specifying Sets of Integers. J. Inf. Process. Cybern. 20(10/11): 531-541 (1984) - [j32]Jan A. Bergstra, Jan Willem Klop:
Process Algebra for Synchronous Communication. Inf. Control. 60(1-3): 109-137 (1984) - [j31]Jan A. Bergstra, John V. Tucker:
Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984) - [j30]Jan A. Bergstra, Jan Willem Klop:
Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. 30: 1-48 (1984) - [j29]J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer:
Linear Time and Branching Time Semantics for Recursion with Merge. Theor. Comput. Sci. 34: 135-156 (1984) - [c19]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95 - [c18]Jan A. Bergstra, Jan Willem Klop:
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94 - 1983
- [j28]Jan A. Bergstra, J. Terlouw:
Standard Model Semantics for DSL A Data Type Specification Language. Acta Informatica 19: 97-113 (1983) - [j27]Jan A. Bergstra, Jan Willem Klop:
Initial Algebra Specifications for Parametrized Data Types. J. Inf. Process. Cybern. 19(1/2): 17-31 (1983) - [j26]Jan A. Bergstra, Jan Willem Klop:
A proof rule for restoring logic circuits. Integr. 1(2-3): 161-178 (1983) - [j25]Jan A. Bergstra, John V. Tucker:
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. SIAM J. Comput. 12(2): 366-387 (1983) - [j24]Jan A. Bergstra, John V. Tucker:
Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983) - [c17]J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer:
Linear Time and Branching Time Semantics for Recursion with Merge. ICALP 1983: 39-51 - [c16]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Algebraic Tools for System Construction. Logic of Programs 1983: 34-44 - [c15]Jan A. Bergstra, Jerzy Tiuryn:
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness. Logic of Programs 1983: 45-56 - 1982
- [j23]Jan A. Bergstra, Jan Willem Klop:
Strong Normalization and Perpetual Reductions in the Lambda Calculus. J. Inf. Process. Cybern. 18(7/8): 403-417 (1982) - [j22]Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn:
Another Incompleteness Result for Hoare's Logic. Inf. Control. 52(2): 159-171 (1982) - [j21]Jan A. Bergstra, John V. Tucker:
The Completeness of the Algebraic Specification Methods for Computable Data Types. Inf. Control. 54(3): 186-200 (1982) - [j20]Jan A. Bergstra, John-Jules Ch. Meyer:
A Simple Transfer Lemma for Algebraic Specifications. Inf. Process. Lett. 14(2): 80-85 (1982) - [j19]Jan A. Bergstra, John V. Tucker:
Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982) - [j18]Jan A. Bergstra, John V. Tucker:
Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982) - [j17]Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker:
Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982) - [j16]Jan A. Bergstra, John V. Tucker:
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. Theor. Comput. Sci. 17: 303-315 (1982) - [j15]Jan A. Bergstra, John-Jules Ch. Meyer:
On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic. Theor. Comput. Sci. 21: 269-279 (1982) - [c14]Jan A. Bergstra:
Specification of Parameterized Data Types. ADT 1982 - [c13]Jan A. Bergstra, Jan Willem Klop:
Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP 1982: 23-34 - [c12]Jan A. Bergstra, Jan Willem Klop:
Formal Proof Systems for Program Equivalence. Formal Description of Programming Concepts 1982: 289-304 - [c11]Jan A. Bergstra, Jan Willem Klop:
A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36 - 1981
- [j14]Jan A. Bergstra, Jerzy Tiuryn:
Logic of effective definitions. Fundam. Informaticae 4(3): 661-674 (1981) - [j13]Jan A. Bergstra, Jerzy Tiuryn:
Algorithmic degrees of algebraic structures. Fundam. Informaticae 4(4): 851-862 (1981) - [j12]Jan A. Bergstra, John-Jules Ch. Meyer:
On the quantifier-free fragment of 'Logic of effective definitions'. Fundam. Informaticae 4(4): 935-956 (1981) - [j11]Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations. Fundam. Informaticae 4(4): 997-1014 (1981) - [j10]Jan A. Bergstra, John-Jules Ch. Meyer:
I/O-computable data structures. ACM SIGPLAN Notices 16(4): 27-32 (1981) - [c10]Jan A. Bergstra, J. Terlouw:
A Characterization of Program Equivalence in Terms of Hoare's Logic. GI Jahrestagung 1981: 72-77 - [c9]Jan A. Bergstra, John V. Tucker:
Algebraically Specified Programming Systems and Hoare's Logic. ICALP 1981: 348-362 - [c8]Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn:
Hoare's Logic is Incomplete When It Does Not Have To Be. Logic of Programs 1981: 9-23 - [c7]Jan A. Bergstra, John V. Tucker:
The Refinement of Specifications and the Stabiliy of Hoare's Logic. Logic of Programs 1981: 24-36 - [c6]Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing:
On the Power of Algebraic Specifications. MFCS 1981: 193-204 - 1980
- [j9]Jan A. Bergstra:
Discourse between processes. Notre Dame J. Formal Log. 21(1): 131-134 (1980) - [j8]Jan A. Bergstra, Jan Willem Klop:
Invertible Terms in the Lambda Calculus. Theor. Comput. Sci. 11: 19-37 (1980) - [c5]Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations. CLAAP 1980: 1-10 - [c4]Jan A. Bergstra, John V. Tucker:
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90
1970 – 1979
- 1979
- [j7]Jan A. Bergstra:
Effective Transformations on Probabilistic Data. Math. Log. Q. 25(13-18): 219-226 (1979) - [j6]Jan A. Bergstra, John V. Tucker:
On the adequacy of finite equational methods for data type specification. ACM SIGPLAN Notices 14(11): 13-18 (1979) - [j5]Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens:
Recursive Assertions are not enough - or are they? Theor. Comput. Sci. 8: 73-87 (1979) - [j4]Jan A. Bergstra, Jan Willem Klop:
Church-Rosser Strategies in the Lambda Calculus. Theor. Comput. Sci. 9: 27-38 (1979) - [c3]Jan A. Bergstra, Jerzy Tiuryn:
Implicit definability of algebraic structures by means of program properties. FCT 1979: 58-63 - 1978
- [j3]Jan A. Bergstra:
What is an Abstract Datatype? Inf. Process. Lett. 7(1): 42-43 (1978) - [j2]Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken:
Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978) - [j1]Jan A. Bergstra:
Degrees of partial functions. Notre Dame J. Formal Log. 19(1): 152-154 (1978) - [c2]Jan A. Bergstra:
Decision Problems Concerning Parallel Programming. MFCS 1978: 134-142 - 1977
- [c1]Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide:
An Axiomatization of the Rational Data Objects. FCT 1977: 33-38
Coauthor Index
Kees Middelburg
aka: Cornelis A. Middelburg
aka: Cornelis A. Middelburg
[i110] [j163] [j156] [j153] [j152] [i105] [i103] [j151] [j150] [i102] [i101] [j148] [j147] [i99] [i98] [j146] [j145] [j144] [j143] [j142] [j141] [j139] [i94] [i90] [i88] [j137] [i85] [i84] [i82] [i81] [i78] [j133] [j131] [j130] [i77] [i76] [i72] [i70] [i69] [b1] [j128] [j127] [j126] [j125] [i67] [i65] [j123] [j122] [j121] [i59] [j116] [j115] [j114] [j113] [i52] [j112] [j110] [c64] [i45] [i44] [i42] [i40] [i39] [i37] [i36] [i35] [i34] [i32] [i31] [i30] [i29] [j107] [j106] [j105] [j104] [i27] [i26] [i24] [i21] [i19] [i17] [i15] [i12] [j101] [j100] [j99] [j98] [j97] [j94] [j93] [i8] [i7] [i6] [i5] [i4] [i3] [i2] [j90] [j89] [j88] [c60] [j85] [c59] [c58] [c57] [j83] [p1] [j67] [j60]
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 20:29 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:
