4617 search results - page 751 / 924 » Automation of Diagrammatic Reasoning |
190
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
199
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
222
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
162
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
334
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...