Proving Partial Order Properties

@article{Peled1994ProvingPO,
  title={Proving Partial Order Properties},
  author={Doron A. Peled and Amir Pnueli},
  journal={Theor. Comput. Sci.},
  year={1994},
  volume={126},
  pages={143-182}
}
Deciding Global Partial-Order Properties
TLDR
A decision procedure for a partial order temporal logic over global states is presented and it is shown that a single until operator is sufficient for undecidability.
Ten Years of Partial Order Reduction
TLDR
This work describes partial order reduction for various logical formalisms, such as LTL, CTL and process algebras, and shows how one can combinepartial order reduction with other efficient model checking techniques.
Partial Order Reduction: Model-Checking Using Representatives
  • D. Peled
  • Computer Science, Mathematics
    MFCS
  • 1996
TLDR
This paper surveys some algorithms for partial order model-checking and focuses on the verification using representatives approach, which is extended to branching specifications.
Truly Concurrent Logic via In-Between Specification
  • Harald Fecher
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2005
Adding Partial Orders to Linear Temporal Logic
TLDR
The temporal logic BPLTL (for Branching Past Linear Temporal Logic) is introduced, based on modeling an execution as a linear sequence of global states, where each state is equipped with its past partial-order history.
Efficient model checking for LTL with partial order snapshots
Distributed Versions of Linear Time Temporal Logic: A Trace Perspective
TLDR
An overview of linear time temporal logics interpreted over traces, mainly concentrated on the satisfiability and model checking problems as well as expressiveness issues, is attempted.
A complete axiomatization of a first-order temporal logic over trace systems
TLDR
A complete axiomatization of a rst-order temporal logic over trace systems is introduced, which contains innnitary rules for temporal operators and a toy concurrent program is considered, for which a temporal semantics is provided.
Combining partial order reductions with on-the-fly model-checking
  • D. Peled
  • Computer Science
    Formal Methods Syst. Des.
  • 1996
TLDR
An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
Soundness and Completeness of an Axiom System for Program Verification
  • S. Cook
  • Computer Science
    SIAM J. Comput.
  • 1978
TLDR
The main new results are the completeness theorem, and a careful treatment of the procedure call rules for procedures with global variables in their declarations.
How to cook a temporal proof system for your pet language
TLDR
An abstract temporal proof system is presented whose program-dependent part has a high-level interface with the programming language actually studied, and is shown to be relatively complete with respect to pure first-order temporal logic.
Completing the Temporal Picture
Verification of concurrent programs: a temporal proof system
TLDR
A proof system based on temporal logic is presented for proving properties of concurrent programs based on the shared-variables computation model and derived proof principles for these classes of properties obtained and lead to a compact representation of proofs.
Verification of concurrent programs, Part I: The temporal framework
TLDR
The temporal formalism is introduced as a tool for reasoning about sequences of states and the set of interesting properties is classified into invariance (safety), eventuality (liveness, and precedence) properties.
Specifying and proving serializability in temporal logic
TLDR
A formal verification system for serializability that uses classical logic reasoning is provided and Serializability for the multiversion-timestamp algorithm is verified.
Interleaving set temporal logic
A new temporal logic and interpretation are suggested which have features from linear temporal logic, branching time temporal logic, and partial order temporal logic. The new logic can describe
...
...