A Graph Transformation System formalism for Software Transactional Memory Opacity-Reference-Cited by-同舟云学术

A Graph Transformation System formalism for Software Transactional Memory Opacity

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the XXIII Brazilian Symposium on Programming Languages - SBLP 2019
language:
Short-container-title:

Author:

Cardoso Diogo J.¹,Foss Luciana¹,Bois Andre R. Du¹

Affiliation:

1. Programa de Pós-Graduação em Computação, Universidade Federal de Pelotas, Pelotas, RS, Brazil

Publisher

ACM Press

Reference29 articles.

1. Paolo Baldan, Andrea Corradini, Fernando Luís Dotti, Luciana Foss, Fabio Gadducci, and Leila Ribeiro. 2008. Towards a notion of transaction in graph rewriting. Electronic Notes in Theoretical Computer Science 211 (2008), 39--50.

2. M. Bardohl, R.and Minas, G. Taentzer, and A. Schurr. 1999. Application of graph transformation to visual languages. Handbook of graph grammars and computing by graph transformation 2 (1999), 105.

3. Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, and Rachid Guerraoui. 2018. The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live. Journal of the ACM (JACM) 66, 1 (2018), 2.

4. Simone André da Costa Cavalheiro, Luciana Foss, and Leila Ribeiro. 2017. Theorem proving graph grammars with attributes and negative application conditions. Theoretical computer science 686 (2017), 25--77.

5. Austin T Clements, M Frans Kaashoek, Eddie Kohler, Robert T Morris, and Nickolai Zeldovich. 2017. The scalable commutativity rule: designing scalable software for multicore processors. Commun. ACM 60, 8 (2017), 83--90.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring Opacity Software Transactional Memory in Haskell through Graph Transformation;XXVI Brazilian Symposium on Programming Languages;2022-10-06