short-paper

Sound reasoning about integral data types with a reusable SMT solver interface

Authors:

Viktor KuncakAuthors Info & Claims

SCALA 2015: Proceedings of the 6th ACM SIGPLAN Symposium on Scala

Pages 35 - 40

https://doi.org/10.1145/2774975.2774980

Published: 13 June 2015 Publication History

Abstract

We extend the Leon verification system for Scala with support for bit-vector reasoning, thus addressing one of its fundamental soundness limitation with respect to the treatment of integers primitives. We leverage significant progresses recently achieved in SMT solving by developing a solver-independent interface to easily configure the back-end of Leon. Our interface is based on the emerging SMT-LIB standard for SMT solvers, and we release a Scala library offering full support for the latest version of the standard. We use the standard BigInt Scala library to represent mathematical integers, whereas we correctly model Int as 32-bit integers. We ensure safety of arithmetic by checking for division by zero and correctly modeling division and modulo. We conclude with a performance comparison between the sound representation of Ints and the cleaner abstract representation using mathematical integers, and discuss the trade-off involved.

References

[1]

C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovi´c, T. King, A. Reynolds, and C. Tinelli. CVC4. In Proceedings of the 23rd International Conference on Computer Aided Verification, CAV’11, pages 171–177, Berlin, Heidelberg, 2011. Springer-Verlag.

Digital Library

[2]

C. Barrett, A. Stump, and C. Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 2010.

[3]

R. Blanc, V. Kuncak, E. Kneuss, and P. Suter. An overview of the Leon verification system: Verification by translation to recursive functions. In Proceedings of the 4th Workshop on Scala, SCALA ’13, pages 1:1–1:10, New York, NY, USA, 2013. ACM.

Digital Library

[4]

R. T. Boute. The euclidean definition of the functions div and mod. ACM Trans. Program. Lang. Syst., 14(2):127–144, Apr. 1992.

Digital Library

[5]

R. Brummayer and A. Biere. Boolector: An efficient smt solver for bit-vectors and arrays. In Tools and Algorithms for the Construction and Analysis of Systems, pages 174–177. Springer, 2009.

Digital Library

[6]

E. Darulova. Programming with Numerical Uncertainties. PhD thesis, EPFL, 2014.

[7]

E. Darulova and V. Kuncak. Sound compilation of reals. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2014.

Digital Library

[8]

L. De Moura and N. Bjørner. Z3: An efficient smt solver. In TACAS, 2008.

Digital Library

[9]

J.-C. Filliâtre and A. Paskevich. Why3 – Where Programs Meet Provers. In ESOP’13 22nd European Symposium on Programming, volume 7792, Rome, Italy, Mar. 2013. Springer.

Digital Library

[10]

H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast Decision Procedures. In R. Alur and D. Peled, editors, Computer Aided Verification, volume 3114 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004.

[11]

S. Jha, R. Limaye, and S. Seshia. Beaver: Engineering an efficient smt solver for bit-vector arithmetic. In Computer Aided Verification, pages 668–674. 2009.

Digital Library

[12]

M. Kaufmann, J. S. Moore, and P. Manolios. Computer-aided reasoning: an approach. Kluwer Academic Publishers, 2000.

Digital Library

[13]

E. Kneuss, M. Koukoutos, and V. Kuncak. Deductive program repair. In Computer-Aided Verification (CAV), 2015.

[14]

E. Kneuss, I. Kuraj, V. Kuncak, and P. Suter. Synthesis modulo recursive functions. In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA ’13, pages 407–426, New York, NY, USA, 2013. ACM.

Digital Library

[15]

V. Kuncak, E. Kneuss, and P. Suter. Executing specifications using synthesis and constraint solving (invited talk). In Runtime Verification (RV), 2013.

[16]

K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR’10, pages 348–370, Berlin, Heidelberg, 2010. Springer-Verlag.

Digital Library

[17]

L. C. Paulson. Isabelle: A generic theorem prover, volume 828. Springer Science & Business Media, 1994.

[18]

P. Suter, M. Dotta, and V. Kuncak. Decision procedures for algebraic data types with abstractions. In Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’10, pages 199– 210, New York, NY, USA, 2010. ACM.

Digital Library

[19]

P. Suter, A. S. Köksal, and V. Kuncak. Satisfiability Modulo Recursive Programs. In SAS, 2011.

Digital Library

[20]

N. Voirol, E. Kneuss, and V. Kuncak. Counterexamplecomplete verification for higher-order functions. In SCALA, 2015.

Digital Library

[21]

C. Walther and S. Schweitzer. About verifun. In Automated Deduction–CADE-19, pages 322–327. Springer, 2003.

[22]

H. S. Warren. Hacker’s Delight. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002.

Digital Library

Cited By

Hamza JVoirol NKunčak V(2019)System FR: formalized foundations for the stainless verifierProceedings of the ACM on Programming Languages10.1145/33605923:OOPSLA(1-30)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360592
Schmid GKuncak VBiboudis AJonnalagedda MStucki SUreche V(2016)SMT-based checking of predicate-qualified types for ScalaProceedings of the 2016 7th ACM SIGPLAN Symposium on Scala10.1145/2998392.2998398(31-40)Online publication date: 30-Oct-2016
https://dl.acm.org/doi/10.1145/2998392.2998398

Index Terms

Sound reasoning about integral data types with a reusable SMT solver interface

Recommendations

SMT Solver-Based Cryptanalysis of Block Ciphers
Abstract
Satisfiability modulo theories (SMT) is a powerful framework for solving constraint satisfaction problem expressed in first-order logic and mainly used for software and hardware verification. In this article, we demonstrate the power of SMT ...
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiability

We present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSAT_CNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Maxterm Covering for Satisfiability

This paper presents a novel efficient satisfiability (SAT) algorithm based on maxterm covering. The satisfiability of a clause set is determined in terms of the number of relative maxterms of the empty clause with respect to the clause set. If the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SCALA 2015: Proceedings of the 6th ACM SIGPLAN Symposium on Scala

June 2015

55 pages

ISBN:9781450336260

DOI:10.1145/2774975

Program Chairs:
Philipp Haller,
Heather Miller

Copyright © 2015 ACM.

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 the author(s) 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].

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

Conference

PLDI '15

Sponsor:

SIGPLAN

PLDI '15: ACM SIGPLAN Conference on Programming Language Design and Implementation

June 13, 2015

OR, Portland, USA

Acceptance Rates

Overall Acceptance Rate 5 of 6 submissions, 83%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
95
Total Downloads

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

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hamza JVoirol NKunčak V(2019)System FR: formalized foundations for the stainless verifierProceedings of the ACM on Programming Languages10.1145/33605923:OOPSLA(1-30)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360592
Schmid GKuncak VBiboudis AJonnalagedda MStucki SUreche V(2016)SMT-based checking of predicate-qualified types for ScalaProceedings of the 2016 7th ACM SIGPLAN Symposium on Scala10.1145/2998392.2998398(31-40)Online publication date: 30-Oct-2016
https://dl.acm.org/doi/10.1145/2998392.2998398

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.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents