FSTTCS 2010 - PDF Preprint Papers

FSTTCS 2010 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2010 Paper

click to vote

FSTTCS
2010
Springer

227views Software Engineering» more FSTTCS 2010»

The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems

13 years 8 months ago

Download drops.dagstuhl.de

We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...

Matthew Hague, Anthony Widjaja To

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	227	The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems	claim
2	210	Expressiveness of streaming string transducers	claim
3	193	Lower bounds for Quantum Oblivious Transfer	claim
4	193	Computationally Sound Abstraction and Verification of Secure Multi-Party Computations	claim
5	184	Global Escape in Multiparty Sessions	claim
6	179	The effect of girth on the kernelization complexity of Connected Dominating Set	claim
7	173	Recent Progress and Open Problems in Algorithmic Convex Geometry	claim
8	169	Global Model Checking of Ordered Multi-Pushdown Systems	claim
9	166	On extracting computations from propositional proofs (a survey)	claim
10	164	Combinatorial Problems with Discounted Price Functions in Multi-agent Systems	claim
11	161	One-Counter Stochastic Games	claim
12	160	Computing Rational Radical Sums in Uniform TC^0	claim
13	159	Colored Hypergraph Isomorphism is Fixed Parameter Tractable	claim
14	159	Finding Sparser Directed Spanners	claim
15	157	Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete	claim
16	154	Finding Independent Sets in Unions of Perfect Graphs	claim
17	151	Average Analysis of Glushkov Automata under a BST-Like Model	claim
18	146	ATL with Strategy Contexts: Expressiveness and Model Checking	claim
19	145	Generalizing the powerset construction, coalgebraically	claim
20	142	Fast equivalence-checking for normed context-free processes	claim
21	139	First-Order Logic with Reachability Predicates on Infinite Systems	claim
22	134	Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems	claim
23	133	Quasi-Random PCP and Hardness of 2-Catalog Segmentation	claim
24	133	Satisfiability of Acyclic and Almost Acyclic CNF Formulas	claim
25	133	Generalized Mean-payoff and Energy Games	claim
26	132	Determining the Winner of a Dodgson Election is Hard	claim
27	131	Parityizing Rabin and Streett	claim
28	130	Model Checking Concurrent Programs with Nondeterminism and Randomization	claim
29	124	Reasoning About Strategies	claim
30	124	Place-Boundedness for Vector Addition Systems with one zero-test	claim
31	121	Minimizing Busy Time in Multiple Machine Real-time Scheduling	claim
32	111	Model checking time-constrained scenario-based specifications	claim
33	111	A graph polynomial for independent sets of bipartite graphs	claim
34	101	Two Size Measures for Timed Languages	claim
35	98	Playing in stochastic environment: from multi-armed bandits to two-player games	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers