444 search results - page 29 / 89 » Termination by Abstraction |
PPDP
2007
Springer
14 years 3 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
ECOOP
2005
Springer
14 years 2 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
EUROCRYPT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
FORMATS
2004
Springer
14 years 2 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
LPAR
1999
Springer
14 years 1 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...