264 search results - page 32 / 53 » Expressing Iterative Properties Logically in a Symbolic Sett... |
104
click to vote
JACM
2007
14 years 11 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
148
click to vote
PLPV
2011
ACM
14 years 2 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
CADE
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
104
click to vote
CADE
2005
Springer
15 years 11 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...