JSC
2010
13 years 5 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
13 years 5 months ago
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
ICSE
2010
IEEE-ACM
13 years 11 months ago
2010
IEEE-ACM
We present a novel approach to automatic synthesis of loopfree programs. The approach is based on a combination of oracle-guided learning from examples, and constraint-based synth...
CSL
2004
Springer
14 years 6 days ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...