106 search results - page 8 / 22 » Termination Analysis of Logic Programs Based on Dependency G... |
134
click to vote
DAC
1994
ACM
15 years 3 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
90
Voted
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
92
Voted
FMCO
2003
Springer
15 years 4 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
85
Voted
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
107
click to vote
CCS
2006
ACM
15 years 3 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...