Fully Dynamic Single-Source Reachability in Practice: An Experimental Study

DOI10.1137/1.9781611976007.9MaRDI QIDQ5147502zbMATH OpenOpenAlexFDO

Authors Kathrin Hanauer, Christian Schulz, Monika R. Henzinger

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.01216

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Reachability of scope-bounded multistack pushdown systems
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
• scientific article; zbMATH DE number 4050940
• Reachability for dynamic parametric processes
• Revisiting underapproximate reachability for multipushdown systems
• Reachability analysis of communicating pushdown systems
• Reachability analysis of communicating pushdown systems
• Precisely deciding control state reachability in concurrent traces with limited observability

This page was built for publication: Fully Dynamic Single-Source Reachability in Practice: An Experimental Study

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