Abstract
Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time. Despite years of efforts, there are no known truly sub-cubic algorithms for this problem. We study the related certification task: given an instance of CFL reachability, are there small and efficiently checkable certificates for the existence and for the non-existence of a path? We show that, in both scenarios, there exist succinct certificates (O(n2) in the size of the problem) and these certificates can be checked in subcubic (matrix multiplication) time. The certificates are based on grammar-based compression of paths (for reachability) and on invariants represented as matrix inequalities (for non-reachability). Thus, CFL reachability lies in nondeterministic and co-nondeterministic subcubic time.
A natural question is whether faster algorithms for CFL reachability will lead to faster algorithms for combinatorial problems such as Boolean satisfiability (SAT). As a consequence of our certification results, we show that there cannot be a fine-grained reduction from SAT to CFL reachability for a conditional lower bound stronger than nω, unless the nondeterministic strong exponential time hypothesis (NSETH) fails. In a nutshell, reductions from SAT are unlikely to explain the cubic bottleneck for CFL reachability.
Our results extend to related subcubic equivalent problems: pushdown reachability and 2NPDA recognition; as well as to all-pairs CFL reachability. For example, we describe succinct certificates for pushdown non-reachability (inductive invariants) and observe that they can be checked in matrix multiplication time. We also extract a new hardest 2NPDA language, capturing the “hard core” of all these problems.
Supplemental Material
- Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. 2015. If the Current Clique Algorithms are Optimal, So is Valiant’s Parser. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. IEEE Computer Society, 98–117.Google Scholar
Digital Library
- Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1968. Time and Tape Complexity of Pushdown Automaton Languages. Information and Control, 13, 3 (1968), 186–206.Google Scholar
Cross Ref
- Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, and Mihalis Yannakakis. 2005. Analysis of recursive state machines. ACM Trans. Program. Lang. Syst., 27, 4 (2005), 786–818. https://doi.org/10.1145/1075382.1075387 Google Scholar
Digital Library
- László Babai. 1985. Trading Group Theory for Randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, Robert Sedgewick (Ed.). ACM, 421–429. https://doi.org/10.1145/22145.22192 Google Scholar
Digital Library
- Arturs Backurs and Piotr Indyk. 2016. Which Regular Expression Patterns Are Hard to Match? In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, Irit Dinur (Ed.). IEEE Computer Society, 457–466. https://doi.org/10.1109/FOCS.2016.56 Google Scholar
Cross Ref
- Daniel Bienstock, Neil Robertson, Paul D. Seymour, and Robin Thomas. 1991. Quickly excluding a forest. J. Comb. Theory, Ser. B, 52, 2 (1991), 274–283. https://doi.org/10.1016/0095-8956(91)90068-U Google Scholar
Digital Library
- Luc Boasson, Bruno Courcelle, and Maurice Nivat. 1981. The Rational Index: A Complexity Measure for Languages. SIAM J. Comput., 10, 2 (1981), 284–296. https://doi.org/10.1137/0210020 Google Scholar
Digital Library
- Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, and Pierre Wolper. 2000. An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett., 74, 5-6 (2000), 221–227. https://doi.org/10.1016/S0020-0190(00)00055-7 Google Scholar
Digital Library
- Ahmed Bouajjani, Javier Esparza, and Oded Maler. 1997. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In CONCUR ’97: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings (Lecture Notes in Computer Science, Vol. 1243). Springer, 135–150.Google Scholar
- Phillip G. Bradford. 2018. Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability. CoRR, abs/1802.05239 (2018), arxiv:1802.05239.Google Scholar
- Karl Bringmann. 2018. Personal communication.Google Scholar
- Karl Bringmann, Allan Grønlund, and Kasper Green Larsen. 2017. A Dichotomy for Regular Expression Membership Testing. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, Chris Umans (Ed.). IEEE Computer Society, 307–318. https://doi.org/10.1109/FOCS.2017.36 Google Scholar
- Arnaud Carayol and Matthew Hague. 2014. Saturation algorithms for model-checking pushdown systems. In Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014, Zoltán Ésik and Zoltán Fülöp (Eds.) (EPTCS, Vol. 151). 1–24. https://doi.org/10.4204/EPTCS.151.1 Google Scholar
Cross Ref
- Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, and Stefan Schneider. 2016. Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016. ACM, 261–270.Google Scholar
Digital Library
- Krishnendu Chatterjee, Bhavya Choudhary, and Andreas Pavlogiannis. 2018. Optimal Dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang., 2, POPL (2018), 30:1–30:30. https://doi.org/10.1145/3158118 Google Scholar
Digital Library
- Krishnendu Chatterjee and Georg Osang. 2017. Pushdown reachability with constant treewidth. Inf. Process. Lett., 122 (2017), 25–29.Google Scholar
Digital Library
- Swarat Chaudhuri. 2008. Subcubic algorithms for recursive state machines. In Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, George C. Necula and Philip Wadler (Eds.). ACM, 159–169. https://doi.org/10.1145/1328438.1328460 Google Scholar
Digital Library
- Don Coppersmith and Shmuel Winograd. 1990. Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput., 9, 3 (1990), 251–280.Google Scholar
Digital Library
- Mateus de Oliveira Oliveira and Michael Wehar. 2018. Intersection Non-emptiness and Hardness Within Polynomial Time. In Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, Mizuho Hoshi and Shinnosuke Seki (Eds.) (Lecture Notes in Computer Science, Vol. 11088). Springer, 282–290. https://doi.org/10.1007/978-3-319-98654-8_23 Google Scholar
Cross Ref
- Mateus de Oliveira Oliveira and Michael Wehar. 2020. On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. In Developments in Language Theory - 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings, Natasa Jonoska and Dmytro Savchuk (Eds.) (Lecture Notes in Computer Science, Vol. 12086). Springer, 69–82. https://doi.org/10.1007/978-3-030-48516-0_6 Google Scholar
Digital Library
- Danny Dolev, Shimon Even, and Richard M. Karp. 1982. On the Security of Ping-Pong Protocols. Inf. Control., 55, 1-3 (1982), 57–68. https://doi.org/10.1016/S0019-9958(82)90401-6 Google Scholar
Cross Ref
- Henning Fernau. 2019. Modern Aspects of Complexity Within Formal Languages. In Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings, Carlos Martín-Vide, Alexander Okhotin, and Dana Shapira (Eds.) (Lecture Notes in Computer Science, Vol. 11417). Springer, 3–30. https://doi.org/10.1007/978-3-030-13435-8_1 Google Scholar
Cross Ref
- Henning Fernau and Andreas Krebs. 2017. Problems on Finite Automata and the Exponential Time Hypothesis. Algorithms, 10, 1 (2017), 24. https://doi.org/10.3390/a10010024 Google Scholar
Cross Ref
- Alain Finkel, Bernard Willems, and Pierre Wolper. 1997. A direct symbolic approach to model checking pushdown systems. In Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997, Faron Moller (Ed.) (Electronic Notes in Theoretical Computer Science, Vol. 9). Elsevier, 27–37. https://doi.org/10.1016/S1571-0661(05)80426-8 Google Scholar
Cross Ref
- Rusins Freivalds. 1979. Fast Probabilistic Algorithms. In Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, Jirí Becvár (Ed.) (Lecture Notes in Computer Science, Vol. 74). Springer, 57–69. https://doi.org/10.1007/3-540-09526-8_5 Google Scholar
Cross Ref
- Zvi Galil. 1977. Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. Mathematical Systems Theory, 10 (1977), 211–228.Google Scholar
Cross Ref
- Jonathan Goldstine, John K. Price, and Detlef Wotschke. 1982. A pushdown automaton or a context-free grammar: which is more economical? Theoret. Comput. Sci., 18 (1982), 33–40.Google Scholar
Cross Ref
- Jim Gray, Michael A. Harrison, and Oscar H. Ibarra. 1967. Two-Way Pushdown Automata. Information and Control, 11, 1/2 (1967), 30–70.Google Scholar
Cross Ref
- Sheila A. Greibach. 1973. The Hardest Context-Free Language. SIAM J. Comput., 2, 4 (1973), 304–310. https://doi.org/10.1137/0202025 Google Scholar
Digital Library
- Nevin Heintze and David A. McAllester. 1997. On the Cubic Bottleneck in Subtyping and Flow Analysis. In Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science (LICS), Warsaw, Poland, June 29 - July 2, 1997. IEEE Computer Society, 342–351. https://doi.org/10.1109/LICS.1997.614960 Google Scholar
Cross Ref
- Jelle Hellings. 2020. Explaining Results of Path Queries on Graphs - Single-Path Results for Context-Free Path Queries. In Software Foundations for Data Interoperability and Large Scale Graph Data Analytics - 4th International Workshop, SFDI 2020, and 2nd International Workshop, LSGDA 2020, held in Conjunction with VLDB 2020, Tokyo, Japan, September 4, 2020, Proceedings, Lu Qin, Wenjie Zhang, Ying Zhang, You Peng, Hiroyuki Kato, Wei Wang, and Chuan Xiao (Eds.) (Communications in Computer and Information Science, Vol. 1281). Springer, 84–98. https://doi.org/10.1007/978-3-030-61133-0_7 Google Scholar
Cross Ref
- John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 2006. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA. isbn:0321455363Google Scholar
Digital Library
- Russell Impagliazzo and Ramamohan Paturi. 2001. On the Complexity of k-SAT. J. Comput. Syst. Sci., 62, 2 (2001), 367–375. https://doi.org/10.1006/jcss.2000.1727 Google Scholar
Digital Library
- Somesh Jha and Thomas W. Reps. 2004. Model checking SPKI/SDSI. J. Comput. Secur., 12, 3-4 (2004), 317–353. http://content.iospress.com/articles/journal-of-computer-security/jcs209Google Scholar
Digital Library
- Tracy Kimbrel and Rakesh K. Sinha. 1993. A Probabilistic Algorithm for Verifying Matrix Products Using O(n^2) Time and olog_2 n + O(1) Random Bits. Inf. Process. Lett., 45, 2 (1993), 107–110. https://doi.org/10.1016/0020-0190(93)90224-W Google Scholar
Digital Library
- Ivan Korec and Jirí Wiedermann. 2014. Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. In SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, and A Min Tjoa (Eds.) (Lecture Notes in Computer Science, Vol. 8327). Springer, 375–382. https://doi.org/10.1007/978-3-319-04298-5_33 Google Scholar
Cross Ref
- Marvin Künnemann. 2018. On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress. In 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, Yossi Azar, Hannah Bast, and Grzegorz Herman (Eds.) (LIPIcs, Vol. 112). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 56:1–56:16. https://doi.org/10.4230/LIPIcs.ESA.2018.56 Google Scholar
Cross Ref
- Bernard Lang. 1994. Recognition can Be Harder Than Parsing. Comput. Intell., 10 (1994), 486–494. https://doi.org/10.1111/j.1467-8640.1994.tb00011.x Google Scholar
Cross Ref
- Lillian Lee. 2002. Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM, 49, 1 (2002), 1–15.Google Scholar
Digital Library
- Markus Lohrey. 2012. Algorithmics on SLP-compressed strings: A survey. Groups Complex. Cryptol., 4, 2 (2012), 241–299. https://doi.org/10.1515/gcc-2012-0016 Google Scholar
Cross Ref
- Anders Alnor Mathiasen and Andreas Pavlogiannis. 2021. The fine-grained and parallel complexity of Andersen’s pointer analysis. Proc. ACM Program. Lang., 5, POPL (2021), 1–29. https://doi.org/10.1145/3434315 Google Scholar
Digital Library
- Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer. 2011. Certifying algorithms. Comput. Sci. Rev., 5, 2 (2011), 119–161. https://doi.org/10.1016/j.cosrev.2010.09.009 Google Scholar
Digital Library
- David Melski and Thomas Reps. 2000. Interconvertibility of a class of set constraints and context-free-language reachability. Theor. Comput. Sci., 248(1-2) (2000), 29–98.Google Scholar
- Radford Neal. 1989. The computational complexity of taxonomic inference. Unpublished manuscript. Available at http://www.cs.toronto.edu/ radford/ftp/taxc.pdfGoogle Scholar
- G.C. Necula. 1997. Proof carrying code. In POPL 97: Principles of Programming Languages. ACM, 106–119.Google Scholar
- Laurent Pierre. 1992. Rational Indexes of Generators of the Cone of Context-Free Languages. Theor. Comput. Sci., 95, 2 (1992), 279–305. https://doi.org/10.1016/0304-3975(92)90269-L Google Scholar
Digital Library
- Aaron Potechin and Jeffrey O. Shallit. 2020. Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett., 162 (2020), 105993. https://doi.org/10.1016/j.ipl.2020.105993 Google Scholar
Cross Ref
- Thomas W. Reps, Susan Horwitz, and Mooly Sagiv. 1995. Precise Interprocedural Dataflow Analysis via Graph Reachability. In Conference Record of POPL’95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, Ron K. Cytron and Peter Lee (Eds.). ACM Press, 49–61. https://doi.org/10.1145/199448.199462 Google Scholar
Digital Library
- Wojciech Rytter. 1981. A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett., 13, 4/5 (1981), 145–146. https://doi.org/10.1016/0020-0190(81)90045-4 Google Scholar
Cross Ref
- Wojciech Rytter. 1985. Fast Recognition of Pushdown Automaton and Context-free Languages. Information and Control, 67, 1-3 (1985), 12–22.Google Scholar
Digital Library
- Wojciech Rytter. 1987. 100 exercises in the theory of automata and formal languages. http://wrap.warwick.ac.uk/60795/ Research report RR-99, University of Warwick, Department of Computer Science, available atGoogle Scholar
- Stefan Schwoon. 2002. Model checking pushdown systems. Ph.D. Dissertation. Technical University Munich, Germany. http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/schwoon.htmlGoogle Scholar
- Richard Edwin Stearns, Juris Hartmanis, and Philip M. Lewis II. 1965. Hierarchies of memory limited computations. In 6th Annual Symposium on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, USA, October 6-8, 1965. IEEE Computer Society, 179–190. https://doi.org/10.1109/FOCS.1965.11 Google Scholar
Digital Library
- Joseph Swernofsky and Michael Wehar. 2015. On the Complexity of Intersecting Regular, Context-Free, and Tree Languages. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.) (Lecture Notes in Computer Science, Vol. 9135). Springer, 414–426. https://doi.org/10.1007/978-3-662-47666-6_33 Google Scholar
Digital Library
- Roei Tell. 2019. Proving that prBPP=prP is as hard as proving that “almost NP” is not contained in P/poly. Inf. Process. Lett., 152 (2019), https://doi.org/10.1016/j.ipl.2019.105841 Google Scholar
Cross Ref
- Leslie G. Valiant. 1975. General Context-Free Recognition in Less than Cubic Time. J. Comput. Syst. Sci., 10, 2 (1975), 308–315.Google Scholar
Digital Library
- Virginia Vassilevska Williams. 2012. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, Howard J. Karloff and Toniann Pitassi (Eds.). ACM, 887–898. https://doi.org/10.1145/2213977.2214056 Google Scholar
Digital Library
- Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In International Congress of Mathematicians (ICM’18). Available at https://eta.impa.br/dl/194.pdfGoogle Scholar
- Virginia Vassilevska Williams and R. Ryan Williams. 2018. Subcubic Equivalences Between Path, Matrix, and Triangle Problems. J. ACM, 65, 5 (2018), 27:1–27:38.Google Scholar
Digital Library
- Mikhail Vyalyi. 2019. Personal communication.Google Scholar
- Mikhail N. Vyalyi. 2011. On regular realizability problems. Probl. Inf. Transm., 47, 4 (2011), 342–352. https://doi.org/10.1134/S003294601104003X Google Scholar
Digital Library
- Mikhail N. Vyalyi and Alexander A. Rubtsov. 2015. On regular realizability problems for context-free languages. Probl. Inf. Transm., 51, 4 (2015), 349–360. https://doi.org/10.1134/S0032946015040043 Google Scholar
Digital Library
- Michael Wehar. 2014. Hardness Results for Intersection Non-Emptiness. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.) (Lecture Notes in Computer Science, Vol. 8573). Springer, 354–362. https://doi.org/10.1007/978-3-662-43951-7_30 Google Scholar
Cross Ref
- Mihalis Yannakakis. 1990. Graph-Theoretic Methods in Database Theory. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA. ACM Press, 230–242.Google Scholar
Digital Library
Index Terms
Subcubic certificates for CFL reachability
Recommendations
Optimal Dyck reachability for data-dependence and alias analysis
A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths ...
The Fine-Grained Complexity of CFL Reachability
Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time O(n3), where n is the number of vertices in the ...
Selective Context-Sensitivity for k-CFA with CFL-Reachability
Static AnalysisAbstractk-CFA provides the most well-known context abstraction for program analysis, especially pointer analysis, for a wide range of programming languages. However, its inherent context explosion problem has hindered its applicability. To mitigate this ...






Comments