330 search results - page 45 / 66 » On Modular Termination Proofs of General Logic Programs |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
APLAS
2007
ACM
13 years 12 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...