Derivation Tree Analysis for Accelerated Fixed-Point Computation

DOI10.1007/978-3-540-85780-8_24zbMath1161.68880OpenAlexW1958977473MaRDI QIDQ3533020

Stefan Kiefer, Michael Luttenberger, Javier Esparza

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_24

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Derivation Tree Analysis for Accelerated Fixed-Point Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted pushdown systems and their application to interprocedural dataflow analysis
• Efficient Computation of Throughput Values of Context-Free Languages
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• On Fixed Point Equations over Commutative Semirings
• Model Checking Probabilistic Pushdown Automata
• An Extension of Newton’s Method to ω-Continuous Semirings
• STACS 2005
• Precise Fixpoint Computation Through Strategy Iteration
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Derivation Tree Analysis for Accelerated Fixed-Point Computation