54 search results - page 4 / 11 » Proving operational termination of membership equational pro... |
89
Voted
CADE
2008
Springer
15 years 10 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
178
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
81
Voted
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
80
Voted
TAPSOFT
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...