Infinite-state Stochastic and Parameterized Systems

A major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such ...

[1]  Robert K. Brayton,et al.  Model-checking continuous-time Markov chains , 2000, TOCL.

[2]  Karsten Stahl,et al.  Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness , 2002, VMCAI.

[3]  Parosh Aziz Abdulla,et al.  Regular Model Checking Made Simple and Efficient , 2002, CONCUR.

[4]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[5]  Alain Finkel,et al.  Decidability of the termination problem for completely specified protocols , 1994, Distributed Computing.

[6]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[7]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[8]  Eugene S. Santos,et al.  Probabilistic Turing machines and computability , 1969 .

[9]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[10]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[12]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[13]  Parosh Aziz Abdulla,et al.  Parameterized Verification of Infinite-State Processes with Global Conditions , 2007, CAV.

[14]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

[15]  Thomas A. Henzinger,et al.  Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[16]  Christel Baier,et al.  Automated Performance and Dependability Evaluation Using Model Checking , 2002, Performance.

[17]  Y. S. Ramakrishna,et al.  An efficient meta-lock for implementing ubiquitous synchronization , 1999, OOPSLA '99.

[18]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[19]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[20]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[21]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[22]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[23]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[24]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

[25]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[26]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[27]  Manuel Silva Suárez,et al.  Petri nets and flexible manufacturing , 1988, European Workshop on Applications and Theory in Petri Nets.

[28]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[29]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[30]  Marta Z. Kwiatkowska,et al.  Probabilistic model checking in practice: case studies with PRISM , 2005, PERV.

[31]  Javier Esparza,et al.  Quantitative analysis of probabilistic pushdown automata: expectations and variances , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

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

[33]  Joost-Pieter Katoen,et al.  Discrete-Time Rewards Model-Checked , 2003, FORMATS.

[34]  Helmut Veith,et al.  Environment Abstraction for Parameterized Verification , 2006, VMCAI.

[35]  Alexander Moshe Rabinovich,et al.  Quantitative Analysis of Probabilistic Lossy Channel Systems , 2003, ICALP.

[36]  Christel Baier,et al.  Model-Checking Algorithms for , 2003 .

[37]  T. Kanade.  Model-Based Testing of Reactive Systems , 2005 .

[38]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

[39]  Jim Handy,et al.  The cache memory book , 1993 .

[40]  Christel Baier,et al.  Model checking action- and state-labelled Markov chains , 2004, International Conference on Dependable Systems and Networks, 2004.

[41]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[42]  Tomás Brázdil,et al.  Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains , 2005, FSTTCS.

[43]  Parosh Aziz Abdulla,et al.  Undecidable Verification Problems for Programs with Unreliable Channels , 1994, Inf. Comput..

[44]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[45]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[46]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

[47]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[48]  Amir Pnueli,et al.  Parameterized Verification with Automatically Computed Inductive Assertions , 2001, CAV.

[49]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[50]  Kousha Etessami,et al.  Verifying Probabilistic Procedural Programs , 2004, FSTTCS.

[51]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[52]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.

[53]  Kousha Etessami,et al.  Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.

[54]  Parosh Aziz Abdulla,et al.  Reasoning about Probabilistic Lossy Channel Systems , 2000, CONCUR.

[55]  Kousha Etessami,et al.  Algorithmic Verification of Recursive Probabilistic State Machines , 2005, TACAS.

[56]  Amir Pnueli,et al.  Model checking and abstraction to the aid of parameterized systems (a survey) , 2004, Comput. Lang. Syst. Struct..

[57]  Vineet Kahlon,et al.  Exact and Efficient Verification of Parameterized Cache Coherence Protocols , 2003, CHARME.

[58]  Robert K. Brayton,et al.  Partial-Order Reduction in Symbolic State-Space Exploration , 2001, Formal Methods Syst. Des..

[59]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[60]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[61]  S. Hart,et al.  Termination of Probabilistic Concurrent Programs. , 1982 .

[62]  Bernhard Steffen,et al.  Compositional Minimization of Finite State Systems , 1990, CAV.

[63]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[64]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[65]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[66]  Parosh Aziz Abdulla,et al.  Deciding Monotonic Games , 2003, CSL.

[67]  P. Stănică.  GOOD LOWER AND UPPER BOUNDS ON BINOMIAL COEFFICIENTS , 2001 .

[68]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[69]  Giorgio Delzanno.  Verification of Consistency Protocols via Infinite-state Symbolic Model Checking - A Case Study , 2000 .

[70]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real Time Systems , 1991 .

[71]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[72]  Parosh Aziz Abdulla,et al.  Tree regular model checking: A simulation-based approach , 2006, J. Log. Algebraic Methods Program..

[73]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[74]  Parosh Aziz Abdulla,et al.  Ensuring completeness of symbolic verification methods for infinite-state systems , 2001, Theor. Comput. Sci..

[75]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[76]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 2005, Distributed Computing.

[77]  Edmund M. Clarke.  Automatic Verification of Finite-state Concurrent Systems , 1994, Application and Theory of Petri Nets.

[78]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[79]  I. V. Ramakrishnan,et al.  Automated Inductive Verification of Parameterized Protocols , 2001, CAV.

[80]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[81]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[82]  Javier Esparza,et al.  Model checking probabilistic pushdown automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[83]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[84]  Ahmed Bouajjani,et al.  Abstract Regular Model Checking , 2004, CAV.

[85]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[86]  Kousha Etessami,et al.  Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games , 2006, STACS.

[87]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[88]  S. Purushothaman Iyer,et al.  Probabilistic Lossy Channel Systems , 1997, TAPSOFT.

[89]  Christel Baier,et al.  Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties , 2005, TOCL.

[90]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[91]  N. Metropolis,et al.  The Monte Carlo method. , 1949 .

[92]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[93]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[94]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.