116 search results - page 19 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
130
Voted
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
145
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
137
Voted
PADO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
137
Voted
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
122
Voted
ISCAS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— Especially for tasks like automatic meeting transcription, it would be useful to automatically recognize speech also while multiple speakers are talking simultaneously....