Sciweavers

154 search results - page 14 / 31
» Dependence Flow Graphs: An Algebraic Approach to Program Dep...
Sort
View
CCS
2006
ACM
13 years 10 months ago
A scalable approach to attack graph generation
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...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
13 years 11 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
PLDI
2009
ACM
14 years 1 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
ICFP
2012
ACM
11 years 9 months ago
Addressing covert termination and timing channels in concurrent information flow systems
When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited ...
Deian Stefan, Alejandro Russo, Pablo Buiras, Amit ...
DMCS
2003
13 years 8 months ago
A symbolic projection of Langton's Ant
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
Anahí Gajardo