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.
Filters
Predicate Pairing for program verification
2017
Theory and Practice of Logic Programming
Preserved Fulltext
Other Versions
We will also present some case studies showing that Predicate Pairing plays a crucial role in the verification of relational properties of programs, that is, properties relating two programs (such as program ...
AbstractIt is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). ...
Acknowledgments We warmly thank the anonymous referees for their very helpful comments and criticism. This work has been partially supported by the National Group of Computing Science (GNCS-INDAM). ...
doi:10.1017/s1471068417000497
fatcat:sqrdis2mhnh2tcpt3kebo2s2ty
Viper: A Verification Infrastructure for Permission-Based Reasoning
[chapter]
2015
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 2018; you can also visit the original URL.
The file type is application/pdf.
Consequently, tool support for these logics is typically developed independently for each technique, dramatically increasing the burden of developing automatic tools for permission-based verification. ...
existing tools for these logics often prefer symbolic execution over verification condition generation. ...
for permission-based verification. ...
doi:10.1007/978-3-662-49122-5_2
fatcat:ukxit5welnfcfpjo2vilygat4u
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 ...
After presenting an algorithm for predicate pairing with abstraction, we report on the experiments we have performed on over a hundred relational verification problems by using various abstract domains ...
Predicate Pairing with Abstraction In this section we present an algorithm for transforming CHCs, called Abstraction-based Predicate Pairing (or APP strategy, for short), which combines Predicate Pairing ...
arXiv:1709.04809v1
fatcat:dsg5k46kmvagpkwobge35ogsiy
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 ...
After presenting an algorithm for Predicate Pairing with abstraction, we report on the experiments we have performed on over a hundred relational verification problems by using various abstract domains ...
Acknowledgements We thank the anonymous referees for their constructive comments. ...
doi:10.1007/978-3-319-94460-9_17
fatcat:uh5fmdecwbgw5pv72ppze5sr2i
Introduction to the special issue on computational logic for verification
2018
Theory and Practice of Logic 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 2018; you can also visit the original URL.
The file type is application/pdf.
The last decade has witnessed a growing interest in the use of computational logic methods for program verification. ...
It has attracted researchers from both computational logic and program verification communities, giving rise to a fruitful exchange of ideas and experiences. ...
The paper "Predicate Pairing for Program Verification" by E. De Angelis, F. Fioravanti, A. Pettorossi and M. ...
doi:10.1017/s1471068418000029
fatcat:c4gxiijazzgohk6shsfnb5p6cy
Predicate abstraction of Java programs with collections
2012
SIGPLAN notices
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 2013; you can also visit the original URL.
The file type is application/pdf.
Our goal is to develop precise and scalable verification techniques for Java programs that use collections and properties that depend on their content. ...
We adapt existing techniques for construction of abstract programs. Most notably, we designed optimizations based on specific features of the predicate language. ...
The actual verification of the given Java program with our approach consists of three steps: 1. predicates about collections and other program variables that are necessary for the verification of the properties ...
doi:10.1145/2398857.2384623
fatcat:tgkobxy4engp7itpokr5e2xv7y
Predicate abstraction of Java programs with collections
2012
Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12
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 2013; you can also visit the original URL.
The file type is application/pdf.
Our goal is to develop precise and scalable verification techniques for Java programs that use collections and properties that depend on their content. ...
We adapt existing techniques for construction of abstract programs. Most notably, we designed optimizations based on specific features of the predicate language. ...
The actual verification of the given Java program with our approach consists of three steps: 1. predicates about collections and other program variables that are necessary for the verification of the properties ...
doi:10.1145/2384616.2384623
dblp:conf/oopsla/ParizekL12
fatcat:munbkntmnvcunbmro4oyaekhnm
Constraint-Based Invariant Inference over Predicate Abstraction
[chapter]
2008
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 2011; you can also visit the original URL.
The file type is application/pdf.
for proving the validity of given program assertions. ...
The verification condition of the program is then encoded by means of a boolean formula over these boolean indicator variables such that any satisfying assignment to the formula yields the inductive invariants ...
Results for (a) Program verification (b) Weakest Precondition Inference program. ...
doi:10.1007/978-3-540-93900-9_13
fatcat:vhho4xrvw5bqhifnx3scvbngiq
Difference Verification with Conditions
[chapter]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Modern software-verification tools need to support development processes that involve frequent changes. Existing approaches for incremental verification hard-code specific verification techniques. ...
Difference verification with conditions is independent from any specific verification technique and can be integrated in software projects at any time. ...
Set waitlist ⊆ L×L stores all pairs of program locations ( 1 , 1 ) for which a program path with the same syntactic structure exist in P and P , and for which no outgoing edges have been considered yet ...
doi:10.1007/978-3-030-58768-0_8
fatcat:atlkxquk5zah7kkddspqmboq3i
Invariant Synthesis for Incomplete Verification Engines
[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.
set of predicates. ...
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. ...
We comment on the case of infinitely many predicates below.
Theorem 2. Assume a normal verification engine for a program P to be given. ...
doi:10.1007/978-3-319-89960-2_13
fatcat:saysfl3slnbn3mktsvtqk7mnlm
A FUNCTIONAL TOOL FOR FUZZY FIRST ORDER LOGIC EVALUATION
2006
Applied Artificial Intelligence
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.
Such generalization is performed using Haskell functional programming language. ...
In this paper we present an automatic evaluation tool for fuzzy first order logic formulas. ...
From a formalization and verification point of view, the classical approach for verification of systems is the Hoare alternative 8 , where the specification of the system is done by a pair of first order ...
doi:10.1142/9789812774118_0007
fatcat:kkespevgsbb5xmsxnjmddlmpe4
Verification of a distributed cache memory by using abstractions
[chapter]
1994
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.
This holds also for the abstraction of the control part of the system as we consider a kind of guarded command programs where all the control is expressed in terms of operations on explicit control variables ...
The purpose of this paper is to verify a distributed cache memory system by using the following general verification method: verify the properties characterizing a complex system on some small finite abstraction ...
Thus, for its verification we observe two pairs (al, dl) and (a2,d2) such that al = as = a and dl E datumjl and ds E datumj2. ...
doi:10.1007/3-540-58179-0_55
fatcat:nv4hbc7plbbrbn37apzyhkrah4
Invariant Synthesis for Incomplete Verification Engines
[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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
set of predicates. ...
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. ...
Our task, therefore, is to synthesize adequate invariants for this program over these predicates. 6 Clearly, the verification conditions of this program are undecidable. ...
arXiv:1712.05581v2
fatcat:iphfjxlyazcfpbcd7n6xazztj4
The GPUVerify Method: a Tutorial Overview
2014
Electronic Communications of the EASST
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.
I present a tutorial overview demonstrating the key technique used by GPUVerify, a static verification tool for graphics processing unit (GPU) kernels. ...
The technique is a method for translating a massively parallel GPU kernel into a sequential program such that correctness of the sequential program implies data race-freedom of the parallel kernel. ...
Collectively, they allow kernel verification to be explicitly reduced to the analysis of a sequential program, allowing existing technology for sequential verification to be re-used. ...
doi:10.14279/tuj.eceasst.70.986
dblp:journals/eceasst/Donaldson14
fatcat:zm6764lvpbeojfwsik27k72yse
Towards a scalable software model checker for higher-order programs
2013
Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation - PEPM '13
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 2016; you can also visit the original URL.
The file type is application/pdf.
In our recent paper, we have shown how to construct a fullyautomated program verification tool (so called a "software model checker") for a tiny subset of functional language ML, by combining higher-order ...
model checking, predicate abstraction, and CE-GAR. ...
Acknowledgment We would like to thank anonymous referees for useful comments. This work was partially supported by Kakenhi 24·8057 and 23220001. ...
doi:10.1145/2426890.2426900
dblp:conf/pepm/SatoUK13
fatcat:7obwokknfjdd7k7unkapp6pxiq
« Previous
Showing results 1 — 15 out of 24,988 results