Finding satisfying global states: all for one and one for all

Mittal, Neeraj; Şen, Alper; Garg, Vijay K.; Atreya, Ranganath

doi:10.1109/ipdps.2004.1302994

Cited by 4 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we will present an approach for event structure slice computing. The slicing algorithm for a prime event structure or its with respect to regular predicates is based on the Adding Edges Theorem (see [8,20,31,33]).…”

Section: Slicing Reduction Algorithmmentioning

confidence: 99%

Unified Mathematical Framework for Slicing and Symmetry Reduction over Event Structures

Gao

Ding

Liu

et al. 2014

Journal of Applied Mathematics

View full text Add to dashboard Cite

Nonclassical slicing and symmetry reduction can act as efficient structural abstract methods for pruning state space when dealing with verification problems. In this paper, we mainly address theoretical and algorithmic aspects for nonclassical slicing and symmetry reduction over prime event structures. We propose sliced and symmetric quotient reduction models of event structures and present their corresponding algorithms. To construct the underlying foundation of the proposed methodologies, we introduce strong and weak conflict concepts and a pair of mutually inverse operators and extend permutation group based symmetry notion of event structures. We have established a unified mathematical framework for slicing and symmetry reduction, and further investigated the translation, isomorphism, and equivalence relationship and other related basic facts from a theoretical point of view. The framework may provide useful guidance and theoretical exploration for overcoming verification challenges. This paper also demonstrates their practical applications by two cases.

show abstract

Section: Slicing Reduction Algorithmmentioning

confidence: 99%

Unified Mathematical Framework for Slicing and Symmetry Reduction over Event Structures

Gao

Ding

Liu

et al. 2014

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

Techniques and applications of computation slicing

Mittal

Garg

2005

Distrib. Comput.

View full text Add to dashboard Cite

Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, especially those employed in safety-critical environments, should be able to operate properly even in the presence of software faults. Monitoring the execution of a distributed system, and, on detecting a fault, initiating the appropriate corrective action is an important way to tolerate such faults. This gives rise to the predicate detection problem which requires finding a consistent cut of a given computation exists that satisfies a given global predicate, if it exists.Detecting a predicate in a computation is, however, an NP-complete problem in general. In order to ameliorate the associated combinatorial explosion problem, we introduce the notion of computation slice. Formally, the slice of a computation with respect to a predicate is a (sub)computation with the least number of consistent cuts that contains all consistent cuts of the computation satisfying the predicate. Intuitively, slice is a concise representation of those consistent cuts of a computation that satisfy a certain condition. To detect a predicate, rather than searching the state-space of the computation, it is much more efficient to search the statespace of the slice.We prove that the slice exists and is uniquely defined for all predicates. We present efficient algorithms for computing the slice for several useful classes of predicates. We establish that the problem of computing the slice for an arbitrary predicate is NP-complete in general. We develop efficient heuristic algorithms for computing an approximate slice for such predicates for which computing the slice is otherwise provably intractable. Our experimental results demonstrate that slicing can lead to an exponential improvement over existing techniques for predicate detection in terms of time and space.

show abstract