Roy Overbeek

Orcid: 0000-0003-0569-0947

According to our database1, Roy Overbeek authored at least 16 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Graph rewriting and relabeling with PBPO<sup>+</sup>: A unifying theory for quasitoposes.
J. Log. Algebraic Methods Program., June, 2023

Generalized Weighted Type Graphs for Termination of Graph Transformation Systems.
CoRR, 2023

Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting.
CoRR, 2023

Fuzzy Presheaves are Quasitoposes.
Proceedings of the Graph Transformation - 16th International Conference, 2023

Termination of Graph Transformation Systems Using Weighted Subgraph Counting.
Proceedings of the Graph Transformation - 16th International Conference, 2023

2022
A PBPO+ Graph Rewriting Tutorial.
Proceedings of the Proceedings Twelfth International Workshop on Computing with Terms and Graphs, 2022

Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes.
CoRR, 2022

2021
Star Games and Hydras.
Log. Methods Comput. Sci., 2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination.
Proceedings of the Proceedings Twelfth International Workshop on Graph Computational Models, 2021

Graph Rewriting and Relabeling with PBPO<sup>+</sup>.
Proceedings of the Graph Transformation - 14th International Conference, 2021

2020
Decreasing Diagrams for Confluence and Commutation.
Log. Methods Comput. Sci., 2020

Graph Rewriting and Relabeling with PBPO+ (Extended Version).
CoRR, 2020

Patch Graph Rewriting.
Proceedings of the Graph Transformation - 13th International Conference, 2020

Formalizing determinacy of concurrent revisions.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2018
Formalization of Concurrent Revisions.
Arch. Formal Proofs, 2018

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018


  Loading...