Path Querying with Conjunctive Grammars by Matrix Multiplication
-
Published:2019-12
Issue:7
Volume:45
Page:357-364
-
ISSN:0361-7688
-
Container-title:Programming and Computer Software
-
language:en
-
Short-container-title:Program Comput Soft
Author:
Azimov R.,Grigorev S.
Publisher
Pleiades Publishing Ltd
Reference25 articles.
1. Barrett, Ch., Jacob, R., and Marathe, M., Formal-language-constrained path problems, SIAM J. Comput., 2000, vol. 30, no. 3, pp. 09–837. 2. Bastani, O., Anand, S., and Aiken, A., Specification inference using context-free language reachability, ACM SIGPLAN Notices, ACM, 2015, vol. 50, pp. 553–566. 3. Xu, G., Rountev, A., and Sridharan, M., Scaling c-reachability-based points-to analysis using context-sensitive must-not-alias analysis, ECOOP, Springer, 2009, vol. 9, pp. 98–122. 4. Reps, T., Program analysis via graph reachability, Inf. Software Technol., 1998, vol. 40, no. 11, pp. 701–726. 5. Zhang, Q. and Su, Z., Context-sensitive data-dependence analysis via linear conjunctive language reachability, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, ACM, 2017, pp. 344–358.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
|
|