Verification and falsification of programs with loops using predicate abstraction-Reference-Cited by-同舟云学术

Verification and falsification of programs with loops using predicate abstraction

Published:2010-03 Issue:2 Volume:22 Page:105-128
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Kroening Daniel¹,Weissenbacher Georg¹²

Affiliation:

1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

2. Computer Systems Institute, ETH Zurich, Zurich, Switzerland

Abstract

Abstract Predicate abstraction is a major abstraction technique for the verification of software. Data is abstracted by means of Boolean variables, which keep track of predicates over the data. In many cases, predicate abstraction suffers from the need for at least one predicate for each iteration of a loop construct in the program. We propose to extract looping counterexamples from the abstract model, and to parametrise the simulation instance in the number of loop iterations. We present a novel technique that speeds up the detection of long counterexamples as well as the verification of programs with loops.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-009-0110-2.pdf

Reference56 articles.

1. Armando A Benerecetti M Carotenuto D Mantovani J Spica P (2007) The EUREKA tool for software model checking. In: Automated software engineering (ASE) pp 541–542. ACM Press New York

2. Armando A Benerecetti M Mantovani J (2006) Model checking linear programs with arrays. In: Software model checking (SoftMC). Electronic notes in theoretical computer science vol 144. Elsevier Amsterdam pp 79–94

3. Armando A Castellini C Mantovani J (2004) Software model checking using linear constraints. In: International conference on formal engineering methods (IFCEM). Lecture notes in computer science vol 3308. Springer Berlin pp 209–223

4. Ball T (2005) Engineering theories of software intensive systems. NATO Science Series II: mathematics physics and chemistry vol 195. Formalizing counterexample-driven refinement with weakest preconditions. Springer Berlin pp 121–139

5. Ball T Cook B Levin V Rajamani SK (2004) Slam and Static driver verifier: technology transfer of formal methods inside Microsoft. In: Integrated formal verification (IFM). Lecture Notes in Computer Science vol 2999. Springer Berlin

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Data and Knowledge Engineering for Legal Precedents Using First-Order Predicate Logic;2023 4th IEEE Global Conference for Advancement in Technology (GCAT);2023-10-06

2. Systematic Testing of the Data-Poisoning Robustness of KNN;Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis;2023-07-12

3. A deductive reasoning approach for database applications using verification conditions;Journal of Systems and Software;2021-05

4. Formal Verification of Database Applications Using Predicate Abstraction;SN Computer Science;2021-03-11

5. Approximation-refinement testing of compute-intensive cyber-physical models;Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering;2020-06-27