888 search results - page 79 / 178 » The Power of Temporal Proofs |
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
100
click to vote
COMPSAC
2009
IEEE
14 years 11 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
ENTCS
2007
14 years 10 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
EATCS
2000
14 years 9 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
101
click to vote
ASWEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...