Sciweavers

30 search results - page 6 / 6
» fsttcs 2005
Sort
View
FSTTCS
2005
Springer
14 years 3 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
FSTTCS
2005
Springer
14 years 3 months ago
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saras...
FSTTCS
2006
Springer
14 years 1 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
FSTTCS
2005
Springer
14 years 3 months ago
Semiperfect-Information Games
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...
Krishnendu Chatterjee, Thomas A. Henzinger
ISBRA
2009
Springer
14 years 4 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...