37 search results - page 2 / 8 » Towards Structurally-Free Theorem Proving |
CSL
2004
Springer
13 years 9 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
CSFW
2000
IEEE
13 years 9 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
GCC
2003
Springer
13 years 10 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
TPHOL
1997
IEEE
13 years 9 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...