From gdr at integrable-solutions.net Fri Apr 3 14:28:00 2009 From: gdr at integrable-solutions.net (Gabriel Dos Reis) Date: Fri, 3 Apr 2009 13:28:00 -0500 Subject: [POPLmark] PLMMS 2009: Call for Papers Message-ID: <206fcf960904031128u48b29555g17c1958929a2f8cd@mail.gmail.com> The ACM SIGSAM 2009 International Workshop on Programming Languages for Mechanized Mathematics Systems PLMMS 2009 Munich, Germany; August 21, 2009 http://plmms09.cse.tamu.edu/ CALL FOR PAPERS The ACM SIGSAM 2009 International Workshop on Programming Languages for Mechanized Mathematics Systems will be co-located with TPHOLs 2009. General Information The scope of this workshop is at the intersection of programming languages (PL) and mechanized mathematics systems (MMS). The latter category subsumes present-day computer algebra systems (CAS), interactive proof assistants (PA), and automated theorem provers (ATP), all heading towards fully integrated mechanized mathematical assistants. Areas of interest include all aspects of PL and MMS that meet in the following topics, but not limited to: * Dedicated input languages for MMS: covers all aspects of languages intended for the user to deploy or extend the system, both algorithmic and declarative ones. Typical examples are tactic definition languages such as Ltac in Coq, mathematical proof languages as in Mizar or Isar, or specialized programming languages built into CA systems. * Mathematical modeling languages used for programming: covers the relation of logical descriptions vs. algorithmic content. For instance the logic of ACL2 extends a version of Lisp, that of Coq is close to Haskell, and some portions of HOL are similar to ML and Haskell, while Maple tries to do both simultaneously. Such mathematical languages offer rich specification capabilities, which are rarely available in regular programming languages. How can programming benefit from mathematical concepts, without limiting mathematics to the computational world view? * Programming languages with mathematical specifications: covers advanced mathematical concepts in programming languages that improve the expressive power of functional specifications, type systems, module systems etc. Programming languages with dependent types are of particular interest here, as is intentionality vs extensionality. * Language elements for program verification: covers specific means built into a language to facilitate correctness proofs using MMS. For example, logical annotations within programs may be turned into verification conditions to be solved in a proof assistant eventually. How need MMS and PL to be improved to make this work conveniently and in a mathematically appealing way? These issues have a very colorful history. Many PL innovations first appeared in either CA or proof systems first, before migrating into more mainstream programming languages. This workshop is an opportunity to present the latest innovations in MMS design that may be relevant to future programming languages, or conversely novel PL principles that improve upon implementation and deployment of MMS. Why are all the languages of mainstream CA systems untyped? Why are the (strongly typed) proof assistants so much harder to use than a typical CAS? What forms of polymorphism exist in mathematics? What forms of dependent types may be used in mathematical modeling? How can MMS regain the upper hand on issues of "genericity" and "modularity"? What are the biggest barriers to using a more mainstream language as a host language for a CAS or PA/ATP? PLMMS 2007 was held as a satellite event of, and PLMMS 2008 was a CICM 2008 workshop. Submission Details * Submission deadline: May 11, 2009 (Apia, Samoa time) * Author Notification: June 22, 2009 * Final Papers Due: July 10, 2009 * Workshop: August 21, 2009 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The length is restricted to 10 pages, and the font size 9pt. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Papers are exclusively submitted via EasyChair http://www.easychair.org/conferences?conf=plmms09 We expect that at least one author of each accepted paper attends PLMMS 2009 and presents her or his paper. Accepted papers will appear in the ACM Digital Library. Links * http://plmms09.cse.tamu.edu/, the PLMMS 2009 workshop web site * http://tphols.in.tum.de/, the THOPLs 2009 conference web site Program Committee * Clemens Ballarin, aicas GmbH * Gabriel Dos Reis, Texas A&M University (Co-Chair) * Jean-Christophe Filliatre, CNRS Universite Paris Sud * Predrag Janinic, University of Belgrade * Jaakko Jarvi, Texas A&M University * Florina Piroi, Johannes Kepler University * Laurent Th351ry, INRIA Sophia Antipolis (Co-Chair) * Makarius Wenzel, Technische Universitaet Muenchen From shankar at csl.sri.com Mon Apr 6 22:08:43 2009 From: shankar at csl.sri.com (Natarajan Shankar) Date: Mon, 06 Apr 2009 19:08:43 -0700 Subject: [POPLmark] Automated Formal Methods '09: Second Call For Papers Message-ID: <6176.1239070123@positron.csl.sri.com> CALL FOR PAPERS Automated Formal Methods (AFM09) June 27, 2009, Grenoble, France http://fm.csl.sri.com/AFM09/ In association with Computer-Aided Verification 2009 http://www-cav2009.imag.fr/ AFM is a one-day workshop centered around the use and integration of formal verification tools for specification, interactive theorem proving, satisfiability (SAT) and satisfiability modulo theories (SMT), model checking, program verification, code generation, and testing, as well as interfaces, documentation, and education. This workshop was first initiated as a users' group meeting for the SRI formal verification tools such as PVS, SAL, and Yices, but the topics are not restricted to these tools. The first workshop was held at FLoC'06, the second workshop with ASE'07, and the third workshop took place in conjunction with CAV'08. We welcome position papers on the topics listed above, particularly those that report on experiments and case studies. Papers must be fewer than 8 pages long in the ACM SIG Proceedings style (http://www.acm.org/sigs/publications/proceedings-templates) and should be submitted to http://www.easychair.org/conferences/?conf=afm09 The post-conference proceedings will be published in the ACM Digital Library. PROGRAM CHAIRS: Hassen Saidi, Natarajan Shankar PROGRAM COMMITTEE: Myla Archer, Saddek Bensalem, Supratik Chakraborthy, Rance de Long, Leonardo de Moura, Jean-Christophe Filliatre, Bernd Finkbeiner, Michael Gordon, John Harrison, Peter Manolios, David Monniaux, David Naumann, Corina Pasareanu, Lee Pike, Kazuhiro Ogata, Sanjit Seshia, Ofer Strichman. KEY DATES: Position papers due: April 30, 2009 Reviews/decisions: May 20, 2009 Camera ready versions due: June 10, 2009 AFM '09 Workshop: June 27, 2009 From afelty at site.uottawa.ca Mon Apr 20 14:27:58 2009 From: afelty at site.uottawa.ca (Amy Felty) Date: Mon, 20 Apr 2009 14:27:58 -0400 Subject: [POPLmark] LFMTP 2009: 2nd Call for Papers Message-ID: <49ECBEAE.40509@site.uottawa.ca> Second 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 1 Paper Submission: May 8 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 shankar at csl.sri.com Mon Apr 20 15:25:35 2009 From: shankar at csl.sri.com (Natarajan Shankar) Date: Mon, 20 Apr 2009 12:25:35 -0700 Subject: [POPLmark] AFM '09 Call for Papers Message-ID: <31080.1240255535@positron.csl.sri.com> CALL FOR PAPERS Automated Formal Methods (AFM09) June 27, 2009, Grenoble, France http://fm.csl.sri.com/AFM09/ In association with Computer-Aided Verification 2009 http://www-cav2009.imag.fr/ AFM is a one-day workshop centered around the use and integration of formal verification tools for specification, interactive theorem proving, satisfiability (SAT) and satisfiability modulo theories (SMT), model checking, program verification, code generation, and testing, as well as interfaces, documentation, and education. This workshop was first initiated as a users' group meeting for the SRI formal verification tools such as PVS, SAL, and Yices, but the topics are not restricted to these tools. The first workshop was held at FLoC'06, the second workshop with ASE'07, and the third workshop took place in conjunction with CAV'08. We welcome position papers on the topics listed above, particularly those that report on experiments and case studies. Papers must be fewer than 8 pages long in the ACM SIG Proceedings style (http://www.acm.org/sigs/publications/proceedings-templates) and should be submitted to http://www.easychair.org/conferences/?conf=afm09 The post-conference proceedings will be published in the ACM Digital Library. PROGRAM CHAIRS: Hassen Saidi, Natarajan Shankar PROGRAM COMMITTEE: Myla Archer, Saddek Bensalem, Aaron Bradley, Supratik Chakraborthy, Rance de Long, Leonardo de Moura, Jean-Christophe Filliatre, Bernd Finkbeiner, Michael Gordon, John Harrison, Peter Manolios, David Monniaux, David Naumann, Corina Pasareanu, Lee Pike, Kazuhiro Ogata, Sanjit Seshia, Ofer Strichman. KEY DATES: Position papers due: April 30, 2009 Reviews/decisions: May 20, 2009 Camera ready versions due: June 10, 2009 AFM '09 Workshop: June 27, 2009 From gdr at integrable-solutions.net Tue Apr 28 06:01:23 2009 From: gdr at integrable-solutions.net (Gabriel Dos Reis) Date: Tue, 28 Apr 2009 05:01:23 -0500 Subject: [POPLmark] PLMMS 2009: Last Call for Papers Message-ID: <206fcf960904280301s242a1a4fp13260959de7f0992@mail.gmail.com> The ACM SIGSAM 2009 International Workshop on Programming Languages for Mechanized Mathematics Systems PLMMS 2009 Munich, Germany; August 21, 2009 http://plmms09.cse.tamu.edu/ CALL FOR PAPERS The ACM SIGSAM 2009 International Workshop on Programming Languages for Mechanized Mathematics Systems will be co-located with TPHOLs 2009. Important Dates * Abstract submission : May 11, 2009 (Apia, Samoa time) * Submission deadline: May 18, 2009 (Apia, Samoa time) * Author notification: June 22, 2009 * Camera ready papers: July 10, 2009 * Workshop: August 21, 2009 General Information The scope of this workshop is at the intersection of programming languages (PL) and mechanized mathematics systems (MMS). The latter category subsumes present-day computer algebra systems (CAS), interactive proof assistants (PA), and automated theorem provers (ATP), all heading towards fully integrated mechanized mathematical assistants. Areas of interest include all aspects of PL and MMS that meet in the following topics, but not limited to: * Dedicated input languages for MMS: covers all aspects of languages intended for the user to deploy or extend the system, both algorithmic and declarative ones. Typical examples are tactic definition languages such as Ltac in Coq, mathematical proof languages as in Mizar or Isar, or specialized programming languages built into CA systems. * Mathematical modeling languages used for programming: covers the relation of logical descriptions vs. algorithmic content. For instance the logic of ACL2 extends a version of Lisp, that of Coq is close to Haskell, and some portions of HOL are similar to ML and Haskell, while Maple tries to do both simultaneously. Such mathematical languages offer rich specification capabilities, which are rarely available in regular programming languages. How can programming benefit from mathematical concepts, without limiting mathematics to the computational world view? * Programming languages with mathematical specifications: covers advanced mathematical concepts in programming languages that improve the expressive power of functional specifications, type systems, module systems etc. Programming languages with dependent types are of particular interest here, as is intentionality vs extensionality. * Language elements for program verification: covers specific means built into a language to facilitate correctness proofs using MMS. For example, logical annotations within programs may be turned into verification conditions to be solved in a proof assistant eventually. How need MMS and PL to be improved to make this work conveniently and in a mathematically appealing way? These issues have a very colorful history. Many PL innovations first appeared in either CA or proof systems first, before migrating into more mainstream programming languages. This workshop is an opportunity to present the latest innovations in MMS design that may be relevant to future programming languages, or conversely novel PL principles that improve upon implementation and deployment of MMS. Why are all the languages of mainstream CA systems untyped? Why are the (strongly typed) proof assistants so much harder to use than a typical CAS? What forms of polymorphism exist in mathematics? What forms of dependent types may be used in mathematical modeling? How can MMS regain the upper hand on issues of "genericity" and "modularity"? What are the biggest barriers to using a more mainstream language as a host language for a CAS or PA/ATP? PLMMS 2007 was held as a satellite event of, and PLMMS 2008 was a CICM 2008 workshop. Submission Details Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The length is restricted to 10 pages, and the font size 9pt. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Papers are exclusively submitted via EasyChair http://www.easychair.org/conferences?conf=plmms09 We expect that at least one author of each accepted paper attends PLMMS 2009 and presents her or his paper. Accepted papers will appear in the ACM Digital Library. Links * http://plmms09.cse.tamu.edu/, the PLMMS 2009 workshop web site * http://tphols.in.tum.de/, the THOPLs 2009 conference web site Program Committee * Clemens Ballarin, aicas GmbH * Gabriel Dos Reis, Texas A&M University (Co-Chair) * Jean-Christophe Filliatre, CNRS Universite Paris Sud * Predrag Janicic, University of Belgrade * Jaakko Jarvi, Texas A&M University * Florina Piroi, Johannes Kepler University * Laurent Thery, INRIA Sophia Antipolis (Co-Chair) * Makarius Wenzel, Technische Universitaet Muenchen From shankar at csl.sri.com Tue Apr 28 20:11:43 2009 From: shankar at csl.sri.com (Natarajan Shankar) Date: Tue, 28 Apr 2009 17:11:43 -0700 Subject: [POPLmark] AFM'09 deadline extension to May 8, 2009 Message-ID: <27288.1240963903@positron.csl.sri.com> ***See the revised dates below*** CALL FOR PAPERS Automated Formal Methods (AFM09) June 27, 2009, Grenoble, France http://fm.csl.sri.com/AFM09/ In association with Computer-Aided Verification 2009 http://www-cav2009.imag.fr/ AFM is a one-day workshop centered around the use and integration of formal verification tools for specification, interactive theorem proving, satisfiability (SAT) and satisfiability modulo theories (SMT), model checking, program verification, code generation, and testing, as well as interfaces, documentation, and education. This workshop was first initiated as a users' group meeting for the SRI formal verification tools such as PVS, SAL, and Yices, but the topics are not restricted to these tools. The first workshop was held at FLoC'06, the second workshop with ASE'07, and the third workshop took place in conjunction with CAV'08. We welcome position papers on the topics listed above, particularly those that report on experiments and case studies. Papers must be fewer than 8 pages long in the ACM SIG Proceedings style (http://www.acm.org/sigs/publications/proceedings-templates) and should be submitted to http://www.easychair.org/conferences/?conf=afm09 The post-conference proceedings will be published in the ACM Digital Library. PROGRAM CHAIRS: Hassen Saidi, Natarajan Shankar PROGRAM COMMITTEE: Myla Archer, Saddek Bensalem, Aaron Bradley, Supratik Chakraborthy, Rance de Long, Leonardo de Moura, Jean-Christophe Filliatre, Bernd Finkbeiner, Michael Gordon, John Harrison, Peter Manolios, David Monniaux, David Naumann, Corina Pasareanu, Lee Pike, Kazuhiro Ogata, Sanjit Seshia, Ofer Strichman. KEY DATES: Position papers due: May 8, 2009 Reviews/decisions: May 22, 2009 Camera ready versions due: June 10, 2009 AFM '09 Workshop: June 27, 2009