4074 search results - page 623 / 815 » Abstract Graph Transformation |
136
Voted
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
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...
136
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
124
click to vote
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
130
Voted
EUROCAST
2007
Springer
15 years 6 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
166
click to vote
LICS
1991
IEEE
15 years 6 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...