References

  1. L. de Alfaro & T. A. Henzinger (2001): Interface automata. SIGSOFT Software Engineering Notes 26(5), pp. 109–120, doi:10.1145/503209.503226.
  2. P. C. Attie (1999): Synthesis of Large Concurrent Programs via Pairwise Composition. In: Proceedings of Conference on Concurrency Theory (CONCUR), pp. 130–145, doi:10.1007/3-540-48320-9_11.
  3. P. C. Attie & E. A Emerson (1989): Synthesis of Concurrent Systems with Many Similar Sequential Processes. In: Proceedings of Principles of Programming Languages (POPL), pp. 191–201, doi:10.1145/75277.75294.
  4. P. C. Attie & E. A Emerson (1996): Synthesis of Concurrent Systems for an Atomic Read/Atomic Write Model of Computation. In: Proceedings of Principles of Distributed Computing (PODC), pp. 111–120, doi:10.1145/248052.248070.
  5. S. Cherem, T. Chilimbi & S. Gulwani (2008): Inferring Locks for Atomic Sections. In: Proceedings of Programming Language Design and Implementation (PLDI), pp. 304–315, doi:10.1145/1375581.1375619.
  6. X. Deng, M. B. Dwyer, J. Hatcliff & M. Mizuno (2002): Invariant-based Specification, Synthesis, and Verification of Synchronization in Concurrent Programs. In: Proceedings of International Conference on Software Engineering (ICSE), pp. 442–452, doi:10.1145/581339.581394.
  7. E. Allen Emerson & E. M. Clarke (1982): Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3), pp. 241–266.
  8. E. Allen Emerson & R. Samanta (2011): An Algorithmic Framework for Synthesis of Concurrent Programs. In: Proceedings of Automated Technqiues for Verification and Analysis (ATVA), pp. 522–530, doi:10.1007/978-3-642-24372-1_41.
  9. M. Emmi, J. S. Fishcher, R. Jhala & R. Majumdar (2007): Lock Allocation. In: Proceedings of Principles of Programming Languages (POPL), pp. 291–296, doi:10.1145/1190216.1190260.
  10. P. B. Hansen (1981): Edison – A Multiprocessor Language. Software – Practice and Experience 11(4), pp. 325–361, doi:10.1002/spe.4380110403.
  11. D. Harel & A. Pnueli (1985): On the Development of Reactive Systems. In: Logics and Models of Concurrent Systems, pp. 477–498.
  12. C. A. R. Hoare (1971): Towards a Theory of Parallel Programming. In: Operating Systems Techniques, pp. 61–71.
  13. M. U. Janjua & A. Mycroft (2006): Automatic Correction to Safety Violations in Programs. In: Proceedings of Thread Verification.
  14. Viktor Kuncak, Mikael Mayer, Ruzica Piskac & Philippe Suter (2012): Functional Synthesis for Linear Arithmetic and Sets. In: Proceedings of Software Tools for Technology Transfer (STTT), doi:10.1007/s10009-011-0217-7.
  15. M. Kuperstein, M. T. Vechev & E. Yahav (2010): Automatic Inference of Memory Fences. In: Proceedings of Formal Methods in Computer-Aided Design (FMCAD), pp. 108–123, doi:10.1145/2261417.2261438.
  16. F. Liu, N. Nedev, N. Prisadnikov, M. T. Vechev & E. Yahav (2012): Dynamic Synthesis for Relaxed Memory Models. In: Proceedings of Programming Language Design and Implementation (PLDI), pp. 429–440, doi:10.1145/2254064.2254115.
  17. Z. Manna & P. Wolper (1984): Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems (TOPLAS) 6(1), pp. 68–93, doi:10.1145/357233.357237.
  18. A. Pnueli (1977): The Temporal Logic of Programs. In: Proceedings of Foundations of Computer Science (FOCS), pp. 46–77, doi:10.1109/SFCS.1977.32.
  19. A. Pnueli (1985): Linear and Branching Structures in the Semantics and Logics of Reactive Systems. In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pp. 15–32, doi:10.1007/BFb0015727.
  20. A. Pnueli & R. Rosner (1989): On the Synthesis of a Reactive Module. In: Proceedings of Principles of Programming Languages (POPL), pp. 179–190, doi:10.1145/75277.75293.
  21. A. Pnueli & R. Rosner (1990): Distributed Reactive Systems are Hard to Synthesize. In: Proceedings of Foundations of Computer Science (FOCS), pp. 746–757, doi:10.1109/FSCS.1990.89597.
  22. A. Solar-Lezama, R. Rabbah, R. Bodik & K. Ebcioglu (2005): Programming by Sketching for Bit-streaming Programs. In: Proceedings of Programming Language Design and Implementation (PLDI), pp. 281–294, doi:10.1145/1065010.1065045.
  23. W. Thomas (2009): Facets of Synthesis: Revisiting Church's Problem. In: Proceedings of Foundations of Software Science and Computation Structures (FOSSACS), pp. 1–14, doi:10.1007/978-3-642-00596-1_1.
  24. M. T. Vechev, E. Yahav & G. Yorsh (2009): Inferring Synchronization under Limited Observability. In: Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 139–154, doi:10.1007/978-3-642-00768-2_13.
  25. M. T. Vechev, E. Yahav & G. Yorsh (2010): Abstraction-Guided Synthesis Of Synchronization. In: Proceedings of Principles of Programming Languages (POPL), pp. 327–388, doi:10.1145/1706299.1706338.
  26. T. Yavuz-Kahveci & T. Bultan (2002): Specification, Verification, and Synthesis of Concurrency Control Components. In: Proceedings of International Symposium on Software Testing and Analysis (ISSTA), pp. 169–179.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org