797 search results - page 79 / 160 » Eliminating Proofs from Programs |
POPL
2011
ACM
13 years 2 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
RAID
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In order to detect a compromise of a running process based on it deviating from its program’s normal system-call behavior, an anomaly detector must first be trained wi...
CCS
2006
ACM
14 years 2 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
ITCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...
ICFP
2005
ACM
14 years 11 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...