1716 search results - page 72 / 344 » Proving Conditional Termination |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
WMASH
2004
ACM
14 years 2 months ago
2004
ACM
Wireless networked embedded terminals like personal digital assistants, cell-phones or sensor nodes are typically memory constrained devices. This limitation prevents the developm...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
IPL
2007
13 years 8 months ago
2007
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
POPL
2007
ACM
14 years 9 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...