Sciweavers

903 search results - page 95 / 181
» Completeness Results for Memory Logics
Sort
View
ITP
2010
156views Mathematics» more  ITP 2010»
14 years 23 days ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
FSTTCS
2007
Springer
14 years 22 days ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey
EUROMICRO
2004
IEEE
14 years 18 days ago
The Need for Declarative Security Mechanisms
Today, security is recognized as an absolute need in application development. Programming environments offer mechanisms and concepts allowing an easy integration of security mecha...
Stefan Probst, Josef Küng
FMCAD
2006
Springer
14 years 16 days ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch
DLOG
2007
13 years 11 months ago
A Proof Theory for DL-Lite
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt