- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j124 |      | Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer: Guest Editorial. Comput. J. 56(1): 2 (2013) |
| j123 | | Jan A. Bergstra, Inge Bethke, Alban Ponse: Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) |
| i67 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequence based non-uniform complexity classes. CoRR abs/1301.3297 (2013) |
| i66 | | Jan A. Bergstra, C. A. Middelburg, Gheorghe Stefanescu: Network algebra for synchronous dataflow. CoRR abs/1303.0382 (2013) |
| i65 | | Jan A. Bergstra, Karl de Leeuw: Bitcoin and Beyond: Exclusively Informational Monies. CoRR abs/1304.4758 (2013) |
| 2012 | ||
| j122 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequence processing operators. Acta Inf. 49(3): 139-172 (2012) |
| j121 | | Jan A. Bergstra, C. A. Middelburg: On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Inform. 120(2): 111-144 (2012) |
| j120 | | Jan A. Bergstra, C. A. Middelburg: On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50(2): 313-328 (2012) |
| j119 | | Jan A. Bergstra, Inge Bethke: On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012) |
| i64 | | |
| i63 | | Jan A. Bergstra, C. A. Middelburg: Turing Impossibility Properties for Stack Machine Programming. CoRR abs/1201.6028 (2012) |
| i62 | | |
| i61 | | Jan A. Bergstra, C. A. Middelburg: Process algebra with conditionals in the presence of epsilon. CoRR abs/1204.3249 (2012) |
| i60 | | |
| i59 | | |
| i58 | | |
| i57 | | Jan A. Bergstra: Informaticology: combining Computer Science, Data Science, and Fiction Science. CoRR abs/1210.6636 (2012) |
| 2011 | ||
| j118 | | Jan A. Bergstra, Cornelis A. Middelburg: Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comp. Sci. 21(2): 283-310 (2011) |
| j117 | | Jan A. Bergstra, C. A. Middelburg: Thread algebra for poly-threading. Formal Asp. Comput. 23(4): 567-583 (2011) |
| j116 | | Jan A. Bergstra, C. A. Middelburg: Inversive meadows and divisive meadows. J. Applied Logic 9(3): 203-220 (2011) |
| j115 | | Jan A. Bergstra, Inge Bethke: Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) |
| j114 | | |
| j113 | | Jan A. Bergstra, Jaco van de Pol: A calculus for four-valued sequential logic. Theor. Comput. Sci. 412(28): 3122-3128 (2011) |
| j112 | | |
| c58 | | |
| i56 | | |
| i55 | | Jan A. Bergstra, C. A. Middelburg: On the behaviours produced by instruction sequences under execution. CoRR abs/1106.6196 (2011) |
| i54 | | Jan A. Bergstra, G. P. A. J. Delen, S. F. M. van Vlijmen: Introducing Sourcements. CoRR abs/1107.4684 (2011) |
| i53 | | Jan A. Bergstra, G. P. A. J. Delen, S. F. M. van Vlijmen: Outsourcing Competence. CoRR abs/1109.6536 (2011) |
| i52 | | |
| i51 | | Jan A. Bergstra, G. P. A. J. Delen, S. F. M. van Vlijmen: Stratified Outsourcing Theory. CoRR abs/1110.1957 (2011) |
| i50 | | |
| 2010 | ||
| j111 | | Jan A. Bergstra, C. A. Middelburg: An Interface Group for Process Components. Fundam. Inform. 99(4): 355-382 (2010) |
| j110 | | Jan A. Bergstra, C. A. Middelburg: Data Linkage Dynamics with Shedding. Fundam. Inform. 103(1-4): 31-52 (2010) |
| j109 | | Jan A. Bergstra, C. A. Middelburg: A thread calculus with molecular dynamics. Inf. Comput. 208(7): 817-844 (2010) |
| j108 | | Jan A. Bergstra, C. A. Middelburg: On the operating unit size of load/store architectures. Mathematical Structures in Computer Science 20(3): 395-417 (2010) |
| i49 | | Jan A. Bergstra, Inge Bethke: On the contribution of backward jumps to instruction sequence expressiveness. CoRR abs/1005.5662 (2010) |
| i48 | | Jan A. Bergstra, C. A. Middelburg: On the definition of a theoretical concept of an operating system. CoRR abs/1006.0813 (2010) |
| i47 | | |
| i46 | | |
| i45 | | |
| i44 | | |
| i43 | | |
| i42 | | Jan A. Bergstra, S. F. M. van Vlijmen: Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations. CoRR abs/1012.5739 (2010) |
| 2009 | ||
| j107 | | Jan A. Bergstra, C. A. Middelburg: Machine structure oriented control code logic. Acta Inf. 46(5): 375-401 (2009) |
| j106 | | Jan A. Bergstra, Alban Ponse: An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. Sci. Ann. Comp. Sci. 19: 57-92 (2009) |
| j105 | | Jan A. Bergstra, C. A. Middelburg: Instruction Sequences with Dynamically Instantiated Instructions. Fundam. Inform. 96(1-2): 27-48 (2009) |
| j104 | | Jan A. Bergstra, Yoram Hirshfeld, J. V. Tucker: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) |
| c57 | | Jan A. Bergstra, C. A. Middelburg: Transmission Protocols for Instruction Streams. ICTAC 2009: 127-139 |
| i41 | | Jan A. Bergstra, C. A. Middelburg: Timed tuplix calculus and the Wesseling and van den Berg equation. CoRR abs/0901.3003 (2009) |
| i40 | | |
| i39 | | |
| i38 | | Jan A. Bergstra, C. A. Middelburg: Transmission protocols for instruction streams. CoRR abs/0902.2859 (2009) |
| i37 | | Jan A. Bergstra, Alban Ponse: An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. CoRR abs/0903.1352 (2009) |
| i36 | | Jan A. Bergstra, C. A. Middelburg: A process calculus with finitary comprehended terms. CoRR abs/0903.2914 (2009) |
| i35 | | Jan A. Bergstra, C. A. Middelburg: A protocol for instruction stream processing. CoRR abs/0905.2257 (2009) |
| i34 | | Jan A. Bergstra, Inge Bethke: Straight-line instruction sequence completeness for total calculation on cancellation meadows. CoRR abs/0905.4612 (2009) |
| i33 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequence notations with probabilistic instructions. CoRR abs/0906.3083 (2009) |
| i32 | | |
| i31 | | Jan A. Bergstra, C. A. Middelburg: Indirect jumps improve instruction sequence performance. CoRR abs/0909.2089 (2009) |
| i30 | | Jan A. Bergstra, Alban Ponse: A progression ring for interfaces of instruction sequences, threads, and services. CoRR abs/0909.2839 (2009) |
| i29 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequence processing operators. CoRR abs/0910.5564 (2009) |
| i28 | | |
| i27 | | Jan A. Bergstra, C. A. Middelburg: Autosolvability of halting problem instances for instruction sequences. CoRR abs/0911.5018 (2009) |
| i26 | | Jan A. Bergstra, Mark Burgess: Local and Global Trust Based on the Concept of Promises. CoRR abs/0912.4637 (2009) |
| 2008 | ||
| j103 | | Jan A. Bergstra, Alban Ponse, Mark van der Zwaag: Tuplix Calculus. Sci. Ann. Comp. Sci. 18: 35-61 (2008) |
| j102 | | Jan A. Bergstra, C. A. Middelburg: Parallel Processes with Implicit Computational Capital. Electr. Notes Theor. Comput. Sci. 209: 55-81 (2008) |
| j101 | | Jan A. Bergstra, C. A. Middelburg: Distributed strategic interleaving with load balancing. Future Generation Comp. Syst. 24(6): 530-548 (2008) |
| j100 | | Jan A. Bergstra, C. A. Middelburg: Simulating Turing machines on Maurer machines. J. Applied Logic 6(1): 1-23 (2008) |
| j99 | | Jan A. Bergstra, C. A. Middelburg: Program algebra with a jump-shift instruction. J. Applied Logic 6(4): 553-563 (2008) |
| j98 | | Jan A. Bergstra, C. A. Middelburg: Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science 18(2): 373-409 (2008) |
| j97 | | Jan A. Bergstra, John V. Tucker: Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008) |
| c56 | | Jan A. Bergstra, Yoram Hirshfeld, John Tucker: Fields, Meadows and Abstract Data Types. Pillars of Computer Science 2008: 166-178 |
| i25 | | Jan A. Bergstra, C. A. Middelburg: Programming an interpreter using molecular dynamics. CoRR abs/0801.2226 (2008) |
| i24 | | Jan A. Bergstra, Kees Middelburg: Thread extraction for polyadic instruction sequences. CoRR abs/0802.1578 (2008) |
| i23 | | Jan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag: Towards a formalization of budgets. CoRR abs/0802.3617 (2008) |
| i22 | | Jan A. Bergstra, C. A. Middelburg: Thread algebra for sequential poly-threading. CoRR abs/0803.0378 (2008) |
| i21 | | Jan A. Bergstra, C. 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 | | |
| i18 | | |
| i17 | | Jan A. Bergstra, C. 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, C. 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 | | |
| i12 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequences for the production of processes. CoRR abs/0811.0436 (2008) |
| 2007 | ||
| j96 | | Jan A. Bergstra, Inge Bethke, Alban Ponse: Decision problems for pushdown threads. Acta Inf. 44(2): 75-90 (2007) |
| j95 | | Jan A. Bergstra, C. A. Middelburg: Synchronous cooperation for explicit multi-threading. Acta Inf. 44(7-8): 525-569 (2007) |
| j94 | | Jan A. Bergstra, C. A. Middelburg: Instruction Sequences with Indirect Jumps. Sci. Ann. Comp. Sci. 17: 19-46 (2007) |
| j93 | | Jan A. Bergstra, C. A. Middelburg: Programming an Interpreter Using Molecular Dynamics. Sci. Ann. Comp. Sci. 17: 47-81 (2007) |
| j92 | | Jan A. Bergstra, C. A. Middelburg: Thread algebra for strategic interleaving. Formal Asp. Comput. 19(4): 445-474 (2007) |
| j91 | | Jan A. Bergstra, C. A. Middelburg: Maurer Computers with Single-Thread Control. Fundam. Inform. 80(4): 333-362 (2007) |
| j90 | | |
| j89 | | Jan A. Bergstra, Alban Ponse: Execution architectures for program algebra. J. Applied Logic 5(1): 170-192 (2007) |
| j88 | | Jan A. Bergstra, C. A. Middelburg: Preferential choice and coordination conditions. J. Log. Algebr. Program. 70(2): 172-200 (2007) |
| j87 | | Jan A. Bergstra, C. A. Middelburg: A Thread Algebra with Multi-Level Strategic Interleaving. Theory Comput. Syst. 41(1): 3-32 (2007) |
| j86 | | Jan A. Bergstra, Paul Klint: About "trivial" software patents: The IsNot case. Sci. Comput. Program. 64(3): 264-285 (2007) |
| j85 | | |
| i11 | | Jan A. Bergstra, Inge Bethke, Mark Burgess: A process algebra based framework for promise theory. CoRR abs/0707.0744 (2007) |
| i10 | | |
| i9 | | Jan A. Bergstra, Alban Ponse: Interface groups and financial transfer architectures. CoRR abs/0707.1639 (2007) |
| i8 | | Jan A. Bergstra, C. A. Middelburg: Instruction sequences with indirect jumps. CoRR abs/0711.0829 (2007) |
| i7 | | Jan A. Bergstra, C. A. Middelburg: An interface group for process components. CoRR abs/0711.0834 (2007) |
| i6 | | Jan A. Bergstra, C. A. Middelburg: Machine structure oriented control code logic. CoRR abs/0711.0836 (2007) |
| i5 | | Jan A. Bergstra, C. A. Middelburg: On the operating unit size of load/store architectures. CoRR abs/0711.0838 (2007) |
| i4 | | Jan A. Bergstra, C. A. Middelburg: A thread calculus with molecular dynamics. CoRR abs/0711.0840 (2007) |
| i3 | | Jan A. Bergstra, C. A. Middelburg: Instruction Sequences with Dynamically Instantiated Instructions. CoRR abs/0711.4217 (2007) |
| i2 | | Jan A. Bergstra, C. A. Middelburg: Program algebra with a jump-shift instruction. CoRR abs/0712.1658 (2007) |
| i1 | | |
| 2006 | ||
| j84 | | Jos C. M. Baeten, Jan A. Bergstra: Six Themes for Future Concurrency Research. Electr. Notes Theor. Comput. Sci. 162: 61-64 (2006) |
| j83 | | Jan A. Bergstra: On the Design Rationale of ACP Style Process Algebras. Electr. Notes Theor. Comput. Sci. 162: 79-85 (2006) |
| j82 | | Jan A. Bergstra, C. A. Middelburg: Thread Algebra with Multi-Level Strategies. Fundam. Inform. 71(2-3): 153-182 (2006) |
| j81 | | Jan A. Bergstra, C. A. Middelburg: Splitting bisimulations and retrospective conditions. Inf. Comput. 204(7): 1083-1138 (2006) |
| j80 | | Jan A. Bergstra, C. A. Middelburg: Continuity controlled hybrid automata. J. Log. Algebr. Program. 68(1-2): 5-53 (2006) |
| c55 | | Jan A. Bergstra, John V. Tucker: Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475 |
| c54 | | Jan A. Bergstra: Elementary Algebraic Specifications of the Rational Function Field. CiE 2006: 40-54 |
| 2005 | ||
| j79 | | Jan A. Bergstra, Inge Bethke: An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94(6): 267-269 (2005) |
| j78 | | Jan A. Bergstra, Inge Bethke: Network algebra in Java. J. Log. Algebr. Program. 62(2): 247-271 (2005) |
| j77 | | Jan A. Bergstra, C. A. Middelburg: Process algebra for hybrid systems. Theor. Comput. Sci. 335(2-3): 215-280 (2005) |
| j76 | | Jan A. Bergstra, Inge Bethke: Polarized process algebra with reactive composition. Theor. Comput. Sci. 343(3): 285-304 (2005) |
| c53 | | Jan A. Bergstra, C. A. Middelburg: Model Theory for Process Algebra. Processes, Terms and Cycles 2005: 445-495 |
| c52 | | |
| c51 | | Jan A. Bergstra, C. A. Middelburg: A Thread Algebra with Multi-level Strategic Interleaving. CiE 2005: 35-48 |
| c50 | | |
| 2004 | ||
| j75 | | Jan A. Bergstra, C. A. Middelburg: Located Actions in Process Algebra with Timing. Fundam. Inform. 61(3-4): 183-211 (2004) |
| 2003 | ||
| j74 | | Jan A. Bergstra, Pum Walters: Operator programs and operator processes. Information & Software Technology 45(10): 681-689 (2003) |
| j73 | | Jan A. Bergstra, Alban Ponse, Mark van der Zwaag: Branching time and orthogonal bisimulation equivalence. Theor. Comput. Sci. 309(1-3): 313-355 (2003) |
| c49 | | |
| c48 | | |
| 2002 | ||
| j72 | | Jan A. Bergstra: Molecule-oriented programming in Java. Information & Software Technology 44(11): 617-638 (2002) |
| j71 | | Jan A. Bergstra, M. E. Loots: Program algebra for sequential code. J. Log. Algebr. Program. 51(2): 125-156 (2002) |
| j70 | | Jan A. Bergstra, Alban Ponse: Combining programs and state machines. J. Log. Algebr. Program. 51(2): 175-192 (2002) |
| j69 | | |
| 2001 | ||
| j68 | | Jan A. Bergstra, Alban Ponse: Process algebra and conditional composition. Inf. Process. Lett. 80(1): 41-49 (2001) |
| j67 | | |
| j66 | | Jan A. Bergstra, Alban Ponse: Non-regular iterators in process algebra. Theor. Comput. Sci. 269(1-2): 203-229 (2001) |
| 2000 | ||
| j65 | | Jan A. Bergstra, M. E. Loots: Program Algebra for Component Code. Formal Asp. Comput. 12(1): 1-17 (2000) |
| j64 | | Jan A. Bergstra, Alban Ponse: Process Algebra with Four-Valued Logic. Journal of Applied Non-Classical Logics 10(1): 27-53 (2000) |
| c47 |  | Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers: Discrete time process algebra with silent step. Proof, Language, and Interaction 2000: 535-570 |
| 1998 | ||
| j63 | | Jos C. M. Baeten, Jan A. Bergstra: Deadlock Behaviour in Split and ST Bisimulation Semantics. Electr. Notes Theor. Comput. Sci. 16(2): 61-74 (1998) |
| j62 | | Jan A. Bergstra, Alban Ponse: Kleene's Three-Valued Logic and Process Algebra. Inf. Process. Lett. 67(2): 95-103 (1998) |
| j61 | | Jan A. Bergstra, Alban Ponse: Bochvar-McCarthy Logic and Process Algebra. Notre Dame Journal of Formal Logic 39(4): 464-484 (1998) |
| j60 | | Jan A. Bergstra, Paul Klint: The Discrete Time TOOLBUS - A Software Coordination Architecture. Sci. Comput. Program. 31(2-3): 205-229 (1998) |
| c46 | | Jan A. Bergstra, Alban Ponse: Grid Protocol Specifications. Prospects for Hardware Foundations 1998: 278-308 |
| 1997 | ||
| j59 | | 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) |
| j58 | | Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse: Grid Protocols Based on Synchronous Communication. Sci. Comput. Program. 29(1-2): 199-233 (1997) |
| j57 | | Jos C. M. Baeten, Jan A. Bergstra: Process Algebra with Propositional Signals. Theor. Comput. Sci. 177(2): 381-405 (1997) |
| j56 | | 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) |
| c45 | | |
| c44 | | |
| 1996 | ||
| j55 | | Jos C. M. Baeten, Jan A. Bergstra: Six Issues Concerning Future Directions in Concurrency Research. ACM Comput. Surv. 28(4es): 39 (1996) |
| j54 | | Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra. Formal Asp. Comput. 8(2): 188-208 (1996) |
| j53 | | Jan A. Bergstra, Gheorghe Stefanescu: Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. Fundam. Inform. 27(1): 37-56 (1996) |
| c43 | | |
| c42 | | |
| c41 | | Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering: A Complete Transformational Toolkit for Compilers. ESOP 1996: 92-107 |
| 1995 | ||
| j52 | | Jan A. Bergstra, J. V. Tucker: A Data Type Variety of Stack Algebras. Ann. Pure Appl. Logic 73(1): 11-36 (1995) |
| j51 | | Jan A. Bergstra, Jan Heering: Homomorphism Preserving Algebraic Specifications Require Hidden Sorts. Inf. Comput. 119(1): 119-123 (1995) |
| j50 | | Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121(2): 234-255 (1995) |
| j49 | | Jan A. Bergstra, J. V. Tucker: Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995) |
| j48 | | 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): 199-217 (1995) |
| c40 | | |
| c39 | | |
| 1994 | ||
| j47 | | Jan A. Bergstra, Inge Bethke, Alban Ponse: Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994) |
| j46 | | Jos C. M. Baeten, Jan A. Bergstra: On Sequential Compoisiton, Action Prefixes and Process Prefixes. Formal Asp. Comput. 6(3): 250-268 (1994) |
| j45 | | Jan A. Bergstra, Gheorghe Stefanescu: Bisimulation is Two-Way Simulation. Inf. Process. Lett. 52(6): 285-287 (1994) |
| j44 | | Johan van Benthem, Jan A. Bergstra: Logic of Transition Systems. Journal of Logic, Language and Information 3(4): 247-283 (1994) |
| j43 | | Jan A. Bergstra, Jan Heering: Which Data Types have omega-complete Initial Algebra Specifications? Theor. Comput. Sci. 124(1): 149-168 (1994) |
| c38 | | |
| c37 | | |
| 1993 | ||
| j42 | | 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) |
| c36 | | |
| c35 | | |
| c34 | | Jan A. Bergstra, Gheorghe Stefanescu: Translations Between Flowchart Schemes and Process Graphs. FCT 1993: 152-161 |
| c33 | | Jan A. Bergstra, Alban Ponse, Jos van Wamel: Process Algebra with Backtracking. REX School/Symposium 1993: 46-91 |
| 1992 | ||
| c32 | | |
| c31 | | Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485 |
| c30 | | Jos C. M. Baeten, Jan A. Bergstra: Asynchronous Communication in Real Space Process Algebra. FTRTFT 1992: 473-492 |
| 1991 | ||
| j41 | | Jos C. M. Baeten, Jan A. Bergstra: Real Time Process Algebra. Formal Asp. Comput. 3(2): 142-188 (1991) |
| j40 | | 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) |
| j39 | | Jos C. M. Baeten, Jan A. Bergstra: Recursive Process Definitions with the State Operator. Theor. Comput. Sci. 82(2): 285-302 (1991) |
| c29 | | |
| c28 | | 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 (Eds.): 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 |
| 1990 | ||
| j38 | | |
| c27 | | |
| 1989 | ||
| j37 | | 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) |
| c26 | | 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 |
| c25 | | 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 (Eds.): 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 |
| 1988 | ||
| j36 | | Jos C. M. Baeten, Jan A. Bergstra: Global Renaming Operators in Concrete Process Algebra. Inf. Comput. 78(3): 205-245 (1988) |
| j35 | | 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) |
| c24 | | |
| c23 | | Jan A. Bergstra, Jan Willem Klop: Process theory based on bisimulation semantics. REX Workshop 1988: 50-122 |
| 1987 | ||
| j34 | | 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) |
| j33 | | Jan A. Bergstra, J. V. Tucker: Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987) |
| j32 | | 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) |
| c22 | | Jan A. Bergstra, Jan Willem Klop: ACTtau: A Universal Axiom System for Process Specification. Algebraic Methods 1987: 447-463 |
| c21 | | 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 |
| c20 | | Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Term Rewriting Systems with Priorities. RTA 1987: 83-94 |
| 1986 | ||
| j31 | | Jan A. Bergstra, Jan Willem Klop: Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. 32(3): 323-362 (1986) |
| 1985 | ||
| j30 | | Jan A. Bergstra, J. V. Tucker: Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985) |
| j29 | | Jan A. Bergstra, Jan Willem Klop: Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. 37: 77-121 (1985) |
| c19 | | 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 | ||
| j28 | | Jan A. Bergstra, J. V. Tucker: The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Inf. 21: 293-320 (1984) |
| j27 | | Jan A. Bergstra, John-Jules Ch. Meyer: On Specifying Sets of Integers. Elektronische Informationsverarbeitung und Kybernetik 20(10/11): 531-541 (1984) |
| j26 | | Jan A. Bergstra, Jan Willem Klop: Process Algebra for Synchronous Communication. Information and Control 60(1-3): 109-137 (1984) |
| j25 | | Jan A. Bergstra, J. V. Tucker: Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984) |
| j24 | | Jan A. Bergstra, Jan Willem Klop: Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. 30: 1-48 (1984) |
| j23 | | 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) |
| c18 | | Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95 |
| c17 | | Jan A. Bergstra, Jan Willem Klop: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94 |
| 1983 | ||
| j22 | | Jan A. Bergstra, J. Terlouw: Standard Model Semantics for DSL A Data Type Specification Language. Acta Inf. 19: 97-113 (1983) |
| j21 | | Jan A. Bergstra, Jan Willem Klop: Initial Algebra Specifications for Parametrized Data Types. Elektronische Informationsverarbeitung und Kybernetik 19(1/2): 17-31 (1983) |
| j20 | | 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) |
| j19 | | Jan A. Bergstra, J. V. Tucker: Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983) |
| c16 | | 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 |
| c15 | | Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Algebraic Tools for System Construction. Logic of Programs 1983: 34-44 |
| c14 | | 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 | ||
| j18 | | 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) |
| j17 | | Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn: Another Incompleteness Result for Hoare's Logic. Information and Control 52(2): 159-171 (1982) |
| j16 | | 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) |
| j15 | | Jan A. Bergstra, John-Jules Ch. Meyer: A Simple Transfer Lemma for Algebraic Specifications. Inf. Process. Lett. 14(2): 80-85 (1982) |
| j14 | | Jan A. Bergstra, J. V. Tucker: Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982) |
| j13 | | Jan A. Bergstra, J. V. Tucker: Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982) |
| j12 | | Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker: Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982) |
| j11 | | 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) |
| j10 | | 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) |
| c13 | | |
| c12 | | Jan A. Bergstra, Jan Willem Klop: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP 1982: 23-34 |
| c11 | | Jan A. Bergstra, Jan Willem Klop: A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36 |
| 1981 | ||
| j9 | | |
| j8 | | Jan A. Bergstra, Jerzy Tiuryn: Algorithmic degrees of algebraic structures. Fundam. Inform. 4(4): 851-862 (1981) |
| j7 | | Jan A. Bergstra, John-Jules Ch. Meyer: On the quantifier-free fragment of 'Logic of effective definitions'. Fundam. Inform. 4(4): 935-956 (1981) |
| j6 | | Jan A. Bergstra, Jerzy Tiuryn: Regular extensions of iterative algebras and metric interpretations. Fundam. Inform. 4(4): 997-1014 (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, J. 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, J. 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, J. V. Tucker, Martin Wirsing: On the Power of Algebraic Specifications. MFCS 1981: 193-204 |
| 1980 | ||
| j5 | | 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, J. V. Tucker: A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90 |
| 1979 | ||
| j4 | | 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) |
| j3 | | 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 | ||
| j2 | | |
| j1 | | Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken: Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978) |
| c2 | | |
| 1977 | ||
| c1 | | Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide: An Axiomatization of the Rational Data Objects. FCT 1977: 33-38 |
Colors in the list of coauthors
Last update Wed May 22 09:48:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page