Sciweavers

496 search results - page 74 / 100
» Practical Reasoning for Very Expressive Description Logics
Sort
View
ESOP
2008
Springer
14 years 11 months ago
A Realizability Model for Impredicative Hoare Type Theory
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
Rasmus Lerchedahl Petersen, Lars Birkedal, Aleksan...
LICS
2007
IEEE
15 years 3 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
TPHOL
1999
IEEE
15 years 1 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
ASWC
2006
Springer
15 years 1 months ago
Minerva: A Scalable OWL Ontology Storage and Inference System
With the increasing use of ontologies in Semantic Web and enterprise knowledge management, it is critical to develop scalable and efficient ontology management systems. In this pap...
Jian Zhou, Li Ma, Qiaoling Liu, Lei Zhang, Yong Yu...
FMSD
2002
114views more  FMSD 2002»
14 years 9 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa