368 search results - page 16 / 74 » Arithmetic as a Theory Modulo |
IANDC
2010
13 years 7 months ago
2010
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...
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
13 years 7 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...
ASIAN
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
PLILP
1998
Springer
14 years 28 days ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
APAL
2008
13 years 8 months ago
2008
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...