Article

Synthesis from Component Libraries

Authors:

Moshe Y. VardiAuthors Info & Claims

Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504

Pages 395 - 409

Published: 22 March 2009 Publication History

Abstract

Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is "constructed from scratch" rather than "composed" from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial system, either in hardware or in software system, relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components.

In this work we define and study the problem of LTL synthesis from libraries of reusable components. We define two notions of composition: data-flow composition, for which we prove the problem is undecidable, and control-flow composition, for which we prove the problem is 2EXPTIME-complete. As a side benefit we derive an explicit characterization of the information needed by the synthesizer on the underlying components. This characterization can be used as a specification formalism between component providers and integrators.

References

[1]

Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, 1962, Institut Mittag-Leffler, pp. 23---35 1963

[2]

Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 179---190 1989

Digital Library

[3]

Sifakis, J.: A framework for component-based construction extended abstract. In: Proc. 3rd Int. Conf. on Software Engineering and Formal Methods SEFM 2005, pp. 293---300. IEEE Computer Society, Los Alamitos 2005

Digital Library

[4]

Alonso, G., Casati, F., Kuno, H.A., Machiraju, V.: Web Services - Concepts, Architectures and Applications. Springer, Heidelberg 2004

[5]

Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. eds. ICSOC 2003. LNCS, vol. 2910, pp. 43---58. Springer, Heidelberg 2003

[6]

Sardiña, S., Patrizi, F., Giacomo, G.D.: Automatic synthesis of a global behavior from multiple distributed behaviors. In: AAAI, pp. 1063---1069 2007

Digital Library

[7]

Büchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295---311 1969

[8]

Rabin, M.: Automata on infinite objects and Church's problem. Amer. Mathematical Society 1972

Digital Library

[9]

Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. 31st IEEE Symp. on Foundations of Computer Science, pp. 746---757 1990

Digital Library

[10]

Kupferman, O., Vardi, M.: Safraless decision procedures. In: Proc. 46th IEEE Symp. on Foundations of Computer Science, pp. 531---540 2005

Digital Library

[11]

Krishnamurthi, S., Fisler, K.: Foundations of incremental aspect model-checking. ACM Transactions on Software Engineering Methods 162 2007

Digital Library

[12]

de Alfaro, L., Henzinger, T.: Interface-based design. In: Broy, M., Grünbauer, J., Harel, D., Hoare, C. eds. Engineering Theories of Software-intensive Systems. NATO Science Series: Mathematics, Physics, and Chemistry, vol. 195, pp. 83---104. Springer, Heidelberg 2005

[13]

Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading 1979

Digital Library

[14]

Nain, S., Vardi, M.Y.: Branching vs. Linear time: Semantical perspective. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. eds. ATVA 2007. LNCS, vol. 4762, pp. 19---34. Springer, Heidelberg 2007

Digital Library

[15]

Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge 1999

Digital Library

[16]

Apt, K., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Infornation Processing Letters 226, 307---309 1986

Digital Library

[17]

Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science 1992

[18]

Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation 1151, 1---37 1994

Digital Library

[19]

Grädel, E., Thomas, W., Wilke, T. eds.: Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg 2002

Digital Library

Cited By

Felli PLogan BSardina S(2016)Parallel behavior composition for manufacturingProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060660(271-278)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060660
Kneuss EKuraj IKuncak VSuter P(2013)Synthesis modulo recursive functionsACM SIGPLAN Notices10.1145/2544173.250955548:10(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2544173.2509555
Kneuss EKuraj IKuncak VSuter PHosking AEugster PLopes C(2013)Synthesis modulo recursive functionsProceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications10.1145/2509136.2509555(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2509136.2509555
Show More Cited By

Synthesis from Component Libraries
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
  2. Software notations and tools

Recommendations

Synthesis from component libraries

Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is "constructed from scratch" rather than "composed" from reusable components. This, of course, ...
Behavioral Synthesis and Component Reuse with VHDL
Specification-guided component-based synthesis from effectful libraries

Component-based synthesis seeks to build programs using the APIs provided by a set of libraries. Oftentimes, these APIs have effects, which make it challenging to reason about the correctness of potential synthesis candidates. This is because changes to ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504

March 2009

470 pages

ISBN:9783642005954

Editor:
Luca Alfaro
School of Engineering, Dept. of Computer Engineering, University of California, Santa Cruz, USA

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 March 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Felli PLogan BSardina S(2016)Parallel behavior composition for manufacturingProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060660(271-278)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060660
Kneuss EKuraj IKuncak VSuter P(2013)Synthesis modulo recursive functionsACM SIGPLAN Notices10.1145/2544173.250955548:10(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2544173.2509555
Kneuss EKuraj IKuncak VSuter PHosking AEugster PLopes C(2013)Synthesis modulo recursive functionsProceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications10.1145/2509136.2509555(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2509136.2509555
Peter HFinkbeiner B(2012)The complexity of bounded synthesis for timed control with partial observabilityProceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-33365-1_15(204-219)Online publication date: 18-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33365-1_15
Yadav NSardina S(2012)Qualitative approximate behavior compositionProceedings of the 13th European conference on Logics in Artificial Intelligence10.1007/978-3-642-33353-8_35(450-462)Online publication date: 26-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33353-8_35
Nain SVardi M(2012)Synthesizing probabilistic composersProceedings of the 15th international conference on Foundations of Software Science and Computational Structures10.1007/978-3-642-28729-9_28(421-436)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28729-9_28
Kupferman O(2012)Recent challenges and ideas in temporal synthesisProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_8(88-98)Online publication date: 21-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27660-6_8
Beneš NČerná IŠtefaňák F(2012)Factorization for component-interaction automataProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_45(554-565)Online publication date: 21-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27660-6_45
Bliudze SSifakis J(2011)Synthesizing glue operators from glue constraints for the construction of component-based systemsProceedings of the 10th international conference on Software composition10.5555/2025951.2025956(51-67)Online publication date: 30-Jun-2011
https://dl.acm.org/doi/10.5555/2025951.2025956
Rehof JUrzyczyn P(2011)Finite combinatory logic with intersection typesProceedings of the 10th international conference on Typed lambda calculi and applications10.5555/2021953.2021970(169-183)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.5555/2021953.2021970
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents