Fairness
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Interleaving set temporal logic
Theoretical Computer Science
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Proving partial order properties
Theoretical Computer Science
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Refinement with global equivalence proofs in temporal logic
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Subtypes for Specifications: Predicate Subtyping in PVS
IEEE Transactions on Software Engineering
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Using Timestamping and History Variables to Verify Sequential Consistency
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
A proof-theoretic mechanized verification environment that allows taking advantage of the "convenient computations" method is presented. The PVS theories encapsulating this method reduce the conceptual difficulty of proving a safety or liveness property for all the possible interleavings of a parallel computation by separating two different concerns: proving that certain convenient computations satisfy the property, and proving that every computation is related to a convenient one by a relation which preserves the property. We define one such relation, the equivalence of computations which differ only in the order of independent operations. We also introduce the computation as an explicit semantic object. The application of the method requires the definition of a "measure" function from computations into a well-founded set. We supply two possible default measures, which can be applied in many cases, together with examples of their use. The work is done in PV S, and a clear separation is made between "infrastructural" theories to be supplied as a proof environment library to users, and the specification and proof of particular examples.