The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan A. Bergstra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jos C. M. Baeten, Jan A. Bergstra
    Real Time Process Algebra. [Citation Graph (1, 0)][DBLP]
    Formal Asp. Comput., 1991, v:3, n:2, pp:142-188 [Journal]
  2. Jan A. Bergstra
    Specification of Parameterized Data Types. [Citation Graph (0, 0)][DBLP]
    ADT, 1982, pp:- [Conf]
  3. Jan A. Bergstra, Jan Willem Klop
    Verification of an alternating bit protocol by means of process algebra. [Citation Graph (0, 0)][DBLP]
    Mathematical Methods of Specification and Synthesis of Software Systems, 1985, pp:9-23 [Conf]
  4. Jan A. Bergstra
    ACP with Signals. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:11-20 [Conf]
  5. Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink
    A Process Specification Formalism Based on Static COLD. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1989, pp:303-335 [Conf]
  6. Jos C. M. Baeten, Jan A. Bergstra
    Design of a Specification Language by Abstract Syntax Engineering. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1989, pp:363-394 [Conf]
  7. Jan A. Bergstra, Jan Willem Klop
    ACTtau: A Universal Axiom System for Process Specification. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1987, pp:447-463 [Conf]
  8. Jan A. Bergstra, Paul Klint
    The Discrete Time TOOLBUS. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:286-305 [Conf]
  9. Jan A. Bergstra, C. A. Middelburg
    Model Theory for Process Algebra. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:445-495 [Conf]
  10. Jan A. Bergstra, John V. Tucker
    Elementary Algebraic Specifications of the Rational Complex Numbers. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:459-475 [Conf]
  11. Jan A. Bergstra, C. A. Middelburg
    Strong Splitting Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    CALCO, 2005, pp:83-97 [Conf]
  12. Jan A. Bergstra
    Elementary Algebraic Specifications of the Rational Function Field. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:40-54 [Conf]
  13. Jan A. Bergstra, C. A. Middelburg
    A Thread Algebra with Multi-level Strategic Interleaving. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:35-48 [Conf]
  14. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
    Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:472-485 [Conf]
  15. Jos C. M. Baeten, Jan A. Bergstra
    Bounded Stacks, Bags and Queues. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:104-118 [Conf]
  16. Jos C. M. Baeten, Jan A. Bergstra
    Non Interleaving Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:308-323 [Conf]
  17. Jan A. Bergstra, Jan Willem Klop, J. V. Tucker
    Process Algebra with Asynchronous Communication Mechanisms. [Citation Graph (0, 0)][DBLP]
    Seminar on Concurrency, 1984, pp:76-95 [Conf]
  18. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with a Zero Object. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:83-98 [Conf]
  19. Jos C. M. Baeten, Jan A. Bergstra
    Real Space Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:96-110 [Conf]
  20. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:401-420 [Conf]
  21. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with Partial Choice. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1994, pp:465-480 [Conf]
  22. Jan A. Bergstra, Paul Klint
    The TOOLBUS Coordination Architecture. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 1996, pp:75-88 [Conf]
  23. Jan A. Bergstra, Inge Bethke, Alban Ponse
    Process Algebra with Combinators. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:36-65 [Conf]
  24. Jan A. Bergstra, Alban Ponse
    A Bypass of Cohen's Impossibility Result. [Citation Graph (0, 0)][DBLP]
    EGC, 2005, pp:1097-1106 [Conf]
  25. Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering
    A Complete Transformational Toolkit for Compilers. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:92-107 [Conf]
  26. Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide
    An Axiomatization of the Rational Data Objects. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:33-38 [Conf]
  27. Jan A. Bergstra, Gheorghe Stefanescu
    Translations Between Flowchart Schemes and Process Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:152-161 [Conf]
  28. Jan A. Bergstra, Gheorghe Stefanescu
    Processes with Multiple Entries and Exits. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:136-145 [Conf]
  29. Jan A. Bergstra, Jerzy Tiuryn
    Implicit definability of algebraic structures by means of program properties. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:58-63 [Conf]
  30. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra with Abstraction. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:1-15 [Conf]
  31. Jan A. Bergstra, Wiet Bouma
    Models for Feature Descriptions and Interactions. [Citation Graph (0, 0)][DBLP]
    FIW, 1997, pp:31-45 [Conf]
  32. Jan A. Bergstra
    Machine Function Based Control Code Algebras. [Citation Graph (0, 0)][DBLP]
    FMCO, 2003, pp:17-41 [Conf]
  33. Jos C. M. Baeten, Jan A. Bergstra
    Asynchronous Communication in Real Space Process Algebra. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1992, pp:473-492 [Conf]
  34. Jan A. Bergstra, J. Terlouw
    A Characterization of Program Equivalence in Terms of Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1981, pp:72-77 [Conf]
  35. J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
    Linear Time and Branching Time Semantics for Recursion with Merge. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:39-51 [Conf]
  36. Jan A. Bergstra, Inge Bethke
    Polarized Process Algebra and Program Equivalence. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1-21 [Conf]
  37. Jan A. Bergstra, Jan Willem Klop
    Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:23-34 [Conf]
  38. Jan A. Bergstra, Jan Willem Klop
    The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:82-94 [Conf]
  39. Jan A. Bergstra, J. V. Tucker
    A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:76-90 [Conf]
  40. Jan A. Bergstra, J. V. Tucker
    Algebraically Specified Programming Systems and Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:348-362 [Conf]
  41. Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol
    A Real Time Process Logic. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:30-47 [Conf]
  42. Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
    Hoare's Logic is Incomplete When It Does Not Have To Be. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:9-23 [Conf]
  43. Jan A. Bergstra, Jan Willem Klop, J. V. Tucker
    Algebraic Tools for System Construction. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:34-44 [Conf]
  44. Jan A. Bergstra, J. V. Tucker
    The Refinement of Specifications and the Stabiliy of Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:24-36 [Conf]
  45. Jan A. Bergstra, Jerzy Tiuryn
    PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:45-56 [Conf]
  46. Jan A. Bergstra
    Decision Problems Concerning Parallel Programming. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:134-142 [Conf]
  47. Jan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing
    On the Power of Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:193-204 [Conf]
  48. Jan A. Bergstra, Alban Ponse
    Grid Protocol Specifications. [Citation Graph (0, 0)][DBLP]
    Prospects for Hardware Foundations, 1998, pp:278-308 [Conf]
  49. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:94-111 [Conf]
  50. Jan A. Bergstra, Jan Willem Klop
    A formalized proof system for total correctness of while programs. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1982, pp:26-36 [Conf]
  51. Jos C. M. Baeten, Jan A. Bergstra
    The State Operator in Real Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1991, pp:107-123 [Conf]
  52. Jan A. Bergstra, Jan Willem Klop
    Process theory based on bisimulation semantics. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:50-122 [Conf]
  53. Jan A. Bergstra, Alban Ponse, Jos van Wamel
    Process Algebra with Backtracking. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:46-91 [Conf]
  54. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Term Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:83-94 [Conf]
  55. Jan A. Bergstra, J. Terlouw
    Standard Model Semantics for DSL A Data Type Specification Language. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:97-113 [Journal]
  56. Jan A. Bergstra, J. V. Tucker
    The Axiomatic Semantics of Programs Based on Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:293-320 [Journal]
  57. Jan A. Bergstra, J. V. Tucker
    A Data Type Variety of Stack Algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:73, n:1, pp:11-36 [Journal]
  58. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:6, pp:498-506 [Journal]
  59. Jan A. Bergstra, Inge Bethke, Alban Ponse
    Process Algebra with Iteration and Nesting. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1994, v:37, n:4, pp:243-258 [Journal]
  60. Jos C. M. Baeten, Jan A. Bergstra
    Six Issues Concerning Future Directions in Concurrency Research. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:39- [Journal]
  61. Jan A. Bergstra, Jan Willem Klop
    Initial Algebra Specifications for Parametrized Data Types. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:1/2, pp:17-31 [Journal]
  62. Jan A. Bergstra, Jan Willem Klop
    Strong Normalization and Perpetual Reductions in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1982, v:18, n:7/8, pp:403-417 [Journal]
  63. Jan A. Bergstra, John-Jules Ch. Meyer
    On Specifying Sets of Integers. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1984, v:20, n:10/11, pp:531-541 [Journal]
  64. Jos C. M. Baeten, Jan A. Bergstra
    Deadlock Behaviour in Split and ST Bisimulation Semantics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:2, pp:- [Journal]
  65. Jan A. Bergstra
    On the Design Rationale of ACP Style Process Algebras. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:79-85 [Journal]
  66. Jos C. M. Baeten, Jan A. Bergstra
    Six Themes for Future Concurrency Research. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:61-64 [Journal]
  67. Jos C. M. Baeten, Jan A. Bergstra
    On Sequential Compoisiton, Action Prefixes and Process Prefixes. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:3, pp:250-268 [Journal]
  68. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1996, v:8, n:2, pp:188-208 [Journal]
  69. Jan A. Bergstra, M. E. Loots
    Program Algebra for Component Code. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2000, v:12, n:1, pp:1-17 [Journal]
  70. Jan A. Bergstra, John-Jules Ch. Meyer
    On the quantifier-free fragment of 'Logic of effective definitions'. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:935-956 [Journal]
  71. Jan A. Bergstra, C. A. Middelburg
    Located Actions in Process Algebra with Timing. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:61, n:3-4, pp:183-211 [Journal]
  72. Jan A. Bergstra, Gheorghe Stefanescu
    Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:27, n:1, pp:37-56 [Journal]
  73. Jan A. Bergstra, Jerzy Tiuryn
    Logic of effective definitions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:3, pp:661-674 [Journal]
  74. Jan A. Bergstra, Jerzy Tiuryn
    Algorithmic degrees of algebraic structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:851-862 [Journal]
  75. Jan A. Bergstra, Jerzy Tiuryn
    Regular extensions of iterative algebras and metric interpretations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:997-1014 [Journal]
  76. Jos C. M. Baeten, Jan A. Bergstra
    Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:29, n:1-2, pp:51-76 [Journal]
  77. Jan A. Bergstra, C. A. Middelburg
    Thread Algebra with Multi-Level Strategies. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:2-3, pp:153-182 [Journal]
  78. Jos C. M. Baeten, Jan A. Bergstra
    Global Renaming Operators in Concrete Process Algebra [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:3, pp:205-245 [Journal]
  79. Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
    Axiomatizing Probabilistic Processes: ACP with Generative Probabilities [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:2, pp:234-255 [Journal]
  80. Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
    Another Incompleteness Result for Hoare's Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:2, pp:159-171 [Journal]
  81. Jan A. Bergstra, Jan Heering
    Homomorphism Preserving Algebraic Specifications Require Hidden Sorts [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:1, pp:119-123 [Journal]
  82. Jan A. Bergstra, Jan Willem Klop
    Process Algebra for Synchronous Communication [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:109-137 [Journal]
  83. Jan A. Bergstra, J. V. Tucker
    The Completeness of the Algebraic Specification Methods for Computable Data Types [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:54, n:3, pp:186-200 [Journal]
  84. Jan A. Bergstra, C. A. Middelburg
    Splitting bisimulations and retrospective conditions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:7, pp:1083-1138 [Journal]
  85. Jan A. Bergstra, Sjouke Mauw, Freek Wiedijk
    Uniform Algebraic Specifications of Finite Sets with Equality. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:1, pp:43-65 [Journal]
  86. Jan A. Bergstra
    Molecule-oriented programming in Java. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2002, v:44, n:11, pp:617-638 [Journal]
  87. Jan A. Bergstra, Pum Walters
    Operator programs and operator processes. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2003, v:45, n:10, pp:681-689 [Journal]
  88. Jan A. Bergstra
    What is an Abstract Datatype? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:1, pp:42-43 [Journal]
  89. Jan A. Bergstra, Inge Bethke
    An upper bound for the equational specification of finite state services. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:6, pp:267-269 [Journal]
  90. Jan A. Bergstra, John-Jules Ch. Meyer
    A Simple Transfer Lemma for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:2, pp:80-85 [Journal]
  91. Jan A. Bergstra, Alban Ponse
    Process algebra and conditional composition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:1, pp:41-49 [Journal]
  92. Jan A. Bergstra, Alban Ponse
    Kleene's Three-Valued Logic and Process Algebra. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:95-103 [Journal]
  93. Jan A. Bergstra, Gheorghe Stefanescu
    Bisimulation is Two-Way Simulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:285-287 [Journal]
  94. Jan A. Bergstra, J. V. Tucker
    Two Theorems About the Completeness of Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:4, pp:143-149 [Journal]
  95. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:653-682 [Journal]
  96. Jan A. Bergstra, Jan Heering, Paul Klint
    Module Algebra [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:335-372 [Journal]
  97. Jan A. Bergstra, Alban Ponse
    Register-machine based processes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:6, pp:1207-1241 [Journal]
  98. Jan A. Bergstra, J. V. Tucker
    Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1194-1230 [Journal]
  99. Jan A. Bergstra, J. V. Tucker
    The rational numbers as an abstract data type. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:2, pp:- [Journal]
  100. Jan A. Bergstra, Inge Bethke, Piet Rodenburg
    A propositional logic with 4 values: true, false, divergent and meaningless. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1995, v:5, n:2, pp:- [Journal]
  101. Jan A. Bergstra, Alban Ponse
    Process Algebra with Four-Valued Logic. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2000, v:10, n:1, pp:- [Journal]
  102. Jan A. Bergstra, Alban Ponse
    Execution architectures for program algebra. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2007, v:5, n:1, pp:170-192 [Journal]
  103. Jan A. Bergstra, Jan Willem Klop
    Conditional Rewrite Rules: Confluence and Termination. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:3, pp:323-362 [Journal]
  104. Jan A. Bergstra, J. V. Tucker
    Expressiveness and the Completeness of Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:3, pp:267-284 [Journal]
  105. Jan A. Bergstra, Inge Bethke
    Network algebra in Java. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:62, n:2, pp:247-271 [Journal]
  106. Jan A. Bergstra, M. E. Loots
    Program algebra for sequential code. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2002, v:51, n:2, pp:125-156 [Journal]
  107. Jan A. Bergstra, Inge Bethke
    Molecular dynamics. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2002, v:51, n:2, pp:193-214 [Journal]
  108. Jan A. Bergstra, C. A. Middelburg
    Continuity controlled hybrid automata. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:68, n:1-2, pp:5-53 [Journal]
  109. Jan A. Bergstra, Alban Ponse
    Combining programs and state machines. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2002, v:51, n:2, pp:175-192 [Journal]
  110. Johan van Benthem, Jan A. Bergstra
    Logic of Transition Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1994, v:3, n:4, pp:247-283 [Journal]
  111. Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken
    Degrees of Sensible Lambda Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:1, pp:45-55 [Journal]
  112. Jan A. Bergstra, Alban Ponse
    Bochvar-McCarthy Logic and Process Algebra. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1998, v:39, n:4, pp:464-484 [Journal]
  113. Jan A. Bergstra, Paul Klint
    The Discrete Time TOOLBUS - A Software Coordination Architecture. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:31, n:2-3, pp:205-229 [Journal]
  114. Jan A. Bergstra, J. V. Tucker
    Top-Down Design and the Algebra of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1985, v:5, n:2, pp:171-199 [Journal]
  115. Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse
    Grid Protocols Based on Synchronous Communication. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1997, v:29, n:1-2, pp:199-233 [Journal]
  116. Jan A. Bergstra, Paul Klint
    About "trivial" software patents: The IsNot case. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:64, n:3, pp:264-285 [Journal]
  117. Jan A. Bergstra
    Letter from the editor. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:65, n:1, pp:- [Journal]
  118. Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
    Readies and Failures in the Algebra of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1134-1177 [Journal]
  119. Jan A. Bergstra, J. V. Tucker
    Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:366-387 [Journal]
  120. Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens
    Recursive Assertions are not enough - or are they? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:73-87 [Journal]
  121. Jos C. M. Baeten, Jan A. Bergstra
    Recursive Process Definitions with the State Operator. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:2, pp:285-302 [Journal]
  122. Jos C. M. Baeten, Jan A. Bergstra
    Process Algebra with Propositional Signals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:177, n:2, pp:381-405 [Journal]
  123. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    On the Consistency of Koomen's Fair Abstraction Rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:129-176 [Journal]
  124. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
    Term-Rewriting Systems with Rule Priorities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:283-301 [Journal]
  125. J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
    Linear Time and Branching Time Semantics for Recursion with Merge. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:135-156 [Journal]
  126. Jan A. Bergstra, Inge Bethke
    Polarized process algebra with reactive composition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:3, pp:285-304 [Journal]
  127. Jan A. Bergstra, Jan Heering
    Which Data Types have omega-complete Initial Algebra Specifications? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:124, n:1, pp:149-168 [Journal]
  128. Jan A. Bergstra, Jan Willem Klop
    Church-Rosser Strategies in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:27-38 [Journal]
  129. Jan A. Bergstra, Jan Willem Klop
    Invertible Terms in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:19-37 [Journal]
  130. Jan A. Bergstra, Jan Willem Klop
    Proving Program Inclusion Using Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:30, n:, pp:1-48 [Journal]
  131. Jan A. Bergstra, Jan Willem Klop
    Algebra of Communicating Processes with Abstraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:37, n:, pp:77-121 [Journal]
  132. Jan A. Bergstra, C. A. Middelburg
    Process algebra for hybrid systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:215-280 [Journal]
  133. Jan A. Bergstra, John-Jules Ch. Meyer
    On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:269-279 [Journal]
  134. Jan A. Bergstra, Alban Ponse
    Non-regular iterators in process algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:269, n:1-2, pp:203-229 [Journal]
  135. Jan A. Bergstra, Alban Ponse, Mark van der Zwaag
    Branching time and orthogonal bisimulation equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:309, n:1-3, pp:313-355 [Journal]
  136. Jan A. Bergstra, J. V. Tucker
    Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:303-315 [Journal]
  137. Jan A. Bergstra, J. V. Tucker
    Hoare's Logic and Peano's Arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:265-284 [Journal]
  138. Jan A. Bergstra, J. V. Tucker
    Hoare's Logic for Programming Languages with two Data Types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:28, n:, pp:215-221 [Journal]
  139. Jan A. Bergstra, J. V. Tucker
    Algebraic Specifications of Computable and Semicomputable Data Types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:50, n:, pp:137-181 [Journal]
  140. Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker
    Floyds Principle, Correctness Theories and Program Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:113-149 [Journal]
  141. Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering
    Toward a Complete Transformational Toolkit for Compilers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:5, pp:639-684 [Journal]
  142. Jan A. Bergstra, Inge Bethke, Alban Ponse
    Decision problems for pushdown threads. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:2, pp:75-90 [Journal]
  143. Jan A. Bergstra, Alban Ponse
    Interface groups and financial transfer architectures [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  144. Jan A. Bergstra, Inge Bethke, Mark Burgess
    A process algebra based framework for promise theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  145. Jan A. Bergstra, Alban Ponse
    Projection semantics for rigid loops [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  146. Jan A. Bergstra, C. A. Middelburg
    Preferential choice and coordination conditions. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:70, n:2, pp:172-200 [Journal]
  147. Jan A. Bergstra, C. A. Middelburg
    A Thread Algebra with Multi-Level Strategic Interleaving. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:1, pp:3-32 [Journal]

  148. Discrete time process algebra with silent step. [Citation Graph (, )][DBLP]


  149. Fields, Meadows and Abstract Data Types. [Citation Graph (, )][DBLP]


  150. Regular extensions of iterative algebras and metric interpretations. [Citation Graph (, )][DBLP]


  151. Transmission Protocols for Instruction Streams. [Citation Graph (, )][DBLP]


  152. Synchronous cooperation for explicit multi-threading. [Citation Graph (, )][DBLP]


  153. Machine structure oriented control code logic. [Citation Graph (, )][DBLP]


  154. Machine structure oriented control code logic [Citation Graph (, )][DBLP]


  155. A thread calculus with molecular dynamics [Citation Graph (, )][DBLP]


  156. Instruction sequences with indirect jumps [Citation Graph (, )][DBLP]


  157. An interface group for process components [Citation Graph (, )][DBLP]


  158. On the operating unit size of load/store architectures [Citation Graph (, )][DBLP]


  159. Instruction Sequences with Dynamically Instantiated Instructions [Citation Graph (, )][DBLP]


  160. Program algebra with a jump-shift instruction [Citation Graph (, )][DBLP]


  161. Tuplix Calculus [Citation Graph (, )][DBLP]


  162. Programming an interpreter using molecular dynamics [Citation Graph (, )][DBLP]


  163. Thread extraction for polyadic instruction sequences [Citation Graph (, )][DBLP]


  164. Towards a formalization of budgets [Citation Graph (, )][DBLP]


  165. Thread algebra for sequential poly-threading [Citation Graph (, )][DBLP]


  166. Data linkage algebra, data linkage dynamics, and priority rewriting [Citation Graph (, )][DBLP]


  167. Tuplix Calculus Specifications of Financial Transfer Networks [Citation Graph (, )][DBLP]


  168. Data linkage dynamics with shedding [Citation Graph (, )][DBLP]


  169. Proposition Algebra with Projective Limits [Citation Graph (, )][DBLP]


  170. Instruction sequences and non-uniform complexity theory [Citation Graph (, )][DBLP]


  171. Mechanistic Behavior of Single-Pass Instruction Sequences [Citation Graph (, )][DBLP]


  172. On the expressiveness of single-pass instruction sequences [Citation Graph (, )][DBLP]


  173. An Instruction Sequence Semigroup with Repeaters [Citation Graph (, )][DBLP]


  174. A static theory of promises [Citation Graph (, )][DBLP]


  175. Instruction sequences for the production of processes [Citation Graph (, )][DBLP]


  176. Square root meadows [Citation Graph (, )][DBLP]


  177. Timed tuplix calculus and the Wesseling and van den Berg equation [Citation Graph (, )][DBLP]


  178. Meadow Enriched ACP Process Algebras [Citation Graph (, )][DBLP]


  179. Transmission protocols for instruction streams [Citation Graph (, )][DBLP]


  180. An Instruction Sequence Semigroup with Involutive Anti-Automorphisms [Citation Graph (, )][DBLP]


  181. A process calculus with finitary comprehended terms [Citation Graph (, )][DBLP]


  182. A protocol for instruction stream processing [Citation Graph (, )][DBLP]


  183. Straight-line instruction sequence completeness for total calculation on cancellation meadows [Citation Graph (, )][DBLP]


  184. Instruction sequence notations with probabilistic instructions [Citation Graph (, )][DBLP]


  185. Indirect jumps improve instruction sequence performance [Citation Graph (, )][DBLP]


  186. A progression ring for interfaces of instruction sequences, threads, and services [Citation Graph (, )][DBLP]


  187. Arithmetical meadows [Citation Graph (, )][DBLP]


  188. Instruction sequence processing operators [Citation Graph (, )][DBLP]


  189. Functional units for natural numbers [Citation Graph (, )][DBLP]


  190. Autosolvability of halting problem instances for instruction sequences [Citation Graph (, )][DBLP]


  191. Local and Global Trust Based on the Concept of Promises [Citation Graph (, )][DBLP]


  192. On the contribution of backward jumps to instruction sequence expressiveness [Citation Graph (, )][DBLP]


  193. On the definition of a theoretical concept of an operating system [Citation Graph (, )][DBLP]


  194. Formaleuros, formalcoins and virtual monies [Citation Graph (, )][DBLP]


  195. Parallel Processes with Implicit Computational Capital. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002