A computer checked algebraic verification of a distributed summation algorithm

Abstract.We present an algebraic verification of Segall’s propagation of information with feedback algorithm and we report on the verification of the proof using the PVS system. This algorithm serves as a nice benchmark for verification exercises (see [2, 8, 17]). The verification is based on the methodology presented in [7] and demonstrates its suitability to deliver mechanically verifiable correctness proofs of highly nondeterministic distributed algorithms.

[1]  Twan Basten,et al.  A process-algebraic approach to life-cycle inheritance : inheritance = encapsulation + abstraction , 1996 .

[2]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

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

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

[5]  Rp Rob Nederpelt,et al.  Predicate calculus : concepts and misconceptions , 1996 .

[6]  Paul F. Hoogendijk,et al.  Nested collections and polytypism , 1996 .

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

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

[9]  Michel A. Reniers,et al.  A hierarchy of communication models for Message Sequence Charts , 1997, Sci. Comput. Program..

[10]  Dieter K. Hammer,et al.  Distributed real-time systems : a survey of applications and a general design model , 1997 .

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

[12]  John Rushby,et al.  User guide for the pvs specification and verification system (beta release) , 1991 .

[13]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[14]  Jan A. Bergstra,et al.  Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time , 1997, Fundam. Informaticae.

[15]  Jcm Jos Baeten,et al.  Discrete-time process algebra with empty process , 1997 .

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

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

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

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

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

[21]  Jan A. Bergstra,et al.  Bounded Stacks, Bags and Queues , 1997, CONCUR.

[22]  Wim H. Hesselink,et al.  A mechanical proof of Segall's PIF algorithm , 1997, Formal Aspects of Computing.

[23]  Herman Geuvers,et al.  Explicit substitution : on the edge of strong normalisation , 1996 .

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

[25]  Fairouz Kamareddine,et al.  AUTOMATH and pure type systems , 1996 .

[26]  Jan Friso Groote,et al.  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[27]  Frits Vaandrager.  Verification of a Distributed Summation Algorithm , 1995, CONCUR.

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

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

[30]  Jan Friso Groote,et al.  Focus points and convergent process operators: a proof strategy for protocol verification , 2001, J. Log. Algebraic Methods Program..

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

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

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

[34]  Natarajan Shankar,et al.  Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

[35]  Hans Weigand,et al.  A formal specification of deadlines using dynamic deontic logic , 1996 .

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

[37]  Jan Friso Groote,et al.  A note on n similar process , 1997 .

[38]  Reniers,et al.  Completeness in discrete-time process algebra , 1996 .

[39]  Jan Friso Groote,et al.  The parallel composition of uniform processes with data , 2001, Theor. Comput. Sci..

[40]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

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

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

[43]  Michel A. Reniers,et al.  Static semantics of message sequence charts , 1996 .

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

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

[46]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.