Taint analysis for graph APIs focusing on broken access control

DOI10.46298/LMCS-22(1:18)2026MaRDI QIDQ6840498zbMATH OpenFDO

Authors Leen Lambers, Lucas Sakizloglou, Taisiya Khakharova, Fernando Orejas

Publication date 23 March 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:18)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A graph-based framework for the analysis of access control policies
• Critical pairs in term graph rewriting
• Efficient conflict detection in graph transformation systems by essential critical pairs
• Fundamentals of algebraic graph transformation
• Granularity of conflicts and dependencies in graph transformation systems
• Graph-based specification of access control policies
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 5542184 (Why is no real title available?)
• Initial conflicts and dependencies: critical pairs revisited

This page was built for publication: Taint analysis for graph APIs focusing on broken access control

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