313 search results - page 9 / 63 » Lazy Abstraction with Interpolants |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper investigates a novel procedure to calculate smooth interpolation curves of the rotation group SO3, which is commonly considered as the standard representatio...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
IFL
2007
Springer
14 years 1 months ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of function...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...