Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

This paper presents a component-based modelling approach to system-software co-
engineering of real-time embedded systems, in particular aerospace systems. Our method is …

We present MathSAT 4, a state-of-the-art SMT solver. MathSAT 4 handles several useful
theories:(combinations of) equality and uninterpreted functions, difference logic, linear …

Safety-critical systems are becoming more complex, both in the type of functionality they
provide and in the way they are demanded to interact with the environment. Such a growing …

The TM-LPSAT planner can construct plans in domains containing atomic actions and
durative actions; events and processes; discrete, real-valued, and interval-valued fluents; …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

The size and complexity of software in spacecraft is increasing exponentially, and this trend
complicates its validation within the context of the overall spacecraft system. Current …

Haskell has many delightful features. Perhaps the one most beloved by its users is its type
system that allows developers to specify and verify a variety of program properties at …

Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-
critical systems, like aircrafts or medical equipment, even a single bug can lead to …