| 2009 |
|---|
| 189 | EE | Jan A. Bergstra,
C. A. Middelburg:
Timed tuplix calculus and the Wesseling and van den Berg equation
CoRR abs/0901.3003: (2009) |
| 188 | EE | Jan A. Bergstra,
C. A. Middelburg:
Meadow Enriched ACP Process Algebras
CoRR abs/0901.3012: (2009) |
| 187 | EE | Jan A. Bergstra,
Inge Bethke:
Square root meadows
CoRR abs/0901.4664: (2009) |
| 186 | EE | Jan A. Bergstra,
C. A. Middelburg:
Transmission protocols for instruction streams
CoRR abs/0902.2859: (2009) |
| 185 | EE | Jan A. Bergstra,
Alban Ponse:
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
CoRR abs/0903.1352: (2009) |
| 184 | EE | Jan A. Bergstra,
C. A. Middelburg:
A process calculus with finitary comprehended terms
CoRR abs/0903.2914: (2009) |
| 183 | EE | Jan A. Bergstra,
Yoram Hirshfeld,
J. V. Tucker:
Meadows and the equational specification of division.
Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) |
| 2008 |
|---|
| 182 | EE | Jan A. Bergstra,
Yoram Hirshfeld,
John Tucker:
Fields, Meadows and Abstract Data Types.
Pillars of Computer Science 2008: 166-178 |
| 181 | EE | Jan A. Bergstra,
C. A. Middelburg:
Programming an interpreter using molecular dynamics
CoRR abs/0801.2226: (2008) |
| 180 | EE | Jan A. Bergstra,
Kees Middelburg:
Thread extraction for polyadic instruction sequences
CoRR abs/0802.1578: (2008) |
| 179 | EE | Jan A. Bergstra,
Sanne Nolst Trenité,
Mark van der Zwaag:
Towards a formalization of budgets
CoRR abs/0802.3617: (2008) |
| 178 | EE | Jan A. Bergstra,
C. A. Middelburg:
Thread algebra for sequential poly-threading
CoRR abs/0803.0378: (2008) |
| 177 | EE | Jan A. Bergstra,
C. A. Middelburg:
Data linkage algebra, data linkage dynamics, and priority rewriting
CoRR abs/0804.4565: (2008) |
| 176 | EE | Jan A. Bergstra,
Sanne Nolst Trenité,
Mark van der Zwaag:
Tuplix Calculus Specifications of Financial Transfer Networks
CoRR abs/0805.1806: (2008) |
| 175 | EE | Jan A. Bergstra,
C. A. Middelburg:
Data linkage dynamics with shedding
CoRR abs/0806.4034: (2008) |
| 174 | EE | Jan A. Bergstra,
Alban Ponse:
Proposition Algebra with Projective Limits
CoRR abs/0807.3648: (2008) |
| 173 | EE | Jan A. Bergstra,
C. A. Middelburg:
Instruction sequences and non-uniform complexity theory
CoRR abs/0809.0352: (2008) |
| 172 | EE | Jan A. Bergstra,
Mark van der Zwaag:
Mechanistic Behavior of Single-Pass Instruction Sequences
CoRR abs/0809.4635: (2008) |
| 171 | EE | Jan A. Bergstra,
C. A. Middelburg:
On the expressiveness of single-pass instruction sequences
CoRR abs/0810.1106: (2008) |
| 170 | EE | Jan A. Bergstra,
Alban Ponse:
An Instruction Sequence Semigroup with Repeaters
CoRR abs/0810.1151: (2008) |
| 169 | EE | Jan A. Bergstra,
Mark Burgess:
A static theory of promises
CoRR abs/0810.3294: (2008) |
| 168 | EE | Jan A. Bergstra,
C. A. Middelburg:
Instruction sequences for the production of processes
CoRR abs/0811.0436: (2008) |
| 167 | EE | Jan A. Bergstra,
C. A. Middelburg:
Parallel Processes with Implicit Computational Capital.
Electr. Notes Theor. Comput. Sci. 209: 55-81 (2008) |
| 166 | EE | Jan A. Bergstra,
C. A. Middelburg:
Distributed strategic interleaving with load balancing.
Future Generation Comp. Syst. 24(6): 530-548 (2008) |
| 165 | EE | Jan A. Bergstra,
C. A. Middelburg:
Simulating Turing machines on Maurer machines.
J. Applied Logic 6(1): 1-23 (2008) |
| 164 | EE | Jan A. Bergstra,
C. A. Middelburg:
Program algebra with a jump-shift instruction.
J. Applied Logic 6(4): 553-563 (2008) |
| 163 | EE | Jan A. Bergstra,
C. A. Middelburg:
Maurer computers for pipelined instruction processing.
Mathematical Structures in Computer Science 18(2): 373-409 (2008) |
| 2007 |
|---|
| 162 | EE | Jan A. Bergstra,
Inge Bethke,
Alban Ponse:
Decision problems for pushdown threads.
Acta Inf. 44(2): 75-90 (2007) |
| 161 | EE | Jan A. Bergstra,
C. A. Middelburg:
Synchronous cooperation for explicit multi-threading.
Acta Inf. 44(7-8): 525-569 (2007) |
| 160 | EE | Jan A. Bergstra,
Inge Bethke,
Mark Burgess:
A process algebra based framework for promise theory
CoRR abs/0707.0744: (2007) |
| 159 | EE | Jan A. Bergstra,
Alban Ponse:
Projection semantics for rigid loops
CoRR abs/0707.1059: (2007) |
| 158 | EE | Jan A. Bergstra,
Alban Ponse:
Interface groups and financial transfer architectures
CoRR abs/0707.1639: (2007) |
| 157 | EE | Jan A. Bergstra,
C. A. Middelburg:
Instruction sequences with indirect jumps
CoRR abs/0711.0829: (2007) |
| 156 | EE | Jan A. Bergstra,
C. A. Middelburg:
An interface group for process components
CoRR abs/0711.0834: (2007) |
| 155 | EE | Jan A. Bergstra,
C. A. Middelburg:
Machine structure oriented control code logic
CoRR abs/0711.0836: (2007) |
| 154 | EE | Jan A. Bergstra,
C. A. Middelburg:
On the operating unit size of load/store architectures
CoRR abs/0711.0838: (2007) |
| 153 | EE | Jan A. Bergstra,
C. A. Middelburg:
A thread calculus with molecular dynamics
CoRR abs/0711.0840: (2007) |
| 152 | EE | Jan A. Bergstra,
C. A. Middelburg:
Instruction Sequences with Dynamically Instantiated Instructions
CoRR abs/0711.4217: (2007) |
| 151 | EE | Jan A. Bergstra,
C. A. Middelburg:
Program algebra with a jump-shift instruction
CoRR abs/0712.1658: (2007) |
| 150 | EE | Jan A. Bergstra,
Alban Ponse,
Mark van der Zwaag:
Tuplix Calculus
CoRR abs/0712.3423: (2007) |
| 149 | EE | Jan A. Bergstra,
C. A. Middelburg:
Thread algebra for strategic interleaving.
Formal Asp. Comput. 19(4): 445-474 (2007) |
| 148 | EE | Jan A. Bergstra,
C. A. Middelburg:
Maurer Computers with Single-Thread Control.
Fundam. Inform. 80(4): 333-362 (2007) |
| 147 | EE | Jan A. Bergstra,
J. V. Tucker:
The rational numbers as an abstract data type.
J. ACM 54(2): (2007) |
| 146 | EE | Jan A. Bergstra,
Alban Ponse:
Execution architectures for program algebra.
J. Applied Logic 5(1): 170-192 (2007) |
| 145 | EE | Jan A. Bergstra,
C. A. Middelburg:
Preferential choice and coordination conditions.
J. Log. Algebr. Program. 70(2): 172-200 (2007) |
| 144 | EE | Jan A. Bergstra,
Paul Klint:
About "trivial" software patents: The IsNot case.
Sci. Comput. Program. 64(3): 264-285 (2007) |
| 143 | EE | Jan A. Bergstra:
Letter from the editor.
Sci. Comput. Program. 65(1): (2007) |
| 142 | EE | Jan A. Bergstra,
C. A. Middelburg:
A Thread Algebra with Multi-Level Strategic Interleaving.
Theory Comput. Syst. 41(1): 3-32 (2007) |
| 2006 |
|---|
| 141 | EE | Jan A. Bergstra:
Elementary Algebraic Specifications of the Rational Function Field.
CiE 2006: 40-54 |
| 140 | EE | Jan A. Bergstra,
John V. Tucker:
Elementary Algebraic Specifications of the Rational Complex Numbers.
Essays Dedicated to Joseph A. Goguen 2006: 459-475 |
| 139 | EE | Jos C. M. Baeten,
Jan A. Bergstra:
Six Themes for Future Concurrency Research.
Electr. Notes Theor. Comput. Sci. 162: 61-64 (2006) |
| 138 | EE | Jan A. Bergstra:
On the Design Rationale of ACP Style Process Algebras.
Electr. Notes Theor. Comput. Sci. 162: 79-85 (2006) |
| 137 | EE | Jan A. Bergstra,
C. A. Middelburg:
Thread Algebra with Multi-Level Strategies.
Fundam. Inform. 71(2-3): 153-182 (2006) |
| 136 | EE | Jan A. Bergstra,
C. A. Middelburg:
Splitting bisimulations and retrospective conditions.
Inf. Comput. 204(7): 1083-1138 (2006) |
| 135 | EE | Jan A. Bergstra,
C. A. Middelburg:
Continuity controlled hybrid automata.
J. Log. Algebr. Program. 68(1-2): 5-53 (2006) |
| 2005 |
|---|
| 134 | EE | Jan A. Bergstra,
C. A. Middelburg:
Strong Splitting Bisimulation Equivalence.
CALCO 2005: 83-97 |
| 133 | EE | Jan A. Bergstra,
C. A. Middelburg:
A Thread Algebra with Multi-level Strategic Interleaving.
CiE 2005: 35-48 |
| 132 | EE | Jan A. Bergstra,
Alban Ponse:
A Bypass of Cohen's Impossibility Result.
EGC 2005: 1097-1106 |
| 131 | EE | Jan A. Bergstra,
C. A. Middelburg:
Model Theory for Process Algebra.
Processes, Terms and Cycles 2005: 445-495 |
| 130 | EE | Jan A. Bergstra,
Inge Bethke:
An upper bound for the equational specification of finite state services.
Inf. Process. Lett. 94(6): 267-269 (2005) |
| 129 | EE | Jan A. Bergstra,
Inge Bethke:
Network algebra in Java.
J. Log. Algebr. Program. 62(2): 247-271 (2005) |
| 128 | EE | Jan A. Bergstra,
C. A. Middelburg:
Process algebra for hybrid systems.
Theor. Comput. Sci. 335(2-3): 215-280 (2005) |
| 127 | EE | Jan A. Bergstra,
Inge Bethke:
Polarized process algebra with reactive composition.
Theor. Comput. Sci. 343(3): 285-304 (2005) |
| 2004 |
|---|
| 126 | EE | Jan A. Bergstra,
C. A. Middelburg:
Located Actions in Process Algebra with Timing.
Fundam. Inform. 61(3-4): 183-211 (2004) |
| 2003 |
|---|
| 125 | EE | Jan A. Bergstra:
Machine Function Based Control Code Algebras.
FMCO 2003: 17-41 |
| 124 | EE | Jan A. Bergstra,
Inge Bethke:
Polarized Process Algebra and Program Equivalence.
ICALP 2003: 1-21 |
| 123 | EE | Jan A. Bergstra,
Pum Walters:
Operator programs and operator processes.
Information & Software Technology 45(10): 681-689 (2003) |
| 122 | EE | Jan 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) |
| 120 | EE | Jan A. Bergstra,
M. E. Loots:
Program algebra for sequential code.
J. Log. Algebr. Program. 51(2): 125-156 (2002) |
| 119 | EE | Jan A. Bergstra,
Alban Ponse:
Combining programs and state machines.
J. Log. Algebr. Program. 51(2): 175-192 (2002) |
| 118 | EE | Jan A. Bergstra,
Inge Bethke:
Molecular dynamics.
J. Log. Algebr. Program. 51(2): 193-214 (2002) |
| 2001 |
|---|
| 117 | EE | Jan A. Bergstra,
Alban Ponse:
Process algebra and conditional composition.
Inf. Process. Lett. 80(1): 41-49 (2001) |
| 116 | EE | Jan A. Bergstra,
Alban Ponse:
Register-machine based processes.
J. ACM 48(6): 1207-1241 (2001) |
| 115 | EE | Jan 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 |
| 113 | EE | Jan 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 |
|---|
| 111 | EE | Jan A. Bergstra,
Alban Ponse:
Grid Protocol Specifications.
Prospects for Hardware Foundations 1998: 278-308 |
| 110 | EE | Jos C. M. Baeten,
Jan A. Bergstra:
Deadlock Behaviour in Split and ST Bisimulation Semantics.
Electr. Notes Theor. Comput. Sci. 16(2): (1998) |
| 109 | EE | Jan 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 |
|---|
| 106 | | Jos 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 |
| 104 | EE | 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) |
| 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) |
| 101 | EE | Jos 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 |
| 98 | | Jan 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) |
| 89 | EE | Jan 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 |
|---|
| 87 | | Jos 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 |
|---|
| 80 | | Jos C. M. Baeten,
Jan A. Bergstra:
Non Interleaving Process Algebra.
CONCUR 1993: 308-323 |
| 79 | | Jan 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 |
| 77 | | Jan A. Bergstra,
Alban Ponse,
Jos van Wamel:
Process Algebra with Backtracking.
REX School/Symposium 1993: 46-91 |
| 76 | EE | 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) |
| 1992 |
|---|
| 75 | | Jos C. M. Baeten,
Jan A. Bergstra:
Discrete Time Process Algebra.
CONCUR 1992: 401-420 |
| 74 | | Jos 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 |
| 71 | | Jos C. M. Baeten,
Jan A. Bergstra:
Real Space Process Algebra.
CONCUR 1991: 96-110 |
| 70 | | Jos 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 |
|---|
| 66 | | Jos C. M. Baeten,
Jan A. Bergstra:
Process Algebra with a Zero Object.
CONCUR 1990: 83-98 |
| 65 | EE | Jan 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 |
| 63 | | 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 |
| 62 | | Jos 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 |
|---|
| 60 | | Jan A. Bergstra:
ACP with Signals.
ALP 1988: 11-20 |
| 59 | | Jan 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 |
|---|
| 56 | | Jan A. Bergstra,
Jan Willem Klop:
ACTtau: A Universal Axiom System for Process Specification.
Algebraic Methods 1987: 447-463 |
| 55 | | 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 |
| 54 | | Jos 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 |
|---|
| 46 | | Jan A. Bergstra,
Jan Willem Klop:
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.
ICALP 1984: 82-94 |
| 45 | | Jan 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 |
|---|
| 38 | | 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 |
| 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 |
| 30 | | Jan 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 |
| 18 | | Jan 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 |
| 15 | | Jan 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 |
| 9 | | Jan 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 |
|---|
| 4 | | Jan 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 |
