1716 search results - page 28 / 344 » Proving Conditional Termination |
TPHOL
2008
IEEE
14 years 3 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
ERSHOV
2009
Springer
14 years 3 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
AMAST
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...
FLOPS
2008
Springer
13 years 10 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
DC
2007
13 years 8 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...