From urban at mathematik.uni-muenchen.de Fri Jun 5 21:42:47 2009 From: urban at mathematik.uni-muenchen.de (urban@mathematik.uni-muenchen.de) Date: Sat, 06 Jun 2009 03:42:47 +0200 Subject: [POPLmark] WMM 2009: Last Call for Papers Message-ID: <20090606034247.gv7s4pk3oks4404o@webmail.mathematik.uni-muenchen.de> ============================================================== Last Call for Papers Submission deadline: 19 June 4rd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory Edinburgh, Scotland Co-located with ICFP'09. http://www.cis.upenn.edu/~sweirich/wmm/ Important Dates * Submission deadline: 19 June 2009 * Author Notification: 24 July 2009 * Workshop: 4 September 2009 Workshop Description Researchers in programming languages have long felt the need for tools to help formalize and check their work. With advances in language technology demanding deep understanding of ever larger and more complex languages, this need has become urgent. There are a number of automated proof assistants being developed within the theorem proving community that seem ready or nearly ready to be applied in this domain-yet, despite numerous individual efforts in this direction, the use of proof assistants in programming language research is still not commonplace: the available tools are confusingly diverse, difficult to learn, inadequately documented, and lacking in specific library facilities required for work in programming languages. The goal of this workshop is to bring together researchers who have experience using automated proof assistants for programming language metatheory, and those who are interested in using tool support for formalizing their work. One starting point for discussion will be the obstacles that hinder mechanisation (whether they be pragmatic or technical), and what users and developers can do to overcome them. Format The workshop will consist of presentations by the participants, selected from submitted abstracts. It will focus on providing a fruitful environment for interaction and presentation of ongoing work. Participants are invited to submit working notes, source files, and abstracts for distribution to the attendees, but as the workshop has no formal proceedings, contributions may still be submitted for publication elsewhere. (See the SIGPLAN republication policy for more details.) Scope The scope of the workshop includes, but is not limited to: * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory. * Formalization techniques, especially with respect to binding issues. * Analysis and comparison of solutions to the POPLmark challenge. * Examples of formalized programming language metatheory. * Proposals for new challenge problems that benchmark programming language work. Submission Guidelines Email submissions to urbanc AT in.tum.de. Submissions should be no longer than two pages in PDF and printable on A4 sized paper. Conference Organization Program Committee * Nick Benton, Microsoft Research Cambridge * Olivier Danvy, University of Aarhus * Daniel Licata, Carnegie Mellon University * Francois Pottier, INRIA Paris-Rocquencourt * Christian Urban, TU Munich (chair) Workshop Organizers * Karl Crary, Carnegie Mellon University * Michael Norrish, National ICT Australia * Stephanie Weirich, University of Pennsylvania Previous Workshops * Victoria, 2008 * Freiburg, 2007 * Portland, 2006 ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From Michael.Norrish at nicta.com.au Thu Jun 11 21:32:04 2009 From: Michael.Norrish at nicta.com.au (Michael Norrish) Date: Fri, 12 Jun 2009 11:32:04 +1000 Subject: [POPLmark] (2nd) Call for FLoC 2010 Workshops Message-ID: <4A31B014.5090001@nicta.com.au> In 2010, the ACL2 Workshop and TPHOLs conference will be combining to form the ITP ("Interactive Theorem Proving") conference. ITP 2010 will also be part of the FLoC combination of conferences and workshops, to be held in Edinburgh in July 2010. FLoC has now issued a call for workshops (as attached) and importantly: Each workshop proposal must indicate one sponsoring conference among the participating conferences. Submissions will be handled via Easychair http://www.easychair.org/conferences/?conf=floc10cfw ---------------------------------------- NOTE ALSO: * The term "workshop" should not be construed narrowly: feel free to propose tutorials, tool demonstrations, competitions, survey talks, etc. * FLoC do not want to handle workshops that do not run for non-integral numbers of days. However, ITP will try to combine half-day applications to make things fit into whole numbers. So, if you feel you only want half a day, let me know, and apply anyway. I am happy to discuss possible workshop applications in advance if there is anything that is unclear. Michael. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: FLoC10.CFW.txt Url: http://lists.seas.upenn.edu/pipermail/poplmark/attachments/20090611/97e131bd/FLoC10.CFW-0002.txt -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: FLoC10.CFW.html Url: http://lists.seas.upenn.edu/pipermail/poplmark/attachments/20090611/97e131bd/FLoC10.CFW-0003.txt From afelty at site.Uottawa.ca Sun Jun 21 12:03:11 2009 From: afelty at site.Uottawa.ca (Amy Felty) Date: Sun, 21 Jun 2009 12:03:11 -0400 Subject: [POPLmark] LFMTP 2009: Call for Participation Message-ID: <4A3E59BF.9030808@site.Uottawa.ca> Call for Participation LFMTP 2009: 4th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice McGill University, Montreal, Canada August 2, 2009 http://workshops.inf.ed.ac.uk/lfmtp Affiliated with CADE-22, Montreal, Canada, August 2-7, 2009 Joint event with the 2009 International Workshop on Proof-Search in Type Theories (PSTT), August 3, 2009 EARLY REGISTRATION DEADLINES Registration: June 30 On-campus accommodation: June 25 PROGRAM: 9:00-10:00 Session 1 Douglas Howe Higher-Order Abstract Syntax in Classical Higher-Order Logic Elsa Gunter and Andrei Popescu Theory Support for Weak Higher Order Abstract Syntax in Isabelle/HOL 10:00-10:30 Break 10:30-12:30 Session 2 Karl Crary A Syntactic Account of Singleton Types via Hereditary Substitution Robin Adams Coercive Subtyping in Lambda-Free Logical Frameworks Florian Rabe and Carsten Schuermann A Practical Module System for LF Jason Reed Higher-Order Constraint Simplification In Dependent Type Theory 12:30-14:00 Lunch 14:00-15:30 Session 3 Christian Doczkal and Jan Schwinghammer Formalizing a Strong Normalization Proof for Moggi's Computational Metalanguage Murdoch Gabbay and Dominic Mulligan Algebraic Theories over Higher-Order Terms and Nominal Terms Edwin Westbrook and Aaron Stump The Calculus of Nominal Inductive Constructions 15:30-16:00 Break 16:00-17:00 JOINT LFMTP/PSTT INVITED TALK Gilles Dowek (Ecole Polytechnique and INRIA) How Can We Prove That a Proof Method is not an Instance of Another? 17:00-17:30 Discussion The following talk will open the PSTT workshop the next morning. JOINT LFMTP/PSTT INVITED TUTORIAL Wilmer Ricciotti (University of Bologna) Proof-Search in Matita From sweirich at cis.upenn.edu Fri Jun 26 09:01:12 2009 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 26 Jun 2009 09:01:12 -0400 Subject: [POPLmark] Journal of Automated Reasoning: Special issue on the POPLmark Challenge Message-ID: <65F3F398-E756-44C7-A1F0-6F309BFCEF2B@cis.upenn.edu> [Note: Due to several requests, the deadline for this special issue has been extended one more week to July 6, 2009. Please do submit a paper. --Stephanie] --------------------------------------------------------- Journal of Automated Reasoning Special issue on the POPLmark Challenge Call for Papers How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and programming language researchers alike? One crucial step towards achieving these goals is mechanized reasoning about language metatheory. Researchers in programming languages have long felt the need for tools to help formalize and check their work. With advances in language technology demanding deep understanding of ever larger and more complex languages, this need has become urgent. In 2005, a group of programming language researchers at Penn and Cambridge issued "The POPLmark challenge": a set of challenge problems aimed at the programming language and theorem proving community to gauge progress in mechanizing programming language metatheory. The solutions to this challenge have been gathered at http://plclub.org/mmm/ The goal of the special issue is a retrospective on the POPLmark challenge, summarizing and analyzing what has been learned. Submissions are encouraged, but not limited to, the following topics: * Complete, polished descriptions of specific POPLmark solutions, including well-commented proof scripts * Analysis and comparison of solutions to the POPLmark challenge * Descriptions and code for proof assistant extensions/libraries developed explicitly for the purpose of programming language metatheory * New formalization techniques, especially with respect to binding issues * Proposals for new challenge problems that benchmark programming language work Manuscripts should be unpublished works and not submitted elsewhere. Revised and enhanced versions of papers published in conference proceedings that have not appeared in archival journals are eligible for submission. All submissions will be reviewed according to the usual standards of scholarship and originality. Submissions are due *July 6, 2009*. We will keep a tight review schedule to enable publication of the special issue by mid 2010. Papers that do not progress through the reviewing cycle in a timely manner may be published in a later issue. Papers should be in pdf format following the JAR guidelines for authors. We encourage authors to keep their submissions below 30 pages. Authors should submit their papers electronically to sweirich at cis.upenn.edu. For more information, see http://www.seas.upenn.edu/~sweirich/jar-poplmark/ Guest Editors Stephanie Weirich, University of Pennsylvania Benjamin Pierce, University of Pennsylvania From berghofe at in.tum.de Mon Jun 29 09:38:04 2009 From: berghofe at in.tum.de (Stefan Berghofer) Date: Mon, 29 Jun 2009 15:38:04 +0200 Subject: [POPLmark] TPHOLs 2009 in Munich: Second Call for Participation Message-ID: <4A48C3BC.7080609@in.tum.de> ************************************************************************************ * NOTE: THE EARLY (DISCOUNT) REGISTRATION DEADLINE IS 5 JULY 2009 (next Sunday!) * ************************************************************************************ TPHOLs 2009 - SECOND CALL FOR PARTICIPATION The 22nd International Conference on Theorem Proving in Higher Order Logics Munich, Germany Monday 17th - Thursday 20th August 2009 ******************************************** * http://tphols.in.tum.de * ******************************************** TPHOLs is the premier international conference for researchers from all areas of interactive theorem proving and its applications. REGISTRATION **** Early registration deadline: 5 JULY 2009 (23:59 CEST, next Sunday!) **** Early registration fee (up to 5 July 2009): EUR 350 (students: EUR 245) Late registration fee (from 6 July 2009): EUR 455 (students: EUR 320) Please register at http://tphols.in.tum.de/fee.html ACCOMMODATION **** Deadline for booking conference hotel at special rate of EUR 119: 5 JULY 2009 **** 25 of the allocated rooms are still available until 26 JULY 2009 Reservations received after this date will be accepted on a space and rate availability basis. For information on hotel booking, see http://tphols.in.tum.de/hotel.html SPONSORS TPHOLs 2009 is sponsored by o Microsoft Research Redmond o Galois o Verisoft XT o Validas AG o DFG doctorate programme Puma o Siemens CONTACT tphols at in tum de PRELIMINARY PROGRAMME Pre-Conference Workshop (August 13-15) Isabelle Developers Workshop http://tphols.in.tum.de/idw.html Monday, August 17 08:00-09:00 REGISTRATION 09:00-10:00 INVITED TALK 1 David Basin. Let's Get Physical: Models and Methods for Real-World Security Protocols 10:00-10:30 COFFEE 10:30-12:10 SESSION 1 Assia Mahboubi, Georges Gonthier, Laurence Rideau and Fran?ois Garillot. Packaging Mathematical Structures Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen and Enrico Tassi. Hints in unification Ioana Pasca and Nicolas Julien. Formal verification of exact computations using Newton's method Osman Hasan, Sanaz Khan Afshar and Sofiene Tahar. Formal Analysis of Optical Waveguides in HOL 12:10-13:40 LUNCH 13:40-15:20 SESSION 2 Wouter Swierstra. Proof pearl: The Hoare State Monad Keiko Nakata and Tarmo Uustalu. Trace-based coinductive operational semantics for While: Big-step and small-step, functional and relational styles Andreas Lochbihler. Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL Stephane Le Roux. Acyclic preferences and existence of sequential Nash equilibria: a formal and constructive equivalence 15:20-15:50 COFFEE 15:50-17:30 SESSION 3 Jesper Bengtson and Joachim Parrow. Psi-calculi in Isabelle Jeremy E. Dawson and Alwen Tiu. Formalising Observer Theory for Environment-Sensitive Bisimulation Brian Huffman. A Purely Definitional Universal Domain Nick Benton, Andrew Kennedy and Carsten Varming. Some Domain Theory and Denotational Semantics in Coq Tuesday, August 18 08:00-09:00 INVITED TUTORIAL 1 John Harrison. HOL Light: an overview 09:00-10:00 INVITED TALK 2 Ernie Cohen, Markus Dahlweid, Mark Hillebrand, Dirk Leinenbach, Michal Moskal, Thomas Santen, Wolfram Schulte and Stephan Tobies. VCC: A Practical System for Verifying Concurrent C 10:00-10:30 COFFEE 10:30-12:10 SESSION 4 Rene Thiemann and Christian Sternagel. Certification of Termination Proofs using CeTA Jinshuang Wang, Xingyuan Zhang and Huabing Yang. Liveness Reasoning with Isabelle/HOL/Isar Dabrowski Frederic and David Pichardie. A Certified Data Race Analysis for a Java-like Language Stefan Berghofer, Lukas Bulwahn and Florian Haftmann. Turning inductive into equational specifications 12:10-13:40 LUNCH 13:40-15:20 POSTER SESSION 15:20-16:00 COFFEE 16:00-17:00 BUSINESS MEETING Wednesday, August 19 08:00-09:00 INVITED TUTORIAL 2 Adam Naumowicz. A Brief Overview of Mizar 09:00-10:00 INVITED TALK 3 John Harrison. Without Loss of Generality 10:00-10:30 COFFEE 10:30-11:45 SESSION 5 Rafal Kolanski and Gerwin Klein. Types, Maps and Separation Logic Andrew McCreight. Practical Tactics for Separation Logic Thomas Tuerk. A Formalisation of Smallfoot in HOL 11:45-13:00 LUNCH 13:00-23:00 EXCURSION Thursday, August 20 08:00-09:00 INVITED TUTORIAL 3 Ana Bove, Ulf Norell and Peter Dybjer. A Brief Overview of Agda - A Functional Language with Dependent Types 09:00-10:00 INVITED TUTORIAL 4 Carsten Sch?rmann. The Twelf Proof Assistant 10:00-10:30 COFFEE 10:30-12:10 SESSION 6 Scott Owens, Susmit Sarkar and Peter Sewell. A better x86 memory model: x86-TSO Magnus O. Myreen and Mike Gordon. Verified LISP implementations on ARM, x86 and PowerPC Javier de Dios and Ricardo Pena. Formal Certification of a Resource-Aware Language Implementation Simon Winwood, Gerwin Klein, Thomas Sewell, June Andronick, David Cock and Michael Norrish. Mind the Gap: A Verification Framework for Low-Level C 12:10-13:40 LUNCH 13:40-15:20 SESSION 7 Peter Homeier. The HOL-Omega Logic Chad Brown and Gert Smolka. Extended First-Order Logic Alexander Schimpf, Stephan Merz and Jan-Georg Smaus. Construction of B?chi Automata for LTL Model Checking Verified in Isabelle/HOL Stefan Berghofer and Markus Reiter. Formalizing the Logic-Automaton Connection 15:20-15:50 COFFEE Post-Conference Workshops (Friday, August 21) PLMMS http://plmms09.cse.tamu.edu/ Coq Workshop http://coq.inria.fr/coq-workshop/