Sciweavers

945 search results - page 42 / 189
» Working the Flow
Sort
View
ERSHOV
1999
Springer
14 years 1 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
KBSE
1997
IEEE
14 years 1 months ago
Modular Flow Analysis for Concurrent Software
Modern software systems are designed and implemented in a modular fashion by composing individual components. Early validation of individual module designs and implementations off...
Matthew B. Dwyer
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
Christopher Earl, Matthew Might, David Van Horn
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 9 months ago
Asymptotic Traffic Flow in an Hyperbolic Network II: Non-uniform Traffic
In this work we study the asymptotic traffic behaviour in Gromov's hyperbolic spaces when the traffic decays exponentially with the distance. We prove that under general condi...
Yuliy Baryshnikov, Gabriel H. Tucci
JCT
2007
94views more  JCT 2007»
13 years 8 months ago
A zero-free interval for flow polynomials of cubic graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
Bill Jackson