Sciweavers

2473 search results - page 106 / 495
» The Logic of Communication Graphs
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management
—We investigate the design of a clean-slate control and nt plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of logically c...
Hammad Iqbal, Taieb Znati
LICS
1994
IEEE
14 years 1 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey
BIRTHDAY
2010
Springer
13 years 9 months ago
Change Management for Heterogeneous Development Graphs
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
Serge Autexier, Dieter Hutter, Till Mossakowski
OOPSLA
2007
Springer
14 years 3 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 9 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen