@inbook{68e5a60cf051467f81efeda9af262685,
title = "Abstract Interpretation of Graphs",
abstract = "Path problems in graphs can be solved by abstraction of a fixpoint definition of all paths in a finite graph. Applied to the Roy-Floyd-Warshall shortest path algorithm this yields a na{\"i}ve n4 algorithm where n is the number of graph vertices. By over-approximating the elementary paths and cycles and generalizing the classical exact fixpoint abstraction, we constructively derive the classical n3 Roy-Floyd-Warshall algorithm.",
author = "Patrick Cousot",
note = "Funding Information: This work was supported in part by NSF Grant CCF-1617717. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation. Publisher Copyright: {\textcopyright} 2023, Springer Nature Switzerland AG.",
year = "2023",
doi = "10.1007/978-3-031-31476-6_4",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "72--96",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}