Faster Algorithms for Weighted Recursive State Machines
DOI10.1007/978-3-662-54434-1_11zbMath1485.68057arXiv1701.04914OpenAlexW2953023573MaRDI QIDQ2988644
Krishnendu Chatterjee, Andreas Pavlogiannis, Bernhard Kragl, Samarth Mishra
Publication date: 19 May 2017
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04914
Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Precise interprocedural dataflow analysis with applications to constant propagation
- The Mailman algorithm: a note on matrix-vector multiplication
- Reducing concurrent analysis under a context bound to sequential analysis
- Weighted pushdown systems and their application to interprocedural dataflow analysis
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
- Faster Algorithms for Weighted Recursive State Machines
- Model Checking Procedural Programs
- Subcubic algorithms for recursive state machines
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- A Four Russians algorithm for regular expression pattern matching
- Multiplying matrices faster than coppersmith-winograd
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Program Analysis Using Weighted Pushdown Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Faster Algorithms for Weighted Recursive State Machines
