Temporal verification with transition invariants

[1]  Amir Pnueli,et al.  Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems , 2005, TACAS.

[2]  Andreas Podelski,et al.  Transition predicate abstraction and fair termination , 2005, POPL '05.

[3]  Ashish Tiwari,et al.  Termination of Linear Programs , 2004, CAV.

[4]  Andreas Podelski,et al.  Transition invariants , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[5]  Andreas Podelski,et al.  A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.

[6]  Giorgio Delzanno,et al.  Constraint-Based Verification of Parameterized Cache Coherence Protocols , 2003, Formal Methods Syst. Des..

[7]  Alex Groce,et al.  Modular verification of software components in C , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[8]  Eran Yahav,et al.  Verifying Temporal Heap Properties Specified via Evolution Logic , 2003, Log. J. IGPL.

[9]  Amir Pnueli,et al.  Liveness with (0, 1, infty)-Counter Abstraction , 2002, CAV.

[10]  Henny B. Sipma,et al.  Practical Methods for Proving Program Termination , 2002, CAV.

[11]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 2002, TOPL.

[12]  Andreas Podelski,et al.  Relative Completeness of Abstraction Refinement for Software Model Checking , 2002, TACAS.

[13]  Thomas A. Henzinger,et al.  Lazy abstraction , 2002, POPL '02.

[14]  Amir Pnueli,et al.  Verification by Augmented Abstraction: The Automata-Theoretic View , 2001, J. Comput. Syst. Sci..

[15]  Henny B. Sipma,et al.  Synthesis of Linear Ranking Functions , 2001, TACAS.

[16]  Amir Pnueli,et al.  Algorithmic Verification of Linear Temporal Logic Specifications , 1998, ICALP.

[17]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[18]  Henny B. Sipma,et al.  Deductive Model Checking , 1996, Formal Methods Syst. Des..

[19]  Moshe Y. Vardi.  Rank Predicates vs. Progress Measures in Concurrent-Program Verification , 1996, Chic. J. Theor. Comput. Sci..

[20]  Radhia Cousot,et al.  Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages) , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[21]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[22]  François Bourdoncle,et al.  Abstract debugging of higher-order imperative languages , 1993, PLDI '93.

[23]  Nils Klarlund,et al.  Progress measures and stack assertions for fair termination , 1992, PODC '92.

[24]  Moshe Y. Vardi.  Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..

[25]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Zohar Manna,et al.  Completing the Temporal Picture , 1989, Theor. Comput. Sci..

[27]  P. Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[28]  A. Schrijver.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[29]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[30]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[31]  P. Cousot,et al.  INTERPRETATION : ‘A UNIFIED LATTICE MODEL FOR STATIC ANALYSIS OF PROGRAMS BY CONSTRUCTION OR APPROXIMATION , 2022 .

[32]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[33]  Zohar Manna,et al.  Axiomatic approach to total correctness of programs , 1973, Acta Informatica.

[34]  Neil D. Jones,et al.  The size-change principle for program termination , 2001, POPL '01.

[35]  Eran Yahav,et al.  Verifying safety properties of concurrent Java programs using 3-valued logic , 2001, POPL '01.

[36]  Edmund M. Clarke,et al.  Counterexample-Guided Abstraction Refinement , 2000, CAV.

[37]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[38]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[39]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[40]  G. Golub.  Matrix computations , 1983 .

[41]  A. Pnueli,et al.  Justice and fairness: The ethics of concurrent termination , 1981 .

[42]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[43]  A. Podelski,et al.  Ëóóøûöö Ìóóð× Óö Ì Blockinòóðóóý Ìööò×××ö Ññòù× Blockinööôø Aeóº´ûûðð Ðþþòòóóôóóóð×××ñôô¹×׺ñôôºº ×øöö Blockinøº ½ Áòøöóù Blockinøøóò , 2022 .