Linear-time graph programs without preconditions

DOI10.4204/EPTCS.417.3MaRDI QIDQ6934023zbMATH OpenFDO

Authors Ziad Ismaili Alaoui, Detlef Plump

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.417.3

Mathematics Subject Classification ID

Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Cites work

• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Efficient graph rewriting and its implementation
• Graph transformation. 17th international conference, ICGT 2024, held as part of STAF 2024, Enschede, the Netherlands, July 10--11, 2024. Proceedings
• Strategic port graph rewriting: an interactive modelling framework

Cited in

(1)

• Rule-based graph programs matching the time complexity of imperative algorithms

This page was built for publication: Linear-time graph programs without preconditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934023)