Author:
Biallas Sebastian,Brauer Jörg,King Andy,Kowalewski Stefan
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. Balakrishnan, G., Sankaranarayanan, S., Ivancic, F., Gupta, A.: Refining the Control Structure of Loops using Static Analysis. In: EMSOFT 2009, pp. 49–58. ACM Press (2009)
2. Lecture Notes in Computer Science;T. Ball,2007
3. Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic Predicate Abstraction of C Programs. In: PLDI, pp. 203–213 (2001)
4. Lecture Notes in Computer Science;T. Ball,2001
5. Biallas, S., Brauer, J., King, A., Kowalewski, S.: Proof Appendix for Loop Leaping with Closures. Technical Report 3-12, University of Kent, Canterbury, CT2 7NF, UK (June 2012),
http://www.cs.kent.ac.uk/people/staff/amk/pubs.html
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algebraic Program Analysis;Computer Aided Verification;2021
2. Numerical Invariants via Abstract Machines;Static Analysis;2018
3. Compositional recurrence analysis revisited;ACM SIGPLAN Notices;2017-09-14
4. Compositional recurrence analysis revisited;Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation;2017-06-14