3572 search results - page 410 / 715 » Nominal Logic Programming |
178
Voted
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
174
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
160
click to vote
DRM
2007
Springer
16 years 10 days ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
289
Voted
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
236
click to vote
POPL
2001
ACM
16 years 6 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...