The &mgr;-calculus as an assertion-language for fairness arguments
Information and Computation
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Verification by augmented finitary abstraction
Information and Computation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Generalized Temporal Verification Diagrams
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Practical Methods for Proving Program Termination
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving that programs eventually do something good
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Bridging the gap between fair simulation and trace inclusion
Information and Computation
Separating fairness and well-foundedness for the analysis of fair discrete systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linear ranking with reachability
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Abstraction refinement for termination
SAS'05 Proceedings of the 12th international conference on Static Analysis
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Auxiliary constructs for proving liveness in compassion discrete systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A proof-based approach to verifying reachability properties
Proceedings of the 2011 ACM Symposium on Applied Computing
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
A dash of fairness for compositional reasoning
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Proving the refuted: symbolic model checkers as proof generators
Concurrency, Compositionality, and Correctness
Proving liveness property under strengthened compassion requirements
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
The paper presents a new deductive rule for verifying response properties under the assumption of compassion (strong fairness) requirements. It improves on previous rules in that the premises of the new rule are all first order.We prove that the rule is sound, and present a constructive completeness proof for the case of finite-state systems. For the general case, we present a sketch of a relative completeness proof. We report about the implementation of the rule in PVS and illustrate its application on some simple but non-trivial examples.