Synthesis from Component Libraries

DOI10.1007/978-3-642-00596-1_28zbMath1234.68260OpenAlexW1596680954MaRDI QIDQ3617743

Yoad Lustig, Moshe Y. Vardi

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_28

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (16)

Factorization for Component-Interaction Automata ⋮ The Complexity of Synthesis from Probabilistic Components ⋮ Incorporating monitors in reactive synthesis without paying the price ⋮ Qualitative Approximate Behavior Composition ⋮ Synthesis of large dynamic concurrent programs from dynamic specifications ⋮ On the aggregation problem for synthesized web services ⋮ Supervisory control and reactive synthesis: a comparative introduction ⋮ Bootstrapping library-based synthesis ⋮ Complexity of synthesis of composite service with correctness guarantee ⋮ Reliability-aware automatic composition approach for web services ⋮ Parametrized automata simulation and application to service composition ⋮ Finite Combinatory Logic with Intersection Types ⋮ Visibly pushdown modular games ⋮ Dynamic Resource Allocation Games ⋮ A Theory Agenda for Component-Based Design ⋮ Synthesizing structured reactive programs via deterministic tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about infinite computations
• Automata, logics, and infinite games. A guide to current research
• Branching vs. Linear Time: Semantical Perspective
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: Synthesis from Component Libraries