Reachability predicates for graph assertions

DOI10.1007/978-3-319-45994-3_5MaRDI QIDQ1708656zbMATH OpenOpenAlexFDO

Authors Giorgio Delzanno

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-45994-3_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A logic of reachable patterns in linked data-structures
• Verifying monadic second-order properties of graph programs
• Verifying graph programs with monadic second-order logic

Cited in

(2)

• Certifying a Termination Criterion Based on Graphs, without Graphs
• scientific article; zbMATH DE number 7599923 (Why is no real title available?)

This page was built for publication: Reachability predicates for graph assertions

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