Verification Techniques for Elementary Data Types and Retransmission Protocols

[1]  Jan Friso Groote,et al.  Invariants in Process Algebra with Data , 1993, CONCUR.

[2]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism , 1984, Theor. Comput. Sci..

[3]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[4]  Frits W. Vaandrager,et al.  Modular Specifications in Process Algebra with Curious Queues , 1987, Algebraic Methods.

[5]  Joris A. Hillebrand.  The ABP and the CABP — a Comparison of Performances in Real Time Process Algebra , 1995 .

[6]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[7]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[8]  Jan A. Bergstra,et al.  Conditional axioms and α/β-calculus in process algebra , 1987, Formal Description of Programming Concepts.

[9]  Jan Friso Groote,et al.  A Bounded Retransmission Protocol for Large Data Packets , 1993, AMAST.

[10]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[11]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[14]  Sjouke Mauw,et al.  Algebraic Specification of Communication Protocols: PREFACE , 1993 .

[15]  Frits W. Vaandrager.  Verification of two communication protocols by means of process algebra , 1986 .

[16]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[17]  Jan A. Bergstra,et al.  The Completeness of the Algebraic Specification Methods for Computable Data Types , 1982, Inf. Control..

[18]  Jan Springintveld,et al.  A Computer-Checked Verification of Milner's Scheduler , 1993, TACS.

[19]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[20]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[21]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[22]  Frits W. Vaandrager,et al.  Two simple protocols , 1992 .

[23]  Amy P. Felty,et al.  The Coq proof assistant user's guide : version 5.6 , 1990 .

[24]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[25]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[26]  Jan A. Bergstra,et al.  Process Algebra with Backtracking , 1993, REX School/Symposium.

[27]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[28]  J. J. van Wamel.  Simple protocols , 1993 .

[29]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[30]  Jan A. Bergstra,et al.  Discrete Time Process Algebra , 1992, CONCUR.

[31]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[32]  Roelf J. Wieringa,et al.  Algebraic Foundations for Dynamic Conceptual Models , 1990 .

[33]  J. J. Brunekreef,et al.  On Modular Algebraic Protocol Specification , 1995 .

[34]  R. J. vanGlabbeek.  Comparative concurrency semantics and refinement of actions , 1996 .

[35]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[36]  Gertjan Kamsteeg.  A Formal Verification of the Alternating Bit Protocol in CRL , 1993 .

[37]  J. F. Groote,et al.  A Correctness Proof of the Bakery Protocol in CRL , 1994 .

[38]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[39]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[40]  Jan A. Bergstra,et al.  Process algebra: specification and verification in bisimulation semantics , 1986 .

[41]  Frits W. Vaandrager,et al.  Some observations on redundancy in a context , 1992 .

[42]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[43]  Jan Friso Groote,et al.  A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL , 1993, Comput. J..

[44]  Jan Friso Groote,et al.  Proof Theory for µCRL: A Language for Processes with Data , 1993, Semantics of Specification Languages.

[45]  Sjouke Mauw,et al.  Process algebra as a tool for the specification and verification of CIM-architectures , 1992 .

[46]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[47]  Jos van Wamel.  Process Algebra with Language Matching , 1997, Theor. Comput. Sci..

[48]  Inge Bethke,et al.  Equational Constructor Induction , 1996, Fundam. Informaticae.

[49]  J. V. Wamel.  Inductive Proofs with Sets, and some Applications in Process Algebra , 1995 .

[50]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[51]  J. C. Mulder,et al.  A modular approach to protocol verification using process algebra , 1986 .

[52]  Jan A. Bergstra,et al.  Process Algebra with Combinators , 1993, CSL.

[53]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[54]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .