437 search results - page 46 / 88 » Proving Termination by Divergence |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
ITP
2010
13 years 12 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
CADE
2009
Springer
14 years 8 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...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...