18,466 Hits in 4.3 sec

Inferring Inductive Invariants from Phase Structures [chapter]

Yotam M. Y. Feldman, James R. Wilcox, Sharon Shoham, Mooly Sagiv
2019 Lecture Notes in Computer Science  
To relieve the user from this laborintensive and challenging task, invariant inference aims to find inductive invariants automatically.  ...  The additional structure from phases guides the inference procedure towards finding an invariant.  ...  This publication is part of a project that has received funding from the European Research Council (  ... 
doi:10.1007/978-3-030-25543-5_23 fatcat:ibck2sre6rhsrlty57pe57rtw4

Plain and Simple Inductive Invariant Inference for Distributed Protocols in TLA+ [article]

William Schultz, Ian Dardik, Stavros Tripakis
2022 arXiv   pre-print
We present a new technique for automatically inferring inductive invariants of parameterized distributed protocols specified in TLA+.  ...  of an overall inductive invariant.  ...  , automatic inference of an inductive invariant for an industrial scale Raft-based reconfiguration protocol.  ... 
arXiv:2205.06360v2 fatcat:66zzsruymbakvd6mnngkrm6qd4

Inferring Inductive Invariants from Phase Structures [article]

Yotam M. Y. Feldman, James R. Wilcox, Sharon Shoham, Mooly Sagiv
2019 arXiv   pre-print
To relieve the user from this labor-intensive and challenging task, invariant inference aims to find inductive invariants automatically.  ...  in a full safety proof.The additional structure from phases guides the inference procedure towards finding an invariant.  ...  This publication is part of a project that has received funding from the Euro  ... 
arXiv:1905.07739v1 fatcat:p4vuenyzrrbslauf5hevfjtatu

Towards an Automatic Proof of Lamport's Paxos [article]

Aman Goel, Karem A. Sakallah
2021 arXiv   pre-print
While various attempts have been made to verify different versions of Paxos, to the best of our knowledge, this is the first demonstration of an automatically-inferred inductive invariant for Lamport's  ...  Notwithstanding its complexity, in this paper, we take a step towards automatically proving the safety of Paxos by taking advantage of three structural features in its specification: spatial regularity  ...  demonstration of an automatically-inferred inductive invariant for the original Lamport's Paxos algorithm.  ... 
arXiv:2108.08796v1 fatcat:cehbhgk53re2plwxdval7lbpgi

VS3: SMT Solvers for Program Verification [chapter]

Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Foster
2009 Lecture Notes in Computer Science  
We present VS 3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the power of SMT solvers.  ...  We have used VS 3 to automatically verify ∀∃ properties of programs and to infer worst case upper bounds and preconditions for functional correctness.  ...  ., inferring the input that yields the worst case run of a sorting program. See [1] for details.  ... 
doi:10.1007/978-3-642-02658-4_58 fatcat:jxg5cox7jjbpvfchfglxllf4um

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

Aman Goel, Karem A. Sakallah
2021 Zenodo  
Instead, the required prefix is automatically inferred without any search by carefully analyzing the structural symmetries of the protocol.  ...  We propose symmetric incremental induction, an extension of the finite-domain IC3/PDR algorithm, that automatically derives the required quantified inductive invariant by exploiting the connection between  ...  As a long-term goal, we aim towards automatically inferring inductive invariants for complicated distributed protocols, such as Paxos [50, 51], by building further on this initial work.  ... 
doi:10.5281/zenodo.4641704 fatcat:ln5my5563fce7c52pcp2ilsklu

LoopInvGen: A Loop Invariant Generator based on Precondition Inference [article]

Saswat Padhi and Rahul Sharma and Todd Millstein
2019 arXiv   pre-print
LoopInvGen is an efficient implementation of the inference technique originally proposed in our earlier work on PIE (  ...  We describe the LoopInvGen tool for generating loop invariants that can provably guarantee correctness of a program with respect to a given specification.  ...  ACKNOWLEDGMENT We thank the organizers of SyGuS-Comp for making all the solvers and benchmarks publicly available.  ... 
arXiv:1707.02029v4 fatcat:mywfv2j3x5c7vdkxpvq67cjx5e

Polyhedra to the rescue of array interpolants

Francesco Alberti, David Monniaux
2015 Proceedings of the 30th Annual ACM Symposium on Applied Computing - SAC '15  
We propose a new approach to the automated verification of the correctness of programs handling arrays.  ...  An abstract interpreter supplies auxiliary numeric invariants to an interpolation-based refinement procedure suited to array programs.  ...  Inferring invariants such as (1) automatically is challenging.  ... 
doi:10.1145/2695664.2695784 dblp:conf/sac/AlbertiM15 fatcat:auyaxp74ivgvvoloyxrfwdeyfe

Verification and refutation of C programs based on k-induction and invariant inference

Omar M. Alhawi, Herbert Rocha, Mikhail R. Gadelha, Lucas C. Cordeiro, Eddie Batista
2020 International Journal on Software Tools for Technology Transfer (STTT)  
Here, we describe and evaluate a proof-by-induction algorithm that combines k-induction with invariant inference to prove and refute safety properties.  ...  Experimental results show that k-induction with invariants can handle a wide variety of safety properties, in typical programs with loops and embedded software applications from the telecommunications,  ...  [69] inferring loop invariants enables a broad and deep range of correctness and security properties to be proven automatically by a variety of program verification tools spanning type checkers, static  ... 
doi:10.1007/s10009-020-00564-1 fatcat:let4uuegzbgvtllmdrswwzeqy4

Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion [article]

Jason R. Koenig, Oded Padon, Sharon Shoham, Alex Aiken
2021 arXiv   pre-print
We present a PDR/IC3 algorithm for finding inductive invariants with quantifier alternations.  ...  We tackle scalability issues that arise due to the large search space of quantified invariants by combining a breadth-first search strategy and a new syntactic form for quantifier-free bodies.  ...  We show that automatically inferring such invariants is possible for systems beyond the current state of the art by addressing several scalability issues that arise as the complexity of systems and their  ... 
arXiv:2112.05304v1 fatcat:k4vz5cctmvd7xcqvlcxg4ezgme

Solving Constrained Horn Clauses over ADTs by Finite Model Finding [article]

Yurii Kostyukov, Dmitry Mordvinov, Grigory Fedyukovich
2021 arXiv   pre-print
Subsequently, modern methods in the automated inference of program invariants progress towards the construction of first-order definable invariants.  ...  Thus we propose to represent program invariants regularly with tree automata. We show how to automatically infer such regular invariants of ADT-manipulating programs using finite model finders.  ...  Suppose, we wish to infer an inductive invariant of typeCheck proving the validity of the assertion.  ... 
arXiv:2108.00225v2 fatcat:skd33ohnwfhkjdrfqt2f3wyczi

Data-Driven Inference of Representation Invariants [article]

Anders Miltner, Saswat Padhi, Todd Millstein, David Walker
2020 arXiv   pre-print
The key novelty is a type-directed notion of visible inductiveness, which ensures that the algorithm makes progress toward its goal as it alternates between weakening and strengthening candidate invariants  ...  A representation invariant is a property that holds of all values of abstract type produced by a module.  ...  Our key insight is that it is possible to drive progress of the algorithm towards its goal not by eagerly searching for fully inductive invariants, but rather by searching first for visibly inductive invariants  ... 
arXiv:2003.12106v1 fatcat:6d7echncmnhsjjlf3m2rhz43rq

Inferring Loop Invariants Using Postconditions [chapter]

Carlo Alberto Furia, Bertrand Meyer
2010 Lecture Notes in Computer Science  
One of the obstacles in automatic program proving is to obtain suitable loop invariants.  ...  Thanks to these heuristics, the technique is able to infer invariants for a large variety of loop examples.  ...  A preliminary version of this work has been presented at the IFIP TC2 WG 2.3 meeting in Lachen, Switzerland, March 2010. The authors thank the attendees for their useful comments and criticism.  ... 
doi:10.1007/978-3-642-15025-8_15 fatcat:rgmjakfjhzgr7le2osppy2h7ru

Automating regression verification

Dennis Felsing, Sarah Grebing, Vladimir Klebanov, Philipp Rümmer, Mattias Ulbrich
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
We present a novel automatic approach for regression verification that reduces the equivalence of two related imperative integer programs to Horn constraints over uninterpreted predicates.  ...  Subsequently, state-of-the-art SMT solvers are used to solve the constraints.  ...  A number of approaches and tools for regression verification exist already, but the majority of them are not automatic and require the user to supply inductive invariants.  ... 
doi:10.1145/2642937.2642987 dblp:conf/kbse/FelsingGKRU14 fatcat:fbcqvbfzurbupl6gxllqqwvuba


Sanjit A. Seshia
2012 Proceedings of the 49th Annual Design Automation Conference on - DAC '12  
In this position paper, we contend that these challenges can be tackled by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure  ...  Chief amongst these are environment modeling, incompleteness in specifications, and the complexity of underlying decision problems.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues.  ... 
doi:10.1145/2228360.2228425 dblp:conf/dac/Seshia12 fatcat:otziclzmebemdcllerhtwbknsi
« Previous Showing results 1 — 15 out of 18,466 results