3105 search results - page 265 / 621 » The Path-Packing Structure of Graphs |
134
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Existing data mining algorithms on graphs look for nodes satisfying specific properties, such as specific notions of structural similarity or specific measures of link-based impor...
121
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
146
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
124
click to vote
SGAI
2007
Springer
15 years 10 months ago
2007
Springer
A method must be provided to support the analysis of security policy rules interdependencies in a (possibly distributed) environment. We propose a Conceptual Graphs based language...