6978 search results - page 204 / 1396 » On Proofs in System P |
167
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
199
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
191
click to vote
DBSEC
2006
15 years 8 months ago
2006
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
287
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
160
click to vote
RTA
2005
Springer
16 years 1 days ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...