Sciweavers

183 search results - page 16 / 37
» Reasoning About Assumptions in Graphs of Models
Sort
View
DBSEC
2009
122views Database» more  DBSEC 2009»
14 years 10 months ago
An Approach to Security Policy Configuration Using Semantic Threat Graphs
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
Simon N. Foley, William M. Fitzgerald
68
Voted
IPL
2008
89views more  IPL 2008»
14 years 9 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 9 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
TIME
2007
IEEE
15 years 4 months ago
Temporal Relations of Intervals with a Gap
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
Max J. Egenhofer
TSE
2010
151views more  TSE 2010»
14 years 8 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold