Filters








51,812 Hits in 6.3 sec

Constraint Solving for Program Verification: Theory and Practice by Example [chapter]

Andrey Rybalchenko
2010 Lecture Notes in Computer Science  
Program verification relies on the construction of auxiliary assertions describing various aspects of program behaviour, e.g., inductive invariants, resource bounds, and interpolants for characterizing  ...  This paper presents a series of examples illustrating algorithms for the automatic construction of such auxiliary assertions by utilizing constraint solvers as the basic computing machinery.  ...  Acknowledgment I thank Byron Cook, Fritz Eisenbrand, Ashutosh Gupta, Tom Henzinger, Rupak Majumdar, Andreas Podelski, and Viorica Sofronie-Stokkermans for unconstrained satisfactory discussions.  ... 
doi:10.1007/978-3-642-15205-4_7 fatcat:zwcyembydzel3fppagd7rg4lru

Constraint Solving for Program Verification: Theory and Practice by Example [chapter]

Andrey Rybalchenko
2010 Lecture Notes in Computer Science  
Program verification relies on the construction of auxiliary assertions describing various aspects of program behaviour, e.g., inductive invariants, resource bounds, and interpolants for characterizing  ...  This paper presents a series of examples illustrating algorithms for the automatic construction of such auxiliary assertions by utilizing constraint solvers as the basic computing machinery.  ...  I thank Byron Cook, Fritz Eisenbrand, Ashutosh Gupta, Tom Henzinger, Rupak Majumdar, Andreas Podelski, and Viorica Sofronie-Stokkermans for unconstrained satisfactory discussions.  ... 
doi:10.1007/978-3-642-14295-6_7 fatcat:7rmdg2xknvbxbc2u5fnbvmy43u

(Quantified) Horn Constraint Solving for Program Verification and Synthesis [article]

Andrey Rybalchenko
2014 arXiv   pre-print
To appear in Theory and Practice of Logic Programming (TPLP)  ...  We show how automatic tools for the verification of linear and branching time properties of procedural, multi-threaded, and functional programs as well as program synthesis can be naturally and uniformly  ...  Verification of temporal properties and program synthesis are particularly relevant examples of such questions.  ... 
arXiv:1405.7739v1 fatcat:7gep4misozduxmvuoksvf6u4zm

Solving String Constraints: The Case for Constraint Programming [chapter]

Jun He, Pierre Flener, Justin Pearson, Wei Ming Zhang
2013 Lecture Notes in Computer Science  
We argue that constraint programming solvers are more suitable than existing solvers for verification tools that have to solve string constraints, as they have a rich tradition of constraints for membership  ...  We improve an existing propagator for the context-free grammar constraint and demonstrate experimentally the practicality of the resulting propagator.  ...  In the analysis, testing, and verification of string-manipulating programs, constraints on sequences (strings) of decision variables arise. Kieżun et al.  ... 
doi:10.1007/978-3-642-40627-0_31 fatcat:pcfjyr576rapnpaev6yxgukrha

Automated test generation for OpenCL kernels using fuzzing and constraint solving

Chao Peng, Ajitha Rajan
2020 Proceedings of the 13th Annual Workshop on General Purpose Processing using Graphics Processing Unit  
We propose a test generation technique for OpenCL kernels that combines mutation-based fuzzing and selective constraint solving with the goal of being fast, effective and scalable.  ...  When fuzz testing is unable to increase branch coverage with random mutations, we gather path constraints for uncovered branch conditions and invoke the Z3 constraint solver to generate tests for them.  ...  Effectiveness of Selective Constraint Solving: Can selec- tive constraint solving generate tests that enhance coverage and fault finding achieved by fuzz tests?  ... 
doi:10.1145/3366428.3380768 dblp:conf/ppopp/PengR20 fatcat:sqfvjm5gmngqlgytbkh5ixngky

Constraint-based Relational Verification [article]

Hiroshi Unno, Tachio Terauchi, Eric Koskinen
2021 arXiv   pre-print
To solve problems in this new language, we present a constraint solving method for pfwCSP based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) of ordinary, well-founded, and functional  ...  (or alignment) that dictate when and which program copies move.  ...  5) and practical effectiveness.  ... 
arXiv:2106.02628v1 fatcat:hj3b7gf6rnbblcyhmj4evpyu3i

Constraint-Based Relational Verification [chapter]

Hiroshi Unno, Tachio Terauchi, Eric Koskinen
2021 Lecture Notes in Computer Science  
To solve problems in this new language, we present a constraint solving method for $$\mathrm {pfwCSP}$$ pfwCSP based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) of ordinary, well-founded  ...  (or alignment) that dictate when and which program copies move.  ...  We thank the anonymous reviewers for their suggestions. This work was supported by ONR grant # N00014-17-1-2787, JST ERATO HASUO Metamathematics for Systems Design Project (No.  ... 
doi:10.1007/978-3-030-81685-8_35 fatcat:sltnc6zslnfljbrqtm4fqlvzsq

