835 search results - page 26 / 167 » Characterizing rosy theories |
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
103
click to vote
IWPC
2005
IEEE
15 years 5 months ago
2005
IEEE
Program comprehension research can be characterized by both the theories that provide rich explanations about how programmers comprehend software, as well as the tools that are us...
IJCAI
1993
15 years 1 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
ESORICS
2010
Springer
15 years 26 days 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...
203
click to vote
ICLP
2009
Springer
16 years 12 days ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...