837 search results - page 57 / 168 » Proof Development with OMEGA |
145
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
124
click to vote
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
144
click to vote
FMOODS
2007
15 years 5 months ago
2007
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
116
click to vote
IANDC
2008
15 years 4 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
127
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...