Separating fairness and well-foundedness for the analysis of fair discrete systems

Authors:
Amir Pnueli;Andreas Podelski;Andrey Rybalchenko
Affiliations:
New York University, New York;Max-Planck-Institut für Informatik, Saarbrücken;Max-Planck-Institut für Informatik, Saarbrücken
Venue:
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2005

Citing 14
Cited 9

Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Progress measures and stack assertions for fair termination

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
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
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Partial Completeness of Abstract Fixpoint Checking

SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Algorithmic Verification of Linear Temporal Logic Specifications

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Transition Invariants

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
Software model checking

ACM Computing Surveys (CSUR)
All you need is compassion

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
The localization reduction and counterexample-guided abstraction refinement

Time for verification
Proving program termination

Communications of the ACM
An abstract interpretation framework for termination

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving liveness by backwards reachability

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Explicit fair scheduling for dynamic control

Concurrency, Compositionality, and Correctness
Fairness for dynamic control

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete systems involves a non-trivial interplay between fairness and well-foundedness (ranking functions). This interplay has been an obstacle for automation. The contribution of this paper is a new analysis of temporal properties of FDSs. The analysis uses a domain of binary relations over states labeled by sets of indices of fairness requirements. The use of labeled relations separates the reasoning on well-foundedness and fairness.