The Complexity of Bidirected Reachability in Valence Systems-Reference-Cited by-同舟云学术

The Complexity of Bidirected Reachability in Valence Systems

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Ganardi Moses¹,Majumdar Rupak¹,Zetzsche Georg¹

Affiliation:

1. Max Planck Institute for Software Systems (MPI-SWS), Germany

Funder

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533345

Reference48 articles.

1. The complexity of matrix rank and feasible systems of linear equations

2. A compendium of problems complete for symmetric logarithmic space

3. The Nielsen reduction and P-complete problems in free groups;Avenhaus Jürgen;Theoretical Computer Science,1984

4. Algebraic Potential Theory on Graphs

5. Rémi Bonnet . 2011 . The Reachability Problem for Vector Addition System with One Zero-Test. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium , MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings(Lecture Notes in Computer Science, Vol. 6907) , Filip Murlak and Piotr Sankowski (Eds.). Springer, 145–157. https://doi.org/10.1007/978-3-642-22993-0_16 Rémi Bonnet. 2011. The Reachability Problem for Vector Addition System with One Zero-Test. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings(Lecture Notes in Computer Science, Vol. 6907), Filip Murlak and Piotr Sankowski (Eds.). Springer, 145–157. https://doi.org/10.1007/978-3-642-22993-0_16

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability;Proceedings of the ACM on Programming Languages;2024-01-05

3. The decidability and complexity of interleaved bidirected Dyck reachability;Proceedings of the ACM on Programming Languages;2022-01-12