From Michael.Norrish at nicta.com.au Fri May 1 01:46:02 2009 From: Michael.Norrish at nicta.com.au (Michael Norrish) Date: Fri, 01 May 2009 15:46:02 +1000 Subject: [POPLmark] Call for FLoC 2010 Workshops Message-ID: <49FA8C9A.2000006@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 to be part of the combination (see attached), and importantly: Each workshop proposal must indicate one sponsoring conference among the participating conferences. I am the workshop chair for ITP, and I would like to encourage workshop applications that mention ITP as their "sponsor". Submissions will be handled via Easychair http://www.easychair.org/conferences/?conf=floc10cfw but 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/20090501/3247d222/FLoC10.CFW.txt -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: FLoC10.CFW.html Url: http://lists.seas.upenn.edu/pipermail/poplmark/attachments/20090501/3247d222/FLoC10.CFW-0001.txt From afelty at site.uottawa.ca Mon May 4 12:45:33 2009 From: afelty at site.uottawa.ca (Amy Felty) Date: Mon, 04 May 2009 12:45:33 -0400 Subject: [POPLmark] LFMTP 2009: Deadline extension Message-ID: <49FF1BAD.8040709@site.uottawa.ca> ***** NOTE: Extended Deadline ***** Final Call for Papers 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 IMPORTANT DATES Abstract submission: May 7 (* new date *) Paper Submission: May 12 (* new date *) Notification: June 15 Final papers due: July 3 Workshop: August 2 JOINT LFMTP/PSTT INVITED SPEAKER: Gilles Dowek (Ecole Polytechnique & INRIA) JOINT LFMTP/PSTT TUTORIAL SPEAKER: TBA DESCRIPTION: The LFMTP workshop continues a series of workshops on Logical Frameworks and Metalanguages (LFM) and Mechanized Reasoning about Languages with Variable Binding (MERLIN). This is the fourth joint workshop in the series. Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. LFMTP 2009 will provide researchers with a forum to review state-of-the-art techniques and to present progress in: - the automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation; - the design of proof assistants, automated theorem provers, and formal digital libraries building upon logical framework technology; - theoretical and practical issues concerning the encoding of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures; - case studies of meta-programming, and the mechanization of the (meta) theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory will be particularly welcome. TOPICS: Papers are solicited on topics including, but not limited to: - logical framework design - meta-theoretic analysis - applications and comparative studies - implementation techniques - efficient proof representation and validation - proof-generating decision procedures and theorem provers - proof-carrying code - substructural frameworks - semantic foundations - methods for reasoning about logics - formal digital libraries SUBMISSIONS: Three categories of papers are solicited: - Category A: Detailed and technical accounts of new research: up to eight pages including bibliography. - Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to six pages including bibliography and appendices. - Category C: System descriptions presenting an implemented tool and its novel features: up to four pages. A demonstration is expected to accompany the presentation. Submissions will be accepted electronically. Authors are required to submit a paper title and a short abstract one week before submitting the paper. For further information and submission instructions, see the LFMTP web page: http://workshops.inf.ed.ac.uk/lfmtp. Accepted papers will be published electronically as part of the ACM International Conference Proceedings Series. Authors of accepted papers are expected to present their paper at the workshop. PROGRAM COMMITTEE: Frederic Blanqui (INRIA) James Cheney, Co-Chair (University of Edinburgh) Adam Chlipala (Harvard University) Amy Felty, Co-Chair (University of Ottawa) Martin Hofmann (LMU Munich) Conor McBride (University of Strathclyde) Marino Miculan (University of Udine) Alberto Momigliano (University of Edinburgh) Gopalan Nadathur (University of Minnesota) Michael Norrish (NICTA) From berghofe at in.tum.de Wed May 13 09:33:21 2009 From: berghofe at in.tum.de (Stefan Berghofer) Date: Wed, 13 May 2009 15:33:21 +0200 Subject: [POPLmark] TPHOLs 2009 in Munich: Call for Participation and Accepted Papers Message-ID: <4A0ACC21.3020801@in.tum.de> NOTE: THE EARLY (DISCOUNT) REGISTRATION DEADLINE IS 5 JULY 2009 TPHOLs 2009 - 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 and ACCOMMODATION http://tphols.in.tum.de/index.html#registration The reduced registration fee is available up to and including 5 July 2009. INVITED SPEAKERS David Basin ETH Z?rich, Switzerland John Harrison Intel, USA Wolfram Schulte Microsoft Research, USA INVITED TUTORIALS Agda Ulf Norell HOL Light John Harrison Mizar Adam Naumowicz Twelf Carsten Sch?rmann RELATED EVENTS This year, the workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009), and the Coq workshop, both on Friday 21 August, are co-located with the conference. In addition, the Isabelle Developers Workshop will take place on 13 - 15 August just before the conference. Further information about the workshops can be found at http://plmms09.cse.tamu.edu/ http://coq.inria.fr/coq-workshop/ http://tphols.in.tum.de/idw.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 OUTLINE PROGRAMME Conference: Monday 17th: Technical sessions Tuesday 18th: Technical sessions. Wednesday 19th: Technical sessions, excursion and conference dinner. Thursday 20th: Technical sessions. Workshops Thursday 13th - Saturday 15th: Isabelle Developers Workshop Friday 21st: PLMMS 2009 and Coq workshops. CONTACT tphols at in tum de ACCEPTED PAPERS Andreas Lochbihler. Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL Alwen Tiu and Jeremy E. Dawson. Formalising Observer Theory for Environment-Sensitive Bisimulation Stefan Berghofer and Markus Reiter. Formalizing the Logic-Automaton Connection Stefan Berghofer, Lukas Bulwahn and Florian Haftmann. Turning inductive into equational specifications Chad Brown and Gert Smolka. Extended First-Order Logic Magnus O. Myreen and Mike Gordon. Verified LISP implementations on ARM, x86 and PowerPC Brian Huffman. A Purely Definitional Universal Domain Peter Homeier. The HOL-Omega Logic Simon Winwood, Gerwin Klein, Thomas Sewell, June Andronick, David Cock and Michael Norrish. Mind the Gap: A Verification Framework for Low-Level C Alexander Schimpf, Stephan Merz and Jan-Georg Smaus. Construction of B?chi Automata for LTL Model Checking Verified in Isabelle/HOL Ren? Thiemann and Christian Sternagel. Certification of Termination Proofs using CeTA Stephane Le Roux. Acyclic preferences and existence of sequential Nash equilibria: a formal and constructive equivalence Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen and Enrico Tassi. Hints in unification Javier de Dios and Ricardo Pena. Formal Certification of a Resource-Aware Language Implementation Dabrowski Fr?d?ric and David Pichardie. A Certified Data Race Analysis for a Java-like Language Wouter Swierstra. Proof pearl: The Hoare State Monad Fran?ois Garillot, Georges Gonthier, Assia Mahboubi, Laurence Rideau. Packaging Mathematical Structures Nick Benton, Andrew Kennedy and Carsten Varming. Some Domain Theory and Denotational Semantics in Coq Thomas Tuerk. A Formalisation of Smallfoot in HOL Rafal Kolanski and Gerwin Klein. Types, Maps and Separation Logic Jesper Bengtson and Joachim Parrow. Psi-calculi in Isabelle Ioana Pasca and Nicolas Julien. Formal verification of exact computations using Newton's method Scott Owens, Susmit Sarkar and Peter Sewell. A better x86 memory model: x86-TSO Andrew McCreight. Practical Tactics for Separation Logic Osman Hasan, Sanaz Khan Afshar and Sofiene Tahar. Formal Analysis of Optical Waveguides in HOL From sweirich at cis.upenn.edu Tue May 19 09:18:10 2009 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Tue, 19 May 2009 09:18:10 -0400 Subject: [POPLmark] Journal of Automated Reasoning: Special Issue on the POPLmark Challenge Message-ID: <7EF0833D-2FFF-49DA-A68E-FEFE780BA253@cis.upenn.edu> [Note: The deadline for this special issue has been extended to June 29, 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 *June 29, 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