Sciweavers

200 search results - page 19 / 40
» Tyrolean Termination Tool
Sort
View
CADE
2009
Springer
14 years 8 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
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...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
APLAS
2007
ACM
13 years 11 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel
FLOPS
2006
Springer
13 years 11 months ago
Resource Analysis by Sup-interpretation
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
Jean-Yves Marion, Romain Péchoux
APAQS
2001
IEEE
13 years 11 months ago
A Path-Based Approach to the Detection of Infinite Looping
Infinite looping is a common type of program error. This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on p...
Jian Zhang
POPL
2007
ACM
14 years 7 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...