Auxiliary constructs for proving liveness in compassion discrete systems

Authors:
Teng Long;Wenhui Zhang
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China and School of Information Science and Engineering, Graduate University of China Academy ...;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Year:
2010

Citing 9
Cited 1

Modalities for model checking: branching time logic strikes back

Science of Computer Programming
Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Verification by augmented finitary abstraction

Information and Computation
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Verification by Augmented abstraction: the automata---theoretic view

Journal of Computer and System Sciences
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Parameterized Verification with Automatically Computed Inductive Assertions

CAV '01 Proceedings of the 13th 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
Ranking abstraction as companion to predicate abstraction

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Proving liveness property under strengthened compassion requirements

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For proving response properties in systems with compassion requirements, a deductive rule is introduced in [1]. In order to use the rule, auxiliary constructs are needed. They include helpful assertions and ranking functions defined on a well-founded domain. The work in [2]computes ranking functions for response properties in systems with justice requirements. This paper presents an approach which extends the work in [2] with compassion requirements. The approach is illustrated on two examples of sequential and concurrent programs.