A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
The ELDARICA Horn Solver
2018
2018 Formal Methods in Computer Aided Design (FMCAD)
Preserved Fulltext
Over the last years we have been developing and maintaining ELDARICA as a state-of-the-art solver for Horn clauses over integer arithmetic. ...
In the version 2, we have extended the solver to support also algebraic data types and bit-vectors, theories that are commonly applied in verification, but currently unsupported by most Horn solvers. ...
Horn clauses are first sent through a number of preprocessing stages, applying transformations such as (forward) slicing, (forward and backward) reachability analysis to eliminate dead relation symbols ...
doi:10.23919/fmcad.2018.8603013
dblp:conf/fmcad/HojjatR18
fatcat:zl3zruilu5gglkr2pa5s5srnu4
Constraint Specialisation in Horn Clause Verification
2015
Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Experimental results on verification problems show that this is an effective transformation, both in our own verification tools (convex polyhedra analyser) and as a pre-processor to other Horn clause verification ...
We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. ...
Finally, we showed effectiveness of this transformation in Horn clause verification problems. ...
doi:10.1145/2678015.2682544
dblp:conf/pepm/KafleG15
fatcat:m3xng6yzfnbeloje2xl3xzw5ui
Constraint specialisation in Horn clause verification
2017
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Experimental results on verification problems show that this is an effective transformation, both in our own verification tools (convex polyhedra analyser) and as a pre-processor to other Horn clause verification ...
We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. ...
Finally, we showed effectiveness of this transformation in Horn clause verification problems. ...
doi:10.1016/j.scico.2017.01.002
fatcat:gouy3q5ilbbpnb4uqtci5ysqui
Solving non-linear Horn clauses using a linear Horn clause solver
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn clauses (also called a solver for linear Horn clauses). ...
The main algorithm then proceeds by applying the linearisation transformation and solver for linear Horn clauses to a sequence of sets of clauses with successively increasing dimension bound. ...
Introduction Many software verification problems can be reduced to checking satisfiability of a set of Horn clauses (the verification conditions). ...
arXiv:1607.04459v1
fatcat:wmzg2amv5jamfjnhg3qzmnadce
Predicate Pairing with Abstraction for Relational Verification
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It has been shown that constrained Horn clauses (CHCs) can effectively be used for relational verification by applying a CHC transformation, called Predicate Pairing, which allows the CHC solver to infer ...
Relational verification is a technique that aims at proving properties that relate two different program fragments, or two different program runs. ...
Recent papers have advocated the use of Constrained Horn Clauses (CHCs) for the verification of relational program properties [12, 18, 27] . ...
doi:10.1007/978-3-319-94460-9_17
fatcat:uh5fmdecwbgw5pv72ppze5sr2i
Automating regression verification of pointer programs by predicate abstraction
2017
Formal methods in system design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel automatic approach for regression verification that reduces the equivalence of two related imperative pointer programs to constrained Horn clauses over uninterpreted predicates ...
Regression verification is an approach complementing regression testing with formal verification. ...
To this end, the two versions of the program are transformed into Horn clauses over uninterpreted predicate symbols. ...
doi:10.1007/s10703-017-0293-8
fatcat:d5eumllzzrexbmfihvr6wee554
Removing Unnecessary Variables from Horn Clause Verification Conditions
2016
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
VCs are derived through program specialization based on the unfold/fold transformation rules and, as it often happens when specializing interpreters, they contain unnecessary variables, that is, variables ...
We consider VCs in the form of constrained Horn clauses (CHC) which are automatically generated from the encoding of (an interpreter of) the operational semantics of the programming language. ...
The NLR transformation enables Z3 to prove 7 additional verification problems. ...
doi:10.4204/eptcs.219.5
fatcat:3zpyhdp5xfh4zjvnzywnf46jtq
Enhancing Predicate Pairing with Abstraction for Relational Verification
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It has been shown that constrained Horn clauses (CHCs) can effectively be used for relational verification by applying a CHC transformation, called predicate pairing, which allows the CHC solver to infer ...
Relational verification is a technique that aims at proving properties that relate two different program fragments, or two different program runs. ...
Recent work has advocated the use of Constrained Horn Clauses (CHCs) for the verification of relational program properties [16, 21, 36] . ...
arXiv:1709.04809v1
fatcat:dsg5k46kmvagpkwobge35ogsiy
Transformational Verification of Quicksort
2020
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2008.02934v1 fatcat:sg4z3u7455fqrlj7micp3sv45q
Many transformation techniques developed for constraint logic programs, also known as constrained Horn clauses (CHCs), have found new useful applications in the field of program verification. ...
In this paper, we work out a nontrivial case study through the transformation-based verification approach. ...
First of all, the topics he contributed to explore starting from the 1970s, such as program transformation, program verification and, in general, the use of logic and formal methods in computing, are still ...
doi:10.4204/eptcs.320.7
fatcat:dfczbzddzre5tet6ohxcznifki
Disjunctive Interpolants for Horn-Clause Verification
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Interpolation methods remains one of the most promising techniques for such verification, and are closely related to solving Horn clause constraints. ...
We have implemented Horn clause verification algorithms that use disjunctive interpolants and evaluate them on benchmarks expressed as Horn clauses over the theory of integer linear arithmetic. ...
An ARG (S , E) is called closed if the edge relation represents all Horn clauses in HC. ...
doi:10.1007/978-3-642-39799-8_24
fatcat:eniwpo3b4rbzlgdyneyxkwsjpq
Tree dimension in verification of constrained Horn clauses
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). ...
The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn clause derivation trees. ...
dimension to decompose constrained Horn clause
verification problems by dimensions. ...
arXiv:1803.01448v2
fatcat:fk6sgwdmovcqvcz534djww7iyy
On recursion-free Horn clauses and Craig interpolation
2014
Formal methods in system design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We give a precise ontology of such extended interpolation methods, and investigate the relationship between interpolation and fragments of constrained recursion-free Horn clauses. ...
modelling software verification tasks. ...
Model Checking with Recursive Horn Clauses Where recursion-free Horn clauses generalise the concept of Craig interpolation, solving recursive Horn clauses corresponds to the verification of general programs ...
doi:10.1007/s10703-014-0219-7
fatcat:jjg3o76slre2blzihe2heomlwa
Synthesizing coupling proofs of differential privacy
2017
Proceedings of the ACM on Programming Languages
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1709.05361v1 fatcat:pjgd5znqgvgqdfeze7fchglrkiOther Versions
(ii) To discover a winning strategy, we present a constraint-based formulation of the problem as a set of Horn modulo couplings (HMC) constraints, a novel combination of first-order Horn clauses and probabilistic ...
(iii) We present a technique for solving HMC constraints by transforming probabilistic constraints into logical constraints with uninterpreted functions. ...
Recall our Horn clauses may mention uninterpreted relation symbols R. ...
doi:10.1145/3158146
dblp:journals/pacmpl/AlbarghouthiH18
fatcat:c3od4wpcbvhgfgaotao7crk5jm
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The purpose of the work is to investigate how analysis and transformation tools developed for constraint logic programs (CLP) can be applied to the Horn clause verification problem. ...
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using ...
A general framework for logic program verification through abstraction was described by Levi [29] . ...
doi:10.4204/eptcs.169.7
fatcat:bxshq32yjndlfetstc2ykwuckm
Analysis and Transformation Tools for Constrained Horn Clause Verification
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Several techniques and tools have been developed for verification of properties expressed as Horn clauses with constraints over a background theory (CHC). ...
transformations. ...
The main difference is that sets of constrained Horn clauses are not necessarily intended for execution, but rather as specifications. ...
arXiv:1405.3883v1
fatcat:i3zfwewz7nfr3pvd7hqw7t2gce
« Previous
Showing results 1 — 15 out of 2,369 results