NDLI: Program verification using templates over predicate abstraction

Content Provider	ACM Digital Library
Author	Srivastava, Saurabh Gulwani, Sumit
Abstract	We address the problem of automatically generating invariants with quantified and boolean structure for proving the validity of given assertions or generating pre-conditions under which the assertions are valid. We present three novel algorithms, having different strengths, that combine template and predicate abstraction based formalisms to discover required sophisticated program invariants using SMT solvers. Two of these algorithms use an iterative approach to compute fixed-points (one computes a least fixed-point and the other computes a greatest fixed-point), while the third algorithm uses a constraint based approach to encode the fixed-point. The key idea in all these algorithms is to reduce the problem of invariant discovery to that of finding optimal solutions for unknowns (over conjunctions of some predicates from a given set) in a template formula such that the formula is valid. Preliminary experiments using our implementation of these algorithms show encouraging results over a benchmark of small but complicated programs. Our algorithms can verify program properties that, to our knowledge, have not been automatically verified before. In particular, our algorithms can generate full correctness proofs for sorting algorithms (which requires nested universally-existentially quantified invariants) and can also generate preconditions required to establish worst-case upper bounds of sorting algorithms. Furthermore, for the case of previously considered properties, in particular sortedness in sorting algorithms, our algorithms take less time than reported by previous techniques.
Starting Page	223
Ending Page	234
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/1543135.1542501
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	44
Issue Number	6
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Weakest preconditions Template invariants Smt solvers Iterative fixed-point Predicate abstraction Constraint-based fixed-point Quantified invariants
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Program verification using templates over predicate abstraction

Back to the future:revisiting precise program verification using SMT solvers

Counterexample-guided focus

Path invariants

Template-based program verification and program synthesis

Program verification using templates over predicate abstraction.

Static specification inference using predicate mining

Snugglebug:a powerful approach to weakest preconditions

Predicate abstraction for software verification

Program verification using templates over predicate abstraction

Similar Documents

Program verification using templates over predicate abstraction

Back to the future:revisiting precise program verification using SMT solvers

Counterexample-guided focus

Path invariants

Template-based program verification and program synthesis

Program verification using templates over predicate abstraction.

Static specification inference using predicate mining

Snugglebug:a powerful approach to weakest preconditions

Predicate abstraction for software verification

Program verification using templates over predicate abstraction