Checking Verifications of Protocols and Distributed Systems by Computer

We provide a treatise about checking proofs of distributed systems by computer using general purpose proof checkers. In particular, we present two approaches to verifying and checking the verification of the Sequential Line Interface Protocol (SLIP), one using rewriting techniques and one using the so-called cones and foci theorem. Finally, we present an overview of literature containing checked proofs.

[1]  Nancy A. Lynch,et al.  Concurrent Timestamping Made Simple , 1992, ISTCS.

[2]  Misao Nagayama,et al.  An NQTHM mechanization of An Exercise in the Verification of Multi-Process Programs , 1991 .

[3]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[4]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[5]  Jozef Hooman,et al.  Assertional Specification and Verification Using PVS of the Steam Boiler Control System , 1995, Formal Methods for Industrial Applications.

[6]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

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

[8]  Lawrence C. Paulson,et al.  Inductive analysis of the Internet protocol TLS , 1999, TSEC.

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

[10]  Mgj Franssen,et al.  Tools for the construction of correct programs : an overview , 1997 .

[11]  Jjm Jozef Hooman,et al.  A programming-language extension for distributed real-time systems , 1997 .

[12]  W. D. Young,et al.  Verifying the Interactive Convergence Clock Synchronization algorithm Using the Boyer-Moore Theorem Prover , 1992 .

[13]  Nir Shavit,et al.  Bounded Concurrent Time-Stamping , 1997, SIAM J. Comput..

[14]  Willem Griffioen.  Proof-checking an audio control protocol with LP , 1995 .

[15]  M. Voorhoeve.  Structural Petri net equivalence , 1996 .

[16]  William D. Young.  Comparing Verification Systems: Interactive Consistency in ACL2 , 1997, IEEE Trans. Software Eng..

[17]  Roland Carl Backhouse,et al.  Calculating a Round-Robin Scheduler , 1998, MPC.

[18]  Tobias Nipkow,et al.  Traces of I/O-Automata in Isabelle/HOLCF , 1997, TAPSOFT.

[19]  van Km Kees Hee,et al.  An analytical method for assessing business processes , 1998 .

[20]  Roland Carl Backhouse,et al.  Deriving a systolic regular language recognizer , 1997, Algorithmic Languages and Calculi.

[21]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[22]  Alban Ponse,et al.  Translating a process algebra with symbolic data values to linear format , 1995 .

[23]  John Rushby,et al.  Formal Verification of a Fault Tolerant Clock Synchronization Algorithm , 1989 .

[24]  Giampaolo Bella.  Using Isabelle to Prove Properties of the Kerberos Authentication System , 1997 .

[25]  Vaj Tijn Borghuis.  Priorean tense logics in modal pure type systems , 1996 .

[26]  Gjpm Geert-Jan Houben,et al.  Designing effective workflow management processes , 1996 .

[27]  Wil M. P. van der Aalst,et al.  Formalization and verification of event-driven process chains , 1999, Inf. Softw. Technol..

[28]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[29]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[30]  Myla Archer,et al.  Mechanical verification of timed automata: a case study , 1996, Proceedings Real-Time Technology and Applications.

[31]  Lmg Loe Feijs.  Algebraic specification and simulation of lazy functional programs in a concurrent environment , 1996 .

[32]  Jozef Hooman.  Verifying Part of the ACCESS.bus Protocol Using PVS , 1995, FSTTCS.

[33]  Atm Ad Aerts,et al.  Multi-user publishing in the Web: DReSS, a Document Repository Service Station , 1996 .

[34]  Fairouz Kamareddine,et al.  A correspondence between Nuprl and the Ramified Theory of Types , 1996 .

[35]  Jan A. Bergstra,et al.  Deadlock Behaviour in Split and ST Bisimulation Semantics , 1998, EXPRESS.

[36]  Tobias Nipkow,et al.  I/Q Automata in Isabelle/HOL , 1994, TYPES.

[37]  A. T. M. Aerts,et al.  OODB Support for WWW Applications: Disclosing the internal structure of Hyperdocuments , 1996, WebNet.

[38]  Natarajan Shankar.  Mechanical Verification of a Generalized Protocol for Byzantine Fault Tolerant Clock Synchronization , 1992, FTRTFT.

[39]  Nicolas Halbwachs,et al.  Automatic verification of parameterized linear networks of processes , 1997, POPL '97.

[40]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[41]  Eduardo Giménez,et al.  An Application of Co-inductive Types in Coq: Verification of the Alternating Bit Protocol , 1995, TYPES.

[42]  W.M.P. van der Aalst,et al.  Structural characterizations of sound workflow nets , 1996 .

[43]  J. Strother Moore,et al.  An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

[44]  Nancy A. Lynch,et al.  Computer-Assisted Simulation Proofs , 1993, CAV.

[45]  P.D.V. van der Stok,et al.  Real-time distributed concurrency control algorithms with mixed time constraints , 1996 .

