368 search results - page 9 / 74 » Arithmetic as a Theory Modulo |
144
Voted
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
121
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
137
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
157
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
132
Voted
CODES
2010
IEEE
15 years 1 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...