dvanhorn's library 234 articles Export

	Environment analysis via \(Δ\)-CFA [My Copy] In POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2006), pp. 127-140. by Matthew Might, Olin Shivers posted to no-tag by dvanhorn on 2009-11-20 04:00:25 as along with 1 person mattmight
	Constraint Abstractions [My Copy] In PADO '01: Proceedings of the Second Symposium on Programs as Data Objects (2001), pp. 63-83. by Jörgen Gustavsson, Josef Svenningsson posted to no-tag by dvanhorn on 2009-11-20 03:15:26 as
	Type-base flow analysis: from polymorphic subtyping to CFL-reachability [My Copy] In POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2001), pp. 54-66. by Jakob Rehof, Manuel Fähndrich posted to no-tag by dvanhorn on 2009-11-20 02:56:17 as along with 1 person mattmight
	Program Analysis using Binary Decision Diagrams [My Copy] (January 2006) by Ondřej Lhoták posted to no-tag by dvanhorn on 2009-11-16 20:21:44 as
	Two Approaches to Interprocedural Data Flow Analysis [My Copy] In Program Flow Analysis (1981), pp. 189-233. by Micha Sharir, Amir Pnueli edited by Steven S. Muchnick, Neil D. Jones posted to no-tag by dvanhorn on 2009-11-02 18:56:32 as
	Featherweight Java: a minimal core calculus for Java and GJ [My Copy] ACM Trans. Program. Lang. Syst., Vol. 23, No. 3. (2001), pp. 396-450. by Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler posted to java by dvanhorn on 2009-10-26 15:00:29 as along with 5 people keigoi bulwahn mattmight jackalope13 fvogels
	Principles of Program Analysis [My Copy] (1999) by Flemming Nielson, Hanne R. Nielson, Chris Hankin posted to cfa by dvanhorn on 2009-10-25 15:33:43 as along with 2 people plaugg zuleger
	A Type and Effect System for Flexible Abstract Interpretation of Java (Extended Abstract) [My Copy] Electronic Notes in Theoretical Computer Science, Vol. 131 (24 May 2005), pp. 111-124. by Christian Skalka, Scott Smith, David Van Horn posted to no-tag by dvanhorn on 2009-08-07 21:51:31 as
	Types and trace effects of higher order programs [My Copy] Journal of Functional Programming, Vol. 18, No. 02. (2008), pp. 179-249. by Christian Skalka, Scott Smith, David Van Horn posted to no-tag by dvanhorn on 2009-08-07 21:46:03 as
	Relating complexity and precision in control flow analysis [My Copy] In ICFP '07: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (2007), pp. 85-96. by David Van Horn, Harry G. Mairson posted to no-tag by dvanhorn on 2009-08-07 21:42:15 as along with 1 group Lambda the Ultimate
	Flow Analysis, Linearity, and PTIME [My Copy] Static Analysis In The 15th International Static Analysis Symposium (SAS 2008) (2008), pp. 255-269. by David Van Horn, Harry Mairson posted to no-tag by dvanhorn on 2009-08-07 21:39:57 as along with 1 person robertjohnsimmons
	Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings [My Copy] In RTA, Vol. 4098 (2006) edited by Frank Pfenning posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:29 as
	Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages [My Copy] In RTA, Vol. 4098 (2006), pp. 297-312. by Jürgen Giesl, Stephan Swiderski, Peter S. Kamp, René Thiemann edited by Frank Pfenning posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	A demand-driven set-based analysis [My Copy] In POPL '97: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1997), pp. 372-385. by Sandip K. Biswas posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Safety analysis versus type inference [My Copy] Inf. Comput., Vol. 118, No. 1. (1995), pp. 128-141. by Jens Palsberg, Michael I. Schwartzbach posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Abstract analysis and optimization of scheme [My Copy] (1993) by Andrew E. Ayers posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Simple and effective analysis of statically-typed object-oriented programs [My Copy] In OOPSLA '96: Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (1996), pp. 292-305. by Amer Diwan, Eliot, Kathryn S. Mckinley posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	A type system for Smalltalk [My Copy] In POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1990), pp. 136-150. by Justin O. Graver, Ralph E. Johnson posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	TS: An optimizing compiler for Smalltalk [My Copy] In OOPSLA '88: Conference proceedings on Object-oriented programming systems, languages and applications (1988), pp. 18-26. by Ralph E. Johnson, Justin O. Graver, Laurance W. Zurawski posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Fast static analysis of C++ virtual function calls [My Copy] In OOPSLA '96: Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (1996), pp. 324-341. by David F. Bacon, Peter F. Sweeney posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Interactive type analysis and extended message splitting; optimizing dynamically-typed object-oriented programs [My Copy] In PLDI '90: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (1990), pp. 150-164. by Craig Chambers, David Ungar posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:28 as
	Class analyses as abstract interpretations of trace semantics [My Copy] ACM Trans. Program. Lang. Syst., Vol. 25, No. 5. (2003), pp. 578-630. by Fausto Spoto, Thomas Jensen posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Flow-directed inlining [My Copy] In PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation (1996), pp. 193-205. by Suresh Jagannathan, Andrew Wright posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Object-oriented type inference [My Copy] In OOPSLA '91: Conference proceedings on Object-oriented programming systems, languages, and applications (1991), pp. 146-161. by Jens Palsberg, Michael I. Schwartzbach posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	On the Non-Approximability of Points-to Analysis [My Copy] Acta Informatica, Vol. 38, No. 8. (July 2002), pp. 587-598. by Venkatesan T. Chakaravarthy, Susan Horwitz posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Compile-Time Analysis of Object-Oriented Programs [My Copy] In CC '92: Proceedings of the 4th International Conference on Compiler Construction (1992), pp. 236-250. by Jan Vitek, R. Nigel Horspool, James S. Uhl posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Making Type Inference Practical [My Copy] In ECOOP '92: Proceedings of the European Conference on Object-Oriented Programming (1992), pp. 329-349. by Nicholas . J, Jens Palsberg, Michael I. Schwartzbach posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Type Systems for Polynomial-Time Computation [My Copy] (1998) by Martin Hofmann posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	On the computational complexity of imperative programming languages [My Copy] Theor. Comput. Sci., Vol. 318, No. 1-2. (2004), pp. 139-161. by L. Kristiansen, K. H. Niggl posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Stratified functional programs and computational complexity [My Copy] In POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993), pp. 325-333. by Daniel Leivant posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	Linear types and non-size-increasing polynomial time computation [My Copy] Inf. Comput., Vol. 183, No. 1. (2003), pp. 57-85. by Martin Hofmann posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:27 as
	A calculus with polymorphic and polyvariant flow types [My Copy] J. Funct. Program., Vol. 12, No. 3. (2002), pp. 183-227. by J. B. Wells, Allyn Dimock, Robert Muller, Franklyn Turbak posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Faithful Translations between Polyvariant Flows and Polymorphic Types [My Copy] In ESOP '00: Proceedings of the 9th European Symposium on Programming Languages and Systems (2000), pp. 26-40. by Torben Amtoft, Franklyn A. Turbak posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Strictly Declarative Specification of Sophisticated Points-to Analyses [My Copy] In OOPSLA '09: Proceedings of the 24th annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (October 2009) by Martin Bravenboer, Yannis Smaragdakis posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Rank 2 intersection types for local definitions and conditional expressions [My Copy] ACM Trans. Program. Lang. Syst., Vol. 25, No. 4. (2003), pp. 401-451. by Ferruccio Damiani posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Rank 2 Intersection for Recursive Definitions [My Copy] Fundam. Inf., Vol. 77, No. 4. (2007), pp. 451-488. by Ferruccio Damiani posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Detecting and Removing Dead-Code using Rank 2 Intersection [My Copy] In TYPES '96: Selected papers from the International Workshop on Types for Proofs and Programs (1998), pp. 66-87. by Ferruccio Damiani, Frédéric Prost posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Complete restrictions of the intersection type discipline [My Copy] Theor. Comput. Sci., Vol. 102, No. 1. (1992), pp. 135-163. by Steffen van Bakel posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths [My Copy] Algorithmica, Vol. 46, No. 2. (2006), pp. 181-192. by Uri Zwick posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	More algorithms for all-pairs shortest paths in weighted graphs [My Copy] In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007), pp. 590-598. by Timothy M. Chan posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	Efficient algorithms for clique problems [My Copy] Inf. Process. Lett., Vol. 109, No. 4. (2009), pp. 254-257. by Virginia Vassilevska posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:26 as
	On diameter verification and boolean matrix multiplication [My Copy] (1995) by Julien Basch, Sanjeev Khanna, Rajeev Motwani posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	Fast recognition of pushdown automaton and context-free languages [My Copy] Inf. Control, Vol. 67, No. 1-3. (1985), pp. 12-22. by Wojciech Rytter posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	Time and Tape Complexity of Pushdown Automaton Languages [My Copy] Information and Control, Vol. 13, No. 3. (1968), pp. 186-206. by Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullmana posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	The computational complexity of taxonomic inference [My Copy] (December 1989) by Radford Neal posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	Introduction to Languages and the Theory of Computation [My Copy] (1997) by John C. Martin posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	The size-change principle for program termination [My Copy] In POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2001), pp. 81-92. by Chin S. Lee, Neil D. Jones, Amir M. Ben Amram posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	CPS transformation of flow information [My Copy] J. Funct. Program., Vol. 13, No. 5. (2003), pp. 905-923. by Jens Palsberg, Mitchell Wand posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	A Modular, Extensible Proof Method for Small-Step Flow Analyses [My Copy] In ESOP '02: Proceedings of the 11th European Symposium on Programming Languages and Systems (2002), pp. 213-227. by Mitchell Wand, Galen B. Williamson posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as
	Selectors Make Set-Based Analysis Too Hard [My Copy] Higher Order Symbol. Comput., Vol. 18, No. 3-4. (2005), pp. 245-269. by Philippe Meunier, Robert B. Findler, Paul Steckler, Mitchell Wand posted to file-import-09-08-07 by dvanhorn on 2009-08-07 21:29:25 as

Note: You may cite this page as: http://www.citeulike.org/user/dvanhorn

Result page: 1 2 3 4 5 Next

dvanhorn's library 234 articles Export

dvanhorn's tags