Sciweavers

174 search results - page 9 / 35
» Directional Type Checking of Logic Programs
Sort
View
ENTCS
2008
101views more  ENTCS 2008»
13 years 8 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CSFW
2007
IEEE
14 years 3 months ago
Do As I SaY! Programmatic Access Control with Explicit Identities
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, J...
ESOP
2006
Springer
14 years 11 days ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
14 years 13 days ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang