116 search results - page 17 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
108
click to vote
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
115
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
ICSE
2003
IEEE-ACM
16 years 1 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
116
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
121
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...