Sciweavers

1749 search results - page 321 / 350
» Conditional colorings of graphs
Sort
View
CCS
2007
ACM
15 years 5 months ago
Topological analysis of network attack vulnerability
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
Sushil Jajodia
LOPSTR
2007
Springer
15 years 5 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
PEPM
2007
ACM
15 years 5 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
POLICY
2007
Springer
15 years 5 months ago
Specifying and Enforcing High-Level Semantic Obligation Policies
Obligation Policies specify management actions that must be performed when a particular kind of event occurs and certain conditions are satisfied. Large scale distributed systems...
Zhen Liu, Anand Ranganathan, Anton Riabov
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
15 years 5 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston