1805 search results - page 90 / 361 » A Theory of Closure Operators |
153
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
119
click to vote
EMSOFT
2008
Springer
15 years 6 months ago
2008
Springer
Interface theories have been proposed to support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can pr...
123
click to vote
AAAI
1994
15 years 5 months ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
162
click to vote
LOGCOM
2002
15 years 4 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
123
click to vote
ESORICS
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and...