Maximally-Polyvariant Partial Evaluation in Polynomial Time
From MaRDI portal
Publication:3179173
DOI10.1007/978-3-319-41579-6_11zbMath1461.68055OpenAlexW2488233963WikidataQ62038218 ScholiaQ62038218MaRDI QIDQ3179173
Publication date: 21 December 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41579-6_11
Analysis of algorithms (68W40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Online algorithms; streaming algorithms (68W27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyvariant mixed computation for analyzer programs
- A note on linear time simulation of deterministic two-way pushdown automata
- On the partial computation principle
- A simulation result for two-way pushdown automata
- A Practical Simulation Result for Two-Way Pushdown Automata
- Model Checking Procedural Programs
- Fast Pattern Matching in Strings
- A positive supercompiler
- Parsing Techniques
- Time and tape complexity of pushdown automaton languages
- Program transformation system based on generalized partial computation