Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
From model checking to a temporal proof
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Model Checking
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Lifting Temporal Proofs through Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
From Falsification to Verification
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Proceedings of the Conference on Logic of Programs
From complementation to certification
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Liveness with invisible ranking
International Journal on Software Tools for Technology Transfer (STTT)
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Shape analysis by augmentation, abstraction, and transformation
Shape analysis by augmentation, abstraction, and transformation
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
Proving liveness property under strengthened compassion requirements
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
The paper presents an automatic method to derive a deductive proof of response properties from symbolic model checking. The method is based on a new proof rule for response properties that deals directly with compassion (strong fairness). The method can be applied to infinite-state systems. In particular, model checking of response of (predicate- and ranking-) abstracted heap programs is automatically transformed into a deductive proof for the concrete heap system. All examples presented in the paper were run in tlv.