Sciweavers

11716 search results - page 72 / 2344
» Computable symbolic dynamics
Sort
View
FOSSACS
2007
Springer
16 years 9 days ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
IPPS
2006
IEEE
16 years 5 days ago
A framework to develop symbolic performance models of parallel applications
Performance and workload modeling has numerous uses at every stage of the high-end computing lifecycle: design, integration, procurement, installation and tuning. Despite the trem...
Sadaf R. Alam, Jeffrey S. Vetter
FMCAD
2000
Springer
15 years 9 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
CADE
2010
Springer
15 years 7 months ago
Interpolation and Symbol Elimination in Vampire
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...
Krystof Hoder, Laura Kovács, Andrei Voronko...
COOPIS
2003
IEEE
15 years 11 months ago
Analysing Mailboxes of Asynchronous Communicating Components
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
Jean-Claude Royer, Michael Xu