Tapas: Theory Combinations and Practical Applications

  • Nikolaj Bjørner
  • Leonardo de Moura
Conference paper

DOI: 10.1007/978-3-642-04368-0_1

Volume 5813 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bjørner N., de Moura L. (2009) Tapas: Theory Combinations and Practical Applications. In: Ouaknine J., Vaandrager F.W. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2009. Lecture Notes in Computer Science, vol 5813. Springer, Berlin, Heidelberg

Abstract

Satisfiability Modulo Theories is about checking the satisfiability of logical formulas over one or more theories. We provide an appetizer of SMT solving, illustrate an application for test-case generation based on dynamic symbolic execution and summarize an array of existing applications, enabling features, challenges and future directions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Nikolaj Bjørner
    • 1
  • Leonardo de Moura
    • 1
  1. 1.Microsoft ResearchOne Microsoft WayRedmondUSA