Skip to main content

Hierarchical Contract-Based Synthesis for Assurance Cases

Part of the Lecture Notes in Computer Science book series (LNCS,volume 13260)

Abstract

An automatic synthesis problem is often characterized by an overall goal or specification to be satisfied, the set of all possible outcomes, called the design space, and an algorithm for the automatic selection of one or more members from the design space that are provably guaranteed to satisfy the overall specification. A key challenge in automatic synthesis is the complexity of the design space. In this paper, we introduce a formal model, termed hierarchical contract nets, and a framework for the efficient automatic synthesis of hierarchical contract nets, based on a library of refinement relations between contracts and contract nets. We show, via the application of automatic synthesis of assurances cases, that hierarchical contract-based synthesis can mitigate the design space complexity problem. We also show that the approach can bring both the benefits of automating the creation of assurance cases and ensuring that the knowledge from the argumentation experts is captured and reflected in the synthesized assurance cases.

Keywords

  • Contracts
  • Automated synthesis
  • Assurance case
  • Certification

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-031-06773-0_9
  • Chapter length: 18 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-031-06773-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.

References

  1. Gulwani, S., Polozov, O., Singh, R., et al.: Program synthesis. Found. Trends Programm. Lang. 4(1–2), 1–119 (2017)

    Google Scholar 

  2. Church, A.: Application of recursive arithmetic to the problem of circuit synthesis. J. Symbol. Logic 28(4) (1963)

    Google Scholar 

  3. Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67–69 (1949)

    Google Scholar 

  4. Bertot, Y., Castéran, P.: Interactive theorem proving and program development: Coq’Art: the calculus of inductive constructions. Springer Science & Business Media (2013)

    Google Scholar 

  5. Nuzzo, P., Bajaj, N., Masin, M., Kirov, D., Passerone, R., Sangiovanni-Vincentelli, A.L.: Optimized selection of reliable and cost-effective safety-critical system architectures. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 39(10), 2109–2123 (2020)

    CrossRef  Google Scholar 

  6. David, C., Kroening, D.: Program synthesis: challenges and opportunities. Philos. Trans. Royal Soc. A: Math. Phys. Eng. Sci. 375(2104), 20150403 (2017)

    CrossRef  Google Scholar 

  7. Alur, R., et al.: Syntax-guided synthesis. IEEE (2013)

    Google Scholar 

  8. Benveniste, A., et al.: Contracts for system design. PhD thesis, Inria (2012)

    Google Scholar 

  9. Sebastian, S., et al.: Moving from specifications to contracts in component-based design. In: Fundamental Approaches to Software Engineering (2012)

    Google Scholar 

  10. Sangiovanni-Vincentelli, A., Damm, W., Passerone, R.: Taming dr. Frankenstein: Contract-based design for cyber-physical systems. Eur. J. Control 18, 217–238 (2012)

    Google Scholar 

  11. Nuzzo, P., Sangiovanni-Vincentelli, A.L., Bresolin, D., Geretti, L., Villa, T.: A platform-based design methodology with contracts and related tools for the design of cyber-physical systems. In: Proceedings of the IEEE (2015)

    Google Scholar 

  12. Benveniste, A., et al.: Contracts for System Design. Werner Damm (2018)

    Google Scholar 

  13. Pneuli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings Annual Symposium on Foundations of Computer Science, pp. 746–757 (1990)

    Google Scholar 

  14. Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 395–409. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00596-1_28

    CrossRef  Google Scholar 

  15. Iannopollo, A., Nuzzo, P., Tripakis, S., Sangiovanni-Vincentelli, A.: Library-based scalable refinement checking for contract-based design. In: 2014 Design, Automation Test in Europe Conference Exhibition (DATE) (2014)

    Google Scholar 

  16. Iannopollo, A., Tripakis, S., Sangiovanni-Vincentelli, A.: Constrained synthesis from component libraries. Sci. Comput. Programm. 171, 21–41 (2019)

    CrossRef  Google Scholar 

  17. Iannopollo, A., Tripakis, S., Sangiovanni-Vincentelli, A.: Specification decomposition for synthesis from libraries of LTL assume/guarantee contracts. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1574–1579 (2018)

    Google Scholar 

  18. Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Model Checking, pp. 305–343. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-10575-8_11

  19. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24

    CrossRef  Google Scholar 

  20. Kelly, T., Weaver, R.: The goal structuring notation-a safety argument notation. In: Proceedings of the Dependable Systems and Networks 2004 Workshop on Assurance Cases, p. 6. Citeseer (2004)

    Google Scholar 

  21. Holloway, C.M.: Understanding the Overarching Properties. NASA Langley Research Center (2019)

    Google Scholar 

Download references

Acknowledgments

Distribution Statement A (Approved for Public Release, Distribution Unlimited). This research was developed with funding from the Defense Advanced Research Projects Agency (DARPA) contract FA875020C0508. The views, opinions, or findings expressed are those of the authors and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timothy E. Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Wang, T.E., Daw, Z., Nuzzo, P., Pinto, A. (2022). Hierarchical Contract-Based Synthesis for Assurance Cases. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds) NASA Formal Methods. NFM 2022. Lecture Notes in Computer Science, vol 13260. Springer, Cham. https://doi.org/10.1007/978-3-031-06773-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-06773-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-06772-3

  • Online ISBN: 978-3-031-06773-0

  • eBook Packages: Computer ScienceComputer Science (R0)