research-article

Verification conditions for single-assignment programs

Authors:

Daniela da Cruz,

Maria João Frade,

Jorge Sousa PintoAuthors Info & Claims

SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing

Pages 1264 - 1270

https://doi.org/10.1145/2245276.2231977

Published: 26 March 2012 Publication History

Get Access

Abstract

A mechanism for generating verification conditions (VCs) for the iteration-free fragment of an imperative language is fundamental in any deductive program verification system. In this paper we revisit symbolic execution, weakest preconditions, and bounded model checking as VC-generation mechanisms, and propose a uniform presentation of the corresponding sets of VCs, in terms of (logical encodings of) paths in the control-flow graph of a single-assignment form of the program under analysis. This allows us to compare the mechanisms, in particular with respect to the size of the generated formulas.

References

[1]

Wolfgang Ahrendt et al. The KeY tool. Software and System Modeling, 4(1): 32--54, 2005.

Digital Library

Google Scholar

[2]

Alessandro Armando, Jacopo Mantovani, and Lorenzo Platania. Bounded model checking of software using SMT solvers instead of SAT solvers. Int. J. Softw. Tools Technol. Transf., 11: 69--83, January 2009.

Digital Library

Google Scholar

[3]

John Barnes. High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley Longman Publishing Co., Inc., 2003.

Digital Library

Google Scholar

[4]

Michael Barnett et al. Boogie: A modular reusable verifier for object-oriented programs. In FMCO'05, volume 4111 of Lecture Notes in Comp. Science, pages 364--387. Springer, 2005.

Digital Library

Google Scholar

[5]

Armin Biere et al. Bounded model checking. Advances in Computers, 58: 118--149, 2003.

Google Scholar

[6]

Edmund Clarke, Daniel Kroening, and Flavio Lerda. A tool for checking ANSI-C programs. In Tools and Algorithms for the Construction and Analysis of Systems, pages 168--176. Springer, 2004.

Crossref

Google Scholar

[7]

E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, New Jersey, 1976.

Digital Library

Google Scholar

[8]

Cormac Flanagan and James B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In Proc. of POPL'01, pages 193--205, New York, NY, USA, 2001. ACM.

Digital Library

Google Scholar

[9]

Maria João Frade and Jorge Sousa Pinto. Verification Conditions for Source-level Imperative Programs. Computer Science Review, 5: 252--277, 2011.

Digital Library

Google Scholar

[10]

Mike Gordon and Hélène Collavizza. Forward with hoare. In A. W. Roscoe, Cliff B. Jones, and Kenneth R. Wood, editors, Reflections on the Work of C.A.R. Hoare, History of Computing, pages 101--121. Springer London, 2010.

Google Scholar

[11]

Radu Grigore et al. Strongest postcondition of unstructured programs. In Proc. of the 11th Int. Workshop on Formal Techniques for Java-like Programs, FTfJP '09, pages 6: 1--6: 7, New York, NY, USA, 2009. ACM.

Digital Library

Google Scholar

[12]

K. Rustan M. Leino. Efficient weakest preconditions. Inf. Process. Lett., 93(6): 281--288, 2005.

Digital Library

Google Scholar

[13]

Peter Vanbroekhoven et al. A practical dynamic single assignment transformation. ACM Trans. Des. Autom. Electron. Syst., 12, Sept. 2007.

Digital Library

Google Scholar

Cited By

View all

Belo Lourenco CFrade MNakajima SSousa Pinto J(2018)A Generalized Approach to Verification Condition Generation2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2018.00032(194-203)Online publication date: Jul-2018
https://doi.org/10.1109/COMPSAC.2018.00032

Verification conditions for single-assignment programs

Recommendations

Single-Assignment Program Verification
Verification conditions for source-level imperative programs

This paper is a systematic study of verification conditions and their use in the context of program verification. We take Hoare logic as a starting point and study in detail how a verification conditions generator can be obtained from it. The notion of ...
Efficient Verification of Sequential and Concurrent C Programs

There has been considerable progress in the domain of software verification over the last few years. This advancement has been driven, to a large extent, by the emergence of powerful yet automated abstraction techniques such as predicate abstraction. ...

Comments

Information & Contributors

Information

Published In

SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing

March 2012

2179 pages

ISBN:9781450308571

DOI:10.1145/2245276

Conference Chairs:
Sascha Ossowski
University Rey Juan Carlos, Spain
,
Paola Lecca
The Microsoft Research - University of Trento COSBI, Italy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Fundação para a Ciência e a Tecnologia

Conference

SAC 2012

Sponsor:

SIGAPP

SAC 2012: ACM Symposium on Applied Computing

March 26 - 30, 2012

Trento, Italy

Acceptance Rates

SAC '12 Paper Acceptance Rate 270 of 1,056 submissions, 26%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
111
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Belo Lourenco CFrade MNakajima SSousa Pinto J(2018)A Generalized Approach to Verification Condition Generation2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2018.00032(194-203)Online publication date: Jul-2018
https://doi.org/10.1109/COMPSAC.2018.00032

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

Single-Assignment Program Verification

Verification conditions for source-level imperative programs

Efficient Verification of Sequential and Concurrent C Programs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations