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 with Abstraction for Relational Verification
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
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 ...
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 ...
Acknowledgements We thank the anonymous referees for their constructive comments. ...
doi:10.1007/978-3-319-94460-9_17
fatcat:uh5fmdecwbgw5pv72ppze5sr2i
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.
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 ...
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 ...
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
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.
For a large class of systems including infinite state systems, the abstractions of the components can be obtained by replacing all operators on concrete domains by abstract operators on some abstract domain ...
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 ...
with the abstraction relation used for ($3). ...
doi:10.1007/3-540-58179-0_55
fatcat:nv4hbc7plbbrbn37apzyhkrah4
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.
algorithm for discovering inductive invariants with k disjuncts. ...
abstract interpretation over predicate abstraction [1] . ...
Introduction Predicate abstraction [1] is a commonly used technique for proving program properties. ...
doi:10.1007/978-3-540-93900-9_13
fatcat:vhho4xrvw5bqhifnx3scvbngiq
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.
model checking, predicate abstraction, and CE-GAR. ...
Among others, we introduce (i) selective CPS transformation, (ii) selective predicate abstraction, and (iii) refined predicate discovery as optimization techniques; and propose (iv) functional encoding ...
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
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.
We adapt existing techniques for construction of abstract programs. Most notably, we designed optimizations based on specific features of the predicate language. ...
We apply the popular approach of predicate abstraction to Java programs and collections. ...
Each abstract map is a set of key-value pairs with a specific iteration order over the keys. ...
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.
We adapt existing techniques for construction of abstract programs. Most notably, we designed optimizations based on specific features of the predicate language. ...
We apply the popular approach of predicate abstraction to Java programs and collections. ...
Each abstract map is a set of key-value pairs with a specific iteration order over the keys. ...
doi:10.1145/2384616.2384623
dblp:conf/oopsla/ParizekL12
fatcat:munbkntmnvcunbmro4oyaekhnm
Property Directed Self Composition
[chapter]
2019
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.
We develop a property-directed inference algorithm that, given a set of predicates, infers composition-invariant pairs expressed by Boolean combinations of the given predicates, or determines that no such ...
pair exists. ...
For all but 3 examples, only 2 types of predicates, which we mined automatically, were sufficient for verification: (i) relational predicates derived from the pre-and post-conditions, and (ii) for simple ...
doi:10.1007/978-3-030-25540-4_9
fatcat:o2hcmxclgjdufnhgxtylnuhsde
Gene sorting in differential evolution with cross-generation mutation
2011
Science China Information Sciences
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 2021; you can also visit the original URL.
The file type is application/pdf.
Competent predicate abstraction in model checking. ...
The paper presents a new approach to computing the abstract state and a maximum weight heuristic method for finding the shortest counter-example in verification of imperative programs. ...
Maximum weight selection For every reachable branch node by the predicate abstraction computation, if every trace is feasible by the abstract predicates, we select the edge with the maximal weight and ...
doi:10.1007/s11432-010-4149-8
fatcat:ltd22ldd3ve2bpsp2b3adloxeu
Terminator: Beyond Safety
[chapter]
2006
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 2008; you can also visit the original URL.
The file type is application/pdf.
., program analysis tools based on predicate abstraction, pushdown model checking and iterative counterexample-guided abstraction refinement, etc.) are restricted to safety properties. ...
Terminator is the first software model checker for termination. ...
The corresponding ranking relation consists of all pairs of states with decreasing rank, including the pair (s, s ). ...
doi:10.1007/11817963_37
fatcat:y52cl4ac3nexrioarh5q4u6dgi
Partially Disjunctive Heap Abstraction
[chapter]
2004
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 2005; you can also visit the original URL.
The file type is application/pdf.
We implemented this abstraction in TVLA-a generic system for implementing program analyses.We conducted an empirical evaluation of the new abstraction and compared it with the powerset heap abstraction ...
with no negative effect on the overall precision. ...
Acknowledgements The authors wish to thank Alexey Loginov for supplying us the tree benchmarks and the DSW benchmark, and Eran Yahav for supplying us the IOStream benchmarks, the KernelBench.1 benchmark ...
doi:10.1007/978-3-540-27864-1_20
fatcat:eczj6rj6zzaq5imqv5qifffmlm
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.
to focus their efforts at the appropriate level of abstraction. ...
We provide tool support, including two back-end verifiers, one based on symbolic execution, and one on verification condition generation; this facilitates experimenting with the two prevailing techniques ...
For instance, Boogie's free precondition is expressed in Silver as a regular precondition with a paired assertion whose second component is simply true. ...
doi:10.1007/978-3-662-49122-5_2
fatcat:ukxit5welnfcfpjo2vilygat4u
Explicit-State Software Model Checking Based on CEGAR and Interpolation
[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 2013; you can also visit the original URL.
The file type is application/pdf.
Abstraction, counterexample-guided refinement, and interpolation are techniques that are essential to the success of predicate-based program analysis. ...
We also show that combining our new approach with an auxiliary predicate analysis scores significantly higher than the SV-COMP'12 winner. An extended version of this article appeared as Tech. ...
The state exploration starts with choosing and removing an abstract state with precision from the waitlist, and the algorithm considers each abstract successor according to the transfer relation. ...
doi:10.1007/978-3-642-37057-1_11
fatcat:wdx3iegsifgvrgypsbar4ze4qy
Gillian, Part II: Real-World Verification for JavaScript and C
[chapter]
2021
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 2022; you can also visit the original URL.
The file type is application/pdf.
We verify the JavaScript and C implementations of the AWS Encryption SDK message header deserialisation module, specifically designing common abstractions used for both verification tasks, and find two ...
AbstractWe introduce verification based on separation logic to Gillian, a multi-language platform for the development of symbolic analysis tools which is parametric on the memory model of the target language ...
We would especially like to thank Ryan Emery for many detailed discussions about his JS code. We thank the reviewers, whose comments have improved the overall quality of the paper. ...
doi:10.1007/978-3-030-81688-9_38
fatcat:h4dhm6qiobbsfhxb4kuvoniocy
Formal Verification for C Program
2007
Informatica
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.
In order to reduce time complexities, we partition the set of candidate predicates into subsets, and construct abstract model independently. ...
The approach eliminates unneeded variables using program slicing technique, and then automatically extracts an initial abstract model from C source code using predicate abstraction and theorem proving. ...
For the construction of abstract model A, we combine the control flow graph and the predicate abstraction to obtain the state space C × V. A state of A is a pair c, v , where c ∈ C and v ∈ V. ...
doi:10.15388/informatica.2007.178
fatcat:skgunlt25vekjbufody6orzufe
« Previous
Showing results 1 — 15 out of 22,875 results