Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Matrix Calculus;Bodewig,1959
3. B. Boigelot, Symbolic methods for exploring infinite state spaces, Collection des Publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
4. B. Boigelot, L. Bronne, S. Rassart, An improved reachability analysis method for strongly linear hybrid systems, in: Proc. 9th Internat. Conf. Computer-Aided Verification, Haifa, Israel, June 1997, Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, pp. 167–177.
5. B. Boigelot, P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs, in: Proc. Computer Aided Verification, New-Brunswick, NJ, July 1996, Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, pp. 1–12.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Newton’s Method – There and Back Again;Lecture Notes in Computer Science;2024
2. Regular Reinforcement Learning;Lecture Notes in Computer Science;2024
3. FlashFill++: Scaling Programming by Example by Cutting to the Chase;Proceedings of the ACM on Programming Languages;2023-01-09
4. A calculus for modular loop acceleration and non-termination proofs;International Journal on Software Tools for Technology Transfer;2022-10
5. What’s decidable about linear loops?;Proceedings of the ACM on Programming Languages;2022-01-12