References

  1. P. Backes & J. Reineke (2014): Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction. In: Proc. VMCAI 2015, LNCS 8931. Springer, pp. 135–152, doi:10.1007/978-3-662-46081-8_8.
  2. P. Baldan, A. Corradini & B. König (2008): Unfolding Graph Transformation Systems: Theory and Applications to Verification. In: Concurrency, Graphs and Models, LNCS 5065. Springer, pp. 16–36, doi:10.1007/978-3-540-68679-8_3.
  3. P. J. Brooke & R. F. Paige (2009): Cameo: an alternative model of concurrency for Eiffel. Formal Aspects of Computing 21(4), pp. 363–391, doi:10.1007/s00165-008-0096-1.
  4. P. J. Brooke, R. F. Paige & J. L. Jacob (2007): A CSP model of Eiffel's SCOOP. Formal Aspects of Computing 19(4), pp. 487–512, doi:10.1007/s00165-007-0033-8.
  5. G. Caltais & B. Meyer (2014): Coffman Deadlocks in SCOOP. In: Proc. NWPT 2014. Online version at http://arxiv.org/abs/1409.7514.
  6. A. Corradini, F. L. Dotti, L. Foss & L. Ribeiro (2004): Translating Java Code to Graph Transformation Systems. In: Proc. ICGT 2004, LNCS 3256. Springer, pp. 383–398, doi:10.1007/978-3-540-30203-2_27.
  7. G. Delzanno & R. Traverso (2013): Specification and Validation of Link Reversal Routing via Graph Transformations. In: Proc. SPIN 2013, LNCS 7976. Springer, pp. 160–177, doi:10.1007/978-3-642-39176-7_11.
  8. F. L. Dotti, L. M. Duarte, L. Foss, L. Ribeiro, D. Russi & O. Marchi dos Santos (2005): An Environment for the Development of Concurrent Object-Based Applications. In: Proc. GraBaTs 2004, ENTCS 127. Elsevier, pp. 3–13, doi:10.1016/j.entcs.2004.12.026.
  9. A. P. Lüdtke Ferreira, L. Foss & L. Ribeiro (2007): Formal Verification of Object-Oriented Graph Grammars Specifications. In: Proc. GT-VC 2006, ENTCS 175. Elsevier, pp. 101–114, doi:10.1016/j.entcs.2007.04.020.
  10. A. P. Lüdtke Ferreira & L. Ribeiro (2005): A Graph-based Semantics For Object-oriented Programming Constructs. In: Proc. CTCS 2004, ENTCS 122. Elsevier, pp. 89–104, doi:10.1016/j.entcs.2004.06.053.
  11. Grand Central Dispatch (GCD) Reference. https://developer.apple.com/library/mac/documentation/Performance/Reference/GCD_libdispatch_Ref/index.html. Acc.: Dec. 2014.
  12. G. Geeraerts, A. Heußner & J.-F. Raskin (2013): Queue-Dispatch Asynchronous Systems. In: Proc. ACSD 2013. IEEE, pp. 150–159, doi:10.1109/ACSD.2013.18.
  13. A. H. Ghamarian, M. de Mol, A. Rensink, E. Zambon & M. Zimakova (2012): Modelling and analysis using GROOVE. Intern. J. on Softw. Tools for Techn. Trans. 14(1), pp. 15–40, doi:10.1007/s10009-011-0186-x.
  14. GRaphs for Object-Oriented VErification GROOVE (project web page). http://groove.cs.utwente.nl/. Acc.: Dec. 2014.
  15. A. Habel & K.-H. Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. Mathem. Struct. in Comp. Sci. 19(2), pp. 245–296, doi:10.1017/S0960129508007202.
  16. E. B. Johnsen, O. Owe & E. W. Axelsen (2005): A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls. In: Proc. WRLA 2004, ENTCS 117. Elsevier, pp. 375–392, doi:10.1016/j.entcs.2004.06.012.
  17. E. B. Johnsen, O. Owe & I. Chieh Yu (2006): Creol: A type-safe object-oriented model for distributed concurrent systems. Theor. Comput. Sci. 365(1-2), pp. 23–66, doi:10.1016/j.tcs.2006.07.031.
  18. H. Kastenberg & A. Rensink (2006): Model Checking Dynamic States in GROOVE. In: Proc. SPIN 2006, LNCS 3925. Springer, pp. 299–305, doi:10.1007/11691617_19.
  19. B. Morandi, M. Schill, S. Nanz & B. Meyer (2013): Prototyping a Concurrency Model. In: Proc. ACSD 2013. IEEE, pp. 170–179, doi:10.1109/ACSD.2013.21.
  20. P. Nienaltowski (2007): Practical framework for contract-based concurrent object-oriented programming. Doctoral dissertation. ETH Zürich.
  21. J. S. Ostroff, F. Ahmadi Torshizi, H. F. Huang & B. Schoeller (2009): Beyond contracts for concurrency. Formal Aspects of Computing 21(4), pp. 319–346, doi:10.1007/s00165-008-0073-8.
  22. C. M. Poskitt & D. Plump (2014): Verifying Monadic Second-Order Properties of Graph Programs. In: Proc. ICGT 2014, LNCS 8571. Springer, pp. 33–48, doi:10.1007/978-3-319-09108-2_3.
  23. A. Rensink (2010): The Edge of Graph Transformation - Graphs for Behavioural Specification. In: Graph Transformations and Model-Driven Engineering, LNCS 5765. Springer, pp. 6–32, doi:10.1007/978-3-642-17322-6_2.
  24. A. Rensink & E. Zambon (2009): A Type Graph Model for Java Programs. In: Proc. FMOODS 2009, LNCS 5522. Springer, pp. 237–242, doi:10.1007/978-3-642-02138-1_18.
  25. A. Rensink & E. Zambon (2012): Pattern-Based Graph Abstraction. In: Proc. ICGT 2012, LNCS 7562. Springer, pp. 66–80, doi:10.1007/978-3-642-33654-6_5.
  26. Supplementary Material. http://www.swt-bamberg.de/gam2015_supp/.
  27. F. A. Torshizi, J. S. Ostroff, R. F. Paige & M. Chechik (2009): The SCOOP Concurrency Model in Java-like Languages. In: Proc. CPA 2009, Concurrent Systems Engineering Series 67. IOS Press, pp. 7–27, doi:10.3233/978-1-60750-065-0-7.
  28. S. West, S. Nanz & B. Meyer (2010): A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model. In: Proc. ICFEM 2010, LNCS 6447. Springer, pp. 597–612, doi:10.1007/978-3-642-16901-4_39.
  29. S. West, S. Nanz & B. Meyer (2015): Efficient and reasonable object-oriented concurrency. In: Proc. PPoPP 2015. ACM, pp. 273–274, doi:10.1145/2688500.2688545.
  30. E. Zambon & A. Rensink (2011): Using Graph Transformations and Graph Abstractions for Software Verification. In: Proc. ICGT-DS 2010, ECEASST 38.
  31. E. Zambon & A. Rensink (2014): Solving the N-Queens Problem with GROOVE - Towards a Compendium of Best Practices. In: Proc. GT-VMT 2014, ECEASST 67.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org