328 search results - page 18 / 66 » Proving Termination of Communicating Programs |
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
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...
AAECC
2007
Springer
13 years 7 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
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...