1418 search results - page 260 / 284 » The Dynamic Complexity of Formal Languages |
178
click to vote
IFIP
2001
Springer
15 years 8 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
144
click to vote
EMSOFT
2009
Springer
15 years 8 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
133
click to vote
LISA
2003
15 years 5 months ago
2003
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
160
click to vote
INFORMS
1998
15 years 4 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
279
click to vote
SIGCOMM
2012
ACM
13 years 6 months ago
2012
ACM
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...