10 Hits in 2.7 sec

Verifying the DPLL Algorithm in Dafny

Cezar-Constantin Andrici, Ştefan Ciobâcă
2019 Electronic Proceedings in Theoretical Computer Science  
To counter this issue, we build a verified SAT solver using the Dafny system. We discuss its implementation in the present article.  ...  However, the data structures and algorithms implemented by a typical high-performance SAT solver are complex enough to allow for subtle programming errors.  ...  This work was supported by a grant of the Alexandru Ioan Cuza University of Ias ¸i within the Research Grants program Grant UAIC, code GI-UAIC-2018-07.  ... 
doi:10.4204/eptcs.303.1 fatcat:cwjfoxi65jdjtfzn4lrpd36yjy

Who Verifies the Verifiers? A Computer-Checked Implementation of the DPLL Algorithm in Dafny [article]

Cezar-Constantin Andrici, Ştefan Ciobâcă
2020 arXiv   pre-print
We build a SAT solver implementing the DPLL algorithm in the verification-enabled programming language Dafny.  ...  We benchmark our Dafny solver and we show that it is just as efficient as an equivalent DPLL solver implemented in C# and roughly two times less efficient than an equivalent solver written in C++.  ...  Acknowledgments This work was supported by a grant of the Alexandru Ioan Cuza University of Iaşi, within the Research Grants program UAIC Grant, code GI-UAIC-2018-07.  ... 
arXiv:2007.10842v1 fatcat:3kzdaslqmfg4vmapmliv5mcnby

Induction for SMT Solvers [chapter]

Andrew Reynolds, Viktor Kuncak
2015 Lecture Notes in Computer Science  
We present a set of techniques that introduce inductive reasoning into SMT solving algorithms that is sound with respect to the interpretation of structures in SMT-LIB standard.  ...  Our solution is freely available in the CVC4 development repository.  ...  Acknowledgments We thank Ravichandhran Madhavan for an initial version of the Leon benchmarks and Cesare Tinelli for discussions about SMT-LIB semantics.  ... 
doi:10.1007/978-3-662-46081-8_5 fatcat:kd4apjhcijhb5lklpkmukazx44

Effective Domain-Specific Formal Verification Techniques

Ákos Hajdu, Zoltán Micskei
2020 Zenodo  
We increase the number of conclusive answers by the algorithm via a new iteration approach on invariants and a hybrid search strategy.  ...  We lift the expressive power of the algorithm by handling a generalized version of reachability and supporting Petri nets extended with inhibitor arcs.  ...  Then this intermediate representation could be translated to alternative verifier backends such as Why3 [FP13] or Dafny [Lei10] .  ... 
doi:10.5281/zenodo.3892347 fatcat:56hta7rkh5dinlehzrcfapumme

Formalization of logical calculi in Isabelle/HOL [article]

Mathias Fleury, Universität Des Saarlandes, Universität Des Saarlandes
The imperative version relies on the two-watched-literal data structure and other optimizations found in modern solvers.  ...  Second, I verify an optimizing CDCL (OCDCL): Given a cost function on literals, OCDCL derives an optimal model with minimum cost. Finally, I work on model covering.  ...  If there are no decisions in the trail, I set the conflict to ⊥. I have verified a weaker version of the theorem, namely one about ODPLL. To do so, I first formalized a DPLL BnB .  ... 
doi:10.22028/d291-30179 fatcat:aukisj5neneidgo7i5fpeqbamu

Verification by Reduction to Functional Programs

Régis William Blanc
Although it is true that only the PhD student types in the content of this manuscript, the results presented were made possible only through the help of several co-authors.  ...  He trusted me when I had no clue about which research direction to take, and I am grateful he let me explore projects in this way.  ...  In particular, local functions can access and update local state, as long as the function does not escape the scope of its parent definition.  ... 
doi:10.5075/epfl-thesis-7636 fatcat:l3oy3stiizaezg2vjtgsydpczy

Automated reasoning over string constraints

Tianyi Liang, Tianyi Liang, Aaron Stump, Hantao Zhang, Octav Chipara, Clark To, Shihui Liang, Ji Chen, Xue Mei
2014 Computer Sciences Commons Recommended Citation Liang, Tianyi   unpublished
The algorithm is shown in Figure 4 .18.  ...  Facilitated by split-on-demand in DPLL(T) [11], we mark a new literal J ≤ 0 as the first decision literal 10 in the DPLL(X) engine, initially.  ...  Indeed, we have implemented our algorithm as a built-in theory engine in cvc4.  ... 

Foundations for natural proofs and quantifier instantiation

Christof Löding, P. Madhusudan, Lucas Peña
2017 Proceedings of the ACM on Programming Languages  
Coupled with the fact that unfolding recursive definitions is essentially term instantiation and with the observation that heap verification engines generate verification conditions in the safe fragment  ...  Furthermore, we study recursive definitions with least fixpoint semantics and show that though they are not amenable to complete procedures, we can systematically introduce induction principles that in  ...  This material is based upon work supported by the National Science Foundation under Grant No. 1527395.  ... 
doi:10.1145/3158098 dblp:journals/pacmpl/LodingMP18 fatcat:u5xnpsg2arbuxovuyvwmkdddoa

Local Arrangement Chairs & Webmasters Publication Chair Steering Committee Program Committee Additional Reviewers

Sean Safarpour, Synopsys Divjyot, Sethi Cisco, Jens Katelaan, Keshav Kini, Florian Zuleger, Armin Biere, Alan Hu, Warren Hunt, Vigyan Singhal, Oski Tech, Pranav Real (+126 others)
Proceedings of the 16th Conference on Formal Methods in Computer-Aided Design (FMCAD 2016)   unpublished
by Manish Pandey, Synopsys Inc. • Verifying Hyperproperties of Hardware Systems by Bernd Finkbeiner (Saarland University) and Markus Rabe (UC Berkeley) • A Paradigm Shift in Verification Methodology by  ...  This was a followed by a keynote by Professor Christos Papadimitriou on algorithms and evolution.  ...  The UC Berkeley authors were supported in part by Toyota through the CHESS center.  ... 

Symbolic execution of verification languages and floating-point code

Daniel Simon Liew, Alastair Donaldson, Cristian Cadar, Engineering And Physical Sciences Research Council, ARM (Firm)
First, an investigation into comparing several state-of-the-art program analysis tools at the level of an intermediate verification language over a large set of benchmarks, and improvements to the state-of-the-art  ...  This is investigated via two independent extensions of the KLEE symbolic execution engine to support reasoning about floating-point operations (with one tool developed by the thesis author).  ...  The algorithm underlying most SAT solvers is the Davis-Putnam-Logemann-Loveland (DPLL) algorithm [62] which stemmed from the earlier work of Davis and Putnam [63] .  ... 
doi:10.25560/59705 fatcat:zljitt4ouzeyrnowg222qh5owm