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

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 124-139

  Pnueli, Amir ^a   Podelski, Andreas ^b   Rybalchenko, Andrey ^b  

^a NEW YORK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAM LISTINGS; CONCURRENCY CONTROL; FUNCTION EVALUATION; SET THEORY; SOFTWARE ENGINEERING;

BINARY RELATIONS; COMPUTATIONAL MODELS; CONCURRENT PROGRAMS; FAIR DISCRETE SYSTEMS (FDS);

DISCRETE TIME CONTROL SYSTEMS;

EID: 24644480733     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_9     Document Type: Conference Paper

References (23)

1. M. Colón and H. Sipma. Synthesis of linear ranking functions. In Proc. of TACAS'2001: Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 67-81. Springer, 2001.
2. P. Cousot. Partial completeness of abstract fixpoint checking. In Proc. of SARA'2000: Abstraction, Reformulation, and Approximation, volume 1864 of LNCS, pages 1-15. Springer, 2000.
3. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of POPL'1977: Principles of Programming Languages, pages 238-252. ACM Press, 1977.
4. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. of POPL'1979: Principles of Programming Languages, pages 269-282. ACM Press, 1979.
5. Y. Fang, N. Piterman, A. Pnueli, and L. D. Zuck. Liveness with incomprehensible ranking. In Proc. of TACAS'2004: Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of LNCS, pages 482-496. Springer, 2004.
6. Y. Fang, N. Piterman, A. Pnueli, and L. D. Zuck. Liveness with invisible ranking. In Steffen and Levi [21], pages 223-238.
7. C. Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
8. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In Proc. of ICALP'1998: Int. Colloq. on Automata, Languages and Programming, volume 1443 of LNCS, pages 1-16. Springer, 1998.
9. N. Klarlund. Progress measures and stack assertions for fair termination. In Proc. of PODC'1992: Principles of Distributed Computing, pages 229-240. ACM Press, 1992.
10. T. I. S. Laboratory. SICStus Prolog User's Manual. Swedish Institute of Computer Science, PO Box 1263 SE-164 29 Kista, Sweden, October 2001. Release 3.8.7.
11. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8):453-455, 1974.
12. D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In Proc. of ICALP'1981: Int. Colloq. on Automata, Languages and Programming, volume 115 of LNCS, pages 264-277. Springer, 1981.
13. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. of POPL'1985: Principles of Programming Languages, pages 97-107. ACM Press, 1985.
14. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Computer Science, 83(1):91-130, 1991.
15. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer, 1995.
16. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Progress. Draft, 1996.
17. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In Steffen and Levi [21], pages 239-251.
18. A. Podelski and A. Rybalchenko. Transition invariants. In Proc. of LICS'2004: Logic in Computer Science, pages 32-41. IEEE, 2004.
19. A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In Proc. of POPL'2005: Principles of Programming Languages. ACM Press, 2005. To appear.
20. F. P. Ramsey. On a problem of formal logic. In Proc. London Math. Soc., volume 30, pages 264-285, 1930.
21. B. Steffen and G. Levi, editors. Proc. of VMCAI'2004: Verification, Model Checking, and Abstract Interpretation, volume 2937 of LNCS. Springer, 2004.
22. A. Tiwari. Termination of linear programs. In Proc. of CAV'2004: Computer Aided Verification, volume 3114 of LNCS, pages 70-82. Springer, 2004.
23. M. Y. Vardi. Verification of concurrent programs -the automata-theoretic framework. Annals of Pure and Applied Logic, 51:79-98, 1991.