[46]  Leslie Lamport,et al.  Mechanical Verification of Concurrent Systems with TLA , 1992, Larch.

[47]  Nancy A. Lynch,et al.  The generalized railroad crossing: a case study in formal verification of real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[48]  Joakim von Wright,et al.  Using a Theorem Prover for Reasoning about Concurrent Algorithms , 1992, CAV.

[49]  Jozef Hooman,et al.  Process Algebra in PVS , 1999, TACAS.

[50]  Michael J. Ferguson,et al.  A TLA Solution to the Specification and Verification of the RLP1 Retransmission Protocol , 1997, FME.

[51]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[52]  van der Wmp Wil Aalst,et al.  Conservative adaption of workflow , 1996, PAKM.

[53]  Jozef Hooman.  Verification of Distributed Real-Time and Fault-Tolerant Protocols , 1997, AMAST.

[54]  Frits W. Vaandrager,et al.  Proof-Checking a Data Link Protocol , 1994, TYPES.

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

[56]  Nancy A. Lynch,et al.  Verifying timing properties of concurrent algorithms , 1994, FORTE.

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

[58]  Hassen Saïdi,et al.  Abstraction of parameterized networks , 1997, INFINITY.

[59]  R. T. Gerth,et al.  A discretisation method for asynchronous timed systems , 1997 .

[60]  Pierre Lescanne,et al.  Formal Verfication of a Protocol for Communications over Faulty Channels , 1995, FORTE.

[61]  Amy P. Felty,et al.  Formalizing Inductive Proofs of Network Algorithms , 1995, ASIAN.

[62]  P. M. Melliar-Smith,et al.  Synchronizing clocks in the presence of faults , 1985, JACM.

[63]  Natarajan Shankar,et al.  Experiments in Theorem Proving and Model Checking for Protocol Verification , 1996, FME.

[64]  W.M.P. van der Aalst,et al.  Parallel computation of reachable dead states in a free-choice Petri net , 1996 .

[65]  Frits W. Vaandrager,et al.  Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394 , 2000, Formal Methods Syst. Des..

[66]  Boutheina Chetali.  Formal Verification of Concurrent Programs Using the Larch Prover , 1998, IEEE Trans. Software Eng..

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

[68]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[69]  Jan Friso Groote,et al.  RAPPORT Waitfree Distributed Memory Management by Create , and Read Until Deletion ( CRUD ) , 1999 .

[70]  Myla Archer,et al.  Verifying Hybrid Systems Modeled as Timed Automata: A Case Study , 1997, HART.

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

[72]  M. M. Ayadi,et al.  On the formal verification of delegation in SESAME , 1997, Proceedings of COMPASS '97: 12th Annual Conference on Computer Assurance.

[73]  J. S. Moore,et al.  ACL2: an industrial strength version of Nqthm , 1996, Proceedings of 11th Annual Conference on Computer Assurance. COMPASS '96.

[74]  Sentot Kromodimoeljo,et al.  EVES: An Overview , 1991, VDM Europe.

[75]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[76]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[77]  Moore J. Strother.  A Formal Model of Asynchronous Communication and Its Use in Mechanically Verifying a Biphase Mark Protocol , 1992 .

[78]  Lawrence C. Paulson.  On two formal analyses of the Yahalom protocol , 1997 .

[79]  Nancy A. Lynch,et al.  Proving Safety Properties of the Steam Boiler Controller , 1995, Formal Methods for Industrial Applications.

[80]  David M. Goldschlag,et al.  Mechanically Verifying Concurrent Programs with the Boyer-Moore Prover , 1990, IEEE Trans. Software Eng..

[81]  Patrick Lincoln,et al.  The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model , 1993, CAV.

[82]  W. D. Young.  Modeling and Veriication of a Simple Real-time Railroad Gate Controller , 1995 .

[83]  Paul Loewenstein.  Verification of a multiprocessor cache protocol using simulation relations and higher-order logic , 1992, Formal Methods Syst. Des..

[84]  Wil M. P. van der Aalst,et al.  Life-Cycle Inheritance: A Petri-Net-Based Approach , 1997, ICATPN.

[85]  Tobias Nipkow,et al.  Combining Model Checking and Deduction for I/O-Automata , 1995, TACAS.

[86]  Nancy A. Lynch,et al.  Computer-Assisted Verification of an Algorithm for Concurrent Timestamps , 1996, FORTE.

[87]  Natarajan Shankar,et al.  Verification of Real-Time Systems Using PVS , 1993, CAV.

[88]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[89]  Henri Korver Alex Sellink.  On Automating Process Algebra Proofs , 1996 .

[90]  Leslie Lamport,et al.  Verification of a Multiplier: 64 Bits and Beyond , 1993, CAV.

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

[92]  Jan Friso Groote,et al.  A Formal Verification of the Alternating Bit Protocol in the Calculus of Constructions , 1993 .

[93]  G. J. Akkerman,et al.  Term rewriting analysis in process algebra , 1990 .