Proving liveness property under strengthened compassion requirements

Authors:
Teng Long;Wenhui Zhang
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China,School of Information Science and Engineering, Graduate University of China Academy of ...;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Year:
2012

Citing 14
Cited 0

Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Complete proof rules for strong fairness and strong extreme fairness

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Verification by augmented finitary abstraction

Information and Computation
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
On the extremely fair treatment of probabilistic algorithms

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Proving the Correctness of Multiprocess Programs

IEEE Transactions on Software Engineering
PAT: Towards Flexible Verification under Fairness

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
All you need is compassion

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Temporal verification of reactive systems: response

Time for verification
Auxiliary constructs for proving liveness in compassion discrete systems

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Self-stabilizing leader election in networks of finite-state anonymous agents

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing population protocols

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Proving the refuted: symbolic model checkers as proof generators

Concurrency, Compositionality, and Correctness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deductive rules are useful for proving properties with fairness constraints and there have been many studies on such rules with justice and compassion constraints. This paper focuses on system specifications with strengthened compassion that impose constraints on transitions involving states and their successors. A deductive rule for proving liveness properties under strengthened compassion is presented, and proofs of the soundness and the relative completeness of the rule are also presented.