This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
A. Bouajjani , J. Esparza & O. Maler (1997) Reachability analysis of pushdown automata: Application to Model-Checking. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR '97). Springer-Verlag, pp. 135–150.
C. Earl , I. Sergey , M. Might & D. Van Horn (2012) Introspective pushdown analysis of higher-order programs. In Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012), ICFP '12. ACM, pp. 177–188.
J. Esparza , A. Kucera & S. Schwoon (2003) Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186 (2), 355–376.
M. Felleisen & D. P. Friedman (1987) A calculus for assignments in higher-order languages. In Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL '87), ACM, pp. 314.
C. Flanagan , A. Sabry , B. F. Duba & M. Felleisen (1993, June) The essence of compiling with continuations. In Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation (PLDI '93). ACM, pp. 237–247.
S. Ginsburg , S. A. Greibach & M. A. Harrison (1967) One-way stack automata. J. ACM 14 (2), 389–418.
N. Kobayashi (2009, January) Types and higher-order recursion schemes for verification of higher-order programs. SIGPLAN Not. 44 (1), 416–428.
D. Melski & T. W. Reps (2000, October). Interconvertibility of a class of set constraints and context-free-language reachability. Theor. Comput. Sci. 248 (1-2), 29–98.
M. Might , B. Chambers & O. Shivers (2007, January) Model checking via Gamma-CFA. In Verification, Model Checking, and Abstract Interpretation, B. Cook & A. Podelski (eds), Springer-Verlag, LNCS, pp. 59–73.
M. Might , D. Darais & D. Spiewak (2011) Parsing with derivatives: a functional pearl. In Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming (ICFP '11). ACM, pp. 189–195.
M. Might & P. Manolios (2009) A posteriori soundness for non-deterministic abstract interpretations. In Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI '09). Springer-Verlag, pp. 260–274.
M. Might & O. Shivers (2006a) Environment analysis via Delta-CFA. In Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2006). ACM, pp. 127–140.
M. Might , Y. Smaragdakis & D. Van Horn (2010) Resolving and exploiting the k-CFA paradox: Illuminating functional vs. object-oriented program analysis. In Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '10). ACM Press, pp. 305–315.
S. Owens , J. Reppy & A. Turon (2009) Regular-expression derivatives re-examined. J. Funct. Program. 19 (02), 173–190.
J. Rehof & M. Fähndrich (2001) Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '01). ACM, pp. 54–66.
T. Reps (1998, December). Program analysis via graph reachability. Inf. Softw. Technol. 40 (11-12), 701–726.
T. Reps , S. Schwoon , S. Jha & D. Melski (2005, October) Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. 58 (1-2), 206–263.
D. Van Horn & M. Might (2012) Systematic abstraction of abstract machines. J. Funct. Program. 22(Special Issue 4-5), 705–746.
A. K. Wright & S. Jagannathan (1998, January) Polymorphic splitting: An effective polyvariant flow analysis. ACM Trans. Program. Lang. Syst. 20 (1), 166–207.