Synthesizing structured reactive programs via deterministic tree automata

DOI10.1016/j.ic.2015.03.013zbMath1317.68029arXiv1303.0797OpenAlexW2001101279MaRDI QIDQ2346409

Benedikt Brütsch

Publication date: 1 June 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0797

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• The treewidth and pathwidth of hypercubes
• All structured programs have small tree width and good register allocation
• A partial k-arboretum of graphs with bounded treewidth
• Graph searching and a min-max theorem for tree-width
• Strategy Machines and Their Complexity
• Bounded Synthesis
• Degrees of Lookahead in Regular Infinite Games
• Synthesis from Component Libraries
• Church's Problem Revisited
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item