797 search results - page 79 / 160 » Eliminating Proofs from Programs |
176
click to vote
POPL
2011
ACM
14 years 6 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...
93
Voted
RAID
2009
Springer
15 years 10 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...
135
Voted
CCS
2006
ACM
15 years 7 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...
119
Voted
ITCC
2005
IEEE
15 years 9 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 ...
135
Voted
ICFP
2005
ACM
16 years 3 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...