dblp.uni-trier.dewww.uni-trier.de

Jan A. Bergstra Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
198EEJan A. Bergstra, C. A. Middelburg: Transmission Protocols for Instruction Streams. ICTAC 2009: 127-139
197EEJan A. Bergstra, C. A. Middelburg: Machine structure oriented control code logic. Acta Inf. 46(5): 375-401 (2009)
196EEJan A. Bergstra, C. A. Middelburg: Timed tuplix calculus and the Wesseling and van den Berg equation CoRR abs/0901.3003: (2009)
195EEJan A. Bergstra, C. A. Middelburg: Meadow Enriched ACP Process Algebras CoRR abs/0901.3012: (2009)
194EEJan A. Bergstra, Inge Bethke: Square root meadows CoRR abs/0901.4664: (2009)
193EEJan A. Bergstra, C. A. Middelburg: Transmission protocols for instruction streams CoRR abs/0902.2859: (2009)
192EEJan A. Bergstra, Alban Ponse: An Instruction Sequence Semigroup with Involutive Anti-Automorphisms CoRR abs/0903.1352: (2009)
191EEJan A. Bergstra, C. A. Middelburg: A process calculus with finitary comprehended terms CoRR abs/0903.2914: (2009)
190EEJan A. Bergstra, C. A. Middelburg: A protocol for instruction stream processing CoRR abs/0905.2257: (2009)
189EEJan A. Bergstra, Inge Bethke: Straight-line instruction sequence completeness for total calculation on cancellation meadows CoRR abs/0905.4612: (2009)
188EEJan A. Bergstra, C. A. Middelburg: Instruction sequence notations with probabilistic instructions CoRR abs/0906.3083: (2009)
187EEJan A. Bergstra, C. A. Middelburg: Arithmetical meadows CoRR abs/0909.2088: (2009)
186EEJan A. Bergstra, C. A. Middelburg: Indirect jumps improve instruction sequence performance CoRR abs/0909.2089: (2009)
185EEJan A. Bergstra, Alban Ponse: A progression ring for interfaces of instruction sequences, threads, and services CoRR abs/0909.2839: (2009)
184EEJan A. Bergstra, C. A. Middelburg: Instruction sequence processing operators CoRR abs/0910.5564: (2009)
183EEJan A. Bergstra, Yoram Hirshfeld, J. V. Tucker: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009)
2008
182EEJan A. Bergstra, Yoram Hirshfeld, John Tucker: Fields, Meadows and Abstract Data Types. Pillars of Computer Science 2008: 166-178
181EEJan A. Bergstra, C. A. Middelburg: Programming an interpreter using molecular dynamics CoRR abs/0801.2226: (2008)
180EEJan A. Bergstra, Kees Middelburg: Thread extraction for polyadic instruction sequences CoRR abs/0802.1578: (2008)
179EEJan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag: Towards a formalization of budgets CoRR abs/0802.3617: (2008)
178EEJan A. Bergstra, C. A. Middelburg: Thread algebra for sequential poly-threading CoRR abs/0803.0378: (2008)
177EEJan A. Bergstra, C. A. Middelburg: Data linkage algebra, data linkage dynamics, and priority rewriting CoRR abs/0804.4565: (2008)
176EEJan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag: Tuplix Calculus Specifications of Financial Transfer Networks CoRR abs/0805.1806: (2008)
175EEJan A. Bergstra, C. A. Middelburg: Data linkage dynamics with shedding CoRR abs/0806.4034: (2008)
174EEJan A. Bergstra, Alban Ponse: Proposition Algebra with Projective Limits CoRR abs/0807.3648: (2008)
173EEJan A. Bergstra, C. A. Middelburg: Instruction sequences and non-uniform complexity theory CoRR abs/0809.0352: (2008)
172EEJan A. Bergstra, Mark van der Zwaag: Mechanistic Behavior of Single-Pass Instruction Sequences CoRR abs/0809.4635: (2008)
171EEJan A. Bergstra, C. A. Middelburg: On the expressiveness of single-pass instruction sequences CoRR abs/0810.1106: (2008)
170EEJan A. Bergstra, Alban Ponse: An Instruction Sequence Semigroup with Repeaters CoRR abs/0810.1151: (2008)
169EEJan A. Bergstra, Mark Burgess: A static theory of promises CoRR abs/0810.3294: (2008)
168EEJan A. Bergstra, C. A. Middelburg: Instruction sequences for the production of processes CoRR abs/0811.0436: (2008)
167EEJan A. Bergstra, C. A. Middelburg: Parallel Processes with Implicit Computational Capital. Electr. Notes Theor. Comput. Sci. 209: 55-81 (2008)
166EEJan A. Bergstra, C. A. Middelburg: Distributed strategic interleaving with load balancing. Future Generation Comp. Syst. 24(6): 530-548 (2008)
165EEJan A. Bergstra, C. A. Middelburg: Simulating Turing machines on Maurer machines. J. Applied Logic 6(1): 1-23 (2008)
164EEJan A. Bergstra, C. A. Middelburg: Program algebra with a jump-shift instruction. J. Applied Logic 6(4): 553-563 (2008)
163EEJan A. Bergstra, C. A. Middelburg: Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science 18(2): 373-409 (2008)
2007
162EEJan A. Bergstra, Inge Bethke, Alban Ponse: Decision problems for pushdown threads. Acta Inf. 44(2): 75-90 (2007)
161EEJan A. Bergstra, C. A. Middelburg: Synchronous cooperation for explicit multi-threading. Acta Inf. 44(7-8): 525-569 (2007)
160EEJan A. Bergstra, Inge Bethke, Mark Burgess: A process algebra based framework for promise theory CoRR abs/0707.0744: (2007)
159EEJan A. Bergstra, Alban Ponse: Projection semantics for rigid loops CoRR abs/0707.1059: (2007)
158EEJan A. Bergstra, Alban Ponse: Interface groups and financial transfer architectures CoRR abs/0707.1639: (2007)
157EEJan A. Bergstra, C. A. Middelburg: Instruction sequences with indirect jumps CoRR abs/0711.0829: (2007)
156EEJan A. Bergstra, C. A. Middelburg: An interface group for process components CoRR abs/0711.0834: (2007)
155EEJan A. Bergstra, C. A. Middelburg: Machine structure oriented control code logic CoRR abs/0711.0836: (2007)
154EEJan A. Bergstra, C. A. Middelburg: On the operating unit size of load/store architectures CoRR abs/0711.0838: (2007)
153EEJan A. Bergstra, C. A. Middelburg: A thread calculus with molecular dynamics CoRR abs/0711.0840: (2007)
152EEJan A. Bergstra, C. A. Middelburg: Instruction Sequences with Dynamically Instantiated Instructions CoRR abs/0711.4217: (2007)
151EEJan A. Bergstra, C. A. Middelburg: Program algebra with a jump-shift instruction CoRR abs/0712.1658: (2007)
150EEJan A. Bergstra, Alban Ponse, Mark van der Zwaag: Tuplix Calculus CoRR abs/0712.3423: (2007)
149EEJan A. Bergstra, C. A. Middelburg: Thread algebra for strategic interleaving. Formal Asp. Comput. 19(4): 445-474 (2007)
148EEJan A. Bergstra, C. A. Middelburg: Maurer Computers with Single-Thread Control. Fundam. Inform. 80(4): 333-362 (2007)
147EEJan A. Bergstra, J. V. Tucker: The rational numbers as an abstract data type. J. ACM 54(2): (2007)
146EEJan A. Bergstra, Alban Ponse: Execution architectures for program algebra. J. Applied Logic 5(1): 170-192 (2007)
145EEJan A. Bergstra, C. A. Middelburg: Preferential choice and coordination conditions. J. Log. Algebr. Program. 70(2): 172-200 (2007)
144EEJan A. Bergstra, Paul Klint: About "trivial" software patents: The IsNot case. Sci. Comput. Program. 64(3): 264-285 (2007)
143EEJan A. Bergstra: Letter from the editor. Sci. Comput. Program. 65(1): (2007)
142EEJan A. Bergstra, C. A. Middelburg: A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. 41(1): 3-32 (2007)
2006
141EEJan A. Bergstra: Elementary Algebraic Specifications of the Rational Function Field. CiE 2006: 40-54
140EEJan A. Bergstra, John V. Tucker: Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475
139EEJos C. M. Baeten, Jan A. Bergstra: Six Themes for Future Concurrency Research. Electr. Notes Theor. Comput. Sci. 162: 61-64 (2006)
138EEJan A. Bergstra: On the Design Rationale of ACP Style Process Algebras. Electr. Notes Theor. Comput. Sci. 162: 79-85 (2006)
137EEJan A. Bergstra, C. A. Middelburg: Thread Algebra with Multi-Level Strategies. Fundam. Inform. 71(2-3): 153-182 (2006)
136EEJan A. Bergstra, C. A. Middelburg: Splitting bisimulations and retrospective conditions. Inf. Comput. 204(7): 1083-1138 (2006)
135EEJan A. Bergstra, C. A. Middelburg: Continuity controlled hybrid automata. J. Log. Algebr. Program. 68(1-2): 5-53 (2006)
2005
134EEJan A. Bergstra, C. A. Middelburg: Strong Splitting Bisimulation Equivalence. CALCO 2005: 83-97
133EEJan A. Bergstra, C. A. Middelburg: A Thread Algebra with Multi-level Strategic Interleaving. CiE 2005: 35-48
132EEJan A. Bergstra, Alban Ponse: A Bypass of Cohen's Impossibility Result. EGC 2005: 1097-1106
131EEJan A. Bergstra, C. A. Middelburg: Model Theory for Process Algebra. Processes, Terms and Cycles 2005: 445-495
130EEJan A. Bergstra, Inge Bethke: An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94(6): 267-269 (2005)
129EEJan A. Bergstra, Inge Bethke: Network algebra in Java. J. Log. Algebr. Program. 62(2): 247-271 (2005)
128EEJan A. Bergstra, C. A. Middelburg: Process algebra for hybrid systems. Theor. Comput. Sci. 335(2-3): 215-280 (2005)
127EEJan A. Bergstra, Inge Bethke: Polarized process algebra with reactive composition. Theor. Comput. Sci. 343(3): 285-304 (2005)
2004
126EEJan A. Bergstra, C. A. Middelburg: Located Actions in Process Algebra with Timing. Fundam. Inform. 61(3-4): 183-211 (2004)
2003
125EEJan A. Bergstra: Machine Function Based Control Code Algebras. FMCO 2003: 17-41
124EEJan A. Bergstra, Inge Bethke: Polarized Process Algebra and Program Equivalence. ICALP 2003: 1-21
123EEJan A. Bergstra, Pum Walters: Operator programs and operator processes. Information & Software Technology 45(10): 681-689 (2003)
122EEJan A. Bergstra, Alban Ponse, Mark van der Zwaag: Branching time and orthogonal bisimulation equivalence. Theor. Comput. Sci. 309(1-3): 313-355 (2003)
2002
121 Jan A. Bergstra: Molecule-oriented programming in Java. Information & Software Technology 44(11): 617-638 (2002)
120EEJan A. Bergstra, M. E. Loots: Program algebra for sequential code. J. Log. Algebr. Program. 51(2): 125-156 (2002)
119EEJan A. Bergstra, Alban Ponse: Combining programs and state machines. J. Log. Algebr. Program. 51(2): 175-192 (2002)
118EEJan A. Bergstra, Inge Bethke: Molecular dynamics. J. Log. Algebr. Program. 51(2): 193-214 (2002)
2001
117EEJan A. Bergstra, Alban Ponse: Process algebra and conditional composition. Inf. Process. Lett. 80(1): 41-49 (2001)
116EEJan A. Bergstra, Alban Ponse: Register-machine based processes. J. ACM 48(6): 1207-1241 (2001)
115EEJan A. Bergstra, Alban Ponse: Non-regular iterators in process algebra. Theor. Comput. Sci. 269(1-2): 203-229 (2001)
2000
114 Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers: Discrete time process algebra with silent step. Proof, Language, and Interaction 2000: 535-570
113EEJan A. Bergstra, M. E. Loots: Program Algebra for Component Code. Formal Asp. Comput. 12(1): 1-17 (2000)
112 Jan A. Bergstra, Alban Ponse: Process Algebra with Four-Valued Logic. Journal of Applied Non-Classical Logics 10(1): (2000)
1998
111EEJan A. Bergstra, Alban Ponse: Grid Protocol Specifications. Prospects for Hardware Foundations 1998: 278-308
110EEJos C. M. Baeten, Jan A. Bergstra: Deadlock Behaviour in Split and ST Bisimulation Semantics. Electr. Notes Theor. Comput. Sci. 16(2): (1998)
109EEJan A. Bergstra, Alban Ponse: Kleene's Three-Valued Logic and Process Algebra. Inf. Process. Lett. 67(2): 95-103 (1998)
108 Jan A. Bergstra, Alban Ponse: Bochvar-McCarthy Logic and Process Algebra. Notre Dame Journal of Formal Logic 39(4): 464-484 (1998)
107 Jan A. Bergstra, Paul Klint: The Discrete Time TOOLBUS - A Software Coordination Architecture. Sci. Comput. Program. 31(2-3): 205-229 (1998)
1997
106EEJos C. M. Baeten, Jan A. Bergstra: Bounded Stacks, Bags and Queues. CONCUR 1997: 104-118
105 Jan A. Bergstra, Wiet Bouma: Models for Feature Descriptions and Interactions. FIW 1997: 31-45
104EEJan 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)
103 Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. Fundam. Inform. 29(1-2): 51-76 (1997)
102 Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse: Grid Protocols Based on Synchronous Communication. Sci. Comput. Program. 29(1-2): 199-233 (1997)
101EEJos C. M. Baeten, Jan A. Bergstra: Process Algebra with Propositional Signals. Theor. Comput. Sci. 177(2): 381-405 (1997)
1996
100 Jan A. Bergstra, Paul Klint: The Discrete Time TOOLBUS. AMAST 1996: 286-305
99 Jan A. Bergstra, Paul Klint: The TOOLBUS Coordination Architecture. COORDINATION 1996: 75-88
98EEJan A. Bergstra, T. B. Dinesh, John Field, Jan Heering: A Complete Transformational Toolkit for Compilers. ESOP 1996: 92-107
97 Jos C. M. Baeten, Jan A. Bergstra: Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. 28(4es): 39 (1996)
96 Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra. Formal Asp. Comput. 8(2): 188-208 (1996)
95 Jan A. Bergstra, Gheorghe Stefanescu: Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. Fundam. Inform. 27(1): 37-56 (1996)
1995
94 Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra with Abstraction. FCT 1995: 1-15
93 Jan A. Bergstra, Gheorghe Stefanescu: Processes with Multiple Entries and Exits. FCT 1995: 136-145
92 Jan A. Bergstra, J. V. Tucker: A Data Type Variety of Stack Algebras. Ann. Pure Appl. Logic 73(1): 11-36 (1995)
91 Jan A. Bergstra, Jan Heering: Homomorphism Preserving Algebraic Specifications Require Hidden Sorts Inf. Comput. 119(1): 119-123 (1995)
90 Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities Inf. Comput. 121(2): 234-255 (1995)
89EEJan A. Bergstra, J. V. Tucker: Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995)
88 Jan A. Bergstra, Inge Bethke, Piet Rodenburg: A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics 5(2): (1995)
1994
87EEJos C. M. Baeten, Jan A. Bergstra: Process Algebra with Partial Choice. CONCUR 1994: 465-480
86 Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol: A Real Time Process Logic. ICTL 1994: 30-47
85 Jan A. Bergstra, Inge Bethke, Alban Ponse: Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994)
84 Jos C. M. Baeten, Jan A. Bergstra: On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Asp. Comput. 6(3): 250-268 (1994)
83 Jan A. Bergstra, Gheorghe Stefanescu: Bisimulation is Two-Way Simulation. Inf. Process. Lett. 52(6): 285-287 (1994)
82 Johan van Benthem, Jan A. Bergstra: Logic of Transition Systems. Journal of Logic, Language and Information 3(4): 247-283 (1994)
81 Jan A. Bergstra, Jan Heering: Which Data Types have omega-complete Initial Algebra Specifications? Theor. Comput. Sci. 124(1): 149-168 (1994)
1993
80EEJos C. M. Baeten, Jan A. Bergstra: Non Interleaving Process Algebra. CONCUR 1993: 308-323
79EEJan A. Bergstra, Inge Bethke, Alban Ponse: Process Algebra with Combinators. CSL 1993: 36-65
78 Jan A. Bergstra, Gheorghe Stefanescu: Translations Between Flowchart Schemes and Process Graphs. FCT 1993: 152-161
77EEJan A. Bergstra, Alban Ponse, Jos van Wamel: Process Algebra with Backtracking. REX School/Symposium 1993: 46-91
76EEJos 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)
1992
75EEJos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra. CONCUR 1992: 401-420
74EEJos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485
73 Jos C. M. Baeten, Jan A. Bergstra: Asynchronous Communication in Real Space Process Algebra. FTRTFT 1992: 473-492
1991
72 Jan A. Bergstra, Loe M. G. Feijs: Algebraic Methods II: Theory, Tools and Applications [papers from a workshop in Mierlo, The Netherlands, September 1989] Springer 1991
71EEJos C. M. Baeten, Jan A. Bergstra: Real Space Process Algebra. CONCUR 1991: 96-110
70EEJos C. M. Baeten, Jan A. Bergstra: The State Operator in Real Time Process Algebra. REX Workshop 1991: 107-123
69 Jos C. M. Baeten, Jan A. Bergstra: Real Time Process Algebra. Formal Asp. Comput. 3(2): 142-188 (1991)
68 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)
67 Jos C. M. Baeten, Jan A. Bergstra: Recursive Process Definitions with the State Operator. Theor. Comput. Sci. 82(2): 285-302 (1991)
1990
66EEJos C. M. Baeten, Jan A. Bergstra: Process Algebra with a Zero Object. CONCUR 1990: 83-98
65EEJan A. Bergstra, Jan Heering, Paul Klint: Module Algebra J. ACM 37(2): 335-372 (1990)
1989
64 Martin Wirsing, Jan A. Bergstra: Algebraic Methods: Theory, Tools and Applications [papers from a workshop in Passau, Germany, June 9-11, 1987] Springer 1989
63EEJos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink: A Process Specification Formalism Based on Static COLD. Algebraic Methods 1989: 303-335
62EEJos C. M. Baeten, Jan A. Bergstra: Design of a Specification Language by Abstract Syntax Engineering. Algebraic Methods 1989: 363-394
61 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)
1988
60EEJan A. Bergstra: ACP with Signals. ALP 1988: 11-20
59EEJan A. Bergstra, Jan Willem Klop: Process theory based on bisimulation semantics. REX Workshop 1988: 50-122
58 Jos C. M. Baeten, Jan A. Bergstra: Global Renaming Operators in Concrete Process Algebra Inf. Comput. 78(3): 205-245 (1988)
57 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)
1987
56EEJan A. Bergstra, Jan Willem Klop: ACTtau: A Universal Axiom System for Process Specification. Algebraic Methods 1987: 447-463
55EEJos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) 1987: 94-111
54EEJos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Term Rewriting Systems with Priorities. RTA 1987: 83-94
53 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)
52 Jan A. Bergstra, J. V. Tucker: Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987)
51 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)
1986
50 Jan A. Bergstra, Jan Willem Klop: Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. 32(3): 323-362 (1986)
1985
49 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
48 Jan A. Bergstra, J. V. Tucker: Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985)
47 Jan A. Bergstra, Jan Willem Klop: Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. 37: 77-121 (1985)
1984
46EEJan A. Bergstra, Jan Willem Klop: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94
45EEJan A. Bergstra, Jan Willem Klop, J. V. Tucker: Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95
44 Jan A. Bergstra, J. V. Tucker: The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Inf. 21: 293-320 (1984)
43 Jan A. Bergstra, John-Jules Ch. Meyer: On Specifying Sets of Integers. Elektronische Informationsverarbeitung und Kybernetik 20(10/11): 531-541 (1984)
42 Jan A. Bergstra, Jan Willem Klop: Process Algebra for Synchronous Communication Information and Control 60(1-3): 109-137 (1984)
41 Jan A. Bergstra, J. V. Tucker: Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984)
40 Jan A. Bergstra, Jan Willem Klop: Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. 30: 1-48 (1984)
39 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)
1983
38EEJ. 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
37 Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Algebraic Tools for System Construction. Logic of Programs 1983: 34-44
36 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
35 Jan A. Bergstra, J. Terlouw: Standard Model Semantics for DSL A Data Type Specification Language. Acta Inf. 19: 97-113 (1983)
34 Jan A. Bergstra, Jan Willem Klop: Initial Algebra Specifications for Parametrized Data Types. Elektronische Informationsverarbeitung und Kybernetik 19(1/2): 17-31 (1983)
33 Jan A. Bergstra, J. V. Tucker: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. SIAM J. Comput. 12(2): 366-387 (1983)
32 Jan A. Bergstra, J. V. Tucker: Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983)
1982
31 Jan A. Bergstra: Specification of Parameterized Data Types. ADT 1982
30EEJan A. Bergstra, Jan Willem Klop: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP 1982: 23-34
29 Jan A. Bergstra, Jan Willem Klop: A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36
28 Jan A. Bergstra, Jan Willem Klop: Strong Normalization and Perpetual Reductions in the Lambda Calculus. Elektronische Informationsverarbeitung und Kybernetik 18(7/8): 403-417 (1982)
27 Jan A. Bergstra, John-Jules Ch. Meyer: A Simple Transfer Lemma for Algebraic Specifications. Inf. Process. Lett. 14(2): 80-85 (1982)
26 Jan A. Bergstra, J. V. Tucker: Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982)
25 Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn: Another Incompleteness Result for Hoare's Logic Information and Control 52(2): 159-171 (1982)
24 Jan A. Bergstra, J. V. Tucker: The Completeness of the Algebraic Specification Methods for Computable Data Types Information and Control 54(3): 186-200 (1982)
23 Jan A. Bergstra, J. V. Tucker: Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982)
22 Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker: Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982)
21 Jan A. Bergstra, J. 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)
20 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)
1981
19 Jan A. Bergstra, J. Terlouw: A Characterization of Program Equivalence in Terms of Hoare's Logic. GI Jahrestagung 1981: 72-77
18EEJan A. Bergstra, J. V. Tucker: Algebraically Specified Programming Systems and Hoare's Logic. ICALP 1981: 348-362
17 Jan A. Bergstra, J. V. Tucker: The Refinement of Specifications and the Stabiliy of Hoare's Logic. Logic of Programs 1981: 24-36
16 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
15EEJan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing: On the Power of Algebraic Specifications. MFCS 1981: 193-204
14 Jan A. Bergstra, Jerzy Tiuryn: Logic of effective definitions. Fundam. Inform. 4(3): 661-674 (1981)
13 Jan A. Bergstra, Jerzy Tiuryn: Algorithmic degrees of algebraic structures. Fundam. Inform. 4(4): 851-862 (1981)
12 Jan A. Bergstra, John-Jules Ch. Meyer: On the quantifier-free fragment of 'Logic of effective definitions'. Fundam. Inform. 4(4): 935-956 (1981)
11 Jan A. Bergstra, Jerzy Tiuryn: Regular extensions of iterative algebras and metric interpretations. Fundam. Inform. 4(4): 997-1014 (1981)
1980
10 Jan A. Bergstra, Jerzy Tiuryn: Regular extensions of iterative algebras and metric interpretations. CLAAP 1980: 1-10
9EEJan A. Bergstra, J. V. Tucker: A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90
8 Jan A. Bergstra, Jan Willem Klop: Invertible Terms in the Lambda Calculus. Theor. Comput. Sci. 11: 19-37 (1980)
1979
7 Jan A. Bergstra, Jerzy Tiuryn: Implicit definability of algebraic structures by means of program properties. FCT 1979: 58-63
6 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)
5 Jan A. Bergstra, Jan Willem Klop: Church-Rosser Strategies in the Lambda Calculus. Theor. Comput. Sci. 9: 27-38 (1979)
1978
4EEJan A. Bergstra: Decision Problems Concerning Parallel Programming. MFCS 1978: 134-142
3 Jan A. Bergstra: What is an Abstract Datatype? Inf. Process. Lett. 7(1): 42-43 (1978)
2 Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken: Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978)
1977
1 Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide: An Axiomatization of the Rational Data Objects. FCT 1977: 33-38

Coauthor Index

1Krzysztof R. Apt [6]
2Jos C. M. Baeten [51] [53] [54] [55] [58] [61] [62] [63] [66] [67] [69] [70] [71] [73] [74] [75] [76] [80] [84] [86] [87] [90] [94] [96] [97] [101] [103] [106] [110] [114] [139]
3J. W. de Bakker (Jaco de Bakker) [38] [39]
4Hendrik Pieter Barendregt (Henk Barendregt) [2]
5Johan van Benthem [82]
6Inge Bethke [79] [85] [88] [118] [124] [127] [129] [130] [160] [162] [189] [194]
7Roland N. Bol [86]
8Wiet Bouma (L. G. Bouma) [105]
9Manfred Broy [15]
10Mark Burgess [160] [169]
11Anna Chmielinska [16] [25]
12T. B. Dinesh [98] [104]
13Loe M. G. Feijs [72]
14John Field [98] [104]
15Jan Heering [65] [81] [91] [98] [104]
16Joris A. Hillebrand [102]
17Yoram Hirshfeld [182] [183]
18Paul Klint [65] [99] [100] [107] [144]
19Jan Willem Klop [2] [5] [8] [28] [29] [30] [34] [37] [38] [39] [40] [42] [45] [46] [47] [49] [50] [51] [53] [54] [55] [56] [57] [59] [61] [76]
20M. E. Loots [113] [120]
21Sjouke Mauw [63] [68]
22Lambert G. L. T. Meertens [6]
23John-Jules Ch. Meyer [12] [20] [27] [38] [39] [43]
24Kees Middelburg (C. A. Middelburg) [126] [128] [131] [133] [134] [135] [136] [137] [142] [145] [148] [149] [151] [152] [153] [154] [155] [156] [157] [161] [163] [164] [165] [166] [167] [168] [171] [173] [175] [177] [178] [180] [181] [184] [186] [187] [188] [190] [191] [193] [195] [196] [197] [198]
25Ernst-Rüdiger Olderog [57]
26Alexander Ollongren [1]
27Alban Ponse [77] [79] [85] [102] [108] [109] [111] [112] [115] [116] [117] [119] [122] [132] [146] [150] [158] [159] [162] [170] [174] [185] [192]
28Michel A. Reniers [114]
29Piet Rodenburg [88]
30Scott A. Smolka [74] [90]
31Gheorghe Stefanescu [78] [83] [93] [95]
32J. Terlouw [19] [35]
33Jerzy Tiuryn [7] [10] [11] [13] [14] [16] [22] [25] [36]
34Sanne Nolst Trenité [176] [179]
35J. V. Tucker (John V. Tucker) [9] [15] [17] [18] [21] [22] [23] [24] [26] [32] [33] [37] [41] [44] [45] [48] [52] [89] [92] [140] [147] [183]
36John Tucker [182]
37Gert J. Veltink [63]
38Henri Volken [2]
39Pum Walters [123]
40Jos van Wamel [77]
41Theo P. van der Weide [1]
42W. P. Weijland [61]
43Freek Wiedijk [68]
44Martin Wirsing [15] [64]
45Mark van der Zwaag [122] [150] [172] [176] [179]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)