References

  1. Krzysztof R. Apt & Dexter Kozen (1986): Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22(6), pp. 307–309, doi:10.1016/0020-0190(86)90071-2.
  2. W. Banzhaf, P. Nordin, R. E. Keller & F. D. Francone (2001): Genetic Programming – An Introduction; On the Automatic Evolution of Computer Programs and its Applications (3rd edition). Morgan Kaufmann, dpunkt.verlag.
  3. Yoah Bar-David & Gadi Taubenfeld (2003): Automatic discovery of mutual exclusion algorithms. In: PODC, pp. 305, doi:10.1145/872035.872080.
  4. James E. Burns & Nancy A. Lynch (1993): Bounds on Shared Memory for Mutual Exclusion. Information and Computation 107(2), pp. 171–184, doi:10.1006/inco.1993.1065.
  5. Edsger W. Dijkstra (1965): Solution of a problem in concurrent programming control. Commun. ACM 8(9), pp. 569, doi:10.1145/365559.365617.
  6. E. Allen Emerson & Kedar S. Namjoshi (1995): Reasoning about Rings. In: POPL, pp. 85–94, doi:10.1145/199448.199468.
  7. Sumit Gulwani, Susmit Jha, Ashish Tiwari & Ramarathnam Venkatesan (2011): Synthesis of loop-free programs. In: PLDI, pp. 62–73, doi:10.1145/1993498.1993506.
  8. Gal Katz & Doron Peled (2008): Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms. In: ATVA, LNCS 5311, pp. 33–47, doi:10.1007/978-3-540-88387-6_5.
  9. Gal Katz & Doron Peled (2008): Model Checking-Based Genetic Programming with an Application to Mutual Exclusion. In: TACAS, LNCS 4963, pp. 141–156, doi:10.1007/978-3-540-78800-3_11.
  10. Gal Katz & Doron Peled (2009): Synthesizing Solutions to the Leader Election Problem using Model Checking and Genetic Programming. In: HVC, LNCS 6405, pp. 117–132, doi:10.1007/978-3-642-19237-1_13.
  11. Gal Katz & Doron Peled (2010): Code Mutation in Verification and Automatic Code Correction. In: TACAS, LNCS, pp. 435–450, doi:10.1007/978-3-642-12002-2_36.
  12. Gal Katz & Doron Peled (2010): MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming. In: ATVA, pp. 359–364, doi:10.1007/978-3-642-15643-4_28.
  13. Joep L. W. Kessels (1982): Arbitration Without Common Modifiable Variables. Acta Inf. 17, pp. 135–141, doi:10.1007/BF00288966.
  14. Leonardo Mendonca de Moura & Nikolaj Bjørner (2008): Z3: An Efficient SMT Solver. In: TACAS, pp. 337–340, doi:10.1007/978-3-540-78800-3_24.
  15. Peter Niebert, Doron Peled & Amir Pnueli (2008): Discriminative Model Checking. In: CAV, LNCS 5123. Springer, pp. 504–516, doi:10.1007/978-3-540-70545-1_48.
  16. Doron Peled (2001): Software Reliability Methods. Springer, doi:10.1007/978-1-4757-3540-6.
  17. Jose Antonio Perez, Rafael Corchuelo & Miguel Toro (2004): An order-based algorithm for implementing multiparty synchronization. Concurrency - Practice and Experience 16(12), pp. 1173–1206, doi:10.1002/cpe.903.
  18. Peterson & Fischer (1977): Economical Solutions to the Critical Section Problem in a Distributed System. In: STOC: ACM Symposium on Theory of Computing (STOC), pp. 91–97, doi:10.1145/800105.803398.
  19. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: POPL, pp. 179–190, doi:10.1145/75277.75293.
  20. Amir Pnueli & Roni Rosner (1990): Distributed Reactive Systems Are Hard to Synthesize. In: FOCS, pp. 746–757, doi:10.1109/FSCS.1990.89597.
  21. Yih-Kuen Tsay (1998): Deriving a Scalable Algorithm for Mutual Exclusion. In: DISC, pp. 393–407, doi:10.1007/BFb0056497.
  22. Henry S. Warren (2002): Hacker's Delight. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.

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