12 search results - page 2 / 3 » Recursive proofs for inductive tree data-structures |
104
Voted
ACL
1993
15 years 1 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
96
Voted
CEFP
2009
Springer
14 years 10 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
JUCS
2006
15 years 11 days ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
214
Voted
POPL
2008
ACM
16 years 22 days ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
193
click to vote
POPL
2004
ACM
16 years 22 days ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...