Derivation tree analysis for accelerated fixed-point computation

DOI10.1016/j.tcs.2011.03.020zbMath1218.68102MaRDI QIDQ549189

Michael Luttenberger, Javier Esparza, Stefan Kiefer

Publication date: 7 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.020

zbMATH Keywords

semirings; fixed-point equations; derivation trees

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

68Q65: Abstract data types; algebraic specification

16Y60: Semirings

Related Items

On the Balancedness of Tree-to-Word Transducers, On the Balancedness of Tree-to-Word Transducers

Uses Software

• mCRL

Cites Work

• Weighted pushdown systems and their application to interprocedural dataflow analysis
• A generic approach to the static analysis of concurrent programs with procedures
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Efficient Computation of Throughput Values of Context-Free Languages
• On Fixed Point Equations over Commutative Semirings
• Process algebra for synchronous communication
• Process Algebra
• Model Checking Probabilistic Pushdown Automata
• An Extension of Newton’s Method to ω-Continuous Semirings
• Precise Fixpoint Computation Through Strategy Iteration
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item