Scala to the power of Z3: integrating SMT and programming

Authors:
Ali Sinan Köksal;Viktor Kuncak;Philippe Suter
Affiliations:
École Polytechnique Fédérale de Lausanne (EPFL), Switzerland;École Polytechnique Fédérale de Lausanne (EPFL), Switzerland;École Polytechnique Fédérale de Lausanne (EPFL), Switzerland
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 5
Cited 4

Java Native Interface: Programmer's Guide and Reference

Java Native Interface: Programmer's Guide and Reference
Programming in Scala: A Comprehensive Step-by-step Guide

Programming in Scala: A Comprehensive Step-by-step Guide
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Sets with cardinality constraints in satisfiability modulo theories

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Matching objects with patterns

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming

Constraints as control

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesis of biological models from mutation experiments

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An overview of the Leon verification system: verification by translation to recursive functions

Proceedings of the 4th Workshop on Scala
Smten: automatic translation of high-level symbolic computations into SMT queries

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees into Scala uses the host type system of Scala to prevent the construction of certain ill-typed constraints. The solution enumeration feature integrates into the iteration constructions of Scala and supports writing non-deterministic programs. Using Z3's mechanism of theory extensions, our system also helps users construct custom constraint solvers where the interpretation of predicates and functions is given as Scala code. The resulting system preserves the productivity advantages of Scala while simplifying tasks such as combinatorial search.