Author:
Fecht Christian,Seidl Helmut
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. F. Bourdoncle. Abstract Interpretation by Dynamic Partitioning. Journal of Functional Programming, 2(4), 1992.
2. B. Le Charlier and P. Van Hentenryck. A Universal Top-Down Fixpoint Algorithm. Technical report 92-22, Institute of Computer Science, University of Namur, Belgium, 1992.
3. B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. TOPLAS, 16(1):35–101, 1994.
4. R. Cleaveland and B. Steffen. A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In CAV'91. Springer, LNCS 575, 1991.
5. A. Cortesi, G. Filé, and W. Winsborough. Prop revisited: Propositional formulas as abstract domain for groundness analysis. In LICS'91, 322–327, Amsterdam, The Netherlands, 1991.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Local Higher-Order Fixpoint Iteration;Electronic Proceedings in Theoretical Computer Science;2020-09-20
2. Enforcing termination of interprocedural analysis;Formal Methods in System Design;2017-08-03
3. Abstract Interpretation as a Programming Language;Electronic Proceedings in Theoretical Computer Science;2013-09-19
4. Points-to Analysis as a System of Linear Equations;Static Analysis;2010
5. Computationally sound secrecy proofs by mechanized flow analysis;Proceedings of the 13th ACM conference on Computer and communications security - CCS '06;2006