CTL+FO Verification as Constraint Solving [article]

Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko
2014 arXiv   pre-print
By integrating this constraint encoding with an off-the-shelf solver we obtain an automatic verifier for CTL+FO.  ...  In this paper, we present a constraint-based method for proving CTL+FO properties automatically.  ...  Our method uses the Ehsf [3] solver for forall-exists Horn constraints and well-foundedness. We omit the syntax and semantics of constraints solved by Ehsf, see [3] for details.  ... 
arXiv:1406.3988v3 fatcat:jhzwsqljizcgbmwqrohktsh3rq

Real World Verification [chapter]

André Platzer, Jan-David Quesel, Philipp Rümmer
2009 Lecture Notes in Computer Science  
Bases, and semidefinite programming for the Positivstellensatz.  ...  Finally, we introduce a new decision procedure combining Gröbner Bases and semidefinite programming for the real Nullstellensatz that outperforms the individual approaches on an interesting set of problems  ...  Although first-order logic over real arithmetic is decidable by quantifier elimination [1] its complexity is doubly exponential in theory and can be high in practice.  ... 
doi:10.1007/978-3-642-02959-2_35 fatcat:4dd6gqu5bbeopbuwikdprliieq

Verification of Pointers

Nils Klarlund, Michael I. Schwartzbach
1994 DAIMI Report Series  
<p>Our recent work links type checking in programming languages to verification based on automata. In this survey, we give an overview of our methods and suggest directions for future research.  ...  </p><p>We can express common properties, for example about doubly-linked lists and their algorithms.  ...  Possible venues solving such problems may also be based on the implicit product spaces of asynchronons automata in trace theory; see 8 for a determinization construction.  ... 
doi:10.7146/dpb.v23i470.6943 fatcat:i34abcwqwvhltn3fuvkck5cizm

From software verification to 'everyware' verification

Marta Kwiatkowska
2013 Computer Science - Research and Development  
Our increasing dependence on ubiquitous computing creates an urgent need for modelling and verification technologies to support the design process, and hence improve the reliability and reduce production  ...  Model-based design and verification techniques have proved useful in supporting the design process by detecting and correcting flaws in a number of ubiquitous computing applications, but are limited by  ...  on recursive equations or solving linear equations or linear programming problems.  ... 
doi:10.1007/s00450-013-0249-1 fatcat:yijv5tfqwjb5rlopsnmy6gpsf4

Theory Refinement for Program Verification [chapter]

Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina
2017 Lecture Notes in Computer Science  
Recent progress in automated formal verification is to a large degree due to the development of constraint languages that are sufficiently light-weight for reasoning but still expressive enough to prove  ...  Satisfiability modulo theories (SMT) solvers implement efficient decision procedures, but offer little direct support for adapting the constraint language to the task at hand.  ...  This work was supported by the SNF grants 163001 and 166288 and the SNF fellowship P2T1P2 161971.  ... 
doi:10.1007/978-3-319-66263-3_22 fatcat:pcnnp7pw2rdjxkka5krudsrpea

CTL+FO verification as constraint solving

Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko
2014 Proceedings of the 2014 International SPIN Symposium on Model Checking of Software - SPIN 2014  
By integrating this constraint encoding with an off-the-shelf solver we obtain an automatic verifier for CTL+FO.  ...  In this paper, we present a constraint-based method for proving CTL+FO properties automatically.  ...  Our method uses the Ehsf [2] solver for forall-exists Horn constraints and well-foundedness. We omit the syntax and semantics of constraints solved by Ehsf, see [2] for details.  ... 
doi:10.1145/2632362.2632364 dblp:conf/spin/BeyeneBR14 fatcat:eo3q6xwvgfgpjj4vvd2lz2trbm

Constraint specialisation in Horn clause verification

Bishoksan Kafle, John P. Gallagher
2017 Science of Computer Programming  
The approach is independent of the abstract domain and the constraints theory underlying the clauses.  ...  We present a method for specialising the constraints in constrained Horn clauses with respect to a goal.  ...  NUSA: Numerical and Symbolic Abstractions for Software Model Checking.  ... 
doi:10.1016/j.scico.2017.01.002 fatcat:gouy3q5ilbbpnb4uqtci5ysqui

Constraint Specialisation in Horn Clause Verification

Bishoksan Kafle, John P. Gallagher
2015 Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15  
The approach is independent of the abstract domain and the constraints theory underlying the clauses.  ...  We present a method for specialising the constraints in constrained Horn clauses with respect to a goal.  ...  NUSA: Numerical and Symbolic Abstractions for Software Model Checking.  ... 
doi:10.1145/2678015.2682544 dblp:conf/pepm/KafleG15 fatcat:m3xng6yzfnbeloje2xl3xzw5ui
« Previous Showing results 1 — 15 out of 51,812 results