Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
review-article

Automatic Synthesis of Distributed Protocols

Published: 10 March 2017 Publication History
First page of PDF

References

[1]
ITU Telecommunication Standardization Sector: ITU-R recommendation Z.120, Message Sequence Charts (MSC '96), May 1996.
[2]
M. Abadi and L. Lamport. Composing specifications. ACM TOPLAS, 15(1):73--132, 1993.
[3]
R. Alur, R. Bodík, G. Juniwal, M.M.K. Martin, M. Raghothaman, S.A. Seshia, R. Singh, A. Solar-Lezama, E. Torlak, and A. Udupa. Syntax-guided synthesis. In Formal Methods in Computer-Aided Design, FMCAD, pages 1--17, 2013.
[4]
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183--235, 1994.
[5]
R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7--48, 1999.
[6]
R. Alur, M. Martin, M. Raghothaman, C. Stergiou, S. Tripakis, and A. Udupa. Synthesizing finite-state protocols from scenarios and requirements. In Haifa Veri_cation Conference, LNCS 8855, pages 75--91. Springer, 2014. Extended version at CORR, abs/1402.7150.
[7]
R. Alur, M. Raghothaman, C. Stergiou, S. Tripakis, and A. Udupa. Automatic completion of distributed protocols with symmetry. In 27th International Conference on Computer Aided Verification (CAV), LNCS 9207, pages 395--412, 2015.
[8]
R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer. Automatic hardware synthesis from specifications: a case study. In Proc. DATE, pages 1188--1193, 2007.
[9]
C.G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Springer, 2nd edition, 2010.
[10]
A. Church. Logic, arithmetics, and automata. In Proc. Int. Congress of Mathematicians, pages 23--35, 1963.
[11]
A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model checker. Software Tools for Technology Transfer, 2(4):410--425, 2000.
[12]
E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, and L.A. Ness. Verification of the Futurebus+ cache coherence protocol. Formal Methods in System Design, 6:217--232, 1995.
[13]
E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 2000.
[14]
L. de Alfaro and T. Henzinger. Interface automata. In Foundations of Software Engineering (FSE). ACM Press, 2001.
[15]
L. de Moura and N. Bjørner. Satisfiability Modulo Theories: introduction and applications. Commun. ACM, 54(9):69--77, 2011.
[16]
D.L. Dill. The Murphi verification system. In Computer Aided Verification, 8th International Conference (CAV), LNCS 1102, pages 390--393, 1996.
[17]
R. Ehlers, S. Lafortune, S. Tripakis, and M. Vardi. Supervisory Control and Reactive Synthesis: A Comparative Introduction. Discrete Event Dynamic Systems, pages 1--52, 2016.
[18]
B. Finkbeiner. Synthesis of reactive systems. In Dependable Software Systems Engineering, volume 45 of NATO Science for Peace and Security Series, D: Information and Communication Security, pages 72--98. IOS Press, 2016.
[19]
B. Finkbeiner and S. Jacobs. Lazy synthesis. In Proceedings of the 13th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI'12, pages 219--234. Springer, 2012.
[20]
B. Finkbeiner and H.-J. Peter. Template-based controller synthesis for timed systems. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'12, pages 392--406, 2012.
[21]
B. Finkbeiner and S. Schewe. Bounded synthesis. International Journal on Software Tools for Technology Transfer, 15(5-6):519--539, 2013.
[22]
R. Gawlick, R. Segala, J. Sogaard-Andersen, and N.A. Lynch. Liveness in timed and untimed systems. In Automata, Languages, and Programming, Proceedings of the 21st ICALP, LNCS 820, pages 166--177. Springer-Verlag, 1994.
[23]
A. Groce, K. Havelund, G. J. Holzmann, R. Joshi, and R. Xu. Establishing ight software reliability: testing, model checking, constraint-solving, monitoring and learning. Ann. Math. Artfi. Intell., 70(4):315--349, 2014.
[24]
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
[25]
G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
[26]
G.J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, 2004.
[27]
G. Kahn. The semantics of simple language for parallel programming. In IFIP Congress, pages 471--475, 1974.
[28]
G. Katz and D.A. Peled. Model checking-based genetic programming with an application to mutual exclusion. In Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, LNCS 4963, pages 141--156, 2008.
[29]
G. Katz and D.A. Peled. Synthesizing solutions to the leader election problem using model checking and genetic programming. In Hardware and Software: Veri_cation and Testing - 5th International Haifa Veri_cation Conference, pages 117--132, 2009.
[30]
O. Kupferman and M.Y. Vardi. Safraless decision procedures. In Proc. FOCS, pages 531--540, 2005.
[31]
H. Lamouchi and J. Thistle. E_ective control synthesis for DES under partial observations. In 39th IEEE Conference on Decision and Control, pages 22--28, 2000.
[32]
L. Lamport. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, 2002.
[33]
L. Lamport. Fast Paxos. Distributed Computing, 19(2):79--103, 2006.
[34]
E.A. Lee and D.G. Messerschmitt. Synchronous data ow. Proceedings of the IEEE, 75(9):1235--1245, 1987.
[35]
N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
[36]
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
[37]
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
[38]
G.L. Peterson and J.H. Reif. Multiple-person alternation. In 20th IEEE Symp. Found. of Comp. Sci., 1979.
[39]
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, 1989.
[40]
A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proceedings of the 31th IEEE Symposium on Foundations of Computer Science, pages 746--757, 1990.
[41]
V. Preoteasa and S. Tripakis. Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems. In 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016.
[42]
A. Puri, S. Tripakis, and P. Varaiya. Problems and examples of decentralized observation and control for discrete event systems. In Synthesis and Control of Discrete Event Systems, pages 37--56. Springer, 2002.
[43]
P. Ramadge and W. Wonham. Supervisory control of a class of discrete event processes. SIAM J. Control Optim., 25(1), January 1987.
[44]
P. Ramadge and W. Wonham. The control of discrete event systems. Proceedings of the IEEE, January 1989.
[45]
K. Rudie and J.C. Willems. The computational complexity of decentralized discrete-event control problems. IEEE Transactions on Automatic Control, 40(7), 1995.
[46]
K. Rudie and W. Wonham. Think globally, act locally: Decentralized supervisory control. IEEE Transactions on Automatic Control, 37, 1992.
[47]
S.A. Seshia. Combining induction, deduction, and structure for verification and synthesis. Proceedings of the IEEE, 103(11):2036--2051, 2015.
[48]
A. Solar-Lezama. Program sketching. Software Tools for Technology Transfer, 15(5-6):475--495, 2013.
[49]
A. Solar-Lezama, R.M. Rabbah, R. Bod__k, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In Proc. 2005 ACM Conference on Programming Language Design and Implementation, pages 281--294, 2005.
[50]
J.G. Thistle. Supervisory control of discrete event systems. Mathl. Comput. Modelling, 23(11/12):25--53, 1996.
[51]
J.G. Thistle. Undecidability in decentralized supervision. Systems & Control Letters, 54(5):503--509, 2005.
[52]
S. Tripakis. Undecidable Problems of Decentralized Observation and Control. In 40th IEEE Conference on Decision and Control (CDC'01), pages 4104--4109. IEEE Computer Society, December 2001.
[53]
S. Tripakis. Undecidable Problems of Decentralized Observation and Control on Regular Languages. Information Processing Letters, 90(1):21--28, April 2004.
[54]
S. Tripakis, B. Lickly, T. A. Henzinger, and E. A. Lee. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS), 33(4), July 2011.
[55]
A. Udupa, A. Raghavan, J.V. Deshmukh, S. Mador-Haim, M.M.K. Martin, and R. Alur. TRANSIT: specifying protocols with concolic snippets. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 287--296, 2013.
[56]
M.Y. Vardi and P.Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First IEEE Symposium on Logic in Computer Science, pages 332--344, 1986.

Cited By

View all
  1. Automatic Synthesis of Distributed Protocols

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGACT News
    ACM SIGACT News  Volume 48, Issue 1
    March 2017
    102 pages
    ISSN:0163-5700
    DOI:10.1145/3061640
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 10 March 2017
    Published in SIGACT Volume 48, Issue 1

    Check for updates

    Qualifiers

    • Review-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)24
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 17 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Synthesizing LTL contracts from component libraries using rich counterexamplesScience of Computer Programming10.1016/j.scico.2024.103116236:COnline publication date: 1-Sep-2024
    • (2023)Decoupled Fitness Criteria for Reactive SystemsSoftware Engineering and Formal Methods10.1007/978-3-031-47115-5_6(85-105)Online publication date: 6-Nov-2023
    • (2023)Synthesis of Distributed Protocols by Enumeration Modulo IsomorphismsAutomated Technology for Verification and Analysis10.1007/978-3-031-45329-8_13(270-291)Online publication date: 24-Oct-2023
    • (2022)Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents2022 IEEE Symposium on Security and Privacy (SP)10.1109/SP46214.2022.9833673(51-68)Online publication date: May-2022
    • (2022)Cybersecurity and Supervisory Control: A Tutorial on Robust State Estimation, Attack Synthesis, and Resilient Control2022 IEEE 61st Conference on Decision and Control (CDC)10.1109/CDC51059.2022.9992966(3020-3040)Online publication date: 6-Dec-2022
    • (2022)Synthesis of winning attacks on communication protocols using supervisory control theory: two case studiesDiscrete Event Dynamic Systems10.1007/s10626-022-00369-132:4(573-610)Online publication date: 1-Dec-2022
    • (2021)QuickSilver: modeling and parameterized verification for distributed agreement-based systemsProceedings of the ACM on Programming Languages10.1145/34855345:OOPSLA(1-31)Online publication date: 15-Oct-2021
    • (2021)Efficient compilation of algebraic effect handlersProceedings of the ACM on Programming Languages10.1145/34854795:OOPSLA(1-28)Online publication date: 15-Oct-2021
    • (2021)Much ADO about failures: a fault-aware model for compositional verification of strongly consistent distributed systemsProceedings of the ACM on Programming Languages10.1145/34854745:OOPSLA(1-31)Online publication date: 15-Oct-2021
    • (2021)On algebraic abstractions for concurrent separation logicsProceedings of the ACM on Programming Languages10.1145/34342865:POPL(1-32)Online publication date: 4-Jan-2021
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media