1894 search results - page 51 / 379 » A TLA Proof System |
102
click to vote
TYPES
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
104
Voted
WWW
2005
ACM
16 years 1 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...
130
click to vote
LFCS
1992
Springer
15 years 5 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...
126
Voted
DBSEC
2006
15 years 2 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...
209
click to vote
POPL
2008
ACM
16 years 1 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...