From dvanhorn at ccs.neu.edu Mon Jul 26 13:26:27 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:26:27 -0400 Subject: [hofa] Abstracting Abstract Machines: Storing and stacking continuations Message-ID: <4C4DEF73.60906@ccs.neu.edu> I'd like to announce a couple new papers that might be of interest to HOFA readers. We've been working on two techniques for systematically deriving abstract interpretations approximating canonical machines for higher-order languages. The first allocates continuations in a bounded store to achieve a finite state-space. We demonstrate the generality of this approach by transforming classical abstract machines into abstract interpreters. Abstracting Abstract Machines. David Van Horn and Matthew Might. The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP?10), Baltimore, Maryland, September, 2010. We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack- inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack- inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection. http://www.ccs.neu.edu/home/dvanhorn/pubs/vanhorn-might-icfp10.pdf The second technique keeps continuations on the stack to achieve a push-down model of abstract interpretation. The resulting abstract interpreter always matches calls and returns, achieving a higher level of precision by never conflating call and return pairs. Although this technique produces abstract interpreters with infinite state-spaces, we demonstrate how basic static analysis questions remain decidable by casting them as language inclusion problems answered by push-down automata. Pushdown Control-Flow Analysis of Higher-Order Programs. Christopher Earl, Matthew Might, and David Van Horn. The 2010 Workshop on Scheme and Functional Programming (SFP 2010), Montr?al, Qu?bec, Canada, August, 2010. Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-- a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we a arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses. http://www.ccs.neu.edu/home/dvanhorn/pubs/earl-might-vanhorn-sfp10.pdf There are also some slides available from a Harvard PL seminar talk: http://www.ccs.neu.edu/home/dvanhorn/talks/abstracting-abstract-machines-harvard-2010.pdf Thanks, David, Matt, Chris From dvanhorn at ccs.neu.edu Mon Jul 26 13:30:46 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:30:46 -0400 Subject: [hofa] Fwd: [TYPES/announce] Call for Papers: VMCAI'11 Message-ID: <4C4DF076.9000707@ccs.neu.edu> -------- Original Message -------- Subject: [TYPES/announce] Call for Papers: VMCAI'11 Date: Thu, 15 Jul 2010 10:23:18 -0500 From: Dave Schmidt To: types-announce at lists.seas.upenn.edu [ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] ---------------------------------------------------------------------- CALL FOR PAPERS VMCAI 2011 The Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation Austin, Texas, USA, January 23-25, 2011 (Co-located with POPL 2011) http://vmcai11.cis.ksu.edu ---------------------------------------------------------------------- VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods. VMCAI'11 is co-located with the POPL'11 conference. The program of VMCAI'11 will consist of invited lectures, invited tutorials, refereed research papers, and tool demonstrations. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification program certification model checking debugging techniques abstract interpretation abstract domains static analysis type systems deductive methods optimization Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. The proceedings will be published by Springer in the Lecture Notes in Computer Science series. The page limit for submissions is 15 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers. Formatting style files can be found at: http://www.springer.de/comp/lncs/authors.html Please visit the conference website for more information. Submission is by PDF file at http://www.easychair.org/conferences/?conf=vmcai2011 Important Dates: - Submission of abstracts: August 22, 2010 - Submission of papers: August 29, 2010 - Notification of acceptance: October 10, 2010 - Final version due: November 3, 2010 - Conference: January 23-25, 2011 Program Chairs: Ranjit Jhala, University of California, San Diego David Schmidt, Kansas State University Program Committee: Josh Berdine, Microsoft Research Ahmed Bouajjani, University of Paris VII Swarat Chaudhuri, Pennsylvania State University Patrick Cousot, ?cole Normale Sup?rieure, France Azadeh Farzan, University of Toronto Cormac Flanagan, University of California, Santa Cruz Aari Gupta, NEC Laboratories America Ranjit Jhala, University of California, San Diego Orna Kupferman, Hebrew University, Jerusalem Viktor Kuncak, ?cole Polytechnique F?d?rale de Lausanne Akash Lal, Microsoft Research Kedar Namjoshi Bell Labs Corina Pasareanu, NASA Ames Lab Ganesan Ramalingam, Microsoft Research Andrey Rybalchenko, Technische Universit?t M?nchen Sriram Sankaranarayanan, University of Colorado, Boulder David Schmidt, Kansas State University Dino Di Stefano, Queen Mary, University of London Tachio Terauchi, Tohoku University Lenore Zuck, University of Illinois at Chicago Steering Committee: Tino Cortesi, Universita Ca Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Giorgio Levi, University of Pisa, Italy Andreas Podelski, Universitaet Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ---------------------------------------------------------------------- From dvanhorn at ccs.neu.edu Mon Jul 26 13:26:27 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:26:27 -0400 Subject: [hofa] Abstracting Abstract Machines: Storing and stacking continuations Message-ID: <4C4DEF73.60906@ccs.neu.edu> I'd like to announce a couple new papers that might be of interest to HOFA readers. We've been working on two techniques for systematically deriving abstract interpretations approximating canonical machines for higher-order languages. The first allocates continuations in a bounded store to achieve a finite state-space. We demonstrate the generality of this approach by transforming classical abstract machines into abstract interpreters. Abstracting Abstract Machines. David Van Horn and Matthew Might. The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP?10), Baltimore, Maryland, September, 2010. We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack- inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack- inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection. http://www.ccs.neu.edu/home/dvanhorn/pubs/vanhorn-might-icfp10.pdf The second technique keeps continuations on the stack to achieve a push-down model of abstract interpretation. The resulting abstract interpreter always matches calls and returns, achieving a higher level of precision by never conflating call and return pairs. Although this technique produces abstract interpreters with infinite state-spaces, we demonstrate how basic static analysis questions remain decidable by casting them as language inclusion problems answered by push-down automata. Pushdown Control-Flow Analysis of Higher-Order Programs. Christopher Earl, Matthew Might, and David Van Horn. The 2010 Workshop on Scheme and Functional Programming (SFP 2010), Montr?al, Qu?bec, Canada, August, 2010. Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-- a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we a arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses. http://www.ccs.neu.edu/home/dvanhorn/pubs/earl-might-vanhorn-sfp10.pdf There are also some slides available from a Harvard PL seminar talk: http://www.ccs.neu.edu/home/dvanhorn/talks/abstracting-abstract-machines-harvard-2010.pdf Thanks, David, Matt, Chris From dvanhorn at ccs.neu.edu Mon Jul 26 13:30:46 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:30:46 -0400 Subject: [hofa] Fwd: [TYPES/announce] Call for Papers: VMCAI'11 Message-ID: <4C4DF076.9000707@ccs.neu.edu> -------- Original Message -------- Subject: [TYPES/announce] Call for Papers: VMCAI'11 Date: Thu, 15 Jul 2010 10:23:18 -0500 From: Dave Schmidt To: types-announce at lists.seas.upenn.edu [ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] ---------------------------------------------------------------------- CALL FOR PAPERS VMCAI 2011 The Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation Austin, Texas, USA, January 23-25, 2011 (Co-located with POPL 2011) http://vmcai11.cis.ksu.edu ---------------------------------------------------------------------- VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods. VMCAI'11 is co-located with the POPL'11 conference. The program of VMCAI'11 will consist of invited lectures, invited tutorials, refereed research papers, and tool demonstrations. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification program certification model checking debugging techniques abstract interpretation abstract domains static analysis type systems deductive methods optimization Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. The proceedings will be published by Springer in the Lecture Notes in Computer Science series. The page limit for submissions is 15 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers. Formatting style files can be found at: http://www.springer.de/comp/lncs/authors.html Please visit the conference website for more information. Submission is by PDF file at http://www.easychair.org/conferences/?conf=vmcai2011 Important Dates: - Submission of abstracts: August 22, 2010 - Submission of papers: August 29, 2010 - Notification of acceptance: October 10, 2010 - Final version due: November 3, 2010 - Conference: January 23-25, 2011 Program Chairs: Ranjit Jhala, University of California, San Diego David Schmidt, Kansas State University Program Committee: Josh Berdine, Microsoft Research Ahmed Bouajjani, University of Paris VII Swarat Chaudhuri, Pennsylvania State University Patrick Cousot, ?cole Normale Sup?rieure, France Azadeh Farzan, University of Toronto Cormac Flanagan, University of California, Santa Cruz Aari Gupta, NEC Laboratories America Ranjit Jhala, University of California, San Diego Orna Kupferman, Hebrew University, Jerusalem Viktor Kuncak, ?cole Polytechnique F?d?rale de Lausanne Akash Lal, Microsoft Research Kedar Namjoshi Bell Labs Corina Pasareanu, NASA Ames Lab Ganesan Ramalingam, Microsoft Research Andrey Rybalchenko, Technische Universit?t M?nchen Sriram Sankaranarayanan, University of Colorado, Boulder David Schmidt, Kansas State University Dino Di Stefano, Queen Mary, University of London Tachio Terauchi, Tohoku University Lenore Zuck, University of Illinois at Chicago Steering Committee: Tino Cortesi, Universita Ca Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Giorgio Levi, University of Pisa, Italy Andreas Podelski, Universitaet Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ---------------------------------------------------------------------- From dvanhorn at ccs.neu.edu Mon Jul 26 13:26:27 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:26:27 -0400 Subject: [hofa] Abstracting Abstract Machines: Storing and stacking continuations Message-ID: <4C4DEF73.60906@ccs.neu.edu> I'd like to announce a couple new papers that might be of interest to HOFA readers. We've been working on two techniques for systematically deriving abstract interpretations approximating canonical machines for higher-order languages. The first allocates continuations in a bounded store to achieve a finite state-space. We demonstrate the generality of this approach by transforming classical abstract machines into abstract interpreters. Abstracting Abstract Machines. David Van Horn and Matthew Might. The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP?10), Baltimore, Maryland, September, 2010. We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine's machine, and the stack- inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack- inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection. http://www.ccs.neu.edu/home/dvanhorn/pubs/vanhorn-might-icfp10.pdf The second technique keeps continuations on the stack to achieve a push-down model of abstract interpretation. The resulting abstract interpreter always matches calls and returns, achieving a higher level of precision by never conflating call and return pairs. Although this technique produces abstract interpreters with infinite state-spaces, we demonstrate how basic static analysis questions remain decidable by casting them as language inclusion problems answered by push-down automata. Pushdown Control-Flow Analysis of Higher-Order Programs. Christopher Earl, Matthew Might, and David Van Horn. The 2010 Workshop on Scheme and Functional Programming (SFP 2010), Montr?al, Qu?bec, Canada, August, 2010. Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-- a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we a arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses. http://www.ccs.neu.edu/home/dvanhorn/pubs/earl-might-vanhorn-sfp10.pdf There are also some slides available from a Harvard PL seminar talk: http://www.ccs.neu.edu/home/dvanhorn/talks/abstracting-abstract-machines-harvard-2010.pdf Thanks, David, Matt, Chris From dvanhorn at ccs.neu.edu Mon Jul 26 13:30:46 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Mon, 26 Jul 2010 16:30:46 -0400 Subject: [hofa] Fwd: [TYPES/announce] Call for Papers: VMCAI'11 Message-ID: <4C4DF076.9000707@ccs.neu.edu> -------- Original Message -------- Subject: [TYPES/announce] Call for Papers: VMCAI'11 Date: Thu, 15 Jul 2010 10:23:18 -0500 From: Dave Schmidt To: types-announce at lists.seas.upenn.edu [ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] ---------------------------------------------------------------------- CALL FOR PAPERS VMCAI 2011 The Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation Austin, Texas, USA, January 23-25, 2011 (Co-located with POPL 2011) http://vmcai11.cis.ksu.edu ---------------------------------------------------------------------- VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods. VMCAI'11 is co-located with the POPL'11 conference. The program of VMCAI'11 will consist of invited lectures, invited tutorials, refereed research papers, and tool demonstrations. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification program certification model checking debugging techniques abstract interpretation abstract domains static analysis type systems deductive methods optimization Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. The proceedings will be published by Springer in the Lecture Notes in Computer Science series. The page limit for submissions is 15 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers. Formatting style files can be found at: http://www.springer.de/comp/lncs/authors.html Please visit the conference website for more information. Submission is by PDF file at http://www.easychair.org/conferences/?conf=vmcai2011 Important Dates: - Submission of abstracts: August 22, 2010 - Submission of papers: August 29, 2010 - Notification of acceptance: October 10, 2010 - Final version due: November 3, 2010 - Conference: January 23-25, 2011 Program Chairs: Ranjit Jhala, University of California, San Diego David Schmidt, Kansas State University Program Committee: Josh Berdine, Microsoft Research Ahmed Bouajjani, University of Paris VII Swarat Chaudhuri, Pennsylvania State University Patrick Cousot, ?cole Normale Sup?rieure, France Azadeh Farzan, University of Toronto Cormac Flanagan, University of California, Santa Cruz Aari Gupta, NEC Laboratories America Ranjit Jhala, University of California, San Diego Orna Kupferman, Hebrew University, Jerusalem Viktor Kuncak, ?cole Polytechnique F?d?rale de Lausanne Akash Lal, Microsoft Research Kedar Namjoshi Bell Labs Corina Pasareanu, NASA Ames Lab Ganesan Ramalingam, Microsoft Research Andrey Rybalchenko, Technische Universit?t M?nchen Sriram Sankaranarayanan, University of Colorado, Boulder David Schmidt, Kansas State University Dino Di Stefano, Queen Mary, University of London Tachio Terauchi, Tohoku University Lenore Zuck, University of Illinois at Chicago Steering Committee: Tino Cortesi, Universita Ca Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France E. Allen Emerson, University of Texas at Austin, USA Giorgio Levi, University of Pisa, Italy Andreas Podelski, Universitaet Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA ----------------------------------------------------------------------