Filters








8,427 Hits in 4.6 sec

Enhancing Predicate Pairing with Abstraction for Relational Verification [article]

Emanuele De Angelis , Maurizio Proietti DEC, University G. D'Annunzio, Chieti-Pescara, Italy, IASI-CNR, Roma, Italy)
2017 arXiv   pre-print
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

Predicate Pairing with Abstraction for Relational Verification [chapter]

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2018 Lecture Notes in Computer Science  
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

Gene sorting in differential evolution with cross-generation mutation

Remi Tassing, Lei Guo, Jian Liu, HongZhi Lin, GuangXi Zhu
2011 Science China Information Sciences  
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

Verification by Abstraction [chapter]

Natarajan Shankar
2003 Lecture Notes in Computer Science  
The resulting abstraction can be explored for offending computations through the use of model checking. We motivate the use of abstraction in verification and survey some of the recent advances.  ...  Abstraction serves as a bridge between the more general deductive methods for program verification and the restricted but effective state exporation methods used in model checking.  ...  This property fails to hold of the abstract program even when we enrich the abstraction with the predicates y ≤ M for a bound M .  ... 
doi:10.1007/978-3-540-40007-3_23 fatcat:tyj42kb4drho3krraqx6pvy6hi

A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification [chapter]

Wei-Ngan Chin, Cristian Gherghina, Răzvan Voicu, Quang Loc Le, Florin Craciun, Shengchao Qin
2011 Lecture Notes in Computer Science  
Separation logic-based abstraction mechanisms, enhanced with userdefined inductive predicates, represent a powerful, expressive means of specifying heap-based data structures with strong invariant properties  ...  While specialization is a familiar technique for code optimization, its use in program verification is new.  ...  We thank the reviewers for insightful feedback. This work is being supported principally by MoE research grant R-252-000-411-112.  ... 
doi:10.1007/978-3-642-22110-1_23 fatcat:nqhhvz2ctbeslb2z7t44e5tba4

Formal Verification for C Program

Junyan Qian, Baowen Xu
2007 Informatica  
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

When Regression Verification Meets CEGAR [article]

Fei He, Qianshan Yu, Liming Cai
2018 arXiv   pre-print
By combining regression verification and CEGAR, we propose a technique that is able to reuse procedure summaries across different abstract precisions and different program revisions.  ...  Regression verification suggests reusing intermediate results from the previous verification runs. This paper proposes a fully automatic regression verification technique in the context of CEGAR.  ...  A state of P is a pair (l, u), where l ∈ L is a program location and u is a valuation to X . Predicate abstraction is a popular abstraction technique for software verification.  ... 
arXiv:1806.04829v1 fatcat:wjitbqkzyvbctijkjlrabeecpm

Analysis and Transformation of Constrained Horn Clauses for Program Verification

EMANUELE DE ANGELIS, FABIO FIORAVANTI, JOHN P. GALLAGHER, MANUEL V. HERMENEGILDO, ALBERTO PETTOROSSI, MAURIZIO PROIETTI
2021 Theory and Practice of Logic Programming  
We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  Acknowledgments We would like to thank Isabel García-Contreras, Bishoksan Kafle, and José Francisco Morales for discussions.  ... 
doi:10.1017/s1471068421000211 fatcat:zfzmqjuozzd5dlfgog7kfmxhce

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
2021 arXiv   pre-print
We present specialisation-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  Acknowledgments We would like to thank Isabel García-Contreras, Bishoksan Kafle, and José Francisco Morales for discussions.  ... 
arXiv:2108.00739v1 fatcat:gevl2xlor5hrzentqc77irt6gu

An abstraction refinement approach combining precise and approximated techniques

Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich
2011 International Journal on Software Tools for Technology Transfer (STTT)  
A precise abstraction contains the minimal set of transitions with regard to the predicates, but as a result is computationally expensive.  ...  Most model checkers therefore approximate the abstraction to alleviate the computation of the abstract system by trading off precision with cost.  ...  The abstract transition relation can be obtained by enumerating the abstract states, and checking if, for each pair of states, there exists an abstract transition.  ... 
doi:10.1007/s10009-011-0185-y fatcat:g2gpjrlvvja3zpy6uywqdwh7mi

Compositional Verification of Heap-Manipulating Programs through Property-Guided Learning [article]

Long H. Pham, Jun Sun, Quang Loc Le
2019 arXiv   pre-print
For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order to decompose the verification problem.  ...  The experimental results show that our approach enhances existing verifiers effectively in automatically verifying complex heap-manipulating programs with multiple function calls.  ...  Related Work The closest to our work is approach for invariant inference using dynamic analysis with separation logic abstraction [30] .  ... 
arXiv:1908.10051v1 fatcat:ce5drvovxnhwnfto7x3qtmnfs4

Counterexample-guided predicate abstraction of hybrid systems

Rajeev Alur, Thao Dang, Franjo Ivančić
2006 Theoretical Computer Science  
We present the basic techniques for discovering new predicates that will rule out closely related spurious counter-examples, optimizations of these techniques, implementation of these in the verification  ...  Predicate abstraction has emerged to be a powerful technique for extracting finitestate models from infinite-state systems, and has been recently shown to enhance the effectiveness of the reachability  ...  We have recently shown that effectiveness of the reachability computation for hybrid systems can be enhanced using predicate abstraction [3] .  ... 
doi:10.1016/j.tcs.2005.11.026 fatcat:fykkoyrbyza2hhqrsxje2o74xa

Towards Evaluating Size Reduction Techniques for Software Model Checking

Gyula Sallai, Ákos Hajdu, Tamás Tóth, Zoltán Micskei
2017 Electronic Proceedings in Theoretical Computer Science  
Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction.  ...  Formal verification techniques are widely used for detecting design flaws in software systems.  ...  Related work. Predicate abstraction [15] , used in conjunction with CEGAR [11] is a widely used technique for model checking software [2, 6, 13, 10, 7] .  ... 
doi:10.4204/eptcs.253.7 fatcat:6env5ed7bjgyzkehfkp457gzni

A Tool-Assisted Framework for Certified Bytecode Verification [chapter]

Gilles Barthe, Guillaume Dufay
2004 Lecture Notes in Computer Science  
The highest quality levels EAL5 to EAL7 impose the use of formal methods for the modelling, specification and verification of the product being certified. founded order on states with a supremum, and by  ...  Bytecode verification is a key security function in several architectures for mobile and embedded code, including Java, JavaCard, and .NET.  ...  The types predicate A and relation A respectively denote the set of predicates and binary relations over a type A. We conclude with some basic definitions used throughout the paper.  ... 
doi:10.1007/978-3-540-24721-0_7 fatcat:2vgaiikiijakrop26csl7t5dry

Refinement strategies for verification methods based on datapath abstraction

Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah
2006 Proceedings of the 2006 conference on Asia South Pacific design automation - ASP-DAC '06  
The data suggest that localization, generalization, and MUS extraction from both the abstract and concrete models are essential for effective verification.  ...  The approach utilizes automatic datapath abstraction augmented with automatic refinement based on 1) localization, 2) generalization, and 3) minimal unsatisfiable subset (MUS) extraction.  ...  Refinement Strategies for Verification Methods Based on Datapath Abstraction CEGAR starts, in line 1, with the construction of an abstraction such that .  ... 
doi:10.1145/1118299.1118306 fatcat:jfb3jleuxjebzcnxtlhnibkl7m
« Previous Showing results 1 — 15 out of 8,427 results