skip to main content
10.1145/3092282.3092296acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

Runtime enforcement using Büchi games

Authors Info & Claims
Published:13 July 2017Publication History

ABSTRACT

We leverage Büchi games for the runtime enforcement of regular properties with uncontrollable events. Runtime enforcement consists in modifying the execution of a running system to have it satisfy a given regular property, modelled by an automaton. We revisit runtime enforcement with uncontrollable events and propose a framework where we model the runtime enforcement problem as a Büchi game and synthesise sound, compliant, and optimal enforcement mechanisms as strategies.We present algorithms and a tool implementing enforcement mechanisms.We reduce the complexity of the computations performed by enforcement mechanisms at runtime by pre-computing the decisions of enforcement mechanisms ahead of time.

References

  1. David Basin, Vincent Jugé, Felix Klaedtke, and Eugen Zălinescu. 2013. Enforceable Security Policies Revisited. ACM Trans. Inf. Syst. Secur. 16, 1, Article 3 (June 2013), 26 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. David Basin, Felix Klaedtke, and Eugen Zalinescu. 2011. Algorithms for Monitoring Real-Time Properties. In Proceedings of the 2nd International Conference on Runtime Verification (RV 2011) (Lecture Notes in Computer Science), Sarfraz Khurshid and Koushik Sen (Eds.), Vol. 7186. Springer-Verlag, 260–275. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Roderick Bloem, Bettina Könighofer, Robert Könighofer, and Chao Wang. 2015.Google ScholarGoogle Scholar
  4. Shield Synthesis: - Runtime Enforcement for Reactive Systems. In Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. 533–548. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Peter Bulychev, Thomas Chatain, Alexandre David, and Kim G. Larsen. 2009.Google ScholarGoogle Scholar
  6. Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation. Springer Berlin Heidelberg, Berlin, Heidelberg, 73–87.Google ScholarGoogle Scholar
  7. Krishnendu Chatterjee and Monika Henzinger. 2012. An O(N2) Time Algorithm for Alternating BÜChi Games. In Proceedings of the Twenty-third Annual ACMSIAM Symposium on Discrete Algorithms (SODA ’12). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1386–1399. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Egor Dolzhenko, Jay Ligatti, and Srikar Reddy. 2015. Modeling Runtime Enforcement with Mandatory Results Automata. International Journal of Information Security 14, 1 (Feb. 2015), 47–60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Yliès Falcone. 2010. You Should Better Enforce Than Verify. In Runtime Verification - First International Conference, RV 2010, St. Julians, Malta, November 1-4, 2010. Proceedings. 89–105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Yliès Falcone, Jean-Claude Fernandez, and Laurent Mounier. 2012.Google ScholarGoogle Scholar
  11. What can you verify and enforce at runtime? International Journal on Software Tools for Technology Transfer 14, 3 (2012), 349–382.Google ScholarGoogle Scholar
  12. Yliès Falcone, Thierry Jéron, Hervé Marchand, and Srinivas Pinisetty. 2016.Google ScholarGoogle Scholar
  13. Runtime enforcement of regular timed properties by suppressing and delaying events. Systems & Control Letters 123 (2016), 2–41.Google ScholarGoogle Scholar
  14. Yliès Falcone, Laurent Mounier, Jean-Claude Fernandez, and Jean-Luc Richier. 2011. Runtime enforcement monitors: composition, synthesis, and enforcement abilities. Formal Methods in System Design 38, 3 (2011), 223–262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Jay Ligatti, Lujo Bauer, and David Walker. 2009.Google ScholarGoogle Scholar
  16. Run-Time Enforcement of Nonsafety Policies. ACM Trans. Inf. Syst. Secur. 12, 3, Article 19 (Jan. 2009), 41 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Srinivas Pinisetty, Yliès Falcone, Thierry Jéron, Hervé Marchand, Antoine Rollet, and Omer Nguena-Timo. 2014. Runtime enforcement of timed properties revisited. Formal Methods in System Design 45, 3 (2014), 381–422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Matthieu Renard, Yliès Falcone, Antoine Rollet, Thierry Jéron, and Hervé Marchand. 2017.Google ScholarGoogle Scholar
  19. Optimal Enforcement of (Timed) Properties with Uncontrollable Events. Mathematical Structures in Computer Science (MSCS) (2017), 1–46.Google ScholarGoogle Scholar
  20. Matthieu Renard, Yliès Falcone, Antoine Rollet, Srinivas Pinisetty, Thierry Jéron, and Hervé Marchand. 2015. Enforcement of (Timed) Properties with Uncontrollable Events. In Theoretical Aspects of Computing - ICTAC 2015 (Lecture Notes in Computer Science), Vol. 9399. Springer International Publishing, 542–560. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Fred B. Schneider. 2000.Google ScholarGoogle Scholar
  22. Enforceable Security Policies. ACM Trans. Inf. Syst. Secur. 3, 1 (Feb. 2000), 30–50. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Runtime enforcement using Büchi games

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software
        July 2017
        199 pages
        ISBN:9781450350778
        DOI:10.1145/3092282

        Copyright © 2017 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 July 2017

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Upcoming Conference

        ICSE 2025

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader