Algorithms for algebraic path properties in concurrent systems of constant treewidth components

DOI10.1145/2837614.2837624zbMath1347.68260arXiv1510.07565OpenAlexW1821417028MaRDI QIDQ2828317

Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Krishnendu Chatterjee, Amir Kafshdar Goharshady

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

concurrent systemsshortest pathalgebraic path propertiesconstant-treewidth graphs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Pushdown reachability with constant treewidth ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ What’s Decidable About Program Verification Modulo Axioms? ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs

Uses Software

• DaCapo

This page was built for publication: Algorithms for algebraic path properties in concurrent systems of constant treewidth components