Solving fixed-point equations by derivation tree analysis

Authors:
Javier Esparza;Michael Luttenberger
Affiliations:
Institut füur Informatik, Technische Universität München, Garching, Germany;Institut füur Informatik, Technische Universität München, Garching, Germany
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 14
Cited 1

Semirings and formal power series: their relevance to formal languages and automata

Handbook of formal languages, vol. 1
Principles of Program Analysis

Principles of Program Analysis
Provenance semirings

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Newton's Method for ω-Continuous Semirings

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Derivation Tree Analysis for Accelerated Fixed-Point Computation

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Handbook of Weighted Automata

Handbook of Weighted Automata
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
On fixed point equations over commutative semirings

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An extension of Newton's method to ω-continuous semirings

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Efficient computation of throughput values of context-free languages

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Newtonian program analysis

Journal of the ACM (JACM)
Complexity of pattern-based verification for multithreaded programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parikh's theorem: A simple and direct automaton construction

Information Processing Letters
Bounded underapproximations

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification

Shrinking timed automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.