Formal Modeling and Analysis of Timed Systems

Volume 5813 of the series Lecture Notes in Computer Science pp 1-6

Tapas: Theory Combinations and Practical Applications

  • Nikolaj BjørnerAffiliated withMicrosoft Research, One Microsoft Way
  • , Leonardo de MouraAffiliated withMicrosoft Research, One Microsoft Way

* Final gross prices may vary according to local VAT.

Get Access


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.