Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
From MaRDI portal
Publication:3617746
DOI10.1007/978-3-642-00596-1_31zbMath1234.68219OpenAlexW1648568813MaRDI QIDQ3617746
Morten Kühnrich, Stefan Kiefer, Stefan Schwoon, Jiří Srba
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_31
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Formal properties of XML grammars and languages
- Weighted pushdown systems and their application to interprocedural dataflow analysis
- Newton’s Method for ω-Continuous Semirings
- Rewriting Models of Boolean Programs
- On Fixed Point Equations over Commutative Semirings
- Accelerated Data-Flow Analysis
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
- XML Validation for Context-Free Grammars
- An Extension of Newton’s Method to ω-Continuous Semirings
- Program Analysis Using Weighted Pushdown Systems
- Precise Fixpoint Computation Through Strategy Iteration
- Complexity Results on Balanced Context-Free Languages
- Programming Languages and Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
