Filters








2,943 Hits in 5.3 sec

Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems

Byron Cook, Heidy Khlaaf, Nir Piterman
2017 Journal of the ACM  
Until now, there have not existed automated systems that allow for the verification of such expressive CTL * properties over infinite-state systems.  ...  This paper proposes a method capable of such a task, thus introducing the first known fully automated tool for symbolically proving CTL * properties of (infinite-state) integer programs.  ...  ACKNOWLEDGMENTS We would like to thank the anonymous referees of both CAV and JACM for their work and their comments.  ... 
doi:10.1145/3060257 fatcat:mi6c6bppmjhppcuxwotu6cpywy

On Automation of CTL* Verification for Infinite-State Systems [chapter]

Byron Cook, Heidy Khlaaf, Nir Piterman
2015 Lecture Notes in Computer Science  
In this paper we introduce the first known fully automated tool for symbolically proving CTL * properties of (infinite-state) integer programs.  ...  The method uses an internal encoding which facilitates reasoning about the subtle interplay between the nesting of path and state temporal operators that occurs within CTL * proofs.  ...  Unfortunately, no fully automatic CTL * proving methods for infinite-state systems are known.  ... 
doi:10.1007/978-3-319-21690-4_2 fatcat:clpmmxh6xfetxk3mtkxktfqh7y

Deductive Verification in Decidable Fragments with Ivy [chapter]

Kenneth L. McMillan, Oded Padon
2018 Lecture Notes in Computer Science  
This paper surveys the work to date on Ivy, a language and a tool for the formal specification and verification of distributed systems.  ...  Ivy supports deductive verification using automated provers, model checking, automated testing, manual theorem proving and generation of executable code.  ...  This general formalism provides a powerful and natural way to model temporal properties of infinite-state systems.  ... 
doi:10.1007/978-3-319-99725-4_4 fatcat:hkqiqefpgra6jahbnk6pugvibu

Eager Abstraction for Symbolic Model Checking [chapter]

Kenneth L. McMillan
2018 Lecture Notes in Computer Science  
We introduce a method of abstraction from infinite-state to finite-state model checking based on eager theory explication and evaluate the method in a collection of case studies.  ...  In general, for a given datatype, we can tailor an abstraction that captures just the properties of that type needed to prove a given system property.  ...  sub-formulas of the property to be proved).  ... 
doi:10.1007/978-3-319-96145-3_11 fatcat:l2aoz3nkszbhvjod6kr2cqumdy

Making prophecies with decision predicates

Byron Cook, Eric Koskinen
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs.  ...  properties of programs where we could not prove them before.  ...  We also thank the Gates Cambridge Scholarship program for funding Eric Koskinen's Ph.D.  ... 
doi:10.1145/1926385.1926431 dblp:conf/popl/CookK11 fatcat:zw23jccndrbnlcadfumsnpmciy

Making prophecies with decision predicates

Byron Cook, Eric Koskinen
2011 SIGPLAN notices  
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs.  ...  properties of programs where we could not prove them before.  ...  We also thank the Gates Cambridge Scholarship program for funding Eric Koskinen's Ph.D.  ... 
doi:10.1145/1925844.1926431 fatcat:pyzrcqj5l5g6hknkhgy2krx4ae

Prophecy Made Simple

Leslie Lamport, Stephan Merz
2022 ACM Transactions on Programming Languages and Systems  
Prophecy variables were introduced in the article "The Existence of Refinement Mappings" by Abadi and Lamport. They were difficult to use in practice.  ...  We describe a new kind of prophecy variable that we find much easier to use. We also reformulate ideas from that article in a more mathematical way.  ...  "Prophecy constants" is just a new name for the bound rigid variables of a temporal logic.  ... 
doi:10.1145/3492545 fatcat:7j3y225s3vbnlnqwfqquhidfsa

Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays [chapter]

Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark Barrett
2021 Lecture Notes in Computer Science  
AbstractWe develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise  ...  We combine this mechanism with a counterexample-guided abstraction refinement scheme for the theory of arrays.  ...  We thank these sponsors for their support. We would also like to thank Alessandro Cimatti for his invaluable feedback on the initial ideas of this paper.  ... 
doi:10.1007/978-3-030-72016-2_7 fatcat:ntdopa3z4nd5rk4c4jc6opyzha

T2: Temporal Property Verification [article]

Marc Brockschmidt, Byron Cook, Samin Ishtiaq, Heidy Khlaaf, Nir Piterman
2016 arXiv   pre-print
T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties.  ...  We briefly discuss T2's architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions.  ...  Proving CTL * . Finally, T2 is the sole tool which supports the verification of CTL * properties of infinite-state programs as presented in [7] .  ... 
arXiv:1512.08689v2 fatcat:4ugpmywcynaa5bsdt7e5dfwad4

Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays [article]

Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark Barrett
2021 arXiv   pre-print
We develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise require  ...  We combine this mechanism with a counterexample-guided abstraction refinement scheme for the theory of arrays.  ...  We thank the National Science Foundation for their support. Additionally, thank you to Alessandro Cimatti for his invaluable feedback on the initial ideas of this paper.  ... 
arXiv:2101.06825v1 fatcat:rfj5t4w42radrbzhvnw3hdzprq

T2: Temporal Property Verification [chapter]

Marc Brockschmidt, Byron Cook, Samin Ishtiaq, Heidy Khlaaf, Nir Piterman
2016 Lecture Notes in Computer Science  
T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties.  ...  We briefly discuss T2's architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions.  ...  Proving CTL * . Finally, T2 is the sole tool which supports the verification of CTL * properties of infinite-state programs as presented in [7] .  ... 
doi:10.1007/978-3-662-49674-9_22 fatcat:jr2dm66usfh5tco6bl3hwaga4q

Universal extensions to simulate specifications

Wim H. Hesselink
2008 Information and Computation  
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulation F: K − L that preserves  ...  First, the assumption of preservation of quiescence is eliminated. Second, it is shown that the intermediate extension only depends on K, and is independent of L and F.  ...  Section 2 contains concepts and notations on binary relations, infinite sequences, temporal operators, stutterings, and properties.  ... 
doi:10.1016/j.ic.2007.10.003 fatcat:qy3llmgwfrgsjela7ucgnzmgcu

Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols

Geoffrey M. Brown, Lee Pike
2007 2007 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE 2007)  
The method is demonstrated by refining a specification of the 8N1 protocol, a widely-used protocol for serial data transmission.  ...  The refinement proof is via automated induction proofs over infinite-state transitions systems using SMT and model checking, as implemented in SRI International's Symbolic Analysis Laboratory (SAL).  ...  Acknowledgments We thank our anonymous reviewers for their suggestions and corrections.  ... 
doi:10.1109/memcod.2007.371227 dblp:conf/memocode/BrownP07 fatcat:v7kl3ique5an3fcdkalkyonsee

Reduction in TLA [chapter]

Ernie Cohen, Leslie Lamport
1998 Lecture Notes in Computer Science  
We want to infer properties of S by proving properties of S R . For this, S and S R needn't be equivalent; it's necessary only that S implement S R -for some suitable notion of implementation.  ...  Recall that the purpose of a reduction theorem is to deduce properties of S by proving properties of S R .  ... 
doi:10.1007/bfb0055631 fatcat:xqoba4fzp5c47in6kmz4cwcy6u

Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations [chapter]

Jakub Daniel, Alessandro Cimatti, Alberto Griggio, Stefano Tonetta, Sergio Mover
2016 Lecture Notes in Computer Science  
We present a fully-symbolic LTL model checking approach for infinite-state transition systems.  ...  We extend liveness-to-safety, a prominent approach in the finite-state case, by means of implicit abstraction, to effectively prove the absence of abstract fair loops without explicitly constructing the  ...  We compare our implementation with the following state-of-the-art tools for temporal property verification of infinite-state systems: HSF [29] , a solver for Horn-like clauses that also supports proving  ... 
doi:10.1007/978-3-319-41528-4_15 fatcat:ge3dpqfpdvcx5h66cpfeclrhbu
« Previous Showing results 1 — 15 out of 2,943 results