Verification of a Distributed Cache Memory by Using Abstractions

The purpose of this paper is to verify a distributed cache memory system by using the following general verification method: verify the properties characterizing a complex system on some small finite abstraction of it, obtained as a composition of abstractions of each component of the system. For a large class of systems including infinite state systems, the abstractions of the components can be obtained by replacing all operators on concrete domains by abstract operators on some abstract domain. This holds also for the abstraction of the control part of the system as we consider a kind of guarded command programs where all the control is expressed in terms of operations on explicit control variables.

[1]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[2]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[3]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[4]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[5]  Amir Pnueli,et al.  Specification and Development of Reactive Systems (Invited Paper) , 1986, IFIP Congress.

[6]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[7]  Robert P. Kurshan,et al.  Analysis of Discrete Event Coordination , 1989, REX Workshop.

[8]  D. E. Long,et al.  Model checking and abstraction , 1992, POPL '92.

[9]  Edmund M. Clarke,et al.  Model checking, abstraction, and compositional verification , 1993 .

[10]  Claire Loiseaux,et al.  A Tool for Symbolic Program Verification and Abstration , 1993, CAV.

[11]  Yehuda Afek,et al.  Lazy caching , 1993, TOPL.

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

[13]  Claire Loiseaux.  Verification symbolique de programmes reactifs a l'aide d'abstractions , 1994 .

[14]  Amir Pnueli,et al.  Verifying sequentially consistent memory , 1994 .

[15]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..