Issue No.04 - April (2007 vol.56)
Alper Sen , IEEE
Vijay K. Garg , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.1011
Concurrent and distributed systems, such as System-on-Chips (SoCs), present an immense challenge for verification due to their complexity and inherent concurrency. Traditional approaches for eliminating errors in concurrent and distributed systems include formal methods and simulation. We present an approach toward combining formal methods and simulation in a technique called Predicate Detection (aka Runtime Verification), while avoiding the complexity of formal methods and the pitfalls of ad hoc simulation. Our technique enables efficient formal verification on execution traces of actual scalable systems. Traditional simulation methodologies are woefully inadequate in the presence of concurrency and subtle synchronization. The bug in the system may appear only when the ordering of concurrent events is different from the ordering in the simulation trace. We use a Partial Order Trace Model rather than the traditional total order trace model and we get the benefit of properly dealing with concurrent events and especially of detecting errors from analyzing successful total order traces. Surprisingly, checking properties, even on a finite partial order trace, is NP-complete in the size of the trace description (aka state-explosion problem). Our approach to ameliorating state explosion in partial order trace model uses two techniques: 1) slicing and 2) exploiting the structure of the property itself—by imposing restrictions—to evaluate its value efficiently for a given execution trace. Intuitively, the slice of a trace with respect to a property is a subtrace that contains all of the global states of the trace that satisfy the property such that it is computed efficiently (without traversing the state space) and represented concisely (without explicit representation of individual states). We present temporal slicing algorithms with respect to properties in temporal logic RCTL+. We show how to use the slicing algorithms for efficient predicate detection of design properties. We have developed a prototype system, Partial Order Trace Analyzer (POTA), which implements our algorithms. We verify several scalable and industrial protocols, including CORBA's General Inter-ORB Protocol, PCI-based System-on-Chip, ISO's Asynchronous Transfer Mode Ring, cache coherence, and mutual exclusion. Our experimental results indicate that slicing can lead to exponential reduction over existing techniques, such as the ones in SPIN model checker, both in time and space.
Simulation, formal verification, runtime verification, temporal logic, partial order, lattice theory.
Alper Sen, Vijay K. Garg, "Formal Verification of Simulation Traces Using Computation Slicing", IEEE Transactions on Computers, vol.56, no. 4, pp. 511-527, April 2007, doi:10.1109/TC.2007.1011