z-logo
open-access-imgOpen Access
Proving Correctness of Logically Decorated Graph Rewriting Systems
Author(s) -
Jon Haël Brenas,
Rachid Echahed,
Martin Strecker
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - correctness , rewriting , decidability , computer science , graph rewriting , confluence , tuple , graph , programming language , theoretical computer science , mathematics , discrete mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom