8 search results - page 1 / 2 » LIRA: Handling Constraints of Linear Arithmetics over the In... |
CAV
2007
Springer
13 years 11 months ago
2007
Springer
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...
PRDC
2007
IEEE
13 years 11 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...