Article

Exploiting shared structure in software verification conditions

Authors:

Domagoj Babić,

Alan J. HuAuthors Info & Claims

HVC'07: Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing

Pages 169 - 184

Published: 23 October 2007 Publication History

Abstract

Despite many advances, today's software model checkers and extended static checkers still do not scale well to large code bases, when verifying properties that depend on complex interprocedural flow of data. An obvious approach to improve performance is to exploit software structure. Although a tremendous amount of work has been done on exploiting structure at various levels of granularity, the fine-grained shared structure among multiple verification conditions has been largely ignored. In this paper, we formalize the notion of shared structure among verification conditions, propose a novel and efficient approach to exploit this sharing, and provide experimental results that this approach can significantly improve the performance of verification, even on pathand context-sensitive and dataflow-intensive properties.

References

[1]

Babic, D., Hu, A.J.: Structural abstraction of software verification conditions. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 371-383. Springer, Heidelberg (2007).

Digital Library

[2]

Babic, D., Musuvathi, M.: Modular Arithmetic Decision Procedure. Technical Report TR- 2005-114, Microsoft Research Redmond (2005).

[3]

Ball, T., Lahiri, S.K., Musuvathi, M.: Zap: Automated theorem proving for software analysis. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 2-22. Springer, Heidelberg (2005).

Digital Library

[4]

Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: PLDI, ACM SIGPLAN Notices, vol. 36, pp. 203-213 (2001).

Digital Library

[5]

Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 358-372. Springer, Heidelberg (2007).

Digital Library

[6]

Conway, C.L., Namjoshi, K.S., Dams, D., Edwards, S.A.: Incremental Algorithms for Interprocedural Analysis of Safety Properties. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 449-461. Springer, Heidelberg (2005).

Digital Library

[7]

Detlefs, D., Nelson, G., Saxe, J.S.: Simplify: A Theorem Prover for Program Checking. Technical report, HP Laboratories Palo Alto, Technical Report HPL-2003-148 (2003).

[8]

Dijkstra, E.W., Scholten, C.S.: Predicate calculus and program semantics. Springer, New York (1990).

Digital Library

[9]

Dutertre, B., de Moura, L.M.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006).

Digital Library

[10]

Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. In: PLDI, ACM SIGPLAN Notices, pp. 234-245 (2002).

Digital Library

[11]

Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: Generating compact verification conditions. In: POPL, pp. 193-205. ACM Press, New York (2001).

Digital Library

[12]

Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast Decision Procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 175-188. Springer, Heidelberg (2004).

[13]

Hooker, J.N.: Solving the incremental satisfiability problem. J. Log. Program. 15(1-2), 177- 186 (1993).

Digital Library

[14]

Kroening, D., Clarke, E., Yorav, K.: Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking. In: DAC, pp. 368-371. ACM Press, New York (2003).

Digital Library

[15]

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

Digital Library

[16]

Leino, K.R.M., Logozzo, F.: Loop invariants on demand. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 119-134. Springer, Heidelberg (2005).

Digital Library

[17]

Leino, K.R.M., Müller, P.: A verification methodology for model fields. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol. 3924, pp. 115-130. Springer, Heidelberg (2006).

Digital Library

[18]

Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121-141 (1979).

Digital Library

[19]

Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC, pp. 530-535. ACM Press, New York (2001).

Digital Library

[20]

Nelson, G.: Techniques for program verification. PhD thesis, Stanford University (1979).

Digital Library

[21]

Prosser, R.T.: Applications of boolean matrices to the analysis of flow diagrams. In: Proceedings of the Eastern Joint Computer Conference, pp. 133-138. Spartan Books (1959).

Digital Library

[22]

Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Global value numbers and redundant computations. In: POPL, pp. 12-27. ACM Press, New York (1988).

Digital Library

[23]

Rountev, A., Kagan, S., Marlowe, T.J.: Interprocedural dataflow analysis in the presence of large libraries. In: Mycroft, A., Zeller, A. (eds.) CC 2006 and ETAPS 2006. LNCS, vol. 3923, pp. 2-16. Springer, Heidelberg (2006).

Digital Library

[24]

Stump, A., Barrett, C., Dill, D.: CVC: A Cooperating Validity Checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002).

Digital Library

[25]

Stump, A., Dill, D.L.: Faster Proof Checking in the Edinburgh Logical Framework. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 392-407. Springer, Heidelberg (2002).

Digital Library

[26]

Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970, pp. 466-483. Springer, Heidelberg (1983).

[27]

Xie, Y., Aiken, A.: Scalable error detection using boolean satisfiability. In: POPL, pp. 351- 363. ACM Press, New York (2005).

Digital Library

[28]

Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD, pp. 279-285. IEEE Press, Los Alamitos (2001).

Digital Library

Cited By

(2017)The Configurable SAT Solver Challenge (CSSC)Artificial Intelligence10.1016/j.artint.2016.09.006243:C(1-25)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.artint.2016.09.006
Babic DHu ASchäfer WDwyer MGruhn V(2008)CalystoProceedings of the 30th international conference on Software engineering10.1145/1368088.1368118(211-220)Online publication date: 15-May-2008
https://dl.acm.org/doi/10.1145/1368088.1368118

Index Terms

Exploiting shared structure in software verification conditions

Index terms have been assigned to the content through auto-classification.

Recommendations

Specification and automated verification of concurrent software systems
Systems and Software Verification: Model-Checking Techniques and Tools
On Quantitative Software Verification
Proceedings of the 16th International SPIN Workshop on Model Checking Software

Software verification has made great progress in recent years, resulting in several tools capable of working directly from source code, for example, SLAM and Astree. Typical properties that can be verified are expressed as Boolean assertions or temporal ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

HVC'07: Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing

October 2007

267 pages

ISBN:3540779647

Editor:
Karen Yorav
IBM Haifa Labs, Haifa, Israel

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 October 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
1
Total Downloads

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

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

(2017)The Configurable SAT Solver Challenge (CSSC)Artificial Intelligence10.1016/j.artint.2016.09.006243:C(1-25)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.artint.2016.09.006
Babic DHu ASchäfer WDwyer MGruhn V(2008)CalystoProceedings of the 30th international conference on Software engineering10.1145/1368088.1368118(211-220)Online publication date: 15-May-2008
https://dl.acm.org/doi/10.1145/1368088.1368118

View Options

View options

Get Access

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

Media

Figures

Other

Tables

View Table of Contents