[TYPES/announce] PASTE 2010 Call for Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] * *** PASTE 2010 CALL FOR PARTICIPATION *** *** (co-located with PLDI 2010) *** * We invite you to attend the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, held on June 5-6 in Toronto, Canada (co-located with PLDI 2010). PASTE 2010 will feature 12 technical presentations and 2 keynote talks, together with opportunities for all attendees to make short presentations/demos and to participate in group discussions. For more details, please see the full program available at http://cseweb.ucsd.edu/paste2010 Register by *May 10* to take advantage of the early registration rate. We hope you will join us in Toronto! Sorin Lerner and Atanas Rountev PASTE 2010 Co-chairs
[TYPES/announce] CFP - PASTE 2010: 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] PASTE 2010 CALL FOR CONTRIBUTIONS 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering June 5-6, 2010 (co-located with PLDI 2010) Fairmont Royal York, Toronto, Canada http://cseweb.ucsd.edu/paste2010 PASTE 2010 is the ninth workshop in a series that brings together the program analysis, software tools, and software engineering communities to focus on applications of program analysis techniques in software tools. PASTE 2010 will provide a forum for the presentation of exciting research, empirical results, and new directions in areas including (but not limited to): * program analysis for program understanding, debugging, testing, and reverse engineering * integration of program analysis into programming environments * user interfaces for software tools and software visualization * applications of program slicing, model checking, and other program analysis techniques * analysis of program execution or program evolution * integration of, or tradeoffs between, different analysis techniques * issues in scaling analyses and user interfaces to deal with large systems PASTE will be a true workshop, with research presentations, organized discussions, opportunities for all attendees to make short presentations, and ample time for debate. SUBMISSION CATEGORIES Regular papers: research papers that describe ongoing research or new results. The page limit for this category is 8 pages. The entire paper (including bibliography, appendices, related work discussion, etc.) must fit within the 8-page limit. Short papers: papers that discuss controversial issues in the field, or describe interesting or thought-provoking ideas that are not yet fully developed. The page limit for this category is 4 pages. The program committee will select papers based on technical quality, relevance to the PASTE community, and ability to inspire new research and productive discussions at the workshop. Detailed submission guidelines are provided at http://cseweb.ucsd.edu/paste2010/cfp.html IMPORTANT DATES Paper submission: February 8, 2010 Author notification: March 18, 2010 Camera-ready version: April 6, 2010 Workshop: June 5-6, 2010 PROGRAM COMMITTEE Brian Demsky, University of California, Irvine Michael Hicks, University of Maryland, College Park Miryung Kim, The University of Texas at Austin Sorin Lerner (co-chair), University of California, San Diego Lori Pollock, University of Delaware G. Ramalingam, Microsoft Research India Atanas Rountev (co-chair), Ohio State University Andrey Rybalchenko, Max Planck Institute for Software Systems Manu Sridharan, IBM T.J. Watson Research Center Westley Weimer, University of Virginia
[TYPES/announce] POPL 2009 Call for Participation
-Aviv University *** The Theory of Deadlock Avoidance via Discrete Control Yin Wang, Discrete Event Systems Lab, U. Michigan EECS Scott Mahlke, Advanced Computer Architecture Lab, U. Michigan EECS Stephane Lafortune, Discrete Event Systems Lab, U. Michigan EECS Terence Kelly, HP Labs Manjunath Kudlur, Advanced Computer Architecture Lab, U. Michigan EECS --- ** STATIC ANALYSIS III (Session chair: Anindya Banerjee, Kansas State University and IMDEA-SW, Madrid) 4:00 - 5:00 *** Equality Saturation: a new Approach to Optimization Ross Tate, UC San Diego Michael Stepp, UC San Diego Zachary Tatlock, UC San Diego Sorin Lerner, UC San Diego *** Positive Supercompilation for a higher order call-by-value language Peter A. Jonsson, Lulea University of Technology Johan Nordlander, Lulea University of Technology *** Compositional Shape Analysis by means of Bi-Abduction Cristiano Calcagno, Imperial College, London Dino Distefano, Queen Mary, University of London Peter O'Hearn, Queen Mary, University of London Hongseok Yang, Queen Mary, University of London --- *** Program Chair's report and announcement of POPL 2010 5:00 - 5:30 Benjamin C. Pierce, University of Pennsylvania, USA Manuel Hermenegildo, IMDEA-Software and T.U. of Madrid, Spain Jens Palsberg, UCLA, USA __ * FRIDAY, January 23, 2009 ** Invited talk: Alex Simpson, University of Edinburgh, UK (Session chair: Masahito Hasegawa, Kyoto University) 9:00 - 10:00 --- ** PROGRAM LOGICS(Session chair: Nick Benton, Microsoft Research) 10:30 - 11:30 *** Unifying Type Checking and Property Checking for Low-Level Code Jeremy Condit, Microsoft Research Brian Hackett, Stanford University Shuvendu Lahiri, Microsoft Research Shaz Qadeer, Microsoft Research *** Local Rely-Guarantee Reasoning Xinyu Feng, Toyota Technological Institute at Chicago *** Classical BI (A Logic for Reasoning about Dualising Resource) James Brotherston, Imperial College London Cristiano Calcagno, Imperial College London --- ** TYPES II (Session chair: Atsushi Igarashi, Kyoto University) 12:00 - 1:00 *** State-Dependent Representation Independence Amal Ahmed, TTI-C Derek Dreyer, MPI-SWS Andreas Rossberg, MPI-SWS *** Modeling Abstract Types in Modules with Open Existential Types Benoit Montagu, INRIA Didier Remy, INRIA *** Focusing on Pattern Matching Neelakantan Krishnaswami, Carnegie Mellon University --- ** MULTICORE (Session chair: Leaf Petersen, Intel Corporation) 2:30 - 3:30 *** The Semantics of x86-CC Multiprocessor Machine Code Susmit Sarkar, University of Cambridge Peter Sewell, University of Cambridge Francesco Zappa Nardelli, INRIA Scott Owens, University of Cambridge Tom Ridge, University of Cambridge Thomas Braibant, INRIA Magnus Myreen, University of Cambridge Jade Alglave, INRIA *** Relaxed memory models: an operational approach Gerard Boudol, INRIA Sophia Antipolis Gustavo Petri, INRIA Sophia Antipolis *** The Semantics of Progress in Lock-Based Transactional Memory Rachid Guerraoui, EPFL Michal Kapalka, EPFL --- ** VERIFICATION (Session chair: Andrew Appel, Princeton University, USA) 4:00 - 5:00 *** Types and Higher-Order Recursion Schemes for Verification of Higher-Order Programs Naoki Kobayashi, Tohoku University *** Verifying Distributed Systems: the Operational Approach Tom Ridge, University of Cambridge *** Automated Verification of Practical Garbage Collectors Chris Hawblitzel, Microsoft Research Erez Petrank, Microsoft Research __
[TYPES/announce] POPL 2008 Call For Participation
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] * * ACM SIGPLAN-SIGACT Symposium * * on* * Principles of Programming Languages * * * * January 10-12, 2008 * *San Francisco USA * * * *Call for Participation * * * *http://www.cs.ucsd.edu/popl/08 * * Important dates * Early registration deadline: December 13, 2007 * Conference: January 10-12, 2008 Hotel All the conference events will take place at The Stanford Court Hotel. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: http://www.cs.ucsd.edu/popl/08/ Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. The program can be found here: http://www.cs.ucsd.edu/popl/08/program.html Student Attendees Students who have a paper accepted for the conference are offered SIGPLAN student membership free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund (http://www.acm.org/sigs/sigplan/PAC.htm). General Chair: George Necula UC Berkeley Department of Electrical Engineering and Computer Sciences Program Chair: Philip Wadler University of Edinburgh School of Informatics Program Committee: Amal Ahmed Toyota Technological Institute, Chicago Lars BirkedalITU Copenhagen Guy Blelloch Carnegie-Mellon University Gilad Bracha Cadence Design Systems Byron Cook Microsoft Research Thierry Coquand Chalmers University Vincent DanosParis VII Robby FindlerUniversity of Chicago Neal GlewIntel Haruo Hosoya University of Tokyo Matthew Hennessy University of Sussex Ranjit Jhala University of California, San Diego Tobias NipkowTechnische Universität München James Noble Victoria University of Wellington Sanjiva Prasad IIT Delhi Zhong Shao Yale University Yannis Smaragdakis University of Oregon Eijiro Sumii Tohoku University Peter Thiemann Universität Freiburg Peter Van RoyUniversité Catholique de Louvain Jan VitekPurdue University Nobuko Yoshida Imperial College London Steve Zdancewic University of Pennsylvania Affiliated Events * Partial Evaluation and Semantics-Based Program Manipulation (PEPM) * January 7-8, 2008 * Practical Applications of Declarative Languages (PADL) * January 7-8, 2008 * Verification, Model Checking and Abstract Interpretation (VMCAI) * January 7-9, 2008 * Using Proof Assistants for Programming Language Research or, How to write your next POPL paper in Coq * January 8, 2008 * Declarative Aspects of Multicore Programming (DAMP) * January 9th, 2008 * Programming Language Technologies for XML (PLAN-X) * January 9, 2008 * Thirty Years of Abstract Interpretation * January 9, 2008 * Foundations of Object-Oriented Languages (FOOL) * January 13, 2008