Sciweavers

220 search results - page 12 / 44
» Coq Modulo Theory
Sort
View
MEMOCODE
2010
IEEE
14 years 7 months ago
A flexible schema for generating explanations in lazy theory propagation
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
Roberto Bruttomesso, Edgar Pek, Natasha Sharygina
IANDC
2010
141views more  IANDC 2010»
14 years 8 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
TPHOL
2007
IEEE
15 years 3 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
14 years 8 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
CIE
2008
Springer
14 years 11 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes