From kai at iam.unibe.ch Mon Jan 4 08:35:30 2010 From: kai at iam.unibe.ch (=?ISO-8859-1?Q?Kai_Br=FCnnler?=) Date: Mon, 4 Jan 2010 14:35:30 +0100 Subject: [TYPES/announce] PCC 2010 -- Call for Papers Message-ID: <3e96a78f1001040535te1491c3u3ad6e7edd3be2935@mail.gmail.com> =============================== CALL FOR PAPERS 9th Proof, Computation and Complexity PCC 2010 June 18-19, 2010 Bern, Switzerland http://pcc2010.unibe.ch/ =============================== Aim and scope -------------------- The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity. Organisers ---------------- * Kai Br?nnler, Bern (co-chair) * Alessio Guglielmi, Loria * Reinhard Kahle, Coimbra * Thomas Studer, Bern (co-chair) Invited Speakers (provisional list) ---------------------------------------------- * Agata Ciabattoni (Wien) Contributions ------------------ PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (Pdf, 1-2 pages) to pcc2010.workshop at gmail.com. The collection of abstracts will be available at the meeting. Important Dates ---------------------- Submission deadline : May 1, 2010 Notification to authors : May 15, 2010 Workshop: June 18-19, 2010 =============================== From mwh at cs.umd.edu Mon Jan 4 10:26:15 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Mon, 4 Jan 2010 10:26:15 -0500 Subject: [TYPES/announce] PLDI 2010: Call for Tutorials Message-ID: <84A6EB42-A8BE-4BDD-8719-C7327A166512@cs.umd.edu> Many of the tools announced on this list would make interesting tutorial topics at PLDI; please consider submitting your idea! -Mike ACM SIGPLAN 2010 Conference on Programming Language Design and Implementation (PLDI'10) Toronto, Canada June 5 - 10, 2010 http://cs.stanford.edu/pldi10/ Second Call for Tutorials http://www.cs.umd.edu/~mwh/pldi10tutorials/cfp.html Submission deadline: Friday, January 22, 2010 (just under three weeks away) PLDI is a forum where researchers, developers, educators, and practitioners exchange information on the latest practical and experimental work in the design and implementation of programming languages. The tutorial program enhances the technical program by providing a day of half-day tutorials offered in parallel tracks. Tutorials for PLDI 2010 are solicited on any topic relevant to the PLDI audience. In particular, tutorials that strive to do one of the following have been particularly successful in the past: * Describe an important piece of research infrastructure * Educate the community on an emerging topic For examples of past tutorials, see (among others) the websites of PLDI 2009, 2008, and 2007 (at http://www.cs.virginia.edu/kim/publicity/pldi09tutorials, http://www.research.ibm.com/people/h/hind/pldi08-tutorial-program.htm and http://ties.ucsd.edu/PLDI/tutorials.shtml, respectively). Submission Procedures Submissions should be in text or pdf form, sent via email to Michael Hicks (mwh at cs.umd.edu, with subject line PLDI tutorial proposal) with the following information: * Tutorial title * Presenter(s), affiliation(s), and contact information * 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation philosophy (if any), target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees * 1-2 paragraph abstract suitable for tutorial publicity * 1 paragraph biography suitable for tutorial publicity Important Dates Submission deadline: Friday, January 22, 2010 Notification: Friday, February 19, 2010 From selinger at mathstat.dal.ca Mon Jan 4 19:08:19 2010 From: selinger at mathstat.dal.ca (Peter Selinger) Date: Mon, 4 Jan 2010 20:08:19 -0400 (AST) Subject: [TYPES/announce] MFPS 26 - call for papers Message-ID: <20100105000819.5B2445C285@chase.mathstat.dal.ca> Second CALL FOR PAPERS MFPS XXVI http://www.math.tulane.edu/~mfps/mfps26 Twenty-sixth Conference on the Mathematical Foundations of Programming Semantics University of Ottawa Ottawa, Ontario, Canada May 6 - 10, 2010 Partially Supported by US Office of Naval Research The Twenty-sixth Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of the University of Ottawa, Ontario, Canada UK from May 6 - 10, 2010. MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighboring areas. TOPICS include, but are not limited to: biocomputation, concurrent and distributed computation, constructive mathematics, domain theory and categorical models, formal languages, formal methods, game semantics, lambda calculus, logic, probabilistic systems, process calculi, programming language theory, quantum computation, security, topological models, type systems, type theory. INVITED SPEAKERS: Amal Ahmed, Indiana Martin Escardo, Birmingham Cedric Fournet, Microsoft, Paris Pieter Hofstra, Ottawa Jean Krivine, PPS, Paris 7 Keye Martin, NRL SPECIAL SESSIONS: * Domain Theory (organized by Martin Escardo) * Logic and Category Theory (organized by Rick Blute and Phil Scott) * Security (organized by Catherine Meadows) * Systems Biology (organized by Jean Krivine) TUTORIAL LECTURES: There will be daily tutorial lectures on Model Checking and Verification, given by Stephen Brookes (Carnegie Mellon), Amy Felty (Ottawa), Joel Ouaknine (Oxford), and Prakash Panangaden (McGill, organizer), and James Worrell (Oxford). PROGRAM COMMITTEE: Ulrich Berger, Swansea Stephen Brookes, Carnegie Mellon Venanzio Capretta, Nottingham Vincent Danos, Edinburgh Thomas Hildebrandt, ITU Copenhagen Achim Jung, Birmingham Guy McCusker, Bath Catherine Meadows, NRL Paul-Andre Mellies, Paris 7 Michael Mislove, Tulane Peter O'Hearn, Queen Mary Prakash Panangaden, McGill Catuscia Palamidessi, INRIA Brigitte Pientka, McGill Benjamin Pierce, U. Pennsylvania Davide Sangiorgi, INRIA and Bologna Vladimiro Sassone, Southampton Andrea Schalk, Manchester Philip Scott, Ottawa Peter Selinger, Chair, Dalhousie Benoit Valiron, LIG Grenoble IMPORTANT DATES: - February 5, 2010 Title and Short Abstract submission deadline - February 12, 2010 Paper submission deadline - March 15, 2010 Notification to authors - April 2, 2010 Preliminary proceedings version due SUBMISSIONS should be prepared using ENTCS Macros, available from http://www.entcs.org. Submissions should be in the form of a PDF file not exceeding 15 pages in length. Submissions are now open on the following EasyChair website: https://www.easychair.org/login.cgi?conf=mfps2010 PROCEEDINGS: There will be a preliminary proceedings of the conference papers that will be distributed at the meeting, with a final proceedings published in ENTCS after the meeting. ORGANIZERS: MFPS is organized by Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane) and Prakash Panangaden (McGill). The local organizers for MFPS 26 are Rick Blute and Phil Scott (Ottawa). For more information, please see the conference web site: http://www.math.tulane.edu/~mfps/mfps26, or contact mfps at math.tulane.edu. * * * From sacerdot at cs.unibo.it Tue Jan 5 06:15:07 2010 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Tue, 05 Jan 2010 12:15:07 +0100 Subject: [TYPES/announce] Post-Doc position in the CerCo FET-Open EU Project Message-ID: <1262690107.5919.57.camel@zenone> Job description: We are currently looking for a Post-Doc position at the Department of Computer Science, University of Bologna, to work on the CerCo FET-Open EU Project (see description below). The gross salary is 36000 euros per year. The University of Bologna is the oldest western university and the Department of Computer Science (http://www.cs.unibo.it/en/), located in the historic city center, has strong expertise in theoretical computer science and logic and it participates to several national and international projects. The Post-Doc will join the HELM team, leaded by Prof. Asperti, whose members work in the domains of Type Theory and Mathematical Knowledge Management. The CerCo project is headed by Dr. Sacerdoti Coen. The candidate will benefit from exchange opportunity with the other project participants (University Paris-Diderot, Paris, and University of Edinburgh, Edinburgh). The candidate will not have any teaching duties. Requirements: Candidates should have a Ph.D. in Computer Science and previous experience in either Type Theory (in particular Interactive Theorem Proving) or Compiler Development, and being proficient in functional programming languages. Starting date: The starting date will be decided together with the candidate and could not be before March. The contract is for two years. The candidate should contact sacerdot at cs.unibo.it for further information. Project description: The CerCo FET-Open EU Project is aimed at producing the first _formally_ _verified_ _complexity_preserving_ compiler for a subset of C to the object code for a microprocessor used in embedded systems. The output of the compilation process will be the object code and a copy of the source code annotated with _exact_ computational complexities for each program slice in O(1). The exact computational complexities (expressed in clock cycles and parametric in the program input) can then be used to formally reason on the overall code complexity. The source code of the compiler will be formally verified using the Matita Interactive Theorem Prover (http://matita.cs.unibo.it), based on a variant of the Calculus of (Co)Inductive Constructions. -- ---------------------------------------------------------------- Real name: Claudio Sacerdoti Coen Doctor in Computer Science, University of Bologna E-mail: sacerdot at cs.unibo.it http://www.cs.unibo.it/~sacerdot ---------------------------------------------------------------- From lp15 at cam.ac.uk Wed Jan 6 03:18:14 2010 From: lp15 at cam.ac.uk (Lawrence Paulson) Date: Wed, 6 Jan 2010 08:18:14 +0000 Subject: [TYPES/announce] Call for Bids (ITP 2011) Message-ID: We received no bids for hosting ITP 2011. Therefore, we will also entertain bids to host ITP 2011 in Europe, in spite of our previous restriction against that. If you might be interested in hosting (whether in Europe or not), please send a reply only to itp10 at easychair.org, no later than Wednesday of next week, January 13, just to let us know that you are considering it. Matt Kaufmann and Larry Paulson -------- Start of forwarded message ------- From: Lawrence Paulson Subject: Call for Bids (ITP 2011) Date: Wed, 11 Nov 2009 15:28:08 +0000 It is time to begin the process of selecting a host for ITP 2011, the International Conference on Interactive Theorem Proving. Following tradition from TPHOLs, the hosts of the previous conference (ITP 2010) are running the process. There are two phases: solicitation of bids and voting. This message concerns the first phase. A long-standing TPHOLs convention is that the conference should be held in a continent different from the location of the previous meeting, and therefore no bids to host ITP 2011 in Europe will be accepted. Based on ITP and TPHOLs history, ITP 2011 will likely be held in July, August or September. (The ACL2 Workshop has taken place at various times of year.) Bids should be sent to itp10 at easychair.org and should include at least the following information: - name and email address of a contact person - names of other people involved - address of website for the bid - approximate dates of the conference - structure (e.g., k workshop days and n days of presentations followed by excursion...) - advantages of the proposed venue An example of a previous winning bid is here:http://web2.comlab.ox.ac.uk/oucl/conferences/TPHOLs2005/bid.html Deadline for all bids is Monday, 4 January 2010. Shortly after that, the bids will be made public and the voting phase will take place. The people eligible to vote are those who are seriously thinking of attending ITP 2011. The voting system used will be Single Transferable Vote between all received bids. (Note: ACL2 papers will be welcome at ITP 2011, regardless of whether or not there is a separate ACL2 workshop in 2011.) Matt Kaufmann and Larry Paulson -------- End of forwarded message ------- From herman at cs.ru.nl Wed Jan 6 10:11:55 2010 From: herman at cs.ru.nl (Herman Geuvers) Date: Wed, 06 Jan 2010 16:11:55 +0100 Subject: [TYPES/announce] PhD student in the FormMath project In-Reply-To: <1262690107.5919.57.camel@zenone> References: <1262690107.5919.57.camel@zenone> Message-ID: <4B44A83B.9000506@cs.ru.nl> Job description The aim of the FORMATH project(http://www.formath.cs.ru.nl) is to develop libraries of formalized mathematics concerning algebra, linear algebra, real number computation, and algebraic topology: These libraries will be structured as software components, relying on Ssreflect, which has proved its worth in the formal proof of the four colour theorem, and to address topics that were mostly left untouched by previous research in formal proofs or formal methods. This work concerns formally proved algorithms for solving problems in real arithmetics, solving problems in ordinary differential equations, or solving problems in algebraic topology. Our methodology is a combination of theoretical research and technological development. The main tools will be provided by the Mathematical Components project, for instance the Ssreflect library for Coq proof assistants. The four partners in the EU ForMath project are: - Goteborg; - INRIA; - Nijmegen; - La Roja. More specifically, as a PhD student at the Nijmegen location you will work on Work package 4; - Real number computation and basic numerical analysis; - The use of exact real number computation to prove inequalities. The objective is specification and implementation of a simple ODE solver. Potential fields of applications include robotics and hybrid systems. Requirements You should meet the following requirements: - A master's degree (or equivalent) in Computer Science, Mathematics or a related field, with a strong interest in proof assistants, type theory, functional programming, constructive analysis and numerical analysis; - Commitment and a cooperative attitude; - Excellent proficiency in written and spoken English. Organization The Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green campus, modern buildings, and state-of-the-art equipment, it has nine faculties and enrols over 17.500 students in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal (a branch of the Rhine). The city has a rich history and one of the liveliest city centres in the Netherlands. The section Intelligent Systems of the Institute for Computing and Information Sciences (ICIS) at the Radboud University Nijmegen studies mathematical theories concerned with computability, provability and complexity. Notably, the group studies type theory, lambda calculus and logic and also applies these theories in the area of theorem proving and formalizing mathematics. The group has an excellent international reputation which was supported by the last national research assessment. Website: http://www.cs.ru.nl Conditions of employment Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ? 2,612 gross/month Starting at ? 2,042 per month, the salary will increase to ? 2,612 per month in the fourth year. PhD scale. Additional conditions of employment You will be appointed as a PhD student for a period of four years. Your performance will be evaluated after 18 months. If the evaluation is positive, the contract will be extended by 2.5 years. Additional Information Bas Spitters Telephone: +31 24 3652611 E-mail: spitters at cs.ru.nl Telephone: +31 24 3652104 Application You can apply for the job (mention the vacancy number 62.52.09) before 1 February 2010 by sending your application -preferably by email- to: RU Nijmegen, FNWI, P&O, mrs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl http://www.ru.nl/vacaturedetails?recid=497982 From adamc at hcoop.net Wed Jan 6 10:20:01 2010 From: adamc at hcoop.net (Adam Chlipala) Date: Wed, 06 Jan 2010 10:20:01 -0500 Subject: [TYPES/announce] New draft textbook on practical Coq Message-ID: <4B44AA21.5070502@hcoop.net> I would like to announce the first complete beta version of a draft textbook that I'm working on, available online under a Creative Commons license: http://adam.chlipala.net/cpdt/ This text deals with practical engineering with the Coq proof assistant (http://coq.inria.fr/), a tool for building machine-checked mathematical proofs. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation. I'm following an unusual philosophy in this book, so it may be of interest even to long-time Coq users. At the same time, I hope that it provides an easier introduction for newcomers, since short and automated proofs are the starting point, rather than an advanced topic. If you've been waiting for a little push to learn how to machine-check your proofs about languages and logics, this book may provide part of that push. :) The final part of the book applies the earlier parts' tools to examples in programming languages and compilers. I'm very interested in hearing from people who might like to beta test this book in courses that they're teaching. There are a few exercises already in the book, with more probably to come, and I have a non-public set of sample solutions to those that are already included. From scaladays2010 at cunei.com Wed Jan 6 10:33:12 2010 From: scaladays2010 at cunei.com (Antonio Cunei) Date: Wed, 06 Jan 2010 16:33:12 +0100 Subject: [TYPES/announce] Call for Papers Reminder: The First Scala Workshop - Scala Days 2010 Message-ID: <4B44AD38.8090502@cunei.com> The First Scala Workshop ======================== Call for Papers --------------- Scala is a general purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. This workshop is a forum for researchers and practitioners to share new ideas and results of interest to the Scala community. The first workshop will be held at EPFL in Lausanne, Switzerland, on Thursday 15 April 2010, co-located with Scala Days 2010 (15-16 April). We seek papers on topics related to Scala, including (but not limited to): 1. Language design and implementation -- language extensions, optimization, and performance evaluation. 2. Library design and implementation patterns for extending Scala -- embedded domain-specific languages, combining language features, generic and meta-programming. 3.Formal techniques for Scala-like programs -- formalizations of the language, type system, and semantics, formalizing proposed language extensions and variants, dependent object types, type and effect systems. 4. Concurrent and distributed programming -- libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. 5. Safety and reliability -- pluggable type systems, contracts, static analysis and verification, runtime monitoring. 6. Tools -- development environments, debuggers, refactoring tools, testing frameworks. 7. Case studies, experience reports, and pearls Important Dates --------------- Submission: Friday, Jan 15, 2010 (24:00 in Apia, Samoa) Notification: Monday, Feb 15, 2010 Final revision: Monday, Mar 15, 2010 Workshop: Thursday, Apr 15, 2010 Submission Guidelines --------------------- Submitted papers should describe new ideas, experimental results, or projects related to Scala. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. Submissions must be in English and at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (10pt). No formal proceedings will be published, but there will be a webpage linking to all accepted papers. The workshop also welcomes short papers. The papers can be submitted at the Scala Workshop EasyChair website, http://www.easychair.org/conferences/?conf=days2010 Details about the Scala Days 2010 event will be available shortly after the submission deadline at http://www.scala-lang.org/days2010 Program Committee ----------------- Ian Clarke, Uprizer Labs William Cook, UT Austin Adriaan Moors, KU Leuven Martin Odersky, EPFL (chair) Kunle Olukotun, Stanford University David Pollak, Liftweb Lex Spoon, Google From swarat at cse.psu.edu Wed Jan 6 11:02:37 2010 From: swarat at cse.psu.edu (swarat@cse.psu.edu) Date: Wed, 6 Jan 2010 11:02:37 -0500 (EST) Subject: [TYPES/announce] Request for comments: Two-phase reviewing for POPL Message-ID: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> Request for comments: Two-phase reviewing for POPL ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Though program chairs and committee members work hard to get things right, no decision process is perfect. Given the role that major conferences such as POPL play in promotion and tenure, the system is coming under increasing pressure and discussion. (For instance, see 'Conferences vs journals in computing research', Moshe Vardi, CACM, May 2009.) The POPL Steering Committee has formulated the following proposal, which we are circulating for discussion and feedback from the community. The proposal aims to improve the decision process for POPL while still working in a fixed time frame and with bounded resources. We propose to use a two-phase reviewing process, broken up approximately as follows: (a) 8 weeks: Reviewers submit first-phase reviews (b) 2 weeks: On-line discussion (c) 2 days: Physical PC meeting *** Decide for each paper: accept, resubmit, or reject *** (d) 2 weeks: Author revise papers (for each accept or resubmit) *** Authors resubmit paper with cover letter describing changes *** (e) 4 weeks: Reviewers submit second-phase reviews (f) 1 week: On-line discussion *** Decide for each paper: accept or reject *** The times may require tuning. It is proposed to omit author response, as two-phase reviewing serves a similar purpose. Resubmitted papers should include a cover letter describing what has changed and responding to concerns raised in the reviews. We also propose that the program committee should have two co-chairs. Two co-chairs provides additional effort to ensure that papers receive expert reviews and to manage the extended review process. As the team for POPL 2011 is already in place, we expect to first try two-phase reviewing for POPL 2012. We envision that the new, earlier submission date for POPL should come, if possible, about two weeks after the ICFP notification date. We plan to survey author satisfaction, starting with POPL 2010, to provide some feedback on the process. Advantages of this proposal include: * Revision is likely to improve the quality of the papers, and in particular may improve readability of the final result. * Revision provides a sounder footing than author response for dealing with papers about which there is doubt. * Some argue that POPL receives more high-quality papers than it can accept. Improving the review process may provide a better basis for deciding whether to increase the number of accepted papers. * Other conferences are moving to a year-round refereeing process closer to that used by journals; for instance VLDB is now linked to a journal PVLDB. The two-phase proposal yields similar benefits, while ensuring focus and a bound on effort. We seek your comments! Please speak or write to any member of the POPL Steering Committee. There will be a community meeting at POPL, 5:15-6:30pm Wednesday 20 January 2010, to discuss this plan. * Philip Wadler, current SIGPLAN Chair and 2008 Program Chair * Kathleen Fisher, past SIGPLAN Chair * Graham Hutton, current SIGPLAN Vice Chair * Chandra Krintz, past SIGPLAN Vice Chair * Tom Ball, 2011 General Chair * Mooly Sagiv, 2011 Program Chair * Manuel Hermenegildo, 2010 General Chair * Jens Palsberg, 2010 Program Chair * Zhong Shao, 2009 General Chair * Benjamin Pierce, 2009 Program Chair * George Necula, 2008 General Chair * Martin Hofman, 2007 General Chair * Matthias Felleisen, 2007 Program Chair From venneri at dsi.unifi.it Fri Jan 8 08:34:15 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Fri, 08 Jan 2010 14:34:15 +0100 Subject: [TYPES/announce] ITRS 2010: Call for papers Message-ID: <4B473457.1010903@dsi.unifi.it> ========================================================================== CALL FOR PAPERS (Deadline: March 31, 2010) **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. They have been one of the first examples of behavioural type theory: namely, they provide an abstract specification of computational properties, by expressing a finer and more precise input/output relation than standard, commonly used, type systems can do. Although intersection types were initially intended for use in analysing and/or synthesizing lambda models as well as in analysing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission of extended abstracts: March 31, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From pmt6sbc at maths.leeds.ac.uk Fri Jan 8 08:56:31 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 8 Jan 2010 13:56:31 GMT Subject: [TYPES/announce] CiE 2010 - Final Call for Papers Message-ID: <201001081356.o08DuUgm021182@amsta.leeds.ac.uk> Final call for papers --------------------------------------------------------------------------- COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes Ponta Delgada (Azores), Portugal June 30 to July 4, 2010 http://www.cie2010.uac.pt/ Deadline for submissions: 20 JANUARY 2010 --------------------------------------------------------------------------- Computability in Europe provides the largest international conference dealing with the full spectrum of computability-related research. CiE 2010 in the Azores is the sixth conference of the Series, held in a geographically unique and dramatic location, Europe's most Westerly outpost. The theme of CiE 2010 - "Programs, Proofs, Processes" - points to the usual CiE synergy of Computer Science, Mathematics and Logic, with important computability-theoretic connections to science and the real universe. TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS on: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Giancarlo Mauri, Natasha Jonoska, Stephane Vialette, Yasubumi Sakakibara Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Barry Cooper, Cris Calude Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Martin Hyland, Fernando Ferreira Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Confirmed speakers: Volker Peckhaus, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Martin Olsen, Thomas Erlebach Confirmed speaker: Debora Donato SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Formal systems, attendant proofs, and the possibility of their computer generation and manipulation (for instance, into programs) have been changing a whole spectrum of disciplines. The conference will address not only the more established lines of research of Computational Complexity and the interplay between Proofs and Computation, but also novel views that rely on physical and biological processes and models to find new ways of tackling computations and improving their efficiency. We particularly invite papers that build bridges between different parts of the research community. Since women are underrepresented in mathematics and computer science, we emphatically encourage submissions by female authors. The Elsevier Foundation is supporting the CiE conference series in the programme "Increasing representation of female researchers in the computability community". This programme will allow us to fund child-care support, a mentoring system for young female researchers, and also a small number of grants for junior female researchers (see below). The dates around the submission process are as follows: Submission Deadline: 20 January 2010 Notification to Authors: 18 March 2010 Deadline for Final Version: 8 April 2010 CiE 2010 conference topics include, but not exclusively: * Admissible sets * Analog computation * Artificial intelligence * Automata theory * Classical computability and degree structures * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational complexity * Computational learning and complexity * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of Computing * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Mathematical models of emergence * Molecular computation * Natural computing * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebra * Programming language semantics * Proof mining * Proof theory and computability * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Swarm intelligence * Type systems and type theory * Uncertain reasoning * Weak arithmetics and applications Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) The Programme Committee cordially invites all researchers in the area of the conference to submit their papers (in PDF-format, at most 10 pages) for presentation at CiE 2010. The best of the accepted papers will be published in the conference proceedings within the Lecture Notes in Computer Science (LNCS) series of Springer, which will be available at the conference. Authors of accepted papers are expected to present their work at the conference. Submitted papers must describe work not previously published, and they must neither be accepted nor under review at a journal or at another conference with refereed proceedings. All papers need to be prepared in LNCS-style LaTeX. Papers must not exceed 10 pages. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Submissions authored or co-authored by members of the Programme Committee are not allowed. Papers that have only student authors are eligible for the "CiE 2010 Best Student Paper Award." If your submission satisfies the requirements, please submit your paper in the category "Regular paper (eligible for Best Student Paper Award)." The Programme Committee will select the best submission among these after acceptance. The recipient of the Best Student Paper Award will get a fee waiver of the registration fee, a certificate, and a small symbolic cash prize. Funded by the Elsevier Foundation's programme 'Women in Computability' we shall offer five travel grants (covering registration fee and up to 300 EUR in reimbursement for travel and accomodation expenses) for junior female researchers. More information will become available in March 2010. Funded by the Elsevier journal Annals of Pure and Applied Logic (APAL), the organizers are offering a number of travel grants (including fee waivers and a modest reimbursement of travel and accommodation expenses) for students to attend CiE 2010. Student authors of accepted papers will have priority for these grants. The Association for Symbolic Logic (ASL) sponsors modest student member travel grants. See http://www.aslonline.org/studenttravelawards.html New funding opportunities are expected to be offered. For more details concerning funding and up to date information, please consult regularly the web page of the conference http://www.cie2010.uac.pt/ _________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From bruni at di.unipi.it Fri Jan 8 11:41:12 2010 From: bruni at di.unipi.it (Roberto Bruni) Date: Fri, 08 Jan 2010 17:41:12 +0100 Subject: [TYPES/announce] Last CfP for TGC 2010: EXTENDED deadline Jan. 20th, 2010 In-Reply-To: <4B2D1A70.6000507@di.unipi.it> References: <4B2D1A70.6000507@di.unipi.it> Message-ID: <4B476028.2040506@di.unipi.it> [Apologies for multiple postings] Due to several requests, the TGC'10 chairs have decided to extend the deadline for submsissions to January 20th ================================================================ Call for Papers TGC 2010 Fifth International Symposium on TRUSTWORTHY GLOBAL COMPUTING http://www.pst.ifi.lmu.de/tgc2010 LMU, Munich, February 26-26, 2010 ---------------------------------------------------------------- co-located with the review of FP6 GCII projects AEOLUS and SENSORIA ================================================================ IMPORTANT DATES --------------- Paper submissions: January 20, 2010 EXTENDED Final version (pre-proc.): February, 2010 Conference: February 24-26, 2010 Final version (post-proc.): March 22, 2010 SCOPE ------ The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorously about their behaviour and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit papers in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * resource usage and information flow policies * game-theoretic approaches to selfishness * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * sharing information and computation * efficient communication * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers, static analyzers * approximation algorithms, impossibility results, and structural properties * privacy, reliability and business integrity SUBMISSION DETAILS ------------------ Papers can be submitted online through the EASYCHAIR website http://www.easychair.org/conferences/?conf=tgc2010 Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. PROCEEDINGS ----------- We plan to publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. ORIGINS & PLANS --------------- In 2010, the symposium is co-located with the reviews of the following FP6 GCII projects: AEOLUS - Algorithmic Principles for Building Efficient Overlay Computers SENSORIA - Software Engineering for Service-Oriented Overlay Computers TGC 2008, the fourth Symposium on Trustworthy Global Computing, was held in Barcelona (Spain), on November 3 - 4, 2008. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2007 was held on November 5-6, 2007 in Sophia-Antipolis, France and it was followed by the Workshop on the Interplay of Programming Languages and Cryptography on November 7, 2007. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2006 was held in Lucca (Italy), on November 7 - 9, 2006 and it was co-located with the reviews of EU FET-IST FP6 Projects AEOLUS, MOBIUS, SENSORIA and CATNETS. The first TGC event took place in Edinburgh on April 7-9, 2005 with the co-sponsorship of IFIP TC-2, as part of ETAPS 2005. TGC 2005 was the evolution of the previous Global Computing I Workshops held in Rovereto in 2003 and 2004 (see e.g. LNCS 2874) and the workshops on Foundation of Global Computing held as satellite events of ICALP and Concur (see e.g. ENTCS Vol. 85). STEERING COMMITTE ----------------- Gilles Barthe (IMDEA Software, Madrid) Rocco De Nicola (University of Florence) Christos Kaklamanis (University of Patras) Ugo Montanari (University of Pisa) Davide Sangiorgi (University of Bologna) Don Sannella (University of Edinburgh) Vladimiro Sassone (University of Southampton) Martin Wirsing (University of Munich) PROGRAM CHAIRS -------------- Martin Hofmann - hofmann at tcs.ifi.lmu.de Institut fur Informatik, LMU Munich Martin Wirsing - wirsing at lmu.de Institut fur Informatik, LMU Munich PROGRAM COMMITTEE (to be invited!) ----------------- * Gilles Barthe (IMDEA Software, Madrid) * Roberto Bruni (University of Pisa) * Rocco De Nicola (University of Florence) * Howard Foster (Imperial College) * Samir Genaim (Universidad Complutense de Madrid) * Stefania Gnesi (ISTI, Pisa) * Martin Hofmann (LMU Munich) (co-chair) * Thomas Jensen (IRISA, Rennes) * Christos Kaklamanis (University of Patras) * Alberto Marchetti-Spaccamela (University of Roma "La Sapienza") * Paddy Nixon (University College Dublin) * Giuseppe Persiano (University of Salerno) * Geppino Pucci (University of Padova) * Paola Quaglia (University of Trento) * Don Sannella (University of Edinburgh) * Vladimiro Sassone (University of Southampton) * Maria J. Serna (Universitat Polit?cnica de Catalunya) * Carolyn Talcott (SRI International) * Emilio Tuosto (University of Leicester) * Nobuko Yoshida (Imperial College London) * Martin Wirsing (LMU Munich) (co-chair) * Franco Zambonelli (University of Modena) LOCAL ORGANIZATION ------------------ * Nora Koch (chair) * Axel Rauschmayer * Gefei Zhang ================================================================ -- ===================================================================== Dr. Roberto Bruni Computer Science Department Phone: +39 050 2212785 University of Pisa Fax: +39 050 2212726 Largo B. Pontecorvo, 3 Email: bruni at di.unipi.it I-56127 Pisa - ITALY WWW: http://www.di.unipi.it/~bruni ===================================================================== "We think in generalities, but we live in detail" Alfred N. Whitehead ===================================================================== From kaufmann at cs.utexas.edu Sat Jan 9 12:23:20 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Sat, 9 Jan 2010 11:23:20 -0600 Subject: [TYPES/announce] Final Call for Bids (ITP 2011) Message-ID: <201001091723.o09HNKDB017592@sundance.cs.utexas.edu> Hello -- In the last few days we have received several expressions of interest in submitting a bid to host ITP 2011. We now invite the community to submit formal bids by following the instructions on the following web page, which is a slightly edited version of the original call for bids, in particular to allow submissions from Europe. http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html As we receive bids, we will post information about them on the above web page. The last day for receipt of bids will be Wednesday, February 17. We will then issue a call for votes, as described on the above page. Regards, Matt Kaufmann and Larry Paulson (ITP 2010 co-chairs) From pmt6sbc at maths.leeds.ac.uk Mon Jan 11 10:17:27 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 11 Jan 2010 15:17:27 GMT Subject: [TYPES/announce] DCM 2010 in Edinburgh - First Call for Papers Message-ID: <201001111517.o0BFHRvZ002934@amsta.leeds.ac.uk> ========================================================================= First Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 Deadline for abstracts: 01 April, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 01 April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). IMPORTANT DATES: Submission deadline for abstracts: 01 April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 CONFIRMED INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From simonpj at microsoft.com Mon Jan 11 17:46:33 2010 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Mon, 11 Jan 2010 22:46:33 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Colleagues | Request for comments: Two-phase reviewing for POPL ... | The POPL Steering Committee has formulated the following proposal, | which we are circulating for discussion and feedback from the | community. The proposal aims to improve the decision process for POPL | while still working in a fixed time frame and with bounded resources. Thank you for broadcasting the proposal, and offering the opportunity for feedback. I can't come to POPL this year, but I do have opinions about this proposal, so I thought I would put them in writing. I'm sending this response only to the TYPES mailing list. Many people are concerned about the publication norms that have developed in our field [1,2,3,4]. In particular, we have evolved a somewhat bizarre system in which we place tremendous weight on publication in premier conferences with extremely low acceptance rates. Promotion and tenure can depend on publication in these venues. Yet anyone who has served on a program committee knows that (a) the evaluation is fairly rough and ready, and (b) it is hard to avoid a tendency to pick well-executed but incremental papers over more adventurous but flawed work. The current proposal for POPL is presumably a direct response to this situation. But I believe its main thrust, to invest yet more effort in the selection process, is addressing the wrong problem. The problem is not that program committees are selecting the *wrong* papers. The problem is that they are selecting too *few* papers. Before developing these claims, I want to mention some real advantages of the current conference system. * It is quick -- and *predictably* quick. There is a delay of only a few months between submission and presentation; and there is never any slippage, because the conference itself is immoveable. * It is a *fantastic* deal for authors. The most precious commodity for any author is the focused attention of other experts in the field. When I began my academic career an author would be lucky to get three scrawled sentences of review, on physical scraps of paper. Nowadays authors get between three and six substantial, thoughtful reviews. That is gold dust. * Reviewing is recognised to be rough and ready. Everyone knows that there is no time to hunt for the perfect reviewer. The reviewers know they have limited time for their work, and cut their cloth accordingly. For that very reason they are more inclined to agree to write a review than if they are asked to review a 60-page journal paper when they are supposed to do a bang-up thorough job. Program committee members review 20-30 papers, and simply cannot spend days on each; and the universal acceptance of this fact is what makes people willing to serve on PCs I regard this limited time-budget for each review as a major advantage. 80% of the benefit of a review comes from the first 20% of investment. Yes, individual injustices are sometimes done, and all of us have been on the receiving end, but in the aggregate it is a very efficient evaluation mechanism. That is, it is not perfectly accurate, but it is a *very effective use of reviewing bandwidth*. * Much has been written about the evils of banging out papers to meet conference deadlines, and no one would defend salami-slicing incremental papers instead of working in a sustained way on adventurous research. Less has been written about the intellectual *advantages* of writing frequently. My own experience is that the act of writing a paper is tremendously enlightening. I learn that I do not understand what I though I understood. The act of putting ideas onto paper forces clarity, or at least exposes muddy thinking. It puts thoughts into a form when they can be shared with others. Since I am a weak mortal, the incentive of a conference deadline is often just what I need to force me to action. In short, there are really good things about our current system that we do not want to lose. All that said, clearly something is wrong at the moment. POPL is getting 250 submissions, and accepting 30-40. That means that many fine papers are being rejected, and among the best 60 papers there is a strong element of chance about which ones end up being accepted. The same is true of PLDI, and perhaps to a lesser extent, of ICFP. (I don't have personal experience of the OOPSLA program committee.) We cannot fix this, as some would wish, by changing the culture to make journal publications be regarded as more valuable than conference ones. If this happened, the spotlight would just shift to journals, which would be overwhelmed with submissions; and we would lose many of the advantages I outline above. But in any case it's a non-starter. No one can wave such a magic wand: cultures are *hard* to shift. Nor can we fix the problem by investing more effort in the review process, as the POPL committee is apparently suggesting. We are already investing quite enough! I'm all for careful reviewing. Double-blind reviewing (if done with a light touch, so that it does not cramp the authors style), and the opportunity for authors to rebut factual errors in reviews, both seem to have a good power-to-weight ratio. But adding a whole new round of reviewing would represent an enormous new investment on the part of both authors and reviewer, and to what end? Perhaps the published papers would be a little bit better, and the decisions would be a little bit more just. But the costs are heavy, the benefits are marginal, and it addresses none of the fundamental problems. I for one would think three times about agreeing to serve on such a PC. (I already think twice.) No, the trouble is that POPL and conferences like it simply rejects too many fine, publishable papers. This is bad because - Authors are badly served, obviously - Readers are badly served, because they don't get to read those papers - The papers get recycled at other conferences and workshops, where they increase reviewing load (by being reviewed a second time), and crowd out the truly workshop-y work in progress that should be showing up at workshops In short, we should just accept more papers at all our premier conferences, using a *quality* bar (is this paper good enough?) not a *quantity* bar (is it one of the best 30?). How can we do this? The "fat proceedings" problem is getting less and less important as we increasingly use digital media. Really the only difficulty is how to accommodate the presentations at the physical meeting itself. But this is a problem that could be dealt with in many ways. One straightforward one is to have parallel tracks. Another is to have more days. Still another, which I am rather fond of, is to accept (say) 60 papers, and then hold a lottery for 20 presentation slots. [That's fewer than usual, so there'd be longer breaks for mingling, which is actually the real reason most people go to conferences in the first place.] I would argue *against* choosing the "best" papers for presentation, because that will just re-introduce the ills we are currently struggling with. Make it clearly a matter of luck, then no one will read anything into the "chosen for presentation" badge. The lottery selection could even done at the conference itself. I'm only half joking; that way, no one could be denied travel funding on the grounds that his or her paper had not been chosen for presentation. Or perhaps participants registering for the conference could vote in advance for which accepted papers they'd like to see presented, so the programme is partly created by those attending the conference? A big advantage of this approach (simply accepting more papers) is that it is something we can simply choose to do. It does not require every conference to make the same choice simultaneously, and it doesn't require a magical cultural change. However, if we did take this path, then a significant cultural change would follow, over time. If publication at POPL was no longer an extraordinary achievement, but rather a recognition for a fine piece of work, appointment committees would in due course adjust their evaluation criteria. And that in turn might actually reduce the overwhelming number of submissions to top-drawer conferences. Simon Peyton Jones [1] J Wing, "CS woes: deadline-driven research, academic inequality", CACM 52(12) Dec 2009, p8 [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic publication process to internet scale", CACM 52(1), Jan 2009, pp27-30. [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 [4] K Bierman, FB Schneider "Program committee overload in systems", CACM 52(5), May 2009 From blume at tti-c.org Mon Jan 11 18:10:00 2010 From: blume at tti-c.org (Matthias Blume) Date: Mon, 11 Jan 2010 17:10:00 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <3525ED91-AEF1-48F3-9212-F42D2B83BC8D@tti-c.org> I would like to thank Simon for his extremely thoughtful response! I agree with him 100% and hope that many others will as well. Matthias PS: As I am also unable to attend POPL this year, I follow Simon in posting to the mailing list instead. On Jan 11, 2010, at 4:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for > POPL > | while still working in a fixed time frame and with bounded > resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. ... From kim at cs.pomona.edu Mon Jan 11 18:47:10 2010 From: kim at cs.pomona.edu (Kim Bruce) Date: Mon, 11 Jan 2010 15:47:10 -0800 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: I also would like to agree with Simon's general thrust. POPL and PLDI are so competitive that it is difficult for the program committee to take a chance on a speculative paper when it would squeeze out a clearly very good paper that is less speculative. Thus I agree that we need to accept more papers at these conferences. Serving on a program committee is very time-consuming. If the POPL proposal were accepted as it stands, I would hope that only a few papers would be in the resubmit pile so that the workload is not overwhelming for the committee (and I agree that it is useful to have a method for authors to respond to referee comments that might reflect misunderstandings -- though a paper that was not well written could more appropriately be resubmitted to a later conference). While I'm not a big fan of Simon's proposal of a lottery to decide which papers will be presented, I have fantasized over the years of having a mechanism where each speaker starts off by giving a 15 minute version of their talk. The audience then votes to see if they continue for another 15 minutes. It is completely unworkable, of course, but it would help in those cases that you decide to attend a talk and then decide after the first few minutes that it is either very different from what you expected or is not well presented. Instead these days we simply flip open our laptops and catch up on our e-mail. My choice would be to increase the acceptance rate and schedule all or some of the submitted papers in parallel sessions. I know there are losses to this (we all become narrower -- we might also have less time to talk in the hallways if there are more papers that are personally interesting), but it will allow more high quality papers to be presented. (Extending conferences is less useful as it is hard for many of us to be away for an extended time during classes.) It also makes sense to do this if we as a profession are going to encourage more use of journals for archival publications. Conference program committees are forced to referee based on interest and likely correctness, while journals can have more detailed proofs, explanations, and data that can be verified by referees. While, as Simon says, it is useful to write often about one's research, it is also useful to put together what one has learned in several successive conference papers to make an up-to-date and comprehensive report on one's research. Kim Bruce .. also not going to POPL this year ... On Jan 11, 2010, at 2:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for POPL > | while still working in a fixed time frame and with bounded resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. > > Many people are concerned about the publication norms that have > developed in our field [1,2,3,4]. In particular, we have evolved a > somewhat bizarre system in which we place tremendous weight on > publication in premier conferences with extremely low acceptance > rates. Promotion and tenure can depend on publication in these > venues. Yet anyone who has served on a program committee knows that > (a) the evaluation is fairly rough and ready, and (b) it is hard to > avoid a tendency to pick well-executed but incremental papers over > more adventurous but flawed work. > > The current proposal for POPL is presumably a direct response to this > situation. But I believe its main thrust, to invest yet more effort in > the selection process, is addressing the wrong problem. The problem is > not that program committees are selecting the *wrong* papers. The > problem is that they are selecting too *few* papers. > > Before developing these claims, I want to mention some real advantages of > the current conference system. > > * It is quick -- and *predictably* quick. There is a delay of only a > few months between submission and presentation; and there is never > any slippage, because the conference itself is immoveable. > > * It is a *fantastic* deal for authors. The most precious commodity for > any author is the focused attention of other experts in the field. > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. > > * Reviewing is recognised to be rough and ready. Everyone knows that > there is no time to hunt for the perfect reviewer. The reviewers > know they have limited time for their work, and cut their cloth > accordingly. For that very reason they are more inclined to agree > to write a review than if they are asked to review a 60-page journal > paper when they are supposed to do a bang-up thorough job. Program > committee members review 20-30 papers, and simply cannot spend days > on each; and the universal acceptance of this fact is what makes > people willing to serve on PCs > > I regard this limited time-budget for each review as a major > advantage. 80% of the benefit of a review comes from the first 20% > of investment. Yes, individual injustices are sometimes done, and > all of us have been on the receiving end, but in the aggregate it is > a very efficient evaluation mechanism. That is, it is not > perfectly accurate, but it is a *very effective use of reviewing > bandwidth*. > > * Much has been written about the evils of banging out papers to meet > conference deadlines, and no one would defend salami-slicing > incremental papers instead of working in a sustained way on > adventurous research. > > Less has been written about the intellectual *advantages* of writing > frequently. My own experience is that the act of writing a paper is > tremendously enlightening. I learn that I do not understand what I > though I understood. The act of putting ideas onto paper forces > clarity, or at least exposes muddy thinking. It puts thoughts into > a form when they can be shared with others. > > Since I am a weak mortal, the incentive of a conference deadline is > often just what I need to force me to action. > > In short, there are really good things about our current system that we > do not want to lose. > > All that said, clearly something is wrong at the moment. POPL is > getting 250 submissions, and accepting 30-40. That means that many > fine papers are being rejected, and among the best 60 papers there is > a strong element of chance about which ones end up being accepted. > The same is true of PLDI, and perhaps to a lesser extent, of ICFP. > (I don't have personal experience of the OOPSLA program committee.) > > We cannot fix this, as some would wish, by changing the culture to make > journal publications be regarded as more valuable than conference > ones. If this happened, the spotlight would just shift to journals, > which would be overwhelmed with submissions; and we would lose many > of the advantages I outline above. But in any case it's a > non-starter. No one can wave such a magic wand: cultures are *hard* to > shift. > > Nor can we fix the problem by investing more effort in the review > process, as the POPL committee is apparently suggesting. We are > already investing quite enough! I'm all for careful reviewing. > Double-blind reviewing (if done with a light touch, so that it does > not cramp the authors style), and the opportunity for authors to rebut > factual errors in reviews, both seem to have a good power-to-weight > ratio. But adding a whole new round of reviewing would represent an > enormous new investment on the part of both authors and reviewer, and > to what end? Perhaps the published papers would be a little bit > better, and the decisions would be a little bit more just. But the > costs are heavy, the benefits are marginal, and it addresses none of > the fundamental problems. I for one would think three times about > agreeing to serve on such a PC. (I already think twice.) > > > No, the trouble is that POPL and conferences like it simply rejects > too many fine, publishable papers. This is bad because > > - Authors are badly served, obviously > > - Readers are badly served, because they don't get to read > those papers > > - The papers get recycled at other conferences and workshops, where > they increase reviewing load (by being reviewed a second time), > and crowd out the truly workshop-y work in progress that should be > showing up at workshops > > In short, we should just accept more papers at all our premier > conferences, using a *quality* bar (is this paper good enough?) not a > *quantity* bar (is it one of the best 30?). How can we do this? The > "fat proceedings" problem is getting less and less important as we > increasingly use digital media. Really the only difficulty is how to > accommodate the presentations at the physical meeting itself. But this > is a problem that could be dealt with in many ways. > > One straightforward one is to have parallel tracks. Another is to > have more days. Still another, which I am rather fond of, is to > accept (say) 60 papers, and then hold a lottery for 20 presentation > slots. [That's fewer than usual, so there'd be longer breaks for > mingling, which is actually the real reason most people go to > conferences in the first place.] I would argue *against* choosing the > "best" papers for presentation, because that will just re-introduce > the ills we are currently struggling with. Make it clearly a matter > of luck, then no one will read anything into the "chosen for > presentation" badge. > > The lottery selection could even done at the conference itself. I'm > only half joking; that way, no one could be denied travel funding on > the grounds that his or her paper had not been chosen for > presentation. Or perhaps participants registering for the conference > could vote in advance for which accepted papers they'd like to see > presented, so the programme is partly created by those attending the > conference? > > > A big advantage of this approach (simply accepting more papers) is > that it is something we can simply choose to do. It does not require > every conference to make the same choice simultaneously, and it > doesn't require a magical cultural change. However, if we did take > this path, then a significant cultural change would follow, over time. > If publication at POPL was no longer an extraordinary achievement, but > rather a recognition for a fine piece of work, appointment committees > would in due course adjust their evaluation criteria. And that in > turn might actually reduce the overwhelming number of submissions to > top-drawer conferences. > Simon Peyton Jones > > [1] J Wing, "CS woes: deadline-driven research, academic > inequality", CACM 52(12) Dec 2009, p8 > > [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic > publication process to internet scale", CACM 52(1), Jan 2009, > pp27-30. > > [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 > > [4] K Bierman, FB Schneider "Program committee overload in systems", > CACM 52(5), May 2009 From Michael.Johnson at mq.edu.au Mon Jan 11 19:40:03 2010 From: Michael.Johnson at mq.edu.au (Michael Johnson) Date: Tue, 12 Jan 2010 11:40:03 +1100 Subject: [TYPES/announce] AMAST (Algebraic Methodology and Software Technology) CFP In-Reply-To: References: Message-ID: [Although this announcement doesn't specifically mention "types", it is of interest to the Types community. AMAST is largely about the interaction of mathematical analyis and software technology, and type theory and the many discussions on Types are very much part of that. Certainly AMAST has attracted many Types subscribers (including myself) in the past.] Please distribute this announcement to your colleagues. --------------------------------------------- CALL FOR PAPERS AMAST 2010: 13th International Conference on Algebraic Methodology And Software Technology http://mpc-amast2010.fsg.ulaval.ca/ Paper Submissions: 26th February 2010 --------------------------------------------- AMAST 2010 June 23th - 26th, 2010 Manoir St-Castin, Quebec City, Canada. The major goal of the AMAST Conferences is to promote research that may lead to the setting of software technology on a firm, mathematical basis. This goal is achieved by a large international community with contributions from both academia and industry. The virtues of a software technology developed on a mathematical basis include the provision of software that is (a) correct, and the correctness can be proved mathematically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i.e., independent of computing platforms and language generations, and (d) evolutionary, i.e., it can be self-adaptable and evolves with the problem domain. All previous editions of the AMAST Conference, which were held at Iowa City (1989,1991), Twente (1993), Montreal (1995), Munich (1996), Sydney (1997), Manaus (1999), Iowa City (2000), Reunion Island (2002), Stirling (2004), Saaremaa (2006) and Urbana-Champaign (2008), made contributions to the AMAST goals by reporting and disseminating academic and industrial achievements within the AMAST area of interest. During these meetings, AMAST attracted an international following among researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. TOPICS ------ As in previous years, we invite papers reporting original research on setting software technology on a firm mathematical basis. We expect two kinds of submissions: technical papers and system demonstrations. Of particular interest is research on using algebraic, logic, and other formalisms suitable as foundations for software technology, as well as software technologies developed by means of logic and algebraic methodologies. Topics of interest include, but are not limited to, the following: SOFTWARE TECHNOLOGY: * systems software technology * application software technology * concurrent and reactive systems * formal methods in industrial software development * formal techniques for software requirements, design * evolutionary software/adaptive systems PROGRAMMING METHODOLOGY: * logic programming, functional programming, object paradigms * constraint programming and concurrency * program verification and transformation * programming calculi * web programming * specification languages and tools * formal specification and development case studies ALGEBRAIC AND LOGICAL FOUNDATIONS: * logic, category theory, relation algebra, computational algebra * algebraic foundations for languages and systems * logical frameworks for reasoning * logics of programs * algebra and coalgebra SYSTEMS AND TOOLS (for system demonstrations or ordinary papers): * software development environments * support for correct software development * system support for reuse * tools for prototyping * component based software development tools * validation and verification * computer algebra systems * theorem proving systems PUBLICATION ----------- As in the past, the proceedings of AMAST 2010 will be published by Springer in the Lecture Notes in Computer Science series. We invite prospective authors to submit electronically previously unpublished papers of high quality. Submissions should not have been published and should not be under consideration for publication elsewhere. Papers must be no longer than 15 pages (6 pages for system demonstrations) and should be prepared using LaTeX and the LNCS style that can be downloaded from http://www.springer.de/comp/lncs/authors.html. Papers should be received by February 26, 2010. Submission will be electronic, and further details will be available at the website soon. IMPORTANT DATES --------------- * Paper submissions: February 26, 2010, (23:59 Pacific (UTC-8)) * Notification of paper acceptance: March 19, 2010 * Camera ready papers due: April 5, 2010 * AMAST'2010 Conference: June 23-26, 2010 LOCATION -------- The conference will be held at the Manoir St-Castin, Quebec City, Canada http://mpc-amast2010.fsg.ulaval.ca/ CONTACT ------- For further information, consult the webiste or send email to mike at ics.mq.edu.au From rwh at cs.cmu.edu Mon Jan 11 20:26:24 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Mon, 11 Jan 2010 20:26:24 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <66B0D6D9-BB82-47A6-A49C-358D3F3D6782@cs.cmu.edu> I am in complete agreement with Simon, and strongly opposed to the proposed plan to change the POPL reviewing process. Bob Harper On Jan 11, 2010, at 5:46 PM, Simon Peyton-Jones wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Colleagues > > | Request for comments: Two-phase reviewing for POPL > ... > | The POPL Steering Committee has formulated the following proposal, > | which we are circulating for discussion and feedback from the > | community. The proposal aims to improve the decision process for > POPL > | while still working in a fixed time frame and with bounded > resources. > > Thank you for broadcasting the proposal, and offering the opportunity > for feedback. I can't come to POPL this year, but I do have opinions > about this proposal, so I thought I would put them in writing. I'm > sending this response only to the TYPES mailing list. > > Many people are concerned about the publication norms that have > developed in our field [1,2,3,4]. In particular, we have evolved a > somewhat bizarre system in which we place tremendous weight on > publication in premier conferences with extremely low acceptance > rates. Promotion and tenure can depend on publication in these > venues. Yet anyone who has served on a program committee knows that > (a) the evaluation is fairly rough and ready, and (b) it is hard to > avoid a tendency to pick well-executed but incremental papers over > more adventurous but flawed work. > > The current proposal for POPL is presumably a direct response to this > situation. But I believe its main thrust, to invest yet more effort in > the selection process, is addressing the wrong problem. The problem > is > not that program committees are selecting the *wrong* papers. The > problem is that they are selecting too *few* papers. > > Before developing these claims, I want to mention some real > advantages of > the current conference system. > > * It is quick -- and *predictably* quick. There is a delay of only a > few months between submission and presentation; and there is never > any slippage, because the conference itself is immoveable. > > * It is a *fantastic* deal for authors. The most precious commodity > for > any author is the focused attention of other experts in the field. > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. > > * Reviewing is recognised to be rough and ready. Everyone knows that > there is no time to hunt for the perfect reviewer. The reviewers > know they have limited time for their work, and cut their cloth > accordingly. For that very reason they are more inclined to agree > to write a review than if they are asked to review a 60-page journal > paper when they are supposed to do a bang-up thorough job. Program > committee members review 20-30 papers, and simply cannot spend days > on each; and the universal acceptance of this fact is what makes > people willing to serve on PCs > > I regard this limited time-budget for each review as a major > advantage. 80% of the benefit of a review comes from the first 20% > of investment. Yes, individual injustices are sometimes done, and > all of us have been on the receiving end, but in the aggregate it is > a very efficient evaluation mechanism. That is, it is not > perfectly accurate, but it is a *very effective use of reviewing > bandwidth*. > > * Much has been written about the evils of banging out papers to meet > conference deadlines, and no one would defend salami-slicing > incremental papers instead of working in a sustained way on > adventurous research. > > Less has been written about the intellectual *advantages* of writing > frequently. My own experience is that the act of writing a paper is > tremendously enlightening. I learn that I do not understand what I > though I understood. The act of putting ideas onto paper forces > clarity, or at least exposes muddy thinking. It puts thoughts into > a form when they can be shared with others. > > Since I am a weak mortal, the incentive of a conference deadline is > often just what I need to force me to action. > > In short, there are really good things about our current system that > we > do not want to lose. > > All that said, clearly something is wrong at the moment. POPL is > getting 250 submissions, and accepting 30-40. That means that many > fine papers are being rejected, and among the best 60 papers there is > a strong element of chance about which ones end up being accepted. > The same is true of PLDI, and perhaps to a lesser extent, of ICFP. > (I don't have personal experience of the OOPSLA program committee.) > > We cannot fix this, as some would wish, by changing the culture to > make > journal publications be regarded as more valuable than conference > ones. If this happened, the spotlight would just shift to journals, > which would be overwhelmed with submissions; and we would lose many > of the advantages I outline above. But in any case it's a > non-starter. No one can wave such a magic wand: cultures are *hard* to > shift. > > Nor can we fix the problem by investing more effort in the review > process, as the POPL committee is apparently suggesting. We are > already investing quite enough! I'm all for careful reviewing. > Double-blind reviewing (if done with a light touch, so that it does > not cramp the authors style), and the opportunity for authors to rebut > factual errors in reviews, both seem to have a good power-to-weight > ratio. But adding a whole new round of reviewing would represent an > enormous new investment on the part of both authors and reviewer, and > to what end? Perhaps the published papers would be a little bit > better, and the decisions would be a little bit more just. But the > costs are heavy, the benefits are marginal, and it addresses none of > the fundamental problems. I for one would think three times about > agreeing to serve on such a PC. (I already think twice.) > > > No, the trouble is that POPL and conferences like it simply rejects > too many fine, publishable papers. This is bad because > > - Authors are badly served, obviously > > - Readers are badly served, because they don't get to read > those papers > > - The papers get recycled at other conferences and workshops, where > they increase reviewing load (by being reviewed a second time), > and crowd out the truly workshop-y work in progress that should be > showing up at workshops > > In short, we should just accept more papers at all our premier > conferences, using a *quality* bar (is this paper good enough?) not a > *quantity* bar (is it one of the best 30?). How can we do this? The > "fat proceedings" problem is getting less and less important as we > increasingly use digital media. Really the only difficulty is how to > accommodate the presentations at the physical meeting itself. But this > is a problem that could be dealt with in many ways. > > One straightforward one is to have parallel tracks. Another is to > have more days. Still another, which I am rather fond of, is to > accept (say) 60 papers, and then hold a lottery for 20 presentation > slots. [That's fewer than usual, so there'd be longer breaks for > mingling, which is actually the real reason most people go to > conferences in the first place.] I would argue *against* choosing the > "best" papers for presentation, because that will just re-introduce > the ills we are currently struggling with. Make it clearly a matter > of luck, then no one will read anything into the "chosen for > presentation" badge. > > The lottery selection could even done at the conference itself. I'm > only half joking; that way, no one could be denied travel funding on > the grounds that his or her paper had not been chosen for > presentation. Or perhaps participants registering for the conference > could vote in advance for which accepted papers they'd like to see > presented, so the programme is partly created by those attending the > conference? > > > A big advantage of this approach (simply accepting more papers) is > that it is something we can simply choose to do. It does not require > every conference to make the same choice simultaneously, and it > doesn't require a magical cultural change. However, if we did take > this path, then a significant cultural change would follow, over time. > If publication at POPL was no longer an extraordinary achievement, but > rather a recognition for a fine piece of work, appointment committees > would in due course adjust their evaluation criteria. And that in > turn might actually reduce the overwhelming number of submissions to > top-drawer conferences. > Simon Peyton Jones > > [1] J Wing, "CS woes: deadline-driven research, academic > inequality", CACM 52(12) Dec 2009, p8 > > [2] J Crowcroft, S Keshav and N McKeown, "Scaling the academic > publication process to internet scale", CACM 52(1), Jan 2009, > pp27-30. > > [3] M Vardi, "Conferences vs journals", CACM 52(5), May 2009, p5 > > [4] K Bierman, FB Schneider "Program committee overload in systems", > CACM 52(5), May 2009 > -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 2108 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100111/6d995185/smime-0001.p7s From matthias at ccs.neu.edu Mon Jan 11 22:23:33 2010 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Mon, 11 Jan 2010 22:23:33 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Simon and others, thanks for the feedback. While I am a member of the POPL SC until January, this email is my personal opinion and is not to be construed as something anyone else on the SC may subscribe to. 1. I like the idea of accepting more papers. It is a part of every year's SC discussion. And as you probably recall from your chairman role, the SC is quite encouraging about accepting more papers. I tried to get more papers into my POPL. This year again the SC is encouraging the PC to broaden the acceptance range. In my own experience, though, the PC tends to block attempts to, say, double the number of papers. The idea is discussed, potential papers are brought up, and eventually the faction that disapproves of a larger program wears out those who are on the 'more papers' side. If you wish to achieve this numeric enlargement, I am afraid you will need to set a target number, say 60 papers. 2. I strongly disagree with your description of the state of affairs: > When I began my academic career an author would be lucky to get > three scrawled sentences of review, on physical scraps of paper. > Nowadays authors get between three and six substantial, thoughtful > reviews. That is gold dust. I started with the same kind of paper reviews. I do not see much of the improvement you see. On some occasion, you get fantastic reviews (even for rejected papers). On many occasions, you get feedback from non-experts that is nearly random. I won't blame the committee members here: they are under time pressure, they have their own preferences, and they have the backgrounds they have. We are all weak, and we do what we can do. Over the past few years, I have collected informal statistics that basically suggests that submissions get about one expert review per submission but that may mean two for one submission and none for another. Yes, a good number of papers are rejected without knowledgeable review. The expectation with a two-phase review is this: -- At the first, physical meeting papers w/o expert reviews are discovered. They get to respond to their preliminary reviews and the PC will figure out how to get appropriate reviewers for these papers. No more 'over night, after dinner' expert reviews. -- Papers with a fixable weakness are sent back to authors so that they can demonstrate clearly how to overcome this weakness. Hopefully this will help get some less-finished ideas into the conference and turn the 'oral journal' that POPL currently is into a real conference again. 3. The two-tier proposal is a compromise that a dozen or so representative POPL community members have worked out. Like all compromises they don't make people 100% happy. I can only speak for myself; I am in the not-100% happy camp. But after discussing this issue for the entire fall, I believe that the (once again) suggested increase of acceptances and this proposal may get POPL moving in the right direction. I do consider it an experiment -- as I am sure others on the SC do, too -- that should be evaluated in a few years. If it moves in the wrong direction, we go back to the status quo or we try a different change. It it turns out to be an improvement, we can still try other modifications. -- Matthias From scd at doc.ic.ac.uk Tue Jan 12 04:28:04 2010 From: scd at doc.ic.ac.uk (Sophia Drossopoulou) Date: Tue, 12 Jan 2010 09:28:04 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> It seems to me that the two phase reviewing proposal is meant to address the problem that PCs are over-conservative, and they reject quirky ideas, that are not so well worked out. If so, I have two questions: 1) We already have the shepherding mechanism for such cases: what will we achieve by enhancing it into the "two-phase" review? (BTW, Jan Vitek, as ECOOP PC chair, has strengthened shepherding, so that there was a "shepherd" who would communicate with the authors, and a "controller" would would give the final "go ahead" to the paper). 2) I suppose we all have some examples of quirky ideas that did not make it to a conference. What has happened afterwards? Did the authors give up, disheartened, or did they take the comments into account, improve the work, and get it accepted somewhere else? Also, so we think that such quirky but maybe flawed papers could be sufficiently improved over the restricted available time period? Sophia If I was asked to vote, I would be against the two-phase reviewing process, but then, I may very well be wring: I was initially against the rebuttal process, but then, when I saw it working, I was absolutely convinced. From coquand at chalmers.se Tue Jan 12 04:22:40 2010 From: coquand at chalmers.se (Thierry Coquand) Date: Tue, 12 Jan 2010 10:22:40 +0100 Subject: [TYPES/announce] 4 PhD positions in Formalization of Mathematics in Type Theory Message-ID: 4 PhD positions in Formalization of Mathematics in Type Theory We are looking for students with a strong interest in functional programming and mathematics for two projects in formalization of mathematics in type theory. Among the theme of research are: constructive representation of algebraic numbers (in particular applied to computations on algebraic curves), homological algebra, category theory in type theory, as well as metatheory of types systems. Three positions are funded by an ERC Advanced Grant from the European Union. One position is within a Strep Open, 7th framework, which involves, as other sites, INRIA, INRIA-microsoft, Nijmegen and La Roja. The monthly salary is around 2350 euros. For more informations see http://www.gu.se/omuniversitetet/ledigaanstallningar From martin.odersky at epfl.ch Tue Jan 12 04:50:46 2010 From: martin.odersky at epfl.ch (martin odersky) Date: Tue, 12 Jan 2010 10:50:46 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> Message-ID: <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> I am very much in favor of strongly encouraging the PC to increase the number of accepted papers. I'd tend to go to parallel sessions to accommodate the increased number of talks. In addition, I would start the conference off with a poster session where every accepted paper is presented. This would counter-balance the danger of fragmentation of the conference otherwise posed by parallel sessions. It would also help the attendees to pick the talks of interest to them. Cheers -- Martin From peterd at chalmers.se Tue Jan 12 05:01:45 2010 From: peterd at chalmers.se (Peter Dybjer) Date: Tue, 12 Jan 2010 11:01:45 +0100 Subject: [TYPES/announce] tenure track assistant professorships at Chalmers Message-ID: <994D40AD62B42647972DD232E960C85518A6D998@MAPI01.ita.chalmers.se> We invite theoretical computer scientists (with a PhD degree no more than 5 years old) to apply for two tenure-track assistant professorships in "basic science" at Chalmers University of Technology (deadline 1 February 2001): http://www.chalmers.se/en/sections/about_chalmers/advance/job-positions-in/positions/two-assistant-professors From dreyer at mpi-sws.org Tue Jan 12 05:14:56 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Tue, 12 Jan 2010 11:14:56 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> Hi, Matthias. Thanks for the clarification about the motivation behind the rather significant proposed change to the POPL review process. There seem to be three major concerns: (1) rejecting papers without at least one expert review, (2) rejecting papers just because of a (presumably fixable) weakness, and (3) rejecting papers because they are "quirky". Let's consider each in turn. 1. I completely understand the concern about papers receiving no expert reviews. This has happened to everyone on occasion, I'm sure. However, at least based on my (perhaps confused) understanding of the proposal at hand, I fail to see how it actually addresses that concern. Let's say I submit a paper to POPL and it gets no expert reviews. The PC discovers this at the PC meeting, and thus they can't make a serious decision and they return my paper "resubmit". Since I have not received an expert review, I get little serious feedback at this point, so I can't make any serious changes to my paper that would help reviewers understand it. In the meantime, the PC seeks out some external reviews. What is the point of this protracted process? The problem in this case is that the PC goofed up by not procuring an external expert review in time for the PC meeting. Why is the poor author punished by having to wait an extra 6 weeks to get an acceptance or rejection? A simpler solution, it seems to me, is for the PC chair (and if there are co-chairs, this will hopefully be easier) to make sure there are expert reviews for all papers, including at least one external expert review, preferably prior to the author response. 2. Regarding papers with a fixable weakness, I tend to agree with Sophia. Why is this not already handled by shepherding? Although I am not a big fan of shepherding, I think it is appropriate to use in the case that a paper contains clear technical flaws that seem easily fixable. Are there really that many papers that fall into this category that it's worth making such a big change to the POPL reviewing process? 3. Regarding "quirky" papers: I have always interpreted "quirky" to mean that some people think the paper is "really cool" and others think it's "not there yet" and/or "rubbish". Again, I agree with Sophia: I'm not sure how the new reviewing process is supposed to help make decisions about such papers. Generally, I think, with these sorts of papers, it's not necessarily the presentation of the work that's at fault; in fact, the offbeat presentation may be why some people like it. Rather, it's a question of whether the work is solid enough for POPL, and that's unlikely to be something that can be addressed in a 2-week revision period. *** To echo Simon and the others, I'm happy to see the POPL acceptance rate go up to 25-30%. If the policy is that we accept more good papers up to that acceptance rate, then I don't see what is difficult about implementing it. It is a simple fix, and does not affect the conference calendar. I am not in favor of a lottery for talks, but parallel sessions seem like a reasonable price to pay. Best regards, Derek On Tue, Jan 12, 2010 at 4:23 AM, Matthias Felleisen wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > > Simon and others, > > thanks for the feedback. While I am a member of the POPL SC until > January, this email is my personal opinion and is not to be > construed as something anyone else on the SC may subscribe to. > > > 1. I like the idea of accepting more papers. It is a part of > every year's SC discussion. And as you probably recall from your > chairman role, the SC is quite encouraging about accepting > more papers. I tried to get more papers into my POPL. This > year again the SC is encouraging the PC to broaden the > acceptance range. > > In my own experience, though, the PC tends to block attempts > to, say, double the number of papers. The idea is discussed, > potential papers are brought up, and eventually the faction > that disapproves of a larger program wears out those who are > on the 'more papers' side. > > If you wish to achieve this numeric enlargement, I am afraid > you will need to set a target number, say 60 papers. > > 2. I strongly disagree with your description of the state of > affairs: > >> When I began my academic career an author would be lucky to get >> ?three scrawled sentences of review, on physical scraps of paper. >> ?Nowadays authors get between three and six substantial, thoughtful >> ?reviews. ?That is gold dust. > > I started with the same kind of paper reviews. I do not see > much of the improvement you see. > > On some occasion, you get fantastic reviews (even for rejected > papers). > > On many occasions, you get feedback from non-experts that is > nearly random. I won't blame the committee members here: they > are under time pressure, they have their own preferences, > and they have the backgrounds they have. We are all weak, and > we do what we can do. > > Over the past few years, I have collected informal statistics > that basically suggests that submissions get about one expert > review per submission but that may mean two for one submission > and none for another. Yes, a good number of papers are rejected > without knowledgeable review. > > The expectation with a two-phase review is this: > > -- At the first, physical meeting papers w/o expert reviews > are discovered. They get to respond to their preliminary reviews > and the PC will figure out how to get appropriate reviewers > for these papers. No more 'over night, after dinner' > expert reviews. > > -- Papers with a fixable weakness are sent back to authors so > that they can demonstrate clearly how to overcome this weakness. > Hopefully this will help get some less-finished ideas > into the conference and turn the 'oral journal' that POPL currently > is into a real conference again. > > 3. The two-tier proposal is a compromise that a dozen or so > representative POPL community members have worked out. Like all > compromises they don't make people 100% happy. I can only speak > for myself; I am in the not-100% happy camp. > > But after discussing this issue for the entire fall, I believe that > the (once again) suggested increase of acceptances and this > proposal may get POPL moving in the right direction. I do consider it > an experiment -- as I am sure others on the SC do, too -- that should > be evaluated in a few years. If it moves in the wrong direction, > we go back to the status quo or we try a different change. > It it turns out to be an improvement, we can still try other > modifications. > > -- Matthias > > > > > > > > > From kapur at cs.unm.edu Tue Jan 12 07:38:45 2010 From: kapur at cs.unm.edu (Deepak Kapur) Date: Tue, 12 Jan 2010 05:38:45 -0700 Subject: [TYPES/announce] reviewing, conference presentations, conference vs journal publications Message-ID: <4B4C6D55.9040603@cs.unm.edu> I applaud the POPL SC for making a proposal to make reviewing fairer, which I support. I am also supportive of increasing the number of accepted papers. But that is not the reason for making my first post on this list. How about the seemingly radical idea of allowing almost all submissions/abstracts to be presented at prestigious CS conferences including POPL, a tradition that has been successfully practiced (I hope) by almost all other disciplines including physics, mathematics, economics, etc., but appears to be so foreign and unacceptable to most of us? Everything else ---- rebuttals, resubmissions, quality, quantity, and what not, can be left for journals, where of course, the reviewing process has to be expedited much like the conference reviewing for which we all are (perhaps reluctantly) willing to abide by deadlines. My 2 cents. Deepak From james.cheney at gmail.com Tue Jan 12 08:32:57 2010 From: james.cheney at gmail.com (James Cheney) Date: Tue, 12 Jan 2010 10:32:57 -0300 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <7fa251b71001120214s9ff1439jc87ead6bf8c08129@mail.gmail.com> Message-ID: <814253dd1001120532n24d993aq176f4b5874751c2c@mail.gmail.com> Hi, Quoting from the proposal: | * Other conferences are moving to a year-round refereeing process | closer to that used by journals; for instance VLDB is now linked to | a journal PVLDB. The two-phase proposal yields similar benefits, | while ensuring focus and a bound on effort. Though I don't have direct experience with the "journal track" of PVLDB, I have heard positive experiences from others and know some of the people who set it up. I think the above description is inaccurate and it's unclear that the POPL SC proposal has the claimed advantages. So I'd like to describe how the VLDB/PVLDB system currently works. At present, VLDB retains an ordinary conference organization. All papers accepted to VLDB are published in "Proceedings of VLDB", a journal, and all authors of such papers are given a slot to present. In addition, there is a "journal track": a paper can be submitted anytime during the year. It is supposed to be reviewed within a set period (similar to the time for conference review) with a hard decision after the second round - very similar to the 2-round proposal for POPL, but not anchored to the conference deadline. All accepted papers, whether submitted via the traditional conference review process or journal track, can be presented at the next suitable instance of the conference. (I believe for journal track papers this is optional). The PVLDB folks anticipate that other conferences might participate in the system, so eventually there might be a choice of venues for accepted journal-track papers. Also, all papers have the same length and are cited as journal papers in PVLDB. I believe both proposals have the properties that are claimed as advantages only for the POPL proposal: 1. the ordinary conference submission process is preserved, providing focused deadlines for the majority of papers (and authors who prefer deadlines and predictability) 2. the additional journal track provides reasonable bounds on PC member and external reviewer effort Indeed, the PVLDB process may be less effort for PC members, since the reviewing process for the conference track is unchanged. The additional effort is needed from journal track reviewers and editors, who are not necessarily PC members. On the other hand, the VLDB system was a response to a different problem: VLDB and other major DB conferences have already grown large (3-4 parallel research tracks, PCs with > 100 members) and the reviewing process is perceived as random; DB systems researchers have co-evolved with this system to submit many papers every year with lots of roll-over (of both good and bad papers). So I'm not claiming the VLDB approach is a solution to the problem identified here. I do think it avoids many of the problems Simon perceives with the proposed change, though. It also has the advantage that it's relatively incremental - instead of moving everyone's deadlines and giving the whole PC (potentially) more work, it is up to the author to decide whether to submit early via the journal track or through the traditional, more predictable conference process. --James -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/035d9233/attachment.htm From greg at eecs.harvard.edu Tue Jan 12 09:05:44 2010 From: greg at eecs.harvard.edu (Greg Morrisett) Date: Tue, 12 Jan 2010 09:05:44 -0500 Subject: [TYPES/announce] reviewing, conference presentations, conference vs journal publications In-Reply-To: <4B4C6D55.9040603@cs.unm.edu> References: <4B4C6D55.9040603@cs.unm.edu> Message-ID: <4B4C81B8.3080604@eecs.harvard.edu> Deepak Kapur wrote: > How about the seemingly radical idea of allowing almost all > submissions/abstracts to be presented at prestigious CS conferences > including POPL, a tradition that has been successfully practiced (I > hope) by almost all other disciplines including physics, mathematics, > economics, etc., but appears to be so foreign and unacceptable to most > of us? I was going to suggest something similar -- the next time you write a letter of recommendation for person X, just say that all of X's papers should've been accepted into POPL. That way, everyone will get a job with tenure! Or, we could just rename all SIGPLAN conferences and workshops to "POPL"! To distinguish them and make sure there's no bias in the title, we could just name them after the month they are in (POPL-Jan, POPL-Feb, etc.) Seriously, let me suggest that the community has already adapted to the "POPL does not admit enough papers" problem. Authors send their revised papers to the next conference (e.g., ICFP, OOPSLA, ESOP, SAS, VMCAI, etc.) This has helped to raise the quality of these other venues to the point where I'm seriously impressed by people who have papers in these settings. So what's happened is that the field has grown, there are more good papers, and so there are more good venues. IMHO, POPL retains such influence in part for historical reasons, and in part because there is still a quality gap. If there weren't, then someone who only has papers at ICFP or only OOPSLA wouldn't have trouble getting a position, compared to someone who has POPL papers. So again, I'm confused about what is broken and what we're trying to fix. -Greg From prakash at cs.mcgill.ca Tue Jan 12 09:18:25 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Tue, 12 Jan 2010 09:18:25 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4C84B1.2070002@cs.mcgill.ca> Thanks to Simon Peyton-Jones for sharing his articulate and well-reasoned thoughts with us. I agree that there are too few papers accepted at the best conferences and that the problem is not quality of reviewing. I would like to push for the idea that we accept many more papers (perhaps double the present number) and present them at poster sessions and have them appear in the proceedings as is done at most of the big AI conferences. Then we could have a smaller number presented as conference presentations. The other point I would like to make is that we as reviewers are far too obsessed with polished but incremental papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard but boring" problems. It is indeed hard to change the culture, but conferences are where we should get the chance to throw out ideas rather than participate in a lek. Cheers Prakash From troina at di.unito.it Tue Jan 12 10:52:14 2010 From: troina at di.unito.it (Angelo Troina) Date: Tue, 12 Jan 2010 16:52:14 +0100 Subject: [TYPES/announce] CS2Bio'10 - First Call for Papers Message-ID: <4B4C9AAE.6010801@di.unito.it> ====================================================================== First call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) - TBA *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). If the quality of the received papers deserves it, the publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, could be considered. *** IMPORTANT DATES *** - Submission deadline: 19 March 2010 - Reviews due: 23 April 2010 - Notification to authors: 30 April 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Verena Wolf - Gianluigi Zavattaro *** ORGANISERS *** - Jean Krivine - Angelo Troina From andru at cs.cornell.edu Tue Jan 12 10:57:33 2010 From: andru at cs.cornell.edu (Andrew Myers) Date: Tue, 12 Jan 2010 10:57:33 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> Message-ID: <4B4C9BED.6020209@cs.cornell.edu> The current two-phase proposal sounds to me as if it will significantly increase the amount of reviewing work without significantly increasing the quality of the reviewing process, for the reasons Derek has argued. Why not look at the approaches other communities have taken? Several major conferences in the networking, systems and security communities have changed to a different two- or three-phase reviewing process in which papers are rejected early in the process if they have enough confident negative reviews. Only the best papers and papers with low confidence continue on. I've seen this both as a PC member and as a PC chair, and in my experience, it's great. The reviewing load is increased only slightly, and both the quality of the reviews and the quality of the decision process is improved. It's also more fun and educational to be a PC member, because the average quality of the papers you review is higher. And the accepted papers get more reviews, which also improves the product. I believe Tom Anderson first introduced this idea for SIGCOMM 2006; I have more detailed notes on how this worked for IEEE Security and Privacy (Oakland) 2009. Cheers, -- Andrew From mairson at brandeis.edu Tue Jan 12 11:30:06 2010 From: mairson at brandeis.edu (Harry Mairson) Date: Tue, 12 Jan 2010 11:30:06 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <5458EABA-1958-4F79-B9F6-5C209901D64F@brandeis.edu> 1. Regarding the proposal of Simon Peyton-Jones to choose papers randomly from a list of papers judged worthy by a program committee: Last year I was talking to a college president in the Boston area (not mine) who told me exactly the same thing about prospective freshmen---the university should just select those who are above threshold, and then choose randomly. College admission is an increasingly crazy business in the US. And for sheer size, it's a bigger problem than POPL. Similarly, a close colleague of mine at another institution said to me about faculty searches: once the list gets down to 10 or 15 for a single position, it's a game of chance, even though there nominally continues to be a rational process. What Simon is suggesting is that we just put up front the meritocratically random endgame that we may already have. 2. Regarding the proposed increase in number accepted papers: I fully understand and appreciate the rationale, especially as it relates to tenure and promotion. The acceptance of a paper at POPL (among other conferences) is a valued achievement in those decisions, significant to institutions and crucial to individuals. In what way is the needed achievement devalued when the number of accepted papers is increased? Will promotion committees say, "That's a POPL paper from 201x, when they increased the size of the conference, and is not as significant as papers from 200x"? That likely analysis suggests that the number of accepted papers be increased slowly---doubling is probably not a good idea. Recognize that people on committees count because they do not understand. I ran a promotion committee (for someone outside CS) where I began the meeting by saying to its members (also outside the field), "What did this person do? Maybe we should try talking about that first." The discussion was a bit awkward---we all sounded like freshmen. As long as there is a nominally meritocratic process for tenure and promotion, it will involve scaling some sort of pyramid. The scaling and selectivity is what has defined the success: these conferences, grants, editorships, etc. It may be that we have created, instead, an obelisk. Are senior researchers who publish serially in these conferences conferring the value, or unduly increasing the pyramid's slope? What's needed is moderation. 3. Regarding the two-tier review process and the quality of reviews: I agree with Matthias Felleisen---I've not seen much of Simon's "gold dust". The quality of mercy is not strain'd, but the quality of reviewing is not improv'd. We've all received (and probably written...) reviews where we immediately recognize, "they didn't get it", and we all know the boilerplate that comprises these reviews. (I've found myself wishing that these reviews simply said, instead, "I didn't understand it and I didn't like it and I'm not interested.") The best critical reviews I've received are from colleagues who were trying to solve the same problems I was working on. Getting boxed by people who know their stuff is an educational experience in itself. When the solution of such challenging problems is a prize, then the local experts weigh in, sometimes even grudgingly, with their careful assessments---almost like sociologists of science---with their precise knowledge of what qualifies as a solution, what's winning, what's losing, what's cheating, and what's the canonical toy problem that needs solving to demonstrate that the solution is the right one. They really know (and sometimes covet) those square centimeters of the intellectual territory---most reviewers don't. The best compliment I've given colleagues is, "I wish I'd done that---and I tried." Harry Mairson -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/96ba9868/attachment.htm From scd at doc.ic.ac.uk Tue Jan 12 12:17:06 2010 From: scd at doc.ic.ac.uk (Sophia Drossopoulou) Date: Tue, 12 Jan 2010 17:17:06 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <3CC4AFA4-CDD7-433C-B90A-EECBF9E20846@doc.ic.ac.uk> <9461d7d01001120150n6c528a9ft707bffa5e1c6ef58@mail.gmail.com> Message-ID: On 12 Jan 2010, at 09:50, martin odersky wrote: > .... I would start > the conference off with a poster session where every accepted paper is > presented. I think this is a great idea, and should be adopted irrespective of whether we adopt parallel sessions, and/or increase the number of papers accepted. Sophia From wand at ccs.neu.edu Tue Jan 12 12:23:50 2010 From: wand at ccs.neu.edu (Mitchell Wand) Date: Tue, 12 Jan 2010 12:23:50 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <1bd18ad51001120923g2f301d25r590ae7a848022a8f@mail.gmail.com> "lek"-- what a wonderful word! Thank you, Prakash, for bringing it to our attention. Now on to more serious comments: I agree with most of the commenters here that the POPL proposal goes in the wrong direction. The fact that conference acceptances is so stochastic leads to a variety of bad outcomes: 1. People submit more papers. Some of these papers are recycled rejections looking for a different PC. Sometimes the comments of the first PC improve the paper for the second go-round, but my impression is that this is the exception. I suspect that the low acceptance rates lead to finer bologna-slicing, though I don't have any data to back this up. NSF observed this phenomenon when their acceptance rates got too low. (Their solution was draconian: only have a call for proposals every other year, and restrict PIs to one submission per competition. Not desirable.) 2. There is inversion of quality. I recall when PPDP was co-located with ICFP that some people would send their better papers to PPDP rather than risk rejection at ICFP. 3. There are second-order effects: For example, we require our PhD students to get an accepted paper as part of our qualifying process. We've seen perfectly good papers rejected multiple times, and we've had to create a whole structure to work around this bug. Predictable conference acceptances would avoid this problem. People on this thread have already mentioned this problem with respect to hiring. For tenure and promotion, it is probably diminished due to the longer time frame, but I'd bet it's still there. I believe that we need to get our acceptance ratio up to about 40%. I think this would drastically increase the predictability of the process. >From my time on POPL and ICFP PC's I suspect that we could reach this goal without substantial loss of quality. 1. I now think that having parallel tracks is a good idea. I used to think otherwise, but I have found it exciting to bounce around, as we do on workshop days, from one workshop to another. It also leads me to interact with more sub-communities than I would otherwise. 2. I remain dubious about poster sessions. These make it difficult for presenters to see others' presentations. It's also harder to tune out when a presentation turns out not to be of interest-- it's hard to walk away. 3. I would support a system of multiple durations, in which the PC would assign different-length time slots to different papers based on perceived quality of work, likely interest in the presentation, etc. If we adopt such a system, however, it is important that all accepted papers receive the same allocation of pages in the printed proceedings. 4. Getting good reviews is a problem, but this is a separate problem and should be dealt with separately. I suspect that the quality of the reviews is less of a problem at a 40% acceptance ratio than it is at 20%: a poor-quality review is less likely to sway the outcome. What would happen if we announced that we were doubling the number of accepted papers to POPL? In the first year, at least, I suspect that we would get many more submissions than in the past. (I'd therefore publicly state the goal in terms of number of acceptances, not in terms of acceptance ratio). Other conferences, eg ICFP and PLDI, might be forced to follow suit in order to keep their submission levels up. So we might be initiating a virtuous cycle, in which the number of good papers and the number of slots in conferences were more in balance. The additional submissions would be something of a burden to the PC committee, but probably many of the "extra" submissions would be of poor quality, and would not require much effort. I hope these thoughts are useful. --Mitch On Tue, Jan 12, 2010 at 9:18 AM, Prakash Panangaden wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Thanks to Simon Peyton-Jones for sharing his articulate and > well-reasoned thoughts with us. I agree that there are too few papers > accepted at the best conferences and that the problem is not quality of > reviewing. I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. Then we could have a smaller number presented > as conference presentations. The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. It is indeed hard to change the culture, but > conferences are where we should get the chance to throw out ideas rather > than participate in a lek. > Cheers > Prakash > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/611d88d0/attachment-0001.htm From mislove at tulane.edu Tue Jan 12 14:22:41 2010 From: mislove at tulane.edu (Michael Mislove) Date: Tue, 12 Jan 2010 13:22:41 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Along the lines of Prakash's comments, I'd like to offer a different proposal. I take as a starting point the "conventional wisdom" that the papers accepted at the leading conferences are not the 40 best papers, but perhaps 40 of the best 80 papers. No reviewing process is perfect and most select some proportion of the best submissions. I don't have confidence that changing the reviewing process will cure this - it's inherent in any subjective process that "human factors" will affect the outcome. This can range from personal preferences of PC members and their referees to biases reflected in the composition of the PC. Given this disparity, the number of papers accepted could be increased by holding poster sessions, as Prakash suggests, but I have concerns about the effectiveness of such a venue for communicating new results even to those who may be interested in them. I also believe poster session papers would not receive the same regard in promotions and tenure considerations those selected for full presentation at the meeting. I believe a better approach would be to make better use of the satellite workshops around the main conference. I suggest that an effort be made to see what proportion of the papers in these workshops were originally submitted to POPL itself. If most of the 40 "best 80" papers that were not accepted at POPL find their way into these workshops, then I would assert the real problem - if there is one - is the disparity between the quality of POPL versus that of its workshops. I'm not as familiar with POPL as I am with other series, but I'd point out that the mega conference ETAPS has a large number of satellite events, some of which are regarded as being of a quality rivaling that of the main conferences. If the same is true of POPL and if there are enough satellite workshops to accommodate the overflow from POPL, then perhaps there is no problem. If this is not the case, then POPL could found some new satellite workshops, directly sanctioned and bearing its imprimatur, and work to make sure their quality rivals that of the main meeting. It remains to determine whether papers submitted to POPL but not accepted actually ended up in one of the satellite events. A first estimate could be obtained by having the PC chair (or an interested PC member) simply look at the accepted papers for the satellite events and see how many of the top 80 submissions that were not accepted for POPL found their way onto the program of one of the workshops. This wouldn't tell the whole story (some papers that were rated highly but not accepted for POPL might have been found wanting by a satellite event, and others might not have had an appropriate venue among the satellites), but it could give some information about how many papers submitted to POPL actually were orphans. In any case, I think making better use of the satellite events would result in a better outcome than tweaking the reviewing process or expanding the number of papers accepted only to relegate the additional papers to posters at the main meeting. Best regards, Mike Mislove On Tue, Jan 12, 2010 at 8:18 AM, Prakash Panangaden wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Thanks to Simon Peyton-Jones for sharing his articulate and > well-reasoned thoughts with us. I agree that there are too few papers > accepted at the best conferences and that the problem is not quality of > reviewing. I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. Then we could have a smaller number presented > as conference presentations. The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. It is indeed hard to change the culture, but > conferences are where we should get the chance to throw out ideas rather > than participate in a lek. > Cheers > Prakash > > -- =============================================== Professor Michael Mislove Phone: +1 504 862-3441 Department of Mathematics FAX: +1 504 865-5063 Tulane University URL: http://www.math.tulane.edu/~mwm New Orleans, LA 70118 USA =============================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100112/39099535/attachment.htm From Manuela.Bujorianu at manchester.ac.uk Tue Jan 12 15:42:03 2010 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Tue, 12 Jan 2010 20:42:03 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C84B1.2070002@cs.mcgill.ca> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> Message-ID: <20100112204203.67214yky8pc21k7v@webmail.manchester.ac.uk> > I would like to push for the idea that we accept many more > papers (perhaps double the present number) and present them at poster > sessions and have them appear in the proceedings as is done at most of > the big AI conferences. I would like to complete this with the practise of submission acceptance at control engineering conferences: 40% acceptance rate for the soundness of reviewing process and parallel sessions plus interactive presentations (i.e. posters) to accommodate all accepted papers. > The other point I would like to make is > that we as reviewers are far too obsessed with polished but incremental > papers and in the theory conferences (STOC/FOCS/LICS/ICALP) with "hard > but boring" problems. Perhaps it will be worthy to remember at this point the practise at conferences in mathematics: no reviewing, abstract publication only - people meet to socialise and team up for writing journal articles. Apologies for intruding, I never attended POPL! With best seasonal wishes, Manuela From nr at cs.tufts.edu Tue Jan 12 20:03:11 2010 From: nr at cs.tufts.edu (Norman Ramsey) Date: Tue, 12 Jan 2010 20:03:11 -0500 Subject: [TYPES/announce] Request for comments: Two-phase reviewing for POPL In-Reply-To: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> (sfid-c-20100106-113704-+12.79-1@multi.osbf.lua) References: <1995.121.246.189.113.1262793757.squirrel@mail.cse.psu.edu> (sfid-c-20100106-113704-+12.79-1@multi.osbf.lua) Message-ID: <20100113010311.9FA5C60A26C77@labrador.cs.tufts.edu> > Request for comments: Two-phase reviewing for POPL > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > > ... no decision process is perfect.... The POPL Steering Committee > has formulated the following proposal, which ... aims to improve > the decision process for POPL. I have followed the discussion on the types mailing list with much interest. I am afraid I am still having problems understanding what the POPL Steering Committee believes will be improved: - Will a different set of papers be accepted? Do we expect this will be a better set than is accepted by the current process? - Will reviews be improved? The proposal seems quite costly, but I would not wish to comment on the costs without better understanding the perceived benefits. Could a member of the steering committee perhaps elaborate on what problem or problems this proposal is intended to solve? Norman From riccardo at ccs.neu.edu Tue Jan 12 22:08:28 2010 From: riccardo at ccs.neu.edu (Riccardo Pucella) Date: Tue, 12 Jan 2010 22:08:28 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Message-ID: <4916024.65521263352108687.JavaMail.root@zimbra> A quick 2 cents on one of Mike Mislove's comments: > Given this disparity, the number of papers accepted could be increased > by holding poster sessions, as Prakash suggests, but I have concerns > about the effectiveness of such a venue for communicating new results > even to those who may be interested in them. I also believe poster > session papers would not receive the same regard in promotions and > tenure considerations those selected for full presentation at the > meeting. My experience with poster papers is mainly from AI conferences. There, there is no distinction between poster papers and presented papers: same number of pages in the proceedings (8,10,whatever), and no indication in the proceedings which papers were posters and which were presented. The poster/presented distinction is purely in terms of which papers get talks, and which get, well, posters. The choice of which is mostly done using a "what would make the most interesting talk" type of question, as opposed to "what's the most important result?" Cheers, Riccardo From Lists at Alessio.Guglielmi.name Wed Jan 13 02:18:27 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Wed, 13 Jan 2010 08:18:27 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> Hello, At 09:18 -0500 12/1/10, Prakash Panangaden wrote: >It is indeed hard to change the culture, but >conferences are where we should get the chance to throw out ideas rather >than participate in a lek. Precisely: the key word is IDEAS, not papers. The hiring and tenure committees should look for, and perhaps count, IDEAS, not papers, especially if at conferences. And the conferences should serve the purpose of disseminating new ideas, not of distributing medals. There are so many `papers' produced, that, right now, in computer `science', not even the authors read their own work. Thanks to cut & paste we have now a ratio of reads/writes < 1. Ciao, -Alessio From dreyer at mpi-sws.org Wed Jan 13 05:55:26 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Wed, 13 Jan 2010 11:55:26 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> Message-ID: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> > Precisely: the key word is IDEAS, not papers. > > The hiring and tenure committees should look for, and perhaps count, > IDEAS, not papers, especially if at conferences. And the conferences > should serve the purpose of disseminating new ideas, not of > distributing medals. Given that there have been several posts with something approaching this sentiment, I would like to respectfully, and strongly, disagree. POPL and other top conferences have been a place where many great *ideas* in programming languages have been first set forth. Yes, there are definitely ways it can be improved---we can accept a larger set of good papers, and we can ensure all papers are reviewed by experts---but *fundamentally* the current system seems to me to work amazingly well. Conference papers are one of *the most effective* ways of transmitting ideas that I know. Their limited size forces the author(s) to be concise, but at least in the case of POPL the size is large enough that one has space to convey a significant contribution, with only some of the technical details left to a tech report. And the serious, *selective* peer review forces authors to communicate their ideas clearly. Furthermore, conferences' regular frequency and deadlines ensure that the ideas presented in conferences are often *not* in their final stages of fruition. They are not the final "polished" word on subject X, but a well-explained intermediate result, which may prove to be an important stepping stone to future results. That is why a good conference paper will clearly explain its limitations and suggest ways of improving the results in future work. So this claim that conference emphasize boring, polished papers over good, novel ideas is rather mind-boggling to me. It is true that conferences do favor good ideas that are well-explained and can be justified in the short term over good ideas that are somewhat sketchy or can only be justified in the long term. But this is a systemic problem with research in general---i.e. nearly everything about the "academic-industrial complex" favors concrete, short-term research over fuzzy, long-term research---and turning conferences into free-for-alls will not solve it. Of course, journals provide an important, complementary, archival role, but journal articles are not a good way of disseminating ideas quickly. They cannot scale to handle the number of submissions that conferences handle, and journal articles give more information about a piece of work than most people need to know in order to understand the main ideas. Journals do not replace conferences or vice versa. So I agree with Harry Mairson that, while change may be in order, what's needed is moderation. > There are so many `papers' produced, that, right now, in computer > `science', not even the authors read their own work. Thanks to cut & > paste we have now a ratio of reads/writes < 1. I don't know what you're talking about: I read way more papers than I write, and I read way more conference papers than journal articles in a given year, often because I am asked to review them! Most of what I learn about new ideas in PL is from reading conference papers. Best, Derek From wadler at inf.ed.ac.uk Wed Jan 13 14:25:03 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Wed, 13 Jan 2010 19:25:03 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Many thanks to Simon and everyone else who has posted in this thread for their thoughtful comments. The POPL Steering Committee has considered whether to increase the number of papers accepted, and indeed there is slow growth in the numbers accepted. The two-phase proposal is largely orthogonal to this. I initiated discussion in the POPL Steering Committee, and now the wider community, because after serving as program chair for POPL 2008, I felt that the system was carrying more weight than it could bear. We all know that refereeing is rough and ready, and decisions are not perfect. But my experience in 2008 suggested that under the increasing level of submissions that the quality of decisions was going down, while their impact on tenure and careers was going up. Anyone who's sat in a pc meeting knows there will be papers where expert reviews are lacking, and someone volunteers to read the paper overnight and provide an opinion. They will also know that innovative papers often have flaws, and the dynamics of pc meetings is that the detractors usually win out over the champions. These are the issues that two-phase reviewing is intended to address. That said, if the sense of the POPL community is similar to the sense expressed by the Types readership to date, I doubt the two-phase proposal will be adopted. If you want two-phase, speak up. If you want something else, please contact a member of the POPL Steering Committee and work with them to formulate an alternative proposal. It would be great to have a number of constructive alternatives to consider at the community meeting next week. Yours, -- P REMINDERS, FOR YOUR INFORMATION: POPL community meeting: 5:15-6:30pm Wednesday 20 January 2010. POPL Steering Committee: * Philip Wadler, current SIGPLAN Chair and 2008 Program Chair * Kathleen Fisher, past SIGPLAN Chair * Graham Hutton, current SIGPLAN Vice Chair * Chandra Krintz, past SIGPLAN Vice Chair * Thomas Ball, 2011 General Chair * Mooly Sagiv, 2011 Program Chair * Manuel Hermenegildo, 2010 General Chair * Jens Palsberg, 2010 Program Chair * Zhong Shao, 2009 General Chair * Benjamin Pierce, 2009 Program Chair * George Necula, 2008 General Chair * Martin Hofman, 2007 General Chair * Matthias Felleisen, 2007 Program Chair -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From rwh at cs.cmu.edu Wed Jan 13 16:14:38 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Wed, 13 Jan 2010 16:14:38 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> Message-ID: <2587037B-04D8-489F-AEC0-842D08B19CBB@cs.cmu.edu> After reading many of the thoughtful responses, I thought it might be worthwhile to add a few further remarks: 1. Mostly, I am against the ever-increasing officiousness of the conference reviewing process: double-blind reviews, author response period, two-stage review process, absurd conflict of interest rules, program committee make-up restrictions, etc, etc, etc. It's all totally unnecessary and in many cases counterproductive. For example, the outlandish conflict of interest rules have ensured in many cases that no competent person can review a submission, because anyone with any expertise may well have had a beer with the author within the last fifteen years (or whatever the current rule may be). 2. I am somewhat sympathetic to the idea that it may make sense to expand the number of papers presented at the top conferences. Here I find Mike Mislove's proposal most persuasive (in fact, we're already doing this to some extent). Why not hold a Federated Programming Languages Conference in which we, at least on occasion and perhaps regularly, seek to consolidate as many meetings in the PL area as we can to encourage publication and attendance? 3. The tenure and promotion process is always a vexed issue because the fact is that the decision is pretty much invariably made in a state of ignorance by most of those involved. We rely heavily on letters of reference, and letter writers back up their claims about a candidate by pointing to publications in venues like POPL. This process is imperfect, but it's not as though there's a better one just waiting to be adopted. Meanwhile, why should POPL neuter itself as playing a decisive role in determining the direction of the field? It will be determined _somehow_ by a process that is surely to be imperfect; I don't see that relyng on publication at POPL as an all- that-terrible a way to do things. Bob From mwh at cs.umd.edu Wed Jan 13 18:47:38 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 13 Jan 2010 17:47:38 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <4B4C9BED.6020209@cs.cornell.edu> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <4B4C9BED.6020209@cs.cornell.edu> Message-ID: It seems like a common desire in the many interesting responses so far is to increase the effectiveness of the review process, to accept deserving papers, and to provide good feedback to papers that need a bit more work. I'd just like to add my voice to Andrew's (below) that tiered reviewing works well toward achieving these goals, somewhat to my surprise. The multiple phases of review increases the chances of obtaining expert reviews. The filtering in the early phases ensures that interesting, but not universally-acceptable papers get more reviews, which improves the quality of feedback. I was a bit worried that early-phase filtering might unfairly remove papers from the process, but I don't believe that has ever happened on the PCs I've been on; i.e., even a fairly conservative criterion for eliminating papers from further consideration (e.g., the first two reviews are both 'D') worked very well. I'm sure Andrew can provide more stats on this, for those interested. Also, I've found the PLDI and ISMM "review committee" approach to expanding the review pool to work pretty well, but I have no general stats on that. -Mike On Jan 12, 2010, at 9:57 AM, Andrew Myers wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > The current two-phase proposal sounds to me as if it will > significantly > increase the amount of reviewing work without significantly increasing > the quality of the reviewing process, for the reasons Derek has > argued. > > Why not look at the approaches other communities have taken? Several > major conferences in the networking, systems and security communities > have changed to a different two- or three-phase reviewing process in > which papers are rejected early in the process if they have enough > confident negative reviews. Only the best papers and papers with low > confidence continue on. I've seen this both as a PC member and as a PC > chair, and in my experience, it's great. The reviewing load is > increased > only slightly, and both the quality of the reviews and the quality of > the decision process is improved. It's also more fun and educational > to > be a PC member, because the average quality of the papers you review > is > higher. And the accepted papers get more reviews, which also improves > the product. > > I believe Tom Anderson first introduced this idea for SIGCOMM 2006; I > have more detailed notes on how this worked for IEEE Security and > Privacy (Oakland) 2009. > > Cheers, > > -- Andrew From andrews at csd.uwo.ca Wed Jan 13 19:16:31 2010 From: andrews at csd.uwo.ca (Jamie Andrews) Date: Wed, 13 Jan 2010 19:16:31 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> Message-ID: A data point from another area that I do research in... The Automated Software Engineering conference (ASE) gets submissions in the form of 10-page papers, and accepts them as either "long papers" or "short papers". Long papers get 10 pages in the conference proceedings, and a 25-minute talk at the conference. Short papers get 4 pages in the proceedings, no talk, and a poster at a poster session. ASE has the poster session in a clean well-lighted place, in a prominent spot in the schedule, with no other parallel session going on, so that poster presenters get the most out of the discussions around their posters. I have had papers accepted there as either long or short papers. I am disappointed when a paper is accepted as short, because it does mean it was not as well loved as the long papers. On the other hand, I have had good discussions at the poster sessions. A 10-minute discussion in front of a large, detailed poster beats a 5-minute Q&A after a talk, or a 20-minute discussion over lunch with only napkins to write on. The paper shows up on my resume as a 4-page paper at a conference, which is what it is, not stigmatized by a label like "poster". I'm not saying it's perfect (e.g., there is endless debate in the PC about what should be accepted as short and what as long). However, it seems to work pretty well and gets more people involved than is possible when every accepted paper corresponds to a 25-minute talk in a session. cheers --Jamie. From dpw at CS.Princeton.EDU Wed Jan 13 22:49:01 2010 From: dpw at CS.Princeton.EDU (David Walker) Date: Wed, 13 Jan 2010 22:49:01 -0500 (EST) Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <1833250288.827901263440858933.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> > Anyone who's sat in a pc meeting knows there will be papers > where expert reviews are lacking, and someone volunteers to > read the paper overnight and provide an opinion. -- I think this could be solved by requiring reviews be due 1 week (or 2 weeks) before the meeting. At that point, the PC could identify those papers with low quality reviews and solicit another one or two from experts. This minor deviation from current practice would seem to be a direct solution to the stated problem. -- Another solution: Don't have double-blind reviewing. Double-blind reviewing requires going through the PC chair to get external reviews, which disincentivizes getting these reviews even when you aren't an expert yourself. -- Another solution: Expand the PC and/or have a greater percentage of the reviews be from external reviewers. The goal would be to reduce the number of papers each PC member reviews. My current experience with PLDI suggests I have a fixed total amount of time & energy for reviewing regardless of how many papers I have to review. If I had to review 15-20 papers instead of 25, my 15-20 reviews would be better than the 25. I also wonder, if there was 2-phase reviewing, whether my first phase reviews may be worse, because I have to save time and energy for the second phase. Or alternatively, I wonder if might be too burned out by the first phase to do anything useful for the second phase. > They will > also know that innovative papers often have flaws, and the > dynamics of pc meetings is that the detractors usually win > out over the champions. These are the issues that two-phase > reviewing is intended to address. -- Will more rounds of reviewing or more in-depth reviewing flip the dynamic so that champions win over detractors? If somebody wants to trash a paper, they can. With more effort invested, they can generally find more holes to poke in the work. I'm skeptical the proposed scheme will help solve this problem. -------------- Two other comments: -- I would massively disagree with any proposal in which some papers are not presented or there is disproportionate talk time given to certain papers, especially based on voting. Who would ever vote to have a student you have never heard of give a talk over Simon Peyton Jones? No one. I'd be voting for Simon every single time without even bothering to look at the paper! And imagine your student has one great result and one great POPL paper and a coin flip means they don't get to present. I could easily see this leading to the student missing out on getting interviews. -- If you want to change journal/conference culture, let's not change POPL or PLDI. Let's change TOPLAS instead: have TOPLAS papers accepted that year presented at POPL or PLDI or ICFP or OOPSLAA to attract attention to them. Dave From dreyer at mpi-sws.org Thu Jan 14 03:33:06 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Thu, 14 Jan 2010 09:33:06 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> References: <1833250288.827901263440858933.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> <453356116.827921263440941577.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <7fa251b71001140033o5d8e809bu934584d00672abc7@mail.gmail.com> >> Anyone who's sat in a pc meeting knows there will be papers >> where expert reviews are lacking, and someone volunteers to >> read the paper overnight and provide an opinion. > > -- I think this could be solved by requiring reviews be due > 1 week (or 2 weeks) before the meeting. ?At that point, > the PC could identify those papers with low quality reviews and > solicit another one or two from experts. ?This minor deviation > from current practice would seem to be a direct solution to > the stated problem. In fact, this *is* the current practice, at least for POPL. In the past few years, the author response period has occurred a full week before the PC meeting, and I know for a fact that a number of expert reviews have been requested during that period. Moreover, for POPL 2011, the PC is planning an even longer period of 2 weeks between the author response period and the physical PC meeting, precisely in order to allow sufficient time to identify and debate contentious and/or inadequately-reviewed papers online, and to seek further expert reviews for them. Regarding all of Dave's other comments, I agree with them 100%. Derek > -- Another solution: ?Don't have double-blind reviewing. ?Double-blind > reviewing requires going through the PC chair to get external reviews, > which disincentivizes getting these reviews even when you aren't an > expert yourself. > > -- Another solution: ?Expand the PC and/or have a greater percentage of the > reviews be from external reviewers. ?The goal would be to reduce the number > of papers each PC member reviews. ?My current experience with PLDI suggests > I have a fixed total amount of time & energy for reviewing regardless of how > many papers I have to review. ?If I had to review 15-20 papers instead of 25, > my 15-20 reviews would be better than the 25. ?I also wonder, if there > was 2-phase reviewing, whether my first phase reviews may be worse, because I have > to save time and energy for the second phase. ?Or alternatively, I wonder if > might be too burned out by the first phase to do anything useful for the > second phase. > >> They will >> also know that innovative papers often have flaws, and the >> dynamics of pc meetings is that the detractors usually win >> out over the champions. ?These are the issues that two-phase >> reviewing is intended to address. > > -- Will more rounds of reviewing or more in-depth reviewing flip > the dynamic so that champions win over detractors? ?If somebody > wants to trash a paper, they can. ?With more effort invested, > they can generally find more holes to poke in the work. ?I'm > skeptical the proposed scheme will help solve this problem. > > -------------- > > Two other comments: > > -- I would massively disagree with any proposal in which some papers are not > presented or there is disproportionate talk time given to certain papers, > especially based on voting. ?Who would ever vote to have a student you have > never heard of give a talk over Simon Peyton Jones? ?No one. I'd be voting for > Simon every single time without even bothering to look at the paper! ?And imagine > your student has one great result and one great POPL paper and a coin flip > means they don't get to present. ?I could easily see this leading to the > student missing out on getting interviews. > > -- If you want to change journal/conference culture, let's not change POPL or > PLDI. ?Let's change TOPLAS instead: ?have TOPLAS papers accepted that year > presented at POPL or PLDI or ICFP or OOPSLAA to attract attention to them. > > Dave > From patrick.baillot at ens-lyon.fr Thu Jan 14 04:36:12 2010 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Thu, 14 Jan 2010 10:36:12 +0100 Subject: [TYPES/announce] DICE 2010 workshop -- Call for short presentations Message-ID: <20100114103612.285237txv7ck2zrg@webmail.ens-lyon.fr> - deadline for submission of short presentations: January 28, 2010 - notification: February 5, 2010 ====================================================== Call for short presentations International Workshop on Developments in Implicit Computational complExity (DICE 2010) http://www.ens-lyon.fr/LIP/DICE2010/ March 27-28, 2010, Paphos, Cyprus as part of ETAPS 2010 ====================================================== SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity. - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) Recent meetings on this topic have been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html), and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html), which motivated the organization of an international event at ETAPS 2010. INVITED SPEAKERS: Amir Ben-Amram (Tel-Aviv) Simone Martini (Bologna) IMPORTANT DATES: * Full paper submission: * December 21, 2009 * (closed) * Short presentation (extended abstract) submission:* January 28,2010 * * Notification for full papers: January 27, 2010 Notification for short presentations: February 5, 2010 * Final version of full papers due: February 8, 2010 * Workshop: March 27-28, 2010 STUDENT GRANTS: A limited number of student grants will be available for some PhD or Master students presenting a paper at the workshop, so as to cover their local expenses and registration. Students who have not yet defended their PhD or have defended it after September 2009 are eligible. To apply for a grant, send by * January 4, 2010* (extended), a mail to patrick.baillot at ens-lyon.fr , with subject line 'DICE 2010 student grant application' , containing: (i) a short recommendation letter by your PhD/Master advisor, (ii) a scan of your university student card justifying your status. SUBMISSION PROCEDURE: The workshop proceedings will be published in the new EPTCS series (Electronic Proceedings in Theoretical Computer Science, http://www.cse.unsw.edu.au/~rvg/EPTCS/). There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be submitted electronically, as pdf files, in the EPTCS format, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. If the number and the quality of submissions justifies it, the publication of a special issue of a journal devoted to the workshop will be considered. PROGRAMME COMMITTEE: * Patrick Baillot (CNRS-ENS Lyon) (chair) * Ugo Dal Lago (University of Bologna) * Martin Hofmann (LMU Munich) * Lars Kristiansen (University of Oslo) * Daniel Leivant (Indiana University) * Jean-Yves Marion (Nancy University) * Virgile Mogbil (University Paris 13) * Simona Ronchi Della Rocca (University of Torino) * Olha Shkaravska (Radboud University, Nijmegen) * Kazushige Terui (University of Kyoto) * Lorenzo Tortora de Falco (University Roma Tre) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: patrick.baillot at ens-lyon.fr From alain.girault at inria.fr Thu Jan 14 04:57:21 2010 From: alain.girault at inria.fr (Alain Girault) Date: Thu, 14 Jan 2010 10:57:21 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: Message-ID: <4B4EEA81.6020903@inria.fr> Jamie Andrews wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > A data point from another area that I do research in... > > The Automated Software Engineering conference (ASE) gets > submissions in the form of 10-page papers, and accepts them as > either "long papers" or "short papers". Long papers get 10 > pages in the conference proceedings, and a 25-minute talk at the > conference. Short papers get 4 pages in the proceedings, no > talk, and a poster at a poster session. ASE has the poster > session in a clean well-lighted place, in a prominent spot in > the schedule, with no other parallel session going on, so that > poster presenters get the most out of the discussions around > their posters. > > I have had papers accepted there as either long or short > papers. I am disappointed when a paper is accepted as short, > because it does mean it was not as well loved as the long > papers. On the other hand, I have had good discussions at the > poster sessions. A 10-minute discussion in front of a large, > detailed poster beats a 5-minute Q&A after a talk, or a > 20-minute discussion over lunch with only napkins to write on. > The paper shows up on my resume as a 4-page paper at a > conference, which is what it is, not stigmatized by a label like > "poster". > > I'm not saying it's perfect (e.g., there is endless debate > in the PC about what should be accepted as short and what as > long). However, it seems to work pretty well and gets more > people involved than is possible when every accepted paper > corresponds to a 25-minute talk in a session. To avoid the problems you mention, why not allow all the papers 10 pages in the proceedings; since the proceedings are electronic, space is not an issue; plus, reducing a paper from 10 pages to 4 pages is always very frustrating, difficult, and very long. Then, instead of selecting oral presentation versus poster presentation based on the ranks of the papers, do it randomly. That way, researchers who come regularly at POPL will experience both ways of presenting their work, and since the decision will be made randomly, attendees will not be tempted to skip the poster session because they will know that, statistically, 50% of the best papers of the conference are there. Usually people skip poster presentations because they have the wrong feeling that these are the "low-end" papers. Random selection will avoid that. P.S. This 50% figure assumes that half the papers are presented as posters, which by the way will allow you to double the number of accepted papers. best regards Alain -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From marcello at liacs.nl Thu Jan 14 05:19:49 2010 From: marcello at liacs.nl (Marcello M. Bonsangue) Date: Thu, 14 Jan 2010 11:19:49 +0100 (CET) Subject: [TYPES/announce] Two PhD positions in theoretical computer science Message-ID: <556095a06507b7490cadeda8d97e4a49.squirrel@webmail.liacs.nl> Vacancies for PhD positions in theoretical computer science =========================================================== Leiden Institute of Advanced Computer Science (LIACS) of Leiden University and Centrum Wiskunde & Informatica (CWI) in Amsterdam are looking for two PhD students for working in the NWO funded research project CoRE: Coinductive Calculi of Regular Expressions The purpose of the project is to use the theory of coalgebras and Kleene algebras for automatic reasoning and verification of quantitative and probabilistic systems, interactive systems and advanced functional programs. We are looking for excellent candidates with a background (Master degree) in mathematics, computer science or a related degree and who have strong interest in the mathematical foundations of computer science. Conditions of employment ------------------------ There are two PhD positions available. One candidate will be employed at LIACS in the Foundations of Software Technology (FAST) group. The other will be employed at CWI in the Coordination Languages group (SEN3) in the sub-group `Coalgebraic Models of Computation' led by Prof. Jan Rutten. Both groups provide a dynamic and productive work environment, are in close collaboration with each other and are involved in several national and international research projects. Both PhD candidates will be appointed for a period of four years and will receive salary based on a full-time employment. The salary and labour agreements are in accordance with the CAO for Dutch universities and research institutes. How to Apply? ------------- You are invited to send your application letter together with a curriculum vitae (including a list of master courses), an abstract of your master thesis or a list of publications, and the names and contact addresses of two potential referees. Please send your application before 1 March 2010 to: Marcello Bonsangue and Milad Niqui From shilov at iis.nsk.su Thu Jan 14 06:26:39 2010 From: shilov at iis.nsk.su (shilov@iis.nsk.su) Date: Thu, 14 Jan 2010 17:26:39 +0600 Subject: [TYPES/announce] CFP: Workshop on Program Semantics, Specification and Verification (PSSV 2010, June 14-15, 2010 in Kazan, Russia) Message-ID: <8F1119352A264D1D87E4BFEFAA60E922@fitmobile01> PSSV 2010 Call for Papers The Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2010) affiliated with 5th International Computer Science Symposium in Russia (CSR-2010, http://csr2010.antat.ru , June 16-20, 2010) will be held on June 14-15, 2010 in Kazan, Russia. =========================================== Important dates Extended abstract submission: March 10, 2010 Notification: March 31, 2010 =========================================== Official languages: English and Russian =========================================== Scope and Topics Research, work in progress and position papers are welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics; * formal models and semantics of programs and systems; * semantics of programming and specification languages; * formal specification of programs and systems; * logics for formal specification and verification; * deductive program verification; * model checking of programs and systems; * formal approach to testing and validation; * software verification tools. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee * Natasha Alechina (University of Nottingham, UK) * Boris Konev (University of Liverpool, UK) * Victor Kuliamin (Institute for System Programming, Moscow, Russia) * Nikolay V. Shilov (Institute of Informatics Systems, Novosibirsk, Russia) * Natalia Sidorova (Techn. University Eindhoven, Netherlands) * Vladimir Zakharov (Moscow State University, Russia) =========================================== Submission and Publication Program committee plans to have contributed talks and posters presentations. Program Committee invites submissions in the form of extended abstracts with length up to 6 pages A4 in 12 pt font with line-spacing 1.5 intervals (in English or in Russian). Additional details may be included in an appendix up to 4 pages for Program Committee. Submissions should be in PDF format and should be sent (as attachments) by e-mail to Alexei Promsky (Inst. of Informatics Systems, Novosibirsk, Russia) promsky at iis.nsk.su All accepted papers will be published in the preliminary proceedings before the workshop and the volume of the proceedings will be distributed at the workshop. Selected papers will be published after the workshop in one of Russian peer-review journals. At least one author of every accepted paper should present a talk in the workshop. From alur at seas.upenn.edu Thu Jan 14 10:32:12 2010 From: alur at seas.upenn.edu (Rajeev Alur) Date: Thu, 14 Jan 2010 10:32:12 -0500 Subject: [TYPES/announce] Proposed changes to POPL review process Message-ID: <4B4F38FC.7040507@seas.upenn.edu> Dear Phil, It has been interesting to see all these responses to the two-phase proposal. I also think two-phase reviewing is not that great. One additional drawback I see is that getting rejection after the second phase will amplify the frustration (particularly for starting graduate students). I feel that low acceptance ratio of POPL is a desirable feature, it is critical to its reputation, and I would hate to see that go up significantly. As an aside, some people have essentially suggested that "since number of POPL papers impacts tenure, we should make it easy for researchers to publish in POPL". I do not find this argument compelling. In fact, I am not aware any committee counting this number. What matters is whether senior POPL researchers are impressed by your work, and given that POPL is selective, easiest way for someone to gain attention is by publishing papers in POPL. Fortunately, selection is based on merit, so this presents a clear recipe to draw attention to your work. If POPL is not selective, then the only way would be to be a student of a famous advisor. In fields such as control theory, top conferences such as CDC have high acceptance rates, and indeed good pedigree is a necessity. In any case, POPL review process should focus on selecting best papers and maintaining high quality, without worrying about other factors. More constructively: conferences such as LICS and CAV use electronic PC meeting. I have been on POPL PC once and PLDI PC once, but I have a lot more experience with LICS and CAV (also as PC Chair for both). The problem with POPL (or LICS/CAV for that matter) initial reviews is not the quality (with some exceptions, most papers' contribution is very clear from the reviews), and also not the selective biases of individuals (which are a given, and also, useful, otherwise no evaluation would be possible), but rather that assignment of letter grades A/B/C/D in a distributed manner. For example, a clear technical advance on a well-studied problem may get a B or a C depending on the reviewer. This can make a huge difference, and thus, the same paper rejected from one conference may get accepted the next time, making the process unpredictable. The goal of the PC meeting is to correct for this bias. But the physical meeting is not conducive to correcting this. For a given paper, the opinion of the person whose interests match most closely with the paper, counts more (but it should not: experts' reviews are useful, not his/her biases on what to do with supposedly incremental, or supposedly theoretical-that-will-never-work, or supposedly practical-but-not-conceptually-deep papers). Also, more vocal people get more influence. Time pressure impacts decisions. In practice, PC members are actively involved only in papers they have been assigned, maintaining the distributed nature of the process. What one says on the spur of moment weighs more than what one writes after careful thought, editing, and sanity checks. Thus, physical PC meeting adds unpredictable noise in the selection process. These are less of a problem in an electronic PC meeting. I think every PC member needs to look at all the papers, and focus on selecting best X submissions based on reviews by applying his/her bias uniformly (and not just to one's own pile). This is easier to do on a longer time scale of electronic PC meeting. Bottomline: not clear why POPL does not switch to electronic PC meeting. More dramatically: I mentioned this to Jens after this year's POPL meeting: abolish the PC (i.e. reduce its role to a "reviewers committee" of an exapnded size). Two or three co-chairs can collect reviews for each paper from those who are real experts on the subject. Then based on the reviews, make a decision applying fair and uniform standards. This is not as bad as it sounds. Jens indeed spent a lot of time browsing through all submissions anyway, and could have easily picked the papers after looking at the reviews. Maybe a single person's bias would be detrimental, but, say 3, would make the process better than it is now (and reduce the cumulative amount of time one would spend on POPL PC duties). best regards --rajeev From monnier at iro.umontreal.ca Thu Jan 14 11:20:15 2010 From: monnier at iro.umontreal.ca (Stefan Monnier) Date: Thu, 14 Jan 2010 11:20:15 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: (Philip Wadler's message of "Wed, 13 Jan 2010 19:25:03 +0000") References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: 1. random-choice is good Since people seem to agree that the current selection process is somewhat arbitrary, and too conservative, I think that the human selection should only be used to select the "acceptable papers", and then a random choice can be used to pick the N papers we can accomodate. This has already been suggested here, where "acceptable" is used to decide whether to include it in the proceedings and the random choice decides whether you get a time slot, but if noone likes this option, we could use the random choice directly to pick the set of papers to include in the proceedings. It may sound outrageous (to quote David "imagine your student has one great result and one great POPL paper and a coin flip means they don't get to ..."), but it's not clear it would be worse than what we already have, and it would probably reduce the load on PC members. 2. shortening presentations To take an example from yet another field: in literature, conference presentations don't come with papers at all. You submit an abstract (like half a page) and the rest is purely oral (even slides are unusual). It shows that proceedings and presentations really don't have to go hand in hand. So we may want to make the link between the two a bit more loose. In many ways, conference talks are ways to promote the article: 25 minutes aren't enough to really show much more than the very general idea and the kind of problems it might solve. So shortening some of the talks even more might not be such a bad idea. I might go even further and suggest we shorten all the talks down to 10minutes. We could link that idea with stronger "sessions" that add a longer discussion period shared among all the presenters, so the few talks that need/deserve more time get it back in the form of a discussion. This might also make the conferences themselves more lively (rather than only having life in the backroom talks). Stefan From rm27 at cornell.edu Thu Jan 14 11:43:23 2010 From: rm27 at cornell.edu (Rod Moten) Date: Thu, 14 Jan 2010 11:43:23 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4F49AB.2090208@cornell.edu> I haven't been to a POPL conference in years, but shortening the presentations to 10 minutes is a bad idea. You should give more time instead of less. How long does it take to determine your findings that you present at POPL? How many people did it take to determine those findings? How much funding was needed? How valuable to the community are the findings? I think the answers to these questions should determine the selection process and the length of presentations. Just my $0.02. Stefan Monnier wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > 1. random-choice is good > > Since people seem to agree that the current selection process is > somewhat arbitrary, and too conservative, I think that the human > selection should only be used to select the "acceptable papers", and > then a random choice can be used to pick the N papers we can accomodate. > > This has already been suggested here, where "acceptable" is used to > decide whether to include it in the proceedings and the random choice > decides whether you get a time slot, but if noone likes this option, we > could use the random choice directly to pick the set of papers to > include in the proceedings. It may sound outrageous (to quote David > "imagine your student has one great result and one great POPL paper and > a coin flip means they don't get to ..."), but it's not clear it would > be worse than what we already have, and it would probably reduce the > load on PC members. > > 2. shortening presentations > > To take an example from yet another field: in literature, conference > presentations don't come with papers at all. You submit an abstract > (like half a page) and the rest is purely oral (even slides are > unusual). It shows that proceedings and presentations really don't have > to go hand in hand. So we may want to make the link between the two > a bit more loose. In many ways, conference talks are ways to promote > the article: 25 minutes aren't enough to really show much more than the > very general idea and the kind of problems it might solve. > So shortening some of the talks even more might not be such a bad idea. > I might go even further and suggest we shorten all the talks down to > 10minutes. We could link that idea with stronger "sessions" that add > a longer discussion period shared among all the presenters, so the few > talks that need/deserve more time get it back in the form of > a discussion. This might also make the conferences themselves more > lively (rather than only having life in the backroom talks). > > > Stefan > > From andru at cs.cornell.edu Thu Jan 14 11:47:21 2010 From: andru at cs.cornell.edu (Andrew Myers) Date: Thu, 14 Jan 2010 11:47:21 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <7BD6B94C-9036-4899-85BF-79E5B1315537@ccs.neu.edu> <4B4C9BED.6020209@cs.cornell.edu> Message-ID: <4B4F4A99.8080304@cs.cornell.edu> Michael Hicks wrote: > I'd just like to add my voice to Andrew's (below) that tiered > reviewing works well toward achieving these goals, somewhat to my > surprise. The multiple phases of review increases the chances of > obtaining expert reviews. The filtering in the early phases ensures > that interesting, but not universally-acceptable papers get more > reviews, which improves the quality of feedback. I was a bit worried > that early-phase filtering might unfairly remove papers from the > process, but I don't believe that has ever happened on the PCs I've > been on; i.e., even a fairly conservative criterion for eliminating > papers from further consideration (e.g., the first two reviews are > both 'D') worked very well. I'm sure Andrew can provide more stats on > this, for those interested. > I've posted the part of the Oakland 2009 chair's report that talks about the three-round reviewing process used there to: http://www.cs.cornell.edu/andru/oakland09/reviewing-slides.pdf We had 253 submissions and got that down to 26 accepts with 5-8 reviews per accepted paper. Reviewing load was about 20-23 papers per PC member. There were 25 people at the physical PC meeting (I think a physical PC meeting is important for a 'top' conference in its area). The keys to making this work were 1) to have the PC split into 'heavy' and 'light' contingents -- this is different from the external review committee approach used in recent PL conferences, and 2) to filter papers in early rounds. To aid filtering, I think it was useful to have a 6-point rating scale with clearly defined semantics and ratings above A and below D (strong accept/reject). The slides have the timeline and the numbers, which do matter if you're trying to engineer a similar process. -- Andrew From jonathan.aldrich at cs.cmu.edu Thu Jan 14 12:13:18 2010 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Thu, 14 Jan 2010 12:13:18 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <4B4F50AE.80001@cs.cmu.edu> I appreciate the ongoing conversation, and have some input and ideas to add. 1) There is a *ton* of great work in this community, and since it has grown over time, the number of papers accepted should grow also. Accepting 25-30% would not lower the quality appreciably, but it would help ensure a broader program and focus the decision on "is this of the right quality" and reduce the impulse to inject reviewer bias (e.g. about topic) into reviews. 2) Presentations are very important. They're a great way to learn about other work. They are *especially* important as a way way for students (who may not already know many people in the field) to get exposure. This hasn't been emphasized so far in the conversation. I'm ok with shortening presentations a bit, and going to a multi-track event is a good idea. But let's continue to ensure that all published papers can be presented in a main conference session, not a poster session. 3) A journal-like process would be *great* to have as an option for submitting to POPL--i.e. submit at any time, review can include more than one stage with revisions, and accepted papers appear in the next POPL whenever it is. If this option were available I would use it more often than the "regular" POPL process. I personally am happy to contribute to making this happen. 4) Recruiting a single group of papers but accepting them in 2 "tiered" categories, i.e. short/long or present/not--is a bad idea. If I submitted a paper to POPL and it got accepted but "demoted" to an inferior category I would strongly consider withdrawing the paper and submitting to another venue--or not submitting in the first place. 5) More than one paper track, where people submit to different tracks, may be worth considering. OOPSLA has added a track (now a co-located conference) called "Onward!" which is specifically intended to accept exceptionally innovative, but perhaps not as well validated, papers. There are tradeoffs in this approach--less validation often means more disagreement about quality--but having a second track recognizes that there is more than one dimension to "good" papers and helps to ensure that more "out of the the box" work can be considered. 6) Random choice is terrible. Use it for computing algorithms, but not for conference paper or presentation selection. It is especially cruel to submit our students to a random process--even if the current process is imperfect, explicit randomness could only make it worse. I would probably never submit to POPL if there were a random choice element. 7) The proposed 2-phase POPL process may improve results, but it will also increase reviewing costs and likely increase lead time. I think a journal-like option (perhaps in addition to the normal submission) would be a better investment of reviewing effort; then authors can choose if they want the greater lead time in exchange for a journal-like process. Thanks to the POPL steering committee for gathering input on this important issue! Jonathan Aldrich From dutchyn at cs.usask.ca Thu Jan 14 12:32:34 2010 From: dutchyn at cs.usask.ca (Christopher Dutchyn) Date: Thu, 14 Jan 2010 11:32:34 -0600 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <53C957BA-6469-4476-856C-F6C883B343E5@cs.usask.ca> On 2010-01-14, at 10:20 AM, Stefan Monnier wrote: > 1. random-choice is good As a relative outsider, my POPL publication record is "in my future", please recognize that I cannot speak with the authority and experience that others wield. But, my gut-reaction to this is "NO!". Recognizing that there is arbitrariness in the selection process doesn't mean we should institutionalize it -- imagine the impact on POPL's reputation as demonstrated by the following conversation: In a hallway somewhere A) "My paper was accepted to POPL -- a premier PL conference." B) "Don't they pick those things randomly?" (thinking to himself: it was pure luck.) I believe the impact of developing a reputation of picking randomly has no upside, and significant risk/cost. I would suggest an alternative way to select 40 from among the 80 meritous papers: how do they fit together into a well-rounded conference? There should be some Group 1 "this area is now solved, here are the details" papers -- these would arise from considering the hot topics over the last few years. There should be some Group 2 "I've made significant progress" papers, in current hot topics; preferably grouped by topic into sessions of three papers, almost a mini-workshop. If papers can't be put into a session in that way, then they're candidates for "reject until next year." There should be some Group 3 "this is novel/unusual/risky/interesting" which move the area into new directions; these are subjective criteria, and the PC needs to actively encourage these potentially incomplete, but strong submissions. This scheme has the advantage that a strong Group 2, but rejected, paper might still be a POPL paper next year because next year it will fit into the track better. I would consider resubmitting papers for which POPL is the right audience/venue. I would ask that the reviewers state "acceptable but didn't fit" for all of the 40 papers rejected on that basis. Furthermore, I believe the PC and especially the chair, have a responsibility to always accept "off-cycle" papers that are seminal, head-and-shoulders above the pack. > 2. shortening presentations I like this idea. A junior researcher, Christopher Dutchyn Assistant Professor, Computer Science, University of Saskatchewan -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100114/8a09c942/attachment-0001.htm From rinard at csail.mit.edu Thu Jan 14 12:32:36 2010 From: rinard at csail.mit.edu (Martin Rinard) Date: Thu, 14 Jan 2010 12:32:36 -0500 Subject: [TYPES/announce] POPL Review Process Message-ID: <19279.21812.617312.614472@cagsrv.csail.mit.edu> I am in complete agreement with Simon's proposal to increase the number of papers accepted at POPL (and other programming language conferences). I would like to add some reasons why I believe the field as a whole would be better served by accepting more papers. 1) The current very selective process makes it difficult for program committees to accept papers that go against the existing value system of the field. Such papers will almost always have at least one strong detractor, which makes the paper virtually impossible to accept over papers that are well-executed but more conservative (and therefore present less provocative ideas). The immediate negative impact of this situation is that the field loses the benefit of the new ideas in the rejected paper. A more subtle but arguably more pernicious effect is that researchers are motivated to perform relatively incremental research that reinforces the existing value system rather than more adventurous research that challenges the value system. I would not be surprised at all if this motivation is currently skewing the research that people in the field choose to do. An alternate, and potentially much more damaging possibility, is that people who are interested in innovation, creativity, and challenging the status quo choose not to enter the field in the first place. The overall effect is to suppress innovation and hamper the intellectual development of the field over time. This is bad for the field both internally and as it competes with other fields. Based on my interaction with colleagues in a variety of situations, POPL is viewed as publishing technically excellent but conservative papers. This perception (which I believe has some justification in reality) is bad for the field - I have seen it negatively impact the perception of researchers who publish in POPL. 2) My first four submitted papers (two of which were POPL papers) were all accepted. Anecdotally I have observed a similar pattern with many other students who chose to pursue research careers. I believe that this early positive experience with the field helps students view the whole research endeavor positively and motivates them to stay in the field. The current publication process winds up rejecting many papers that are at least as deserving of publication as the papers that are accepted. Students who experience this kind of unjustified rejection can easily come to view the system (again with some basis in reality) as unfairly and arbitrarily failing to recognize legitimate accomplishment. As a result they become disillusioned with research and choose to pursue careers in other areas. By the way, I am not alone in this perception - I have heard other senior faculty express their frustration with the effect that the current publication process has on their students. 3) Greg Morrisett makes the point that rejected POPL papers are often published in other conferences. This is true, which mitigates some of the negative effects, but it is hardly an ideal situation. First, the publication delay denies the field timely access to the idea. Second, the publication delay runs the risk of getting the priority for the idea in the paper wrong. Finally, the proliferation of conferences fragments the field and hampers the useful interchange of ideas between subcommunities. 4) Rajeev Alur (and Simon Peyton-Jones, although he comes to a different conclusion) makes the point that selectivity can enhance both the reputation and visibility of the accepted papers. I agree with this point and indeed, believe that I have benefited enormously from this phenomenon myself. The problem is that the field has tipped over into a situation in which there are not enough slots in the top conferences to publish clearly deserving papers. There are two negative effects: a) The process becomes arbitrary and unfair because it becomes next to impossible to separate the top, say, 40 papers from the next 20 papers based on merit. b) The selection criteria become biased to counterproductively emphasize execution and conformance to the existing value system over innovation and creativity, with long-term negative consequences for the development of the field as detailed above. In my view these negative effects, at this point in time, more than counterbalance the positive effects of an extremely selective system. Another way to look at this is that the growth in the field (over the last two decades) has outstripped the growth in the number of papers published at POPL, to the point that POPL is no longer an effective publication outlet for the field as a whole. So why is accepting more papers the right way to attack this problem at this time? Because it effectively addresses so many of the problems above. First, it removes some of the selection pressure and makes room for more innovative papers in the short run and more innovative research programs in the long run. Second, it provides a fairer publication process that recognizes accomplishment and makes the field more attractive to students who are looking for such a field. Third, it maximizes publication timeliness. Finally, it would enable (but certainly not require if this were not to be perceived to be desirable) the creation of fewer but broader conferences that help facilitate communication across subfields. In the long term, of course, the most productive course is to move to a more standard conference/journal system in which the purpose of conferences is to enable the fast dissemenation of recent information and promote interaction between members of the community, while the purpose of journals is to publish vetted results. But this is a topic for a different discussion. Martin From kutsia at risc.uni-linz.ac.at Thu Jan 14 14:12:42 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Thu, 14 Jan 2010 20:12:42 +0100 Subject: [TYPES/announce] 2nd CfP: LOPSTR 2010 Message-ID: <20100114191242.GA15923@risc.uni-linz.ac.at> ========================================================================= Call for papers 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate the feedback in the published papers. The 20th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2010) will be held in Hagenberg, Austria; previous symposia were held in Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2010 will be co- located with PPDP 2010 (12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in- the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation specialization inversion composition program/model manipulation certification security transformational techniques in SE applications and tools Survey papers that present some aspect of the above topics from a new perspective. Application papers, that describe experience with industrial applications, are also welcome. 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. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, publication of the formal post-conference proceedings in the Springer series Lecture Notes in Computer Science (LNCS) is envisaged. IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: March 25, 2010 Notification (for pre-proceedings): May 15, 2010 Camera-ready (for pre-proceedings): June 15, 2010 Symposium: July 23-25, 2010 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages, respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2010 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2010 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal post-proceedings. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=lopstr2010 They should be in PDF format and interpretable by Acrobat Reader. Invited Speakers: Bruno Buchberger RISC, Johannes Kepler University Linz, Austria Olivier Danvy University of Aarhus, Denmark Johann Schumann RIACS/NASA Ames Research Center, USA Program Committee: Maria Alpuente Tech. University of Valencia (Chair), Spain Sergio Antoy Portland State University, USA Gilles Barthe IMDEA Software, Madrid Manuel Carro Tech. University of Madrid, Spain Marco Comini University of Udine, Italy Danny De Schreye K.U.Leuven, Belgium Santiago Escobar Tech. University of Valencia, Spain Moreno Falaschi University of Siena, Italy Fabio Fioravanti University of Chieti - Pescara, Italy John Gallagher Roskilde University, Denmark Michael Hanus University of Kiel, Germany Patricia M Hill University of Parma, Italy Andy King University of Kent, UK Temur Kutsia Johannes Kepler University Linz, Austria Ralf Lämmel Universität Koblenz-Landau, Germany Michael Leuschel University of Southampton, UK Yanhong Annie Liu State University of New York at Stony Brook, USA Julio Mariño Tech. University of Madrid, Spain Ricardo Peña University Complutense of Madrid, Spain Peter Schneider-Kamp University of Southern Denmark Alicia Villanueva Tech. University of Valencia, Spain Contacts Program Chair Maria Alpuente DSIC - Technical University of Valencia Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Email: alpuente at dsic.upv.es Conference Chair Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Email: kutsia at risc.uni-linz.ac.at From wadler at inf.ed.ac.uk Thu Jan 14 18:05:12 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Thu, 14 Jan 2010 23:05:12 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Before the Types discussion began, I collected comments on the two-phase proposal, which I planned to post on the web (with permission). I am now posting them here. Enjoy! -- P ------------------------------------------------------------------------ Dan Grossman, 11 Dec 2009 At first blush, I'm quite supportive of this. Among the community I'm one of the "happier" ones with how things are now, and quite concerned about making major changes that "throw the baby out with the bathwater". But this proposal seems quite measured and certainly worth trying as an experiment. I agree it should lead to better results. It seems like a thoughtful compromise. I had two questions that if I don't ask somebody else will, so I encourage the POPL EC to think through rough answers: 1. Approximately what percentage do they envision being accept, resubmit, and reject? 5% resubmit and 50% resubmit are _very_ different things. 2. Will there be a length limit on the cover letters? 500 words? 3 pages? No limit? ------------------------------------------------------------------------ Erez Petrank, 13 Dec 2009 As the proposal mentions, this is a step towards making our conferences something of a journal, and probably another step towards reducing the value of journals in our community. The discussion on the POPL proposal may fit well into our planned discussion on conferences versus journals in the next [SIGPLAN EC] meeting. --Erez ------------------------------------------------------------------------ Manuel Chakravarty, 14 Dec 2009 Hi Phil, This is an interesting proposal, and I'd be curious to see how it performs in practice. I wonder whether you have thought about any specific means to evaluate both the amount of additional work generated by two-phase reviewing (once it has been trialled) and to evaluate its impact on the POPL program. I appreciate that especially the latter is hard to measure, which is why I'm curious whether any concrete metrics have been discussed. The proposal mentions having two PC chairs to spread the work load. Do you also plan to have more PC members on the committee? How detailed do you expect the second-phase reviews to be? Cheers, Manuel ------------------------------------------------------------------------ Francois Pottier, 14 Dec 2009 Dear Phil, Some thoughts and questions: + the idea that this would work better than the current author response process sounds plausible. Is there an evaluation of the current rebuttal process? o one should make sure that the two weeks during which authors are supposed to revise the paper do not fall within the summer break (i.e. avoid August; early September would be fine) o how are the reviewers supposed to evaluate the revised version? read it all again in detail? have a quick look? will at least one new reviewer be enrolled? - if the second round reviewers are the same as the first round reviewers, then it is not clear that the quality of the selection process will improve. - the review process will become significantly longer (at least for the papers which pass the first round). It is not very encouraging for authors to have to spend several months waiting for the final result. It is perhaps more acceptable for a journal, where presumably the work is well polished already and stands a good chance of being accepted; but for a selective conference, where there is a good chance of being rejected, isn't that a waste of time? If conferences are supposed to encourage the dissemination of new results, then the process should be quick. (One might argue that the authors should not wait, but instead continue working while the paper is under consideration. Maybe so, but this is a shift to a new paradigm.) -- Fran?ois Pottier Francois.Pottier at inria.fr http://gallium.inria.fr/~fpottier/ ------------------------------------------------------------------------ James Hook, 14 Dec 2009 I think it is a very good idea to have conferences experiment. I would like to thank the POPL steering committee for creating this proposal, and for inviting feedback. On the goal: I think the goal "improve the decision process" needs refinement. What aspect of the decision process do you wish to improve? Is there any way to measure it? Do you feel the current process is too conservative, and want to encourage publication of less incremental work? Do you feel that too many technically weak papers have been accepted? Do you feel that too many technically sound and subsequently influential papers have been rejected? Do you feel that authors have not taken the opportunity to improve their papers once they are notified of acceptance? Are authors of rejected material getting reviews of sufficient quality to help them improve their work? (There is some discussion of these points in the "advantages section", but I would recommend a clear goal statement.) Leading the proposal with the impact of the decisions on promotion and tenure cases suggests to me that perfection might be a goal. The statement is true---the decisions have consequences. But ultimately the PC must evaluate papers, not individuals, and make the best decisions they can on the work products submitted. We serve our community best by bringing integrity to the reviewing process, not by allowing ourselves to be distracted by the very real personal consequences of our decisions. I think perfection of the process should not be a goal. Experience suggests that there will be some clear winners, some clear losers, and a bunch of papers in the middle. I have seen no evidence that any amount of time invested in reviewing or discussing the papers on the cusp will significantly improve the quality of the technical program selected. Overall structure: I would recommend structuring the proposal as an experiment. What is the goal? What is the evaluation plan? When will it be evaluated? I doubt we would learn very much from doing it once and then abandoning it. After it has been tried and tuned for three years is it ready to be evaluated? Timeline: The proposal is trying to balance end-to-end time with time for meaningful revisions. I think this is an area where we need to gain some experience to make an informed judgement. The submission-to- presentation time seems quite long to me. It is difficult to predict what the impact will be of having the POPL submission date coupled to the ICFP notification date. Currently the ICFP satellite events are informally coupled with the ICFP notification date. The largest of these is the Haskell Symposium. Perhaps the best thing to do here is to include some measurement of ICFP workshop and Haskell symposium submissions as part of the evaluation plan. It is clear that it is not the intent of the proposal to weaken these technical meetings, but it is one possible consequence. I hope other members of the ICFP SC will comment on this aspect. Other issues: To what extent is the current print publication process adding confounding delays to the overall submission-to-presentation time? Is there a way to borrow time from Sheridan instead of moving the submission deadlines earlier in the year? In closing, thank you for the stimulating and innovative proposal! Regards, Jim ------------------------------------------------------------------------ Martin Abadi, 6 Jan 2010 Dear Phil, I am concerned about the possibility of revisions, for two reasons: * It can be a scheduling problem. Not all authors will be equally available in any two-week period, and some periods are particularly harsh on particular groups of authors (e.g., the French in august, academics near the start of the quarter). * I am unclear on what sorts of revisions will be expected or allowed, and I am concerned that this will be a source of problems when working on a tight schedule. Happy New Year. Martin ------------------------------------------------------------------------ Cristina Cifuentes, 7 Jan 2010 It is not clear to me what the net result of the two-phase reviewing will be: to discourage journal publications even further? Or to increase the quality of POPL papers? POPL papers have a page limit, which journals do not normally have. A journal paper is more complete, and as such, I believe journals are a good place to publish more complete work that cannot "fit" into a conference paper. The two-phase review will improve the quality of some POPL papers at the expense of more work by the PC. POPL already has a high standing in academia, increasing its quality will NOT make it the same as publishing in a journal. In other fields, journal papers are highly valued and are rather short, e.g., Nature (4 page papers). One could argue that part of the problem with our journal papers is that they are too long: long time lead to write, review and publish, leading to not-up-to-date information. In fields like Nature, papers are published in a timely basis, but their length is rather short. Regards, Cristina ------------------------------------------------------------------------ Derek Dreyer to Benjamin Pierce, 8 Jan 2010 Based on this email, I don't entirely understand the proposed process, nor do I really understand its motivation. What is the problem being solved? It seems that the idea is to make POPL reviewing more similar to journal reviewing. However, it's unclear to me what "resubmit" corresponds to in journal reviewing. "Resubmit" on a journal submission usually is tantamount to "major revisions needed", but presumably major revisions cannot be carried out in 2 weeks. Or is that not the meaning of "resubmit"? After the PC initially decides between accept, resubmit, and reject, who has to resubmit? Is it just the people who got "resubmit" who are judged in the second round? Why does the PC meet physically after the first round but not the second? Is it because it is expected that there will only be a few papers in the "resubmit" category, that it will be used sparingly for only really tough borderline cases? Otherwise, I can imagine a PC meeting devolving into "resubmit everything". One very real concern I have is that the people who would be most likely to resubmit their POPL rejects to ESOP (which would perhaps be among the better papers at ESOP) are precisely those who would have to wait an extra 6 weeks to get "reject" and thus have missed the ESOP deadline. I guess it's not POPL's concern whether it feeds into ESOP, but I thought I'd mention it. ------------------------------------------------------------------------ Peter Sewell to Benjamin Pierce, 8 January 2010 I'm strongly against this proposal. The current process certainly has a lot of noise, but I don't think this would be much better - much of the noise comes from the PC and reviewer assignment at the start, despite the best efforts of the PC chairs. This proposal sounds like a massive amount of additional work for the PC and (if there are a significant number of "resubmits") for the reviewers and authors. Instead, as there often seem to be many perfectly good papers that get rejected, I would simply move to accepting more papers, multi-tracking or extending the conference. It might also be that more care to ensure a subject-balanced PC could be taken. ------------------------------------------------------------------------ John Reppy to Kathleen Fisher, 10 January 2010 On the face of it, I think that this is a bad idea that will increase the work for reviewers, who are already overworked. It is not clear what problem this proposal is attempting to fix. Is there a concern that bad papers are getting accepted to POPL by accident? I suspect that that is not a serious problem. Is the concern that the quality of POPL reviewing is not high enough? That could be addressed by increasing the size of the PC (or perhaps using the external reviewer mechanism of PLDI) to reduce the number of reviews that each member is responsible for, but again I suspect that review quality is not a pressing issue (in fact, the quality of reviews has significantly improved over the time that I've been submitting conference papers). Instead, the problem that POPL suffers from (and it is not alone in this regard) is an insufficient number of slots for the number of worthwhile papers that are submitted. The proposal does not address that issue at all. The fact that POPL is both a crap shoot and really important for tenure decisions is a symptom of a broader problem that our discipline faces. Our current publication model doesn't really scale to an ever-growing community of researchers. In the short term, we can increase the number of slots by decreasing talk length (probably a good thing) and adding parallel sessions (probably a bad thing). I do worry that increasing the conference size will eventually reach a point where there won't be consistency across the reviewing process. I am also concerned about the first-round accept class of papers. What percentage of papers would likely be accepted/rejected the first round? Can a paper that is accepted the first round be rejected in the second round? Is this just a mechanism to force authors to make the changes requested by reviewers? This plan also loses what, I think, is the most important benefit of author response. Namely, that it is a forcing function that requires reviewers to produce a quality review before the PC meeting. Lastly, I do think the idea of moving to co-chairs for the PC has merit. ------------------------------------------------------------------------ Karl Crary, 11 Jan 2010 I won't be at POPL this year, so I thought I would send you my comments: I'm not against the proposal, exactly. I can see some possible benefits, and it definitely seems like an improvement over the current system of author response (which I am against). However, I am troubled by the endless tinkering with a system that seems to be functioning well overall. Each change carries with it the possibility of some negative unintended consequence, while the upside is limited. I had hoped that the system had already converged, and I wouldn't mind rejecting the proposal on the if-it-ain't-broke-don't fix-it principle. But if we do adopt the proposal, I hope it's the last change for some time. I do appreciate you raising the topic for general discussion. It's a welcome contrast to the recent history of unilateral changes. -- Karl ------------------------------------------------------------------------ -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From kohei at dcs.qmul.ac.uk Thu Jan 14 19:57:57 2010 From: kohei at dcs.qmul.ac.uk (Kohei Honda) Date: Fri, 15 Jan 2010 00:57:57 +0000 Subject: [TYPES/announce] PLACES'10: deadline extension Message-ID: 2nd CALL FOR PAPERS (deadline extension) PLACES'10 Programming Language Approaches to Concurrency and communication-cEntric Software 21st March 2010, Paphos, Cyprus Affiliated with ETAPS 2010 http://places10.di.fc.ul.pt/ Theme and Goals Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Many normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. Topics of Interest Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. Submission Guidelines Authors are invited to submit a five-page abstract in PDF format by 22nd January using the EasyChair proceedings template available at: http://www.easychair.org/easychair.zip Abstracts and full papers should be submitted using EasyChair: http://www.easychair.org/conferences/?conf=places2010 Preliminary proceedings will be available at the workshop. The post-proceedings of the workshop will be published in a journal (the past post-proceedings were published in ENTCS and EPTCS). Please address enquires to am at cl.cam.ac.uk and kohei at dcs.qmul.ac.uk, with a subject field containing "[PLACES]". Important Dates (deadline extended) Deadline of 5-page abstracts: Friday 22nd Jan 2010 Notification: Friday 12th Feb 2010 Camera Ready for pre-proceedings: Friday 26th Feb 2010 Invited Speakers William Cook, Jayadev Misra (University of Texas, Austin) Program Committee Alastair Beresford, University of Cambridge Marco Carbone, IT University of Copenhagen Simon Gay, University of Glasgow Joshua Guttman, The MITRE Corporation and Worcester Polytechnic Institute Kohei Honda (chair), Queen Mary, University of London Alan Mycroft (chair), University of Cambridge Hanne Riis Nielson, The Technical University of Denmark John Reppy, University of Chicago Konstantinos Sagonas, National Technical University of Athens and Uppsala University Vivek Sarkar, Rice University Vasco T. Vasconcelos, University of Lisbon Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London From kaufmann at cs.utexas.edu Fri Jan 15 10:25:29 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Fri, 15 Jan 2010 09:25:29 -0600 Subject: [TYPES/announce] ITP-10: Call for Rough Diamonds Message-ID: <201001151525.o0FFPTis024974@sundance.cs.utexas.edu> Call for "Rough Diamonds" ITP 2010: Conference on Interactive Theorem Proving 11-14 July 2010, Edinburgh, Scotland http://www.floc-conference.org/ITP-cfp.html As previously announced, the deadline is today for abstracts of papers to be submitted to ITP 2010. However, we have waived the requirement for abstracts of submissions in the "rough diamonds" category; such submissions will be accepted through Friday, January 22 (the paper submissions deadline for full papers). Quoting from the Call for Papers: In addition to regular submissions, described above, there will be a "rough diamonds" section. Rough diamond submissions are limited to four pages and may consist of an extended abstract. They will be refereed: they will be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings. They will be presented at the conference venue in a poster session. Please see the above URL for the full Call for Papers, which includes instructions for submission using EasyChair. Regards, Matt Kaufmann and Larry Paulson (ITP 2010 co-chairs) From osantos at cs.york.ac.uk Fri Jan 15 12:04:25 2010 From: osantos at cs.york.ac.uk (Osmar Marchi dos Santos) Date: Fri, 15 Jan 2010 17:04:25 +0000 Subject: [TYPES/announce] LAST REMINDER - CALL FOR PAPERS: TOOLS EUROPE 2010 Message-ID: <4B50A019.7040203@cs.york.ac.uk> ========================================================================== LAST CALL FOR PAPERS (Deadline: January 22, 2010) TOOLS EUROPE 2010 48th International Conference Objects, Models, Components, Patterns Co-located with *** International Conference on Model Transformation (ICMT 2010) *** *** International Conference on Software Composition (SC 2010) *** *** International Conference on Tests and Proofs (TAP 2010) *** M?laga - Spain, 28 June - 02 July 2010 http://malaga2010.lcc.uma.es/ ========================================================================== TOOLS EUROPE is devoted to the combination of technologies that have emerged as a result of object technology becoming "mainstream". Like its predecessors, TOOLS EUROPE combines an emphasis on quality with a strong practical focus. Started in 1989, TOOLS conferences, held in Europe, the USA, Australia, China and Eastern Europe, have played a major role in the development of object technology; many of seminal concepts were first presented at TOOLS. After an interruption of four years, the conference was revived in 2007 to reflect the maturing of the field and the new challenges ahead and has become a yearly event. Contributions are solicited on all aspects of object technology and related fields, in particular model-based development, component-based development, and patterns (design, analysis and other applications); more generally, any contribution addressing topics in advanced software technology fall within the scope of TOOLS. Reflecting the practical emphasis of TOOLS, contributions showcasing applications along with a sound conceptual contribution are particularly welcome. Topics include: * Object technology, including programming techniques, languages, tools * Testing of object-oriented systems * Patterns, pattern languages, tool support for patterns * Distributed and concurrent object systems * Real-time object-oriented programming and design * Experience reports, including efforts at standardisation * Applications to safety- and security-related software * Component-based programming, modelling, tools * Aspects and aspect-oriented programming and modelling * Frameworks for component-based development * Trusted and reliable components * Model-driven development and Model-Driven Architecture * Domain specific languages and language design * Tools and frameworks for supporting model-driven development * Language implementation techniques, compilers, run-time systems * Practical applications of program verification and analysis * Open source solutions & Reproduction studies All contributions will be subject to a rigorous selection process by the international Program Committee, with a stress on originality, practicality and overall quality. The proceedings will be published in Springer LNBIP. For detailed submission information see the conference page. Important Dates: Papers submission deadline: January 22, 2010 Acceptance notification: March 24, 2010 Camera-ready final copy: April 5, 2010 Conference: June 28 -- July 02, 2010 Conference Chair: Bertrand Meyer, ETH Z?rich and Eiffel Software Program Chair: Jan Vitek, Purdue University Publicity Chair: Osmar Santos, University of York Program Committee: Uwe Assman, University of Dresden, Germany Elisa Baniassad, Chinese University of Hong Kong, Hong Kong Alexandre Bergel, University of Chile, Chile Lorenzo Bettini, University of Torino, Italy Judith Bishop, Microsoft Research, USA William Cook, University of Texas Austin, USA Sophia Drossopolou, Imperial College London, UK Catherine Dubois, ENSIIE, France St?phane Ducasse, INRIA Lille, France Manuel Fahndrich, Microsoft Research, USA Harald Gall, University of Zurich, Switzerland Benoit Garbinato, University of Lausanne, Switzerland Angelo Gargantini, University of Bergamo, Italy Jeff Gray, University of Alabama Birmingham, USA Kathryn Gray, University of Cambridge, UK Thomas Gschwind, IBM Research, Switzerland Matthias Hauswith, University of Lugano, Switzerland Nigel Horspool, University of Victoria, Canada Tomas Kalibera, Charles University, Czech Republic Gerti Kappel, Vienna University of Technology, Austria Doug Lea, State University of New York Oswego, USA Shane Markstrum, Brucknell University, USA Peter M?ller, ETH Zurich, Switzerland Oscar Nierstrasz, University of Bern, Switzerland James Noble, Victoria University of Wellington, New Zealand Nate Nystrom, University of Texas Arlington, USA Manuel Oriol, University of York, UK Jonathan Ostroff, York University, Canada Richard Paige, University of York, UK Shaz Qadeer, Microsoft Research, USA Awais Rashid, Lancaster University, UK Vivek Sarkar, Rice University, USA Doug Schmidt, Vanderbilt University, USA Manuel Serrano, INRIA Sophia Antipolis, France Peter Thiemann, University of Freiburg, Germany Dave Thomas, Bedarra Research Labs, Canada Laurence Tratt, Bournemouth University, UK Mandana Vaziri, IBM Research, USA Tian Zhao, University of Wisconsin-Milwaukee, USA From matthias at ccs.neu.edu Fri Jan 15 15:04:12 2010 From: matthias at ccs.neu.edu (Matthias Felleisen) Date: Fri, 15 Jan 2010 15:04:12 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: Dear typists, as many of you know Jens Palsberg sent out a brief survey to the authors of POPL 2010 submissions on behalf of the SC. Several expressed a dislike for non-anonymous surveys and others pointed out that they didn't submit this year but are otherwise regular authors. Phil asked me to create a surveymonkey survey and I did by copying and pasting Jens's questions into a web page: http://www.surveymonkey.com/s/ZLJF6VG I still have to figure out how to get the results back but in the meantime, fire away. -- Matthias From dd at dominicduggan.org Fri Jan 15 15:08:53 2010 From: dd at dominicduggan.org (Dominic Duggan) Date: Fri, 15 Jan 2010 15:08:53 -0500 Subject: [TYPES/announce] CFP: First International Workshop on Programming Methods for Mobile and Pervasive Computing (PMMPS 10) Message-ID: *First International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS'10) http://www.pmmps.org * *Helsinki, Finland, May 17, 2010.* * Colocated with Pervasive 2010, the 8th International Conference on Pervasive Computing . * The International Workshop on Programming Methods for Mobile and Pervasive Systems (PMMPS) is intended to bring together researchers in programming languages, software architecture and design, and pervasive systems to present and discuss results and approaches to the development of mobile and pervasive systems. The goal is to begin the process of developing the software design and development tools necessary for the next generation of services in dynamic environments, including mobile and pervasive computing, wireless sensor networks, and adaptive devices. *Discussions of type systems for mobile and pervasive systems are part of the parvenu for the workshop.* Potential workshop participants should submit a paper on topics relevant to programming models for mobile and pervasive systems. We are primarily seeking short position papers (2?4 pages), although full papers that have not been published and are not under consideration elsewhere will also be considered (a maximum of 10 pages). Position papers that lay out some of the challenges to programming mobile and pervasive systems, including past failures, are welcome. Papers longer than 10 pages may be automatically rejected by the chairs or workshop committee. From the submissions, the program committee will strive to balance participation between academia and industry and across topics. Selected papers will appear on the workshop web site; PMMPS has no formal published proceedings. Authors of selected papers will be invited to submit extended versions for publication in an appropriate journal (under negotiation). Submission deadline: March 1, 2010. Notification: March 29, 2010. Final copy: April 12, 2010. Workshop: May 17, 2010. Both new ideas *and critical evaluation of earlier approaches* are welcome. -- Dominic Duggan Associate Professor, Computer Science Stevens Institute of Technology Hoboken, NJ 07030. Telephone: (201) 216-8042 Email: dduggan at stevens.edu Web: http://www.dominicduggan.org -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100115/89356ccf/attachment-0001.htm From Lists at Alessio.Guglielmi.name Fri Jan 15 19:09:40 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Sat, 16 Jan 2010 01:09:40 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> Message-ID: <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> Hello, At 11:55 +0100 13/1/2010, Derek Dreyer wrote: >>And the conferences should serve the purpose of disseminating new >>ideas, not of distributing medals. > >Given that there have been several posts with something approaching >this sentiment, I would like to respectfully, and strongly, >disagree. POPL and other top conferences have been a place where >many great *ideas* in programming languages have been first set >forth. Yes, nobody is disputing that, but not all the ideas have the right granularity to fit the conference format, which is the problem that many of us lament. In other words, the problem is that giving excessive importance to conference publication distorts research towards what fits conferences, which is not necessarily bad, but it's certainly not all there is. This is particularly bad in certain areas and for the young researchers, who are told `publish several small easily digestible things at conferences (or perish)' instead of `do good research'. Of course there is, for the obvious dynamics, a strong cultural attractor that tends to blur those two concepts, and I think that this is precisely what should be resisted. >>There are so many `papers' produced, that, right now, in computer >>`science', not even the authors read their own work. Thanks to cut >>& paste we have now a ratio of reads/writes < 1. > >I don't know what you're talking about: I read way more papers than >I write, and I read way more conference papers than journal articles >in a given year, often because I am asked to review them! Most of >what I learn about new ideas in PL is from reading conference papers. I didn't mean to be taken so literally. But then again, it really depends on the areas and on what we mean by `reading'. For example, POPL prospective authors used to be advised, in the call for papers, that their works would have been judged after a 40-minute `reading'. Should we really count this reading? It happened to me to review a short and very well written paper (for a journal) whose claims looked to me absolutely impossible, outrageous. After reading (= studying) the paper for days, I still was in the dark, and had to dig out some older results the paper was relying upon, and this took me weeks of study. The paper was right, it was accepted, and it changed dramatically my own research ever since. A fantastic idea. I wonder what I would have done of that paper in 40 minutes. Ciao, -Alessio From wadler at inf.ed.ac.uk Sat Jan 16 10:39:10 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Sat, 16 Jan 2010 15:39:10 +0000 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: <4B4F38FC.7040507@seas.upenn.edu> References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: Following on from Rajeev Alur's e-mail, I want to make the following proposal: - Replace the POPL physical PC meeting with an electronic one. This proposal was discussed by the POPL Steering Committee, which was split on the matter. Input from the community would be helpful. My experience matches Rajeev's. The process of a physical PC meeting necessarily requires quick decisions, often based on who is most vocal or an overnight reading of a paper. My experience of electronic meetings is that the discussions can be more considered. I believe the advantages of electronic meetings become clearer in a context where more papers are accepted, so the decisions centre on 'Is this paper of good quality?' rather than 'Is it better than the other papers we've accepted?' In addition to the cogent points raised by Rajeev, I'll mention that there is also the cost, particularly to the climate, of a physical meeting. Typically, POPL has about 200 attendees and a PC of 25, so a physical PC meeting increases the carbon footprint of the conference by on the order of 10%. How does the community feel about a move to electronic PC meetings? Yours, -- P On Thu, Jan 14, 2010 at 3:32 PM, Rajeev Alur wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Dear Phil, > It has been interesting to see all these responses to the two-phase > proposal. I also think two-phase reviewing is not that great. > One additional drawback I see is that getting rejection after the > second phase will amplify the frustration (particularly for starting > graduate students). > I feel that low acceptance ratio of POPL is a desirable feature, it is > critical > to its reputation, and I would hate to see that go up significantly. > As an aside, some people have essentially suggested that "since number > of POPL papers impacts tenure, we should make it easy for researchers to > publish in POPL". I do not find this argument compelling. In fact, I am > not aware > any committee counting this number. What matters is whether senior POPL > researchers are impressed by your work, and given that POPL is selective, > easiest way for someone to gain attention is by publishing > papers in POPL. Fortunately, selection is based on merit, so this presents > a clear recipe to draw attention to your work. If POPL is not selective, > then the only way would be to be a student of a famous advisor. > In fields such as control theory, top conferences such as CDC have > high acceptance rates, and indeed good pedigree is a necessity. > In any case, POPL review process should focus on selecting best papers > and maintaining high quality, without worrying about other factors. > > More constructively: > conferences such as LICS and CAV use electronic PC meeting. > I have been on POPL PC once and PLDI PC once, but I have a lot more > experience with LICS and CAV (also as PC Chair for both). > The problem with POPL (or LICS/CAV for that matter) initial reviews is > not the > quality (with some exceptions, most papers' contribution is very clear > from the reviews), > and also not the selective biases of individuals (which are a given, and > also, useful, > otherwise no evaluation would be possible), but rather that assignment > of letter grades > A/B/C/D in a distributed manner. For example, a clear technical advance > on a well-studied > problem may get a B or a C depending on the reviewer. This can make a huge > difference, and thus, the same paper rejected from one conference may > get accepted the > next time, making the process unpredictable. The goal of the PC meeting > is to correct > for this bias. But the physical meeting is not conducive to correcting > this. > For a given paper, the opinion of the person whose interests match most > closely with the paper, > counts more (but it should not: experts' reviews are useful, > not his/her biases on what to do with supposedly incremental, or supposedly > theoretical-that-will-never-work, or supposedly > practical-but-not-conceptually-deep papers). > Also, more vocal people get more influence. Time pressure impacts > decisions. > In practice, PC members are actively involved only in papers they have > been assigned, > maintaining the distributed nature of the process. > What one says on the spur of moment weighs more than what one writes > after careful > thought, editing, and sanity checks. > Thus, physical PC meeting adds unpredictable noise in the selection > process. > These are less of a problem in an electronic PC meeting. I think every PC > member needs to look at all the papers, and focus on selecting best X > submissions > based on reviews by applying his/her bias uniformly (and not just to > one's own pile). > This is easier to do on a longer time scale of electronic PC meeting. > Bottomline: not clear why POPL does not switch to electronic PC meeting. > > More dramatically: > I mentioned this to Jens after this year's POPL meeting: abolish the PC > (i.e. reduce its role > to a "reviewers committee" of an exapnded size). > Two or three co-chairs can collect reviews for each paper from those who > are real experts > on the subject. Then based on the reviews, make a decision applying fair > and uniform standards. > This is not as bad as it sounds. Jens indeed spent a lot of time > browsing through all submissions anyway, > and could have easily picked the papers after looking at the reviews. > Maybe a single person's bias would be detrimental, > but, say 3, would make the process better than it is now (and reduce the > cumulative amount > of time one would spend on POPL PC duties). > > best regards > --rajeev > > > > -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Jeremy.Gibbons at comlab.ox.ac.uk Sat Jan 16 12:21:48 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Sat, 16 Jan 2010 17:21:48 GMT Subject: [TYPES/announce] Spring School in Generic and Indexed Programming Message-ID: <201001161721.o0GHLmbY024289@merc3.comlab.ox.ac.uk> SPRING SCHOOL ON GENERIC AND INDEXED PROGRAMMING Wadham College, Oxford, 22nd to 26th March 2010 TOPIC "Generic programming" is about making programs more widely applicable via exotic kinds of parametrization - not just along the dimensions of values or of types, but of things such as the shape of data, algebraic structures, strategies, computational paradigms, and so on. "Indexed programming" is a lightweight form of dependently typed programming, constraining flexibility by allowing one to state and check relationships between parameters: that the shapes of two arguments agree, that an encoded value matches to some type, that values transmitted along a channel conforms to some protocol, and so on. The two forces of genericity and indexing balance each other nicely, simultaneously promoting and controlling generality. The EPSRC-funded Generic and Indexed Programming project at Oxford has been exploring their interaction over the period 2006 - 2010; this school is the closing activity of the project. LECTURERS Six lecturers from the Programming Languages community, each an acknowledged expert in their specialism, will cover various aspects of generic and indexed programming. Each will give about four hours' lectures, distributed throughout the week. Nate Foster (Princeton University) "Bidirectional Programming" Ralf Hinze (University of Oxford) "Generic Programming with Adjunctions" Oleg Kiselyov (Fleet Numerical Meteorology and Oceanography Center) "Typed Tagless Interpreters" Simon Peyton Jones (Microsoft Research Cambridge) "Type Functions" Jeremy Siek (University of Colorado at Boulder) "Concepts in C++" Stephanie Weirich (University of Pennsylvania) "Generic Programming with Dependent Types" PREREQUISITES The school is aimed at doctoral students in programming languages and related areas; however, researchers and practitioners will be very welcome, as will strong masters students with the support of a supervisor. It will be assumed that participants have a good understanding of typed functional programming, as in Haskell or O'Caml. DATES Registration deadline: 19th February School: 22nd March (0900) to 26th March (lunchtime) VENUE Lectures will be held and accommodation provided in Wadham College in the centre of Oxford. The college celebrates its 400th anniversary in 2010; notable past members include Sir Christopher Wren, the founder of the Royal Society, and notable present ones Marcus du Sautoy, the mathematician and TV presenter. COSTS Costs will be kept low, thanks to support from EPSRC. There will be a nominal registration fee, and B&B accommodation in college will be about £55 per night. (Precise costs are yet to be determined.) FURTHER INFORMATION Further information, including instructions on how to register, will be available soon at the website: http://www.comlab.ox.ac.uk/projects/gip/school.html From dreyer at mpi-sws.org Sat Jan 16 13:34:04 2010 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Sat, 16 Jan 2010 19:34:04 +0100 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: <7fa251b71001161034x3d9d7a3k47868b6f402d67e9@mail.gmail.com> Hi, Phil. FWIW, the POPL'11 PC also discussed this issue in detail when deciding what kind of meeting we are going to hold this year. As you say, the issue split people down the middle. I thought it might be useful to summarize the main arguments that were given for physical vs. electronic meetings. (To clarify, by "electronic", I'm talking here about a week-long, online discussion through the conference management website, NOT a phone discussion, which most of the PC members pooh-poohed.) Main benefits of physical meeting: - Easier to get a "global" view of the submissions - PC members are more likely to contribute to the discussion of papers they didn't review - More effective use of PC members' "bandwidth", no delays in communication due to time zone differences - Excellent networking opportunity, esp. for more junior PC members - Much more fun, esp. for extroverts Main benefits of electronic meeting: - No travel costs, no jet lag, no carbon footprint - Longer, more careful and thorough discussion of papers (with the possibility of requesting additional expert reviews during the discussion) - Easier, more fun for non-native English speakers (as well as introverts) to participate In the end, the POPL'11 PC decided to have a 10-day electronic meeting followed by a 2-day physical meeting. Personally, I started the discussion strongly in favor of physical meetings, for all the reasons given above, but I found the arguments for electronic meetings to be compelling, and I sense that the future is electronic. Phil, concerning your comment that the advantages of electronic meetings become clearer in a context where more papers are accepted, I understand the argument but I don't think it's so clear-cut. You're right that there's less of a need for a "global" view in this case, because determining the "cut-off" point is less important. OTOH, getting a global view is still important for the purpose of normalizing the reviewing process. That is, one paper might get a B and 2 C's (and get rejected), and another might get an A and two B's (and get accepted), with the only difference being that the first paper had reviewers with low average scores and the second paper had reviewers with high average scores. To detect this problem, one cannot simply consider each paper independently, and so I think it is easier to detect in a physical meeting, given that more people pay attention to the discussion of each paper. But there may, of course, be purely electronic solutions. Best regards, Derek On Sat, Jan 16, 2010 at 4:39 PM, Philip Wadler wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Following on from Rajeev Alur's e-mail, I want to make the following proposal: > > ?- Replace the POPL physical PC meeting with an electronic one. > > This proposal was discussed by the POPL Steering Committee, which was > split on the matter. ?Input from the community would be helpful. > > My experience matches Rajeev's. ?The process of a physical PC meeting > necessarily requires quick decisions, often based on who is most vocal > or an overnight reading of a paper. ?My experience of electronic > meetings is that the discussions can be more considered. ?I believe > the advantages of electronic meetings become clearer in a context > where more papers are accepted, so the decisions centre on 'Is this > paper of good quality?' rather than 'Is it better than the other > papers we've accepted?' > > In addition to the cogent points raised by Rajeev, I'll mention that > there is also the cost, particularly to the climate, of a physical > meeting. ?Typically, POPL has about 200 attendees and a PC of 25, so a > physical PC meeting increases the carbon footprint of the conference > by on the order of 10%. > > How does the community feel about a move to electronic PC meetings? > Yours, ?-- P > > > > On Thu, Jan 14, 2010 at 3:32 PM, Rajeev Alur wrote: >> [ The Types Forum (announcements only), >> ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] >> >> Dear Phil, >> It has been interesting to see all these responses to the two-phase >> proposal. I also think two-phase reviewing is not that great. >> One additional drawback I see is that getting rejection after the >> second phase will amplify the frustration (particularly for starting >> graduate students). >> I feel that low acceptance ratio of POPL is a desirable feature, it is >> critical >> to its reputation, and I would hate to see that go up significantly. >> As an aside, some people have essentially suggested that "since number >> of POPL papers impacts tenure, we should make it easy for researchers to >> publish in POPL". I do not find this argument compelling. In fact, I am >> not aware >> any committee counting this number. What matters is whether senior POPL >> researchers are impressed by your work, and given that POPL is selective, >> easiest way for someone to gain attention is by publishing >> papers in POPL. Fortunately, selection is based on merit, so this presents >> a clear recipe to draw attention to your work. If POPL is not selective, >> then the only way would be to be a student of a famous advisor. >> In fields such as control theory, top conferences such as CDC have >> high acceptance rates, and indeed good pedigree is a necessity. >> In any case, POPL review process should focus on selecting best papers >> and maintaining high quality, without worrying about other factors. >> >> More constructively: >> conferences such as LICS and CAV use electronic PC meeting. >> I have been on POPL PC once and PLDI PC once, but I have a lot more >> experience with LICS and CAV (also as PC Chair for both). >> The problem with POPL (or LICS/CAV for that matter) initial reviews is >> not the >> quality (with some exceptions, most papers' contribution is very clear >> from the reviews), >> and also not the selective biases of individuals (which are a given, and >> also, useful, >> otherwise no evaluation would be possible), but rather that assignment >> of letter grades >> A/B/C/D in a distributed manner. For example, a clear technical advance >> on a well-studied >> problem may get a B or a C depending on the reviewer. This can make a huge >> difference, and thus, the same paper rejected from one conference may >> get accepted the >> next time, making the process unpredictable. The goal of the PC meeting >> is to correct >> for this bias. But the physical meeting is not conducive to correcting >> this. >> For a given paper, the opinion of the person whose interests match most >> closely with the paper, >> counts more (but it should not: experts' reviews are useful, >> not his/her biases on what to do with supposedly incremental, or supposedly >> theoretical-that-will-never-work, or supposedly >> practical-but-not-conceptually-deep papers). >> Also, more vocal people get more influence. Time pressure impacts >> decisions. >> In practice, PC members are actively involved only in papers they have >> been assigned, >> maintaining the distributed nature of the process. >> What one says on the spur of moment weighs more than what one writes >> after careful >> thought, editing, and sanity checks. >> Thus, physical PC meeting adds unpredictable noise in the selection >> process. >> These are less of a problem in an electronic PC meeting. I think every PC >> member needs to look at all the papers, and focus on selecting best X >> submissions >> based on reviews by applying his/her bias uniformly (and not just to >> one's own pile). >> This is easier to do on a longer time scale of electronic PC meeting. >> Bottomline: not clear why POPL does not switch to electronic PC meeting. >> >> More dramatically: >> I mentioned this to Jens after this year's POPL meeting: abolish the PC >> (i.e. reduce its role >> to a "reviewers committee" of an exapnded size). >> Two or three co-chairs can collect reviews for each paper from those who >> are real experts >> on the subject. Then based on the reviews, make a decision applying fair >> and uniform standards. >> This is not as bad as it sounds. Jens indeed spent a lot of time >> browsing through all submissions anyway, >> and could have easily picked the papers after looking at the reviews. >> Maybe a single person's bias would be detrimental, >> but, say 3, would make the process better than it is now (and reduce the >> cumulative amount >> of time one would spend on POPL PC duties). >> >> best regards >> --rajeev >> >> >> >> > > > > -- > .\ Philip Wadler, Professor of Theoretical Computer Science > ./\ School of Informatics, University of Edinburgh > / ?\ http://homepages.inf.ed.ac.uk/wadler/ > > The University of Edinburgh is a charitable body, registered in > Scotland, with registration number SC005336. > > From Francois.Pottier at inria.fr Sat Jan 16 16:21:07 2010 From: Francois.Pottier at inria.fr (Francois Pottier) Date: Sat, 16 Jan 2010 22:21:07 +0100 Subject: [TYPES/announce] Proposed changes to POPL review process In-Reply-To: References: <4B4F38FC.7040507@seas.upenn.edu> Message-ID: <20100116212107.GB21419@yquem.inria.fr> On Sat, Jan 16, 2010 at 03:39:10PM +0000, Philip Wadler wrote: > My experience matches Rajeev's. The process of a physical PC meeting > necessarily requires quick decisions, often based on who is most vocal > or an overnight reading of a paper. My experience of electronic > meetings is that the discussions can be more considered. My experience is quite opposite. The physical PC meetings that I participated in were quite interesting and every paper was considered and discussed by the whole PC. During electronic meetings, on the other hand, I feel that I have no global understanding of what is going on, just a limited view of the papers that I have reviewed. The argument of cost (in time, money and carbon) is important, but otherwise I think a physical meeting wins hands down. Of course, it might be possible to use a combination of both modes (e.g. hold a preliminary electronic discussion before the physical meeting takes place; make sure every paper has received enough expert reviews, for instance). Best regards, -- Fran?ois Pottier Francois.Pottier at inria.fr http://gallium.inria.fr/~fpottier/ From vs at ecs.soton.ac.uk Sat Jan 16 16:57:23 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Sat, 16 Jan 2010 21:57:23 +0000 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <4B4C84B1.2070002@cs.mcgill.ca> <2e0980f31001121122s3866a338k9f1f21d2027a8189@mail.gmail.com> <2134A8F9-C9BE-4133-83B3-9E6FBC953311@ecs.soton.ac.uk> Message-ID: I wish to add to the discussion a brief marginal note on my experience with running ETAPS (www.etaps.org). ETAPS covers in five main parallel member conferences the aspects of design, engineering, programming, transformation and validation of software systems (and several more in about 20 satellite events). We have about 600 submission, between 550-650 participants, presentations of 30 mins, and acceptance rate of around 25-28%, which we believe guarantees high quality whilst being reasonably inclusive. The reality is that this works pretty well, and I personally think it is time for ETAPS to consider about expanding itself further. With best regards, V. Sassone (as chair of the ETAPS Steering Ctte) From mwh at cs.umd.edu Sat Jan 16 17:20:49 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Sat, 16 Jan 2010 17:20:49 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> Message-ID: <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> > It happened to me to review a short and very well written paper (for > a journal) whose claims looked to me absolutely impossible, > outrageous. After reading (= studying) the paper for days, I still > was in the dark, and had to dig out some older results the paper was > relying upon, and this took me weeks of study. The paper was right, > it was accepted, and it changed dramatically my own research ever > since. A fantastic idea. I wonder what I would have done of that > paper in 40 minutes. I don't know the paper, but I disagree with the implication that great papers will somehow be precluded from publication indefinitely if they are not immediately accepted. As Greg Morrisett previously noted, there are many other high-quality publication venues if the paper is not selected for POPL. Indeed, revision may be required to make the paper great. When I review a paper, I am interested in the technical idea in the paper *and* how well the paper communicates that idea to the reader. Indeed, these two things are tied together. As a rule of thumb, I've found that if I can't understand the basic idea and why it works, the novelty of the idea, and its potential impact within 40 minutes, there's reason to believe that POPL readers would be similarly vexed, give up on the paper, and thus get little from it. Understanding all of the technical details for the general case is another matter and will take longer; but the basic idea and approach should be clear enough after an hour. I have been in conversations with people who have complained that a particular published paper is not very deep/interesting/insightful/ etc. but after some discussion realize there is more to the paper than they thought, but the paper fails to communicate it clearly. Perhaps the paper could use better motivation, a few key examples, a careful description of an elided algorithm, better comparison to a related approach, ... whatever. As a reviewer, I try to suggest where I'm having trouble understanding the paper, how it could make its points better, etc. so the authors can revise accordingly. So while POPL PCs may not select eventually-great papers, I think it would be even more tragic for a paper to be published prematurely, and thus a potentially great idea not appreciated, especially when that idea could have been more widely understood after a round of revision. -Mike From Lists at Alessio.Guglielmi.name Sun Jan 17 04:26:56 2010 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Sun, 17 Jan 2010 10:26:56 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> Message-ID: <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> Hello, At 17:20 -0500 16/1/10, Michael Hicks wrote: >>It happened to me to review a short and very well written paper >>(for a journal) whose claims looked to me absolutely impossible, >>outrageous. [...] I wonder what I would have done of that paper in >>40 minutes. > >I don't know the paper, but I disagree with the implication that >great papers will somehow be precluded from publication indefinitely >if they are not immediately accepted. [...] Indeed, revision may be >required to make the paper great. Actually, I didn't mean such an implication, and, as I said, the paper was brilliantly written. As a reviewer, I didn't ask for changes in the exposition, because it was already perfect. The paper was in proof theory/proof complexity, so, not really in the POPL scope, but still in computer science, and in particular in the range of interests of the TYPES list. The main reason why I'm discussing this issue here is because TYPES and my area intersect, and am worried by what I perceive as a cultural bias. >As a rule of thumb, I've found that if I can't understand the basic >idea and why it works, the novelty of the idea, and its potential >impact within 40 minutes, there's reason to believe that POPL >readers would be similarly vexed, give up on the paper, and thus get >little from it. I agree with what you say, except for one thing, the `why it works', and this is a very important point. So, let's use the example of our paper. One could understand in one minute what the paper was claiming, its novelty and its impact, and 40 minutes would suffice to understand the basic idea, in broad terms. However, its results would clash dramatically with my expectations, and indeed those of my community. This is one of those cases where one says `it cannot be true'. The only way to judge is to check the details, and this takes days or weeks of study because there's some serious mathematics behind. Suppose this masterfully-written paper is submitted to a 40-minute-review conference: should we accept it or not? I'd say YES if the conference is just for making ideas circulate and be discussed; I'd say NO if a conference accept is an important medal to be exhibited before a tenure committee, because we should make sure that tenured faculty actually prove what they claim. (Probably, and rightfully, in our paper's case, the author didn't even dream of sending his paper to a conference.) I suppose you see my point: 40-minute-reviewing is OK to judge whether an idea should be communicated, it's not OK to judge whether somebody is a good scientist (at least when some deep theory is involved). Unless, of course, we think that publishing at conferences is sufficient to define the good scientist. I think most disagree with it, but are we all aware that this is precisely the risk we are incurring? Isn't it obvious that our species is already perversely adapting to the conference environment? That the rule makers are more and more the products of the game? If the computer-science peculiar way to conferences gains even more ground, the important kind of research of our paper will be even more discouraged than it is already (which is a lot). We will also see more conference papers brilliantly communicating false results, and people making careers out of that (perhaps not at the top places, but below?). Expanding POPL (for example) means expanding the overall space for papers, because the expansion will trickle down the conference chain. This, unless the last conference down the chain closes (I bet it won't). Since nature abhors vacuum, more papers will be written; but we all are already at the limit of our working possibilities, so there will be even less serious reading. (By the way, I agree with Peyton-Jones that writing is tremendously important for clarifying ideas, but this doesn't mean that after writing a paper the best thing to do is to rush it out. The best is to rewrite, and then rewrite, certainly not until perfection, but definitely until maturity.) Anyway, expanding POPL means lowering the standards, plain and simply, perhaps not of POPL, but of the whole business. And what would the reason be? Because some are randomly denied the top medal? If conferences were just for communicating ideas, instead of being races, this would not be felt as much of a problem. This is not a problem of POPL, of course, but of the whole culture at play here. Let's say that some of its assumptions are politically incorrect towards the minority for which leks, as Prakash accurately called them, are not suited. Ciao, -Alessio From adamc at hcoop.net Sun Jan 17 07:32:14 2010 From: adamc at hcoop.net (Adam Chlipala) Date: Sun, 17 Jan 2010 07:32:14 -0500 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> References: <20100113071830.9607414CD93@janeway.inf.tu-dresden.de> <7fa251b71001130255h2261c89cp41f4215e56328243@mail.gmail.com> <20100116000943.C35C114CDDE@janeway.inf.tu-dresden.de> <122694F5-6FFB-4E50-80B5-27F890DD49B6@cs.umd.edu> <20100117092703.1FBB414CDC8@janeway.inf.tu-dresden.de> Message-ID: <4B53034E.1080308@hcoop.net> Alessio Guglielmi wrote: > However, its results would clash dramatically with my expectations, > and indeed those of my community. This is one of those cases where > one says `it cannot be true'. The only way to judge is to check the > details, and this takes days or weeks of study because there's some > serious mathematics behind. > This is one area where we can benefit from the shift towards machine-checked proofs that is already going on in this community. If the theorem were proved with a proof assistant, then one would only need to audit the theorem statement and the definitions it depends on. (Of course, understanding the structure of the argument would still be important, but not _as_ important.) It would take a significant culture change to reach the point where a proof isn't believed if it isn't machine-checked, but I wouldn't want to bet against the POPL community reaching that point in the next few decades. Because of that possibility, this particular reason in support of high time investment by reviewers may not need to be considered as fundamental. From aleks.nanevski at imdea.org Mon Jan 18 07:25:46 2010 From: aleks.nanevski at imdea.org (Aleksandar Nanevski) Date: Mon, 18 Jan 2010 13:25:46 +0100 Subject: [TYPES/announce] Openings at IMDEA-Software, Madrid, Spain Message-ID: <4B54534A.4000504@imdea.org> Openings at IMDEA Software, Madrid, Spain ******************************************* Background ************ The Madrid Institute of Advanced Studies (IMDEA) is a network of international research centers in the Madrid region of Spain for research of excellence in areas of high economic impact. The main focus of the Madrid Institute for Advanced Studies in Software Development Technologies (IMDEA Software) is to perform research of excellence required to devise methods that will allow the cost-effective development of software products with sophisticated functionality and high quality that are safe, reliable, and efficient. In order to achieve this goal IMDEA Software is gathering a critical mass of top international researchers and providing them with an ideal environment to perform their research. IMDEA Software is funded by the regional government of Madrid (Communidad de Madrid) with the task of becoming an international preeminent center of research. The focus of the Institute includes all aspects of the software development cycle (analysis, design, implementations, validation and verification), including methodologies, languages, and mechanisms. The Institute's distinguishing feature is its concentration on approaches that are rigorous and that, at the same time, allow building practical tools. IMDEA Software has recently hired world-class researchers in the areas of programming languages and type theory, formal methods, verification, static analysis, systems modeling and validation, and language-based security. The Institute intends to grow to about 100 scientific personnel (including postdoctoral scholars and PhD students) in five years and will be relocating to a new, state-of-the art building by late 2011. Salaries and research packages are competitive. The Institute offers an ideal work environment, open and collaborative, where researchers can focus on developing new ideas and projects. IMDEA-Software is located in the region of Madrid, Spain, with easy access to the lively cultural, sports, business and restaurant scenes of the city of Madrid. Madrid has recently hosted several international conferences, e.g., POPL 2010 and WWW 2009. The campus has excellent communication with both the airport as well as downtown Madrid by way of efficient public transit. Several major international airlines fly into Madrid. The city is well served by an excellent national high-speed train network. Openings ********** IMDEA-Software invites applications for (a) Tenure-track (Assistant Research Professor) and Tenured (Associate Research Professor and Research Professor) faculty positions (b) Postdoctoral fellowships (c) PhD fellowships (d) Research Internships in the broad area of rigorous technologies for software development. Please visit the websites http://software.imdea.org and http://software.imdea.org/open_positions/positions.html for more information (including application forms). The working language at IMDEA-Software is English. IMDEA-Software is an Equal Opportunity Employer and strongly encourages applications from a diverse and international community. IMDEA-Software complies with the European Charter for Researchers. From G.A.McCusker at bath.ac.uk Mon Jan 18 08:30:09 2010 From: G.A.McCusker at bath.ac.uk (Guy McCusker) Date: Mon, 18 Jan 2010 13:30:09 +0000 Subject: [TYPES/announce] PhD studies in Computer Science at Bath Message-ID: <29AC8758-CC33-489B-A157-11055CA49F65@bath.ac.uk> *** PhD studies in Logic and Semantics at Bath *** Applications are invited for PhD study in the Logic and Semantics of Computation research group at the University of Bath. Our staff include Alessio Guglielmi, Jim Laird, Guy McCusker and John Power. We welcome students interested in logic and proof theory, semantics of programming languages and proof systems, and category theory. The research publications of the Department of Computer Science at Bath were ranked 3rd in the UK at the 2008 Research Assessment Exercise. The department's other research interests include computer algebra, computational geometry, logic programming, computer vision and graphics, artificial intelligence, agents, and human-computer interaction. A wide range of funding opportunities, including full stipendiary studentships as well as scholarships and fee-waivers, is available, for studies commencing in October 2010. Every application will be considered for all eligible funding sources. The sooner you apply, the more opportunities are available. Please direct informal enquiries to G.A.McCusker at bath.ac.uk or visit http://www.bath.ac.uk/comp-sci/postgraduate/phd/ for application details. ----- Guy McCusker Professor of Computer Science Dept of Computer Science University of Bath Bath BA2 7AY United Kingdom +44 (0) 1225 383578 From Peter.Sewell at cl.cam.ac.uk Mon Jan 18 09:14:49 2010 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Mon, 18 Jan 2010 14:14:49 +0000 Subject: [TYPES/announce] 3-year faculty position at Cambridge (Programming/Logic/Semantics) Message-ID: [Please draw this to the attention of any suitable applicants - thanks, Peter] http://www.admin.cam.ac.uk/offices/hr/jobs/vacancies.cgi?job=6156 Fixed Term Lectureship in Computer Science Faculty of Computer Science & Technology Vacancy Reference No: NR06156 Salary: £36,532-£46,278 Limit of tenure applies* FIXED-TERM LECTURESHIP IN COMPUTER SCIENCE Faculty of Computer Science & Technology Applications are invited for a Lectureship for a fixed term of three years to carry out research and teaching in the area of computer science centred on programming languages. The successful candidate will be expected to take up the appointment on 1 October 2010, or as soon as possible thereafter. The appointment has been created in connection with the award of an EPSRC Leadership Fellowship within the Laboratory. It is targeted at the core area of computer science that comprises language design, compilation, and program analysis, evolution, semantics, testing and verification. The successful candidate will contribute to one or more of these topics within the Laboratory's Programming, Logic and Semantics Research Group. Research group boundaries are very flexible and the successful candidate may also contribute to other areas of the Laboratory's work. The Laboratory provides an environment in which engagement between theoretical and practical aspects of Computer Science, and with industry, is encouraged. The person appointed will be expected to contribute to the teaching of the new M.Phil in Advanced Computer Science and to support undergraduate teaching in this key area. Further details of the Department can be found at http://www.cl.cam.ac.uk. Informal enquiries may be addressed to Professor Anuj Dawar, email Anuj.Dawar at cl.cam.ac.uk. Applications should be sent to The Secretary of the Appointments Committee, Computer Laboratory, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK so as to reach her by 28 February 2010. Applications may also be sent by e-mail (with documents in PDF format) to personnel-admin at cl.cam.ac.uk. Applications should include - a single document containing a Curriculum Vitae (resume), a list of publications, and a statement of research interests and future plans - a completed application form PD18 (parts I and III only) including the names and e-mail addresses of 3 referees Provisional Interview Date: 21 April 2010 * Limit of tenure: 3 years fixed-term. Closing date: 28 February 2010. Interview date: 21 April 2010. The University values diversity and is committed to equality of opportunity. The University has a responsibility to ensure that all employees are eligible to live and work in the UK. From david.delahaye at cnam.fr Mon Jan 18 13:20:21 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Mon, 18 Jan 2010 19:20:21 +0100 (CET) Subject: [TYPES/announce] Calculemus 2010: First Call for Papers Message-ID: <33340.163.173.229.111.1263838821.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ----------------------------------------- CALCULEMUS 2010 - First Call for Papers ----------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 7-8, 2010 http://cicm2010.cnam.fr/calculemus/ Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and must not exceed 15 pages for full papers and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all full papers submitted to a peer review. Emerging trends papers will be lightly reviewed. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== The proceedings of full papers of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. Important Dates =============== For (reviewed) full paper submissions: Abstract submission: February 24, 2010 Submission deadline: March 3, 2010 Notification of acceptance: April 14, 2010 Camera ready copies due: April 28, 2010 For extended abstracts on emerging trends: Abstract submission: April 30, 2010 Submission deadline: May 7, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 7-8, 2009. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From Jean-Yves.Marion at loria.fr Tue Jan 19 02:54:28 2010 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Tue, 19 Jan 2010 07:54:28 -0000 Subject: [TYPES/announce] (PN) [STACS] First Call for Participation Message-ID: ********************************************************************************* 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010 - CALL FOR PARTICIPATION MARCH 4-6, 2010, NANCY, FRANCE http://stacs.loria.fr/ ******************************************************************************* INVITED SPEAKERS *********************** Mikolaj Bojanczyk, Warsaw University Rolf Niedermeier, University of Jena Jacques Stern, Ecole Normale Sup?rieure ACCEPTED PAPERS ************************ http://stacs.loria.fr/AcceptedPapers.html PROGRAM COMMITTEE *************************** Markus Bl?ser, Saarland University Harry Buhrman, CWI, University of Amsterdam Thomas Colcombet, CNRS, Paris 7 University Anuj Dawar, University of Cambridge Arnaud Durand, Paris 7 University S?ndor Fekete, Braunschweig University of Technology Ralf Klasing, CNRS, Bordeaux University Christian Knauer, Freie Universit?t of Berlin Piotr Krysta, University of Liverpool Sylvain Lombardy, Marne la Vall?e University Parthasarathy Madhusudan, University of Illinois Jean-Yves Marion, Nancy University (co-chair) Pierre McKenzie, Universit? de Montr?al Rasmus Pagh, IT University of Copenhagen Boaz Patt-Shamir, Tel Aviv University Christophe Paul, CNRS, Montpellier University Georg Schnitger, Frankfurt University Thomas Schwentick, TU Dortmund University (co-chair) Helmut Seidl, TU Munich Jir? Sgall, Charles University Sebastiano Vigna, Universit? degli Studi di Milano Paul Vitanyi, CWI, Amsterdam CONTACT : stacs at loria.fr ************************* -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100119/b1fc867d/attachment-0001.htm -------------- next part -------------- ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ petrinet at informatik.uni-hamburg.de ]] From kutsia at risc.uni-linz.ac.at Tue Jan 19 06:08:21 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 19 Jan 2010 12:08:21 +0100 Subject: [TYPES/announce] CfP: PPDP 2010 Message-ID: <4B5592A5.4030101@risc.uni-linz.ac.at> ====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: Program Design and Development * Declarative Aspects of Object-Oriented Programming * Concurrent Extensions to Declarative Languages * Declarative Mobile Computing * Integration of Paradigms * Proof Theoretic and Semantic Foundations * Type and Module Systems * Program Analysis and Verification * Program Transformation * Abstract Machines and Compilation * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: As in previous years, we are planning to include invited talks in the programme. Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From simonpj at microsoft.com Tue Jan 19 12:08:11 2010 From: simonpj at microsoft.com (Simon Peyton-Jones) Date: Tue, 19 Jan 2010 17:08:11 +0000 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: References: <59543203684B2244980D7E4057D5FBC10AF9F075@DB3EX14MBXC306.europe.corp.microsoft.com> <59543203684B2244980D7E4057D5FBC10AFA2016@DB3EX14MBXC306.europe.corp.microsoft.com> <59543203684B2244980D7E4057D5FBC10AFA2BE8@DB3EX14MBXC306.europe.corp.microsoft.com> <11BC7A81-4FAC-4440-A827-CDCABE147F21@cis.upenn.edu> <59543203684B2244980D7E4057D5FBC10AFA353E@DB3EX14MBXC306.europe.corp.microsoft.com> Message-ID: <59543203684B2244980D7E4057D5FBC10AFA54FE@DB3EX14MBXC306.europe.corp.microsoft.com> Gentle colleagues There has been a vigorous debate on the Types mailing list about acceptance rates and criteria for POPL. Phil Wadler, as SIGPLAN Chair, and a member of the POPL steering committee, asked me to present a concrete proposal for discussion at the POPL community meeting tomorrow. Thank you for the opportunity, Phil. The proposal appears below. I am sorry that I am missing the meeting this year. Enjoy POPL! Simon Reviewing for POPL: a concrete proposal ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ I will not repeat the details of the debate here, since you all have access to it: http://lists.seas.upenn.edu/pipermail/types-announce/2010/thread.html#1740 Instead, responding to Phil's request, I want to make single proposal That we use a "quality bar" rather than a "quantity bar" to govern acceptance for POPL. It is difficult to quantify just what "POPL-publishable quality" is, but I propose that it should be a level that, if it had been applied in recent years, would have resulted in an acceptance range in the region of 30%. The current norm is 16-23%. One data point is that ICFP typically accepts rather more than 30%, but the quality IMHO is still very high. (Historical figures for POPL, PLDI, and ICFP appear below) An alternative would to continue with a quantity bar, but increase it substantially, say from its current 35 to 50 papers. Personally I prefer a target acceptance rate because my gut feel is that the average quality does not change much year to year, whereas submission volume does. Regardless of the exact figure, I am advocating a sea change in our attitude to the POPL evaluation process, not just an incremental shift in policy. It is worth noting anecdotal evidence that individual POPL program chairs have tried and failed to get their committee to accept more papers. The idea is discussed, potential papers are brought up, but they are ultimately rejected. To achieve this change, if we want it, will take a broad community decision that gives a clear mandate to the program committee. With all that said, we can't tie the program committee's hands completely, by requiring them to accept N papers or X% of submissions; in the end we have to trust the PC. This proposal is not to restrict their discretion, but to give them a mandate. Reasons for this change (in brief) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * Fine, publishable papers are being rejected, which is bad for both authors and audience. Those papers are recycled at other conferences and workshop, where they increase the reviewing load (by being re-reviewed) and crowd out workshop-y papers. * Acceptance or rejection has a significant element of chance: it is very difficult for program committees to choose 35 out of 70 very good papers. Yet, partly because it is so competitive, acceptance at POPL has a strong effect on promotion and tenure committees. Having career-important decisions based on a chancy process seems wrong. * The pressure for slots makes it hard for a program committee to accept a ground-breaking but flawed paper over a more incremental but well-executed one. This is not a clear-cut issue, but many people (including me) think that the relentless pressure for slots forces program committees to err towards more conservative conference programmes. * It is a change that we can deliver. In contrast, arguing that journal publications should be valued more highly might be desirable, but is a cultural change that no one can guarantee to deliver. (However if POPL starts accepting more papers, a cultural change may well follow in due course.) Consequences of the change ~~~~~~~~~~~~~~~~~~~~~~~~~~ If this proposal were to be accepted, we would need to figure out how to accommodate many more papers at the physical meeting. How to achieve this is secondary to my main proposal, but a number of proposals have been floated, including * Parallel sessions * A lottery among accepted papers * Voting by conference registrants * Program committee decision I suggest that we invite the POPL steering committee to consider these and other possibilities, and make a proposal in due course. Background acceptance rates for POPL, PLDI, ICFP ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Source: http://people.engr.ncsu.edu/txie/seconferences.htm --------------------------------------------------- Year POPL PLDI ICFP --------------------------------------------------- 2008 35/212(16%) 34/184(18%) 29/87(33%) 2007 36/198(18%) 45/178(25%) 26/103(25%) 2006 33/167(20%) 36/169(21%) 24/74(32%) 2005 31/172(18%) 28/135(21%) 26/87(30%) 2004 29/176(16%) ?/?(20%) 21/80(26%) 2003 24/126(19%) 28/131(21%) 24/95(25%) 2002 28/128(22%) 28/169(17%) 24/76(32%) 2001 24/126(19%) 30/144(21%) 23/66(35%) 2000 30/151(20%) 30/173(17%) 24/110(22%) 1999 24/136(18%) 26/130(20%) 25/81(31%) 1998 31/175(18%) 31/136(23%) 30/70(39%) 1997 36/225(16%) 31/158(20%) 25/78(32%) 1996 34/148(23%) 28/112(25%) 25/83(30%) 1995 ? 28/105(27%) ? --------------------------------------------------- From dpw at CS.Princeton.EDU Wed Jan 20 00:54:25 2010 From: dpw at CS.Princeton.EDU (David Walker) Date: Wed, 20 Jan 2010 00:54:25 -0500 (EST) Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <973633032.910231263966608926.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> > If this proposal were to be accepted, we would need to figure out how > to accommodate many more papers at the physical meeting. How to > achieve this is secondary to my main proposal, but a number of > proposals have been floated, including > > * Parallel sessions > * A lottery among accepted papers > * Voting by conference registrants > * Program committee decision I know this is secondary, but I want to make sure I get my two cents in: the only rational choice is to go to parallel sessions or to extend the length of the conference. I believe that voting, either by PC or conference registrants, has the potential to be much more unfair than current paper selection practice. If part of the voting explicitly depends upon answering the question "who will give a good talk?" as opposed to "what is the content of the paper" then this introduces an extreme bias towards old, famous, successful researchers and away from young, new, unheard of researchers and students. Whereas we now at least try to judge POPL papers purely on the merit of the current technical document, we would instead be veering away from that crucial principle. And the more we start asking personality-based questions such as "who will give a good talk," the more we may be susceptible to subconscious biases against various minorities (women, racial, etc) or the more we may try to overcompensate for such biases, resulting in reverse-discrimination. I also believe that lottery for talks is bad. What a lottery does is select some set of papers for which the talk audience is zero. With parallel sessions, the talk audiences will be smaller, but not zero. If I had a really great idea, I'd rather present it 6 months later at PLDI than have it appear 6 months earlier in the POPL proceedings, but not have the chance to give a talk. One last thing: while we may be getting all tied in knots over this popl review process right now, from what I've heard, within computer science, our community is really pretty great when it comes to selecting papers for inclusion in conferences based on their merits. I've heard of all kinds of dysfunctionality and biases and turf wars and sketchiness in other communities that we don't seem to be suffering from at all. Of course, that's probably because we're constantly working to try to make the process better and more fair to all. Cheers, Dave From alain.girault at inria.fr Wed Jan 20 05:35:12 2010 From: alain.girault at inria.fr (Alain Girault) Date: Wed, 20 Jan 2010 11:35:12 +0100 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> References: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: <4B56DC60.8060608@inria.fr> Dear all First, I completely agree with Simon's proposal. Then, concerning how to accommodate more papers at the conference, my preference also goes to solution A (i.e., parallel sessions). cheers Alain >> If this proposal were to be accepted, we would need to figure out how >> to accommodate many more papers at the physical meeting. How to >> achieve this is secondary to my main proposal, but a number of >> proposals have been floated, including >> >> * Parallel sessions >> * A lottery among accepted papers >> * Voting by conference registrants >> * Program committee decision > > I know this is secondary, but I want to make sure I get my two cents in: the only rational choice is to go to parallel sessions or to extend the length of the conference. > > I believe that voting, either by PC or conference registrants, has the potential to be much more unfair than current paper selection practice. If part of the voting explicitly depends upon answering the question "who will give a good talk?" as opposed to "what is the content of the paper" then this introduces an extreme bias towards old, famous, successful researchers and away from young, new, unheard of researchers and students. Whereas we now at least try to judge POPL papers purely on the merit of the current technical document, we would instead be veering away from that crucial principle. And the more we start asking personality-based questions such as "who will give a good talk," the more we may be susceptible to subconscious biases against various minorities (women, racial, etc) or the more we may try to overcompensate for such biases, resulting in reverse-discrimination. > > I also believe that lottery for talks is bad. What a lottery does is select some set of papers for which the talk audience is zero. With parallel sessions, > the talk audiences will be smaller, but not zero. If I had a really great idea, I'd rather present it 6 months later at PLDI than have it appear 6 months earlier in the POPL proceedings, but not have the chance to give a talk. > > One last thing: while we may be getting all tied in knots over this popl review process right now, from what I've heard, within computer science, our community is really pretty great when it comes to selecting papers for inclusion in conferences based on their merits. I've heard of all kinds of dysfunctionality and biases and turf wars and sketchiness in other communities that we don't seem to be suffering from at all. Of course, that's probably because we're constantly working to try to make the process better and more fair to all. > > Cheers, > Dave -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From doaitse at swierstra.net Wed Jan 20 10:34:55 2010 From: doaitse at swierstra.net (S. Doaitse Swierstra) Date: Wed, 20 Jan 2010 16:34:55 +0100 Subject: [TYPES/announce] Reviewing for POPL: a concrete proposal In-Reply-To: <4B56DC60.8060608@inria.fr> References: <1786066673.910331263966865113.JavaMail.root@suckerpunch-mbx-0.CS.Princeton.EDU> <4B56DC60.8060608@inria.fr> Message-ID: The POPL event is actually a multi-event, with a lot of workshops around one main conference with top papers. One of the problems with refereeing is that first papers are sent to POPL and once rejected are resubmitted as a workshop paper. Notwithstanding the good work done by the POPL-PC's I know from my own experience that: - quite a number of papers submitted are probably not so excellent; but why not try since there always is a second chance at a more specialised event? - papers come form a large variety of subjects, and it is not always easy to find a sufficient number of informed PC members I can see a solution in which: - people initially/only submit to one of the more specialised conferences and workshops - the PC's of these conferences select the papers they think are of high quality and deserve to be presented to a wider community because they represent something new and interesting for everyone - the POPL PC constructs a nice single track conference out of these preselected papers, and there are no conferences scheduled in parallel when these papers are presented (e.g. in the morning) - the other events run in the afternoon and in parallel with the papers which were accepted by their PC's except those who made to the plenary POPL sessions. As a result we have more accepted papers, a better balanced program, automatic decisions about paralell session, and the committee has an easier job, since fewer and better papers have to be judged, and an initial review has already been done by the experts in the PC of the associated conferences. It also takes a bit of the gambling effect away. From my Haskell Symposium/ICFP experience I would rather have the HS PC select which are the best Haskell papers and send them one level up to the ICFP plenary forum, then to leave the selection to the ICFP PC. Given the broader scope of POPL I would expect this effect to be even stronger. Doaitse On 20 jan 2010, at 11:35, Alain Girault wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > > Dear all > > First, I completely agree with Simon's proposal. > Then, concerning how to accommodate more papers at the conference, > my preference also goes to solution A (i.e., parallel sessions). > > cheers > > Alain > >>> If this proposal were to be accepted, we would need to figure out >>> how >>> to accommodate many more papers at the physical meeting. How to >>> achieve this is secondary to my main proposal, but a number of >>> proposals have been floated, including >>> >>> * Parallel sessions >>> * A lottery among accepted papers >>> * Voting by conference registrants >>> * Program committee decision >> >> I know this is secondary, but I want to make sure I get my two >> cents in: the only rational choice is to go to parallel sessions or >> to extend the length of the conference. >> >> I believe that voting, either by PC or conference registrants, has >> the potential to be much more unfair than current paper selection >> practice. If part of the voting explicitly depends upon answering >> the question "who will give a good talk?" as opposed to "what is >> the content of the paper" then this introduces an extreme bias >> towards old, famous, successful researchers and away from young, >> new, unheard of researchers and students. Whereas we now at least >> try to judge POPL papers purely on the merit of the current >> technical document, we would instead be veering away from that >> crucial principle. And the more we start asking personality-based >> questions such as "who will give a good talk," the more we may be >> susceptible to subconscious biases against various minorities >> (women, racial, etc) or the more we may try to overcompensate for >> such biases, resulting in reverse-discrimination. >> >> I also believe that lottery for talks is bad. What a lottery does >> is select some set of papers for which the talk audience is zero. >> With parallel sessions, >> the talk audiences will be smaller, but not zero. If I had a >> really great idea, I'd rather present it 6 months later at PLDI >> than have it appear 6 months earlier in the POPL proceedings, but >> not have the chance to give a talk. >> >> One last thing: while we may be getting all tied in knots over >> this popl review process right now, from what I've heard, within >> computer science, our community is really pretty great when it >> comes to selecting papers for inclusion in conferences based on >> their merits. I've heard of all kinds of dysfunctionality and >> biases and turf wars and sketchiness in other communities that we >> don't seem to be suffering from at all. Of course, that's probably >> because we're constantly working to try to make the process better >> and more fair to all. >> >> Cheers, >> Dave > > > -- > ------------- > Alain GIRAULT http://pop-art.inrialpes.fr/~girault > INRIA senior researcher tel: +(33|0) 476 61 53 51 > Head of the POP ART project-team fax: +(33|0) 476 61 52 52 > ----------------------------------------------------------------------------- > Sauvons la Recherche ! http://www.sauvonslarecherche.fr > ----------------------------------------------------------------------------- From michaelw at cs.utwente.nl Thu Jan 21 10:16:12 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Thu, 21 Jan 2010 16:16:12 +0100 Subject: [TYPES/announce] SPIN 2010 Call for Papers Message-ID: 17th International SPIN Workshop on Model Checking of Software (SPIN 2010) September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From peterol at ifi.uio.no Thu Jan 21 11:45:33 2010 From: peterol at ifi.uio.no (=?ISO-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Thu, 21 Jan 2010 17:45:33 +0100 Subject: [TYPES/announce] CfP: Workshop on Rewriting Techniques for Real-Time Systems (Spitsbergen/polar bears/EPTCS proceedings) Message-ID: <6C21E039-A91A-49A8-8713-2A7AD80B8107@ifi.uio.no> 1st International Workshop on Rewriting Techniques for Real-Time Systems R T R T S 2010 Longyearbyen, Spitsbergen, Norway, April 6-9, 2010 http://rtrts10.ifi.uio.no/ *** Proceedings will be published by EPTCS *** IMPORTANT DATES February 24, 2010 Deadline for submission Early March, 2010 Notification of acceptance April 6-9, 2010 Workshop in Spitsbergen AIMS AND SCOPE The aim of the workshop is to bring together researchers with an interest in the use of rewriting-based techniques (including rewriting logic) and tools for the modeling, analysis, and/or implementation of real-time and hybrid systems, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to: - methods and tools supporting rewriting-based modeling and analysis of real-time and hybrid systems, and extensions of such systems; - use of rewriting techniques to provide rigorous support for model-based software engineering of timed systems; - applications and case studies; - comparison with other formalisms and tools. PROGRAM COMMITTEE Erika ?brah?m RWTH Aachen Francisco Dur?n Universidad de Malaga Narciso Marti-Oliet Universidad Complutense de Madrid Jos? Meseguer University of Illinois at Urbana-Champaign Sayan Mitra University of Illinois at Urbana-Champaign Thomas Noll RWTH Aachen Peter ?lveczky (chair) University of Oslo Joel Ouaknine Oxford University Olaf Owe University of Oslo Grigore Rosu University of Illinois at Urbana-Champaign Stavros Tripakis University of California, Berkeley Martin Wirsing Ludwig-Maximillian University, Munich VENUE RTRTS 2010 will be held in Longyearbyen, Spitsbergen. Spitsbergen is a fascinating archipelago pretty close to the North Pole (same latitude as northern Greenland!). April is the high season, with the sun above the horizon yet it should be wintry enough to do the usual winter activities, like dog sledding, snow scooter trips, and ice cave exploration, etc. Maybe this could be your last chance to see polar bears roaming around freely? SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be published by Electronic Proceedings in Theoretical Computer Science. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. Papers should not exceed 20 pages, formatted according to EPTCS guidelines (http://style.eptcs.org), and should be submitted electronically using Easychair: http://www.easychair.org/conferences/?conf=rtrts2010 INVITED SPEAKERS (to be announced) CONTACT INFORMATION For more information, please contact the organizer peterol at ifi.uio.no or visit the workshop web page http://rtrts10.ifi.uio.no/ From m.stannett at dcs.shef.ac.uk Thu Jan 21 15:22:54 2010 From: m.stannett at dcs.shef.ac.uk (Mike Stannett) Date: Thu, 21 Jan 2010 20:22:54 +0000 Subject: [TYPES/announce] CfP: Midlands Graduate School in the Foundations of Computing Science Message-ID: <4B58B79E.9010507@dcs.shef.ac.uk> Call for Participation MIDLANDS GRADUATE SCHOOL IN THE FOUNDATIONS OF COMPUTING SCIENCE (MGS 2010) 28.03.-01.04.2010, Sheffield, UK http://www.dcs.shef.ac.uk/~georg/mgs.html The MGS is the leading annual research training event in Theoretical Computer Science in the UK. We are widely known for our courses on the mathematical foundations of computing. Our main mission is advanced research training for PhD students, but our school is open for anyone. We have consistently been evaluated as excellent: All recent participants would recommend the school to others. The MGS addresses primarily PhD students in their first and second year. But we warmly welcome postdoctoral researchers, academics or industrial practitioners as well. Further information can be found at the MGS 2010 web site. PROGRAMME: The MGS is an intensive one-week training event. We offer nine courses with five hours of lectures plus exercise sessions. Invited Speaker: Lectures on Separation Logic Peter O'Hearn (Queen Mary, London) Introductory Courses: Category Theory Graham Hutton (Nottingham) Functional Programming Henrik Nilsson (Nottingham) Typed Lambda Calculi Eike Ritter (Birmingham) Advanced Courses: Domain Theory and Denotational Semantics Mart?n Escard? (Birmingham) Game Semantics and Applications Dan Ghica (Birmingham) Formal Languages and Group Theory Rick Thomas (Leicester) Protocol Verification Emilio Tuosto (Leicester) Quantum Topos Theory Steve Vickers (Birmingham) VENUE: The MGS 2010 will be hosted at the University of Sheffield. B&B accommodation is provided at the newly built Ranmoor Student Village. Sheffield is centrally located in the UK and easy to reach by train, air or car. Travel advice and general information for visitors can be found at the MGS 2010 web site. REGISTRATION: Registration fee: ?350 (incl accommodation) Registration deadline: 01.03.2010. Instructions on how to register can be found at the MGS 2010 web site. FURTHER INFORMATION: http://www.dcs.shef.ac.uk/~georg/mgs.html From asperti at cs.unibo.it Fri Jan 22 11:08:58 2010 From: asperti at cs.unibo.it (Andrea Asperti) Date: Fri, 22 Jan 2010 17:08:58 +0100 Subject: [TYPES/announce] MSCS Special Issue - Mechanization of Mathematics In-Reply-To: <1260973587.6056.71.camel@amelior> References: <1260973587.6056.71.camel@amelior> Message-ID: <4B59CD9A.6040405@cs.unibo.it> Mathematical Structures in Computer Science Special Issue on Advances and Perspectives in the Mechanization of Mathematics Guest Editors: Andrea Asperti and Jeremy Avigad Call for contributions Recent advances in automated reasoning and interactive theorem proving have made it possible to formalize and mechanically check substantial mathematical theorems, such as the prime number theorem, the four color theorem, and the Jordan curve theorem. In particular, a number of interactive proof assistants have been developed to help users manage libraries of definitions and theorems, and fill in the inferential details of a mathematical argument. Automated methods are also often used to verify calculations that are too long and complex to check by hand. As mathematical proofs become more complicated and, increasingly, rely on extensive calculation, this gives rise to an exciting interaction between traditional methods and computational means of verifying mathematical claims. The present issue is devoted to recent advances and new perspectives in this field, including descriptions of formalizations, thoughtful reflection on the future of the discipline, novel insights, innovative research directions, and critical assessments of the current state of the art. Deadlines Deadline for submissions: June 28, 2010 Author's notification: September 27, 2010 Submissions: All papers should be written in pdf and submitted via the EasyChair system, accessible at the following address: https://www.easychair.org/login.cgi?conf=mscsadvancesandperspectivesint Authors are invited to write their papers following the mscs instructions available in the MSCS guide for contributors downloadable here: http://assets.cambridge.org/MSC/MSC_ifc.pdf. Extended versions of work previously published in conference proceedings are eligible for submission but authors should make it clear how their submission improves upon the conference publication; in those cases where Cambridge University Press is not the publisher of the original conference proceedings, authors should take care to avoid infringing that publisher's copyright. Authors who wish to discuss potential submissions are encouraged to contact the guest editors. Papers should not be longer than 35 pages; shorter papers are obviously welcome. ------------------------------------------------------------ All informations can be found at the following web page: http://www.cs.unibo.it/~asperti/mscs -- Andrea Asperti & Jeremy Avigad From Bob.Coecke at comlab.ox.ac.uk Mon Jan 25 09:39:29 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Mon, 25 Jan 2010 14:39:29 +0000 (GMT) Subject: [TYPES/announce] 6th Workshop on Categories, Logic and Foundations of Physics, Oxford, 9th March 2010 Message-ID: Dear all, The sixth workshop on: "Categories, Logic and Foundations of Physics" (CLP 6), http://categorieslogicphysics.wikidot.com/ will take place at: Oxford University Computing Laboratory Tuesday, 9th March 2010, 12:00 - 18:20. REGISTRATION: For logistic reasons, it would be helpful if you send us a quick email if you would like to take part. Many thanks! Our workshop series is aimed at nourishing research in the fields named in the title and at bringing together scientists from the different fields involved. The videos and slides of previous workshops plus a number of talks from other events are available from: http://categorieslogicphysics.wikidot.com/events The site is constantly growing. SPEAKERS AND SCHEDULE: Room 478: 12.00-12.50 Martin Hyland (Cambridge) http://www.dpmms.cam.ac.uk/~martin/ Lecture Theatre A: 14.00-14.50 Boris Zilber (Oxford) http://people.maths.ox.ac.uk/zilber/ 14:50-15.40 Pawel Blasiak (Krakow) http://www.ifj.edu.pl/~blasiak/ 15:40-16:10 Why n-categories? Panel discussion with Tom Leinster, Urs Schreiber and any other n-category cafe server who shows up: http://golem.ph.utexas.edu/category/ 16:40-17:30 Urs Schreiber (Hamburg) http://www.math.uni-hamburg.de/home/schreiber/ 17:30-18:20 Bertfried Fauser (Birmingham) http://www.cs.bham.ac.uk/~fauserb/ Please bring the workshop to the attention of others who might be interested. We are maintaining a mailing list so please let us know if you either wish to be removed from it or adjoined to it. Best regards, Andreas Doering and Bob Coecke. P.S.: Since both Andreas Doering, Jamie Vicary and newly recruited CLP'er Chris Heunen have all joined the Oxford University Computing Laboratory: http://web.comlab.ox.ac.uk/activities/quantum/ the entire CLP team is now located in one place. We hereby invite people at other (relatively easy to reach) institutions to host future CLP events. From Radu.Iosif at imag.fr Mon Jan 25 10:45:47 2010 From: Radu.Iosif at imag.fr (Radu Iosif) Date: Mon, 25 Jan 2010 16:45:47 +0100 Subject: [TYPES/announce] Post-doctoral position at VERIMAG, Grenoble, France Message-ID: <4B5DBCAB.3030703@imag.fr> [Apologies for multiple postings] The VERIMAG laboratory has a vacancy for a post-doctoral position on: Development of Automatic Techniques for Software Verification ========================================= *** Project description The goal of this project is the verification of C programs that are used to control safety-critical systems, such as power plants. A major problem is the scalability of existing verification techniques for programs with dynamic data structures. These techniques are capable nowadays of analyzing and finding bugs in toy programs of about 100 lines of code. In this project we aim, on one hand, at extending the existing verification techniques in order to deal with parallel programs handling singly-linked lists and array data structures. On the other hand, we aim at applying these techniques to real-life test cases, with sizes of several tens of thousands lines of C code. *** Research group The research will take place in the Distributed and Complex Systems group (http://www-verimag.imag.fr/~async/pv.html) of the research laboratory VERIMAG. The members of this group focus on a wide range of problems such as program verification, computer security, testing and synthesis, component-based development, etc. VERIMAG is an academic research laboratory affiliated with CNRS (French National Research Center), UJF (University Joseph Fourrier) and INPG (National Polytechnic Institute of Grenoble). *** Qualifications The applicants must have a PhD in Computer Science, with knowledge in at least one of the following fields: - logics, proof theory, arithmetic theories, linear integer programming - formal languages, automata theory - deductive or algorithmic verification (model checking) *** Job description The appointment is for one year, starting as soon as possible, with possibility of extension. The contract will be within the VERIDYC project of the ANR (French National Research Agency). More information at: http://www-verinew.imag.fr/VERIDYC.html The chosen candidate is expected to work on the implementation of a prototype using the Frama-C framework: http://frama-c.cea.fr/ Knowledge of the French language is not required. *** Contact For further information and applications, send email to Radu.Iosif at imag.fr From Dave.Clarke at cs.kuleuven.be Mon Jan 25 11:20:08 2010 From: Dave.Clarke at cs.kuleuven.be (Dave Clarke) Date: Mon, 25 Jan 2010 17:20:08 +0100 Subject: [TYPES/announce] Call for Papers: COORDINATION 2010 Message-ID: <201001251620.o0PGK8AU021631@leo.cs.kuleuven.be.> An embedded and charset-unspecified text was scrubbed... Name: not available Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100125/6d7b0ff9/attachment.ksh From troina at di.unito.it Mon Jan 25 12:03:43 2010 From: troina at di.unito.it (Angelo Troina) Date: Mon, 25 Jan 2010 18:03:43 +0100 Subject: [TYPES/announce] CS2Bio'10 - Second Call for Papers (Invited Speakers Updated) Message-ID: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> ====================================================================== Second call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - Luca Cardelli (Microsoft Research - Cambridge, UK) - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). The quality of the received papers permitting, publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, is planned. *** IMPORTANT DATES *** - Submission deadline: 19 March 2010 - Reviews due: 23 April 2010 - Notification to authors: 30 April 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Angelo Troina (Co-chair) - Verena Wolf - Gianluigi Zavattaro From moggi at disi.unige.it Wed Jan 27 02:30:19 2010 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Wed, 27 Jan 2010 08:30:19 +0100 (CET) Subject: [TYPES/announce] ICTCS 2010 preliminary CFP Message-ID: <20100127073019.9079435D86@mailstore.csita.unige.it> Preliminary Call for Papers 12th Italian Conference on Theoretical Computer Science (ICTCS 2010) Camerino, Italy, September 15-17, 2010 http://www.cs.unicam.it/ictcs2010 ICTCS 2010 provides a forum for the exchange of ideas among researchers, and it aims to foster an environment, where junior researchers and PhD students can gain experience in presenting their work, broaden their views on the subject, and benefit from contact with more established researchers. Also researchers from outside Italy are welcome to submit papers and attend the Conference. The Scientific and Organizing Committee welcomes contributions in any area of Theoretical Computer Science. These contributions could describe - original works, that the authors may want to submit to a post-conference special issue; - original works submitted or accepted somewhere else, that the authors wish to publicize at ICTCS; - works in progress, on which the authors wish to get feedback at ICTCS. INVITED SPEAKERS Marco Bernardo (Univ. di Urbino) Stefano Crespi-Reghizzi (Poli. di Milano) Rossella Petreschi (Sapienza Univ. di Roma) IMPORTANT DATES Submission Deadline: May 20 Notification of Acceptance: June 20 Early registration deadline: July 30 Conference: September 15-17 SUBMISSIONS. Authors are invited to submit electronically an extended abstract (in pdf format), not exceeding four single spaced pages. The Scientific and Organizing Committee is considering the publication of a postconference special issue in the Journal Theoretical Informatics and Applications. For additional information, please refer to the conference web page. Further queries concerning submissions for presentation at ICTCS or to the special issue can be sent to ictcs2010 at easychair.org ICTCS is hosted by Camerino University. Camerino is an historical town in the Center of Italy, known and respected since Roman times, which became particularly important in the middle-age. Camerino is located in hilly surroundings (Marche Region), between the spectacular Appennini mountains and the pleasant Adriatic coast. SCIENTIFIC AND ORGANIZING COMMITTEE Marcella Anselmo (Univ. di Salerno) Tiziana Calamoneri (Sapienza Univ. di Roma) Flavio Corradini (Univ. di Camerino) Emanuela Merelli (Univ. di Camerino) Eugenio Moggi (Univ. di Genova) From bove at chalmers.se Wed Jan 27 04:07:40 2010 From: bove at chalmers.se (Ana Bove) Date: Wed, 27 Jan 2010 10:07:40 +0100 Subject: [TYPES/announce] PAR 2010: First CFP Message-ID: <4B60025C.7040502@chalmers.se> Please distribute to those you might think are interested. ======================================================================== 1st Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the PC for publication in the proceedings of the workshop. The final proceedings will be published after the workshop as a special issue of EPTCS and a preliminary version will be available during the workshop. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EPTCS macro package . The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 24 May 2010: Final version of accepted papers * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * TBA Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui From Maribel.Fernandez at kcl.ac.uk Wed Jan 27 08:45:05 2010 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Wed, 27 Jan 2010 13:45:05 +0000 Subject: [TYPES/announce] CFP UNIF 2010 at FLoC (Edinburgh, 14 July) In-Reply-To: <4909F8C4.7020903@kcl.ac.uk> References: <4909F8C4.7020903@kcl.ac.uk> Message-ID: <4B604361.2010501@kcl.ac.uk> Call for Papers UNIF 2010 24th International Workshop on Unification 14 July 2010, Edinburgh, UK A FLoC workshop associated to RTA and IJCAR http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html ============================================================== This workshop promotes research and collaboration in the area of unification theory and related fields, including constraint solving and applications of unification to theorem proving and programming languages. It encourages the presentation of new directions, developments and results, as well as tutorials on existing knowledge in this area. Topics of interest include, but are not restricted to: * General E-unification and calculi * Narrowing * Matching algorithms * Special unification algorithms * Higher-order and nominal unification * Constraint solving * Disunification * Combination problems * Complexity analysis * Implementation techniques * Applications: type checking and reconstruction, automated theorem proving, programming language design, etc. System descriptions and demonstrations are also welcome. SUBMISSION GUIDELINES The submission is in two stages. 1)Before the workshop, authors are invited to submit an abstract (max. 5 pages) in pdf format, using the Easychair submission site. Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a paper based on their presentation, which will be refereed for inclusion in the final workshop proceedings published by EPTCS. We also invite authors to submit a 5 page abstract describing relevant work that has been or will be published elsewhere, or work in progress. Submissions in this class will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. IMPORTANT DATES # Submission: 28 March 2010 # Notification: 23 April 2010 # Preliminary proceedings version due: 16 May 2010 # Workshop: 14 July 2010 # Submission for final proceedings: 12 September 2010 # Notification: 7 November 2010 # Final version: 5 December 2010 PROGRAMME COMMITTEE Maribel Fernandez (UK), chair Temur Kutsia (Austria) Jordi Levy (Spain) Christopher Lynch (US) Cathy Meadows (US) Gianfranco Rossi (Italy) Laurent Vigneron (France) For more information, please contact Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk From katoen at cs.rwth-aachen.de Thu Jan 28 06:51:03 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Thu, 28 Jan 2010 12:51:03 +0100 Subject: [TYPES/announce] ETAPS 2010: Call For Participation Message-ID: <4B617A27.702@cs.rwth-aachen.de> [We apologise for multiple copies.] ==================================================================== CALL FOR PARTICIPATION: ETAPS 2010 *** 5 Conferences, 19 Workshops, 4 Tutorials *** European Joint Conferences on Theory And Practice of Software March 20 - March 28, 2010 Paphos, Cyprus http://www.etaps.org http://www.etaps10.cs.ucy.ac.cy/ ==================================================================== -- REGISTRATION -- For online registration, please visit http://www.etaps10.cs.ucy.ac.cy/ and click on the menu item "Registration". The early registration deadline is *February 15, 2010*, and the normal registration deadline is February 28, 2010. -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2010 is the thirteenth event in the series. -- THE HOST CITY: PAPHOS, CYPRUS -- The west coast town of Paphos, with its pleasant harbour and medieval fort, combines a cosmopolitan holiday resort, spectacular countryside and historical sites. With a population of just 28.000 inhabitants, Paphos nestles in the lee of the Western Troodos Mountains and close to the Akamas National Park which add another dimension to this area of scenic beauty. Paphos has an air of holiday charm combined with history, and olden-day elegance is lent to the town by its classical style buildings in the upper part of town which leads to the shopping area. The lower part of the town has a life of its own, down near the sea, home of the harbour, the fish taverns, souvenir shops and several hotels with important archaeological sites around them. Paphos was the island's capital, and it is famous for the remains of the Roman Governor's palace, where extensive, fine mosaics are a major tourist attraction. The town of Paphos is included in the official UNESCO list of cultural and natural treasures of the world's heritage. ETAPS 2010 is organized by the University of Cyprus and will take place at the Coral Beach Hotel and Resort in Paphos, Cyprus, a 5-start hotel overlooking the golden sandy beaches and sparkling waters of Coral bay and adjacent to the Akamas National Park. For more information about Paphos, please visit the Cyprus Tourism Organization website: http://www.visitcyprus.com/wps/portal For travel information, please consult the ETAPS'10 website: http://www.etaps10.cs.ucy.ac.cy/ -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction ( http://www.cs.ucr.edu/~gupta/CC%202010.htm ) - ESOP: European Symposium on Programming ( http://research.microsoft.com/en-us/um/people/adg/ESOP2010/ ) - FASE: Fundamental Approaches to Software Engineering ( http://www.mathematik.uni-marburg.de/~swt/fase2010/ ) - FOSSACS: Foundations of Software Science and Computation Structures ( http://users.comlab.ox.ac.uk/luke.ong/FoSSaCS2010/ ) - TACAS: Tools and Algorithms for the Construction and Analysis of Systems ( http://tacas10.in.tum.de/ ) -- INVITED SPEAKERS -- Mark Harman (KCL, UK) Jim Larus (MSR, Redmond USA) Dave Naumann (Stevens, USA) Jean-Francois Raskin (Brussels, Belgium) Joseph Sifakis (IMAG, France) Colin Stirling (Edinburgh, UK) Philip Wadler (Edinburgh, UK) -- SATELLITE EVENTS -- The ETAPS 2010 satellite events comprise of workshops and tutorials which will be held on the Saturday/Sunday (March 20/21) before and the Saturday/Sunday (March 27/28) after the main conferences. WORKSHOPS - ACCAT, Applied and Computational Category Theory - ARSPA-WITS, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security - BYTECODE, Bytecode Semantics, Verification, Analysis and Transformation - CMCS, Coalgebraic Methods in Computer Science - COCV, Compiler Optimization Meets Compiler Verification - DCC, Designing Correct Circuits - DICE, Developments in Implicit Computational Complexity - FBTC, From Biology to Concurrency and back - FESCA, Formal Engineering approaches to Software Components and Architectures - FOSS-AMA, Free and Open Source Software - for Accessible Mainstream Applications - GaLoP, Games for Logics and Programming Languages - GT-VMT, Graph Transformation and Visual Modeling Techniques - LDTA, Language Descriptions, Tools and Applications - MBT, Model-Based Testing - PLACES, Programming Language Approaches to Concurrency and Communication-cEntric Software - QAPL, Quantitative Aspects of Programming Languages - SafeCert, Certification of Safety-Critical Software Controlled Systems - WGT, Workshop on Generative Technologies - WRLA, Workshop on Rewriting Logic and its Applications TUTORIALS * Uncertainty Modeling in Cyber-Physical Systems (Manuela Bujorianu) * Security, specification and refinement (Annabelle McIver) * Executable Models of Gene Regulatory Networks (Wan Fokkink) * The DisCoVeri continues ... (On the Application of Concurrency Theory to Fault-Tolerant Distributed Algorithms) (Uwe Nestmann) Additional information about the satellite events is available on the ETAPS web page: http://www.etaps10.cs.ucy.ac.cy/ -- FURTHER INFORMATION AND ENQUIRIES -- ETAPS 2010 is organised by the Dept. of Computer Science, University of Cyprus. For further information, do not hesitate to contact the Local Organisers at the following address: etaps10 at cs.ucy.ac.cy From pierre.geneves at inria.fr Thu Jan 28 08:13:13 2010 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Thu, 28 Jan 2010 14:13:13 +0100 Subject: [TYPES/announce] Postdoctoral position at INRIA Grenoble, France Message-ID: <4B618D69.5040306@inria.fr> Applications are invited for a postdoctoral position at INRIA Grenoble, France. The appointment will be in the areas of programming languages, computational logic, and program analysis and verification. The selected candidate will be expected to conduct research on some of the following topics: * the design of logics for reasoning about programs manipulating tree-shaped structures * the implementation of satisfiability solvers for such logics, and * the use of the implemented systems in building type-checkers and reasoners for actual programs. The WAM project seeks to establish logical foundations and automated reasoning techniques with applications concerning, but not limited to, static analysis of programs manipulating XML documents, pointer and heap analysis, program verification. Information about previous relevant research is available online: http://wam.inrialpes.fr/web-solver/webinterface.html The position is under the supervision of Nabil Layaida (INRIA) and Pierre Geneves (CNRS). Applicants should have interests in programming languages, type theory, and/or mathematical logic, with a concern in the intersection of theory and practice. Expertise in the following areas are particularly welcomed: - program analysis - formal methods - automated reasoning The fellowship is offered for a period of up to 16 months and can start as soon as possible, depending on the candidate availability. A prerequisite for employment is a doctoral degree in Computer Science or closely related field. Applications should include: - detailed curriculum vitae, in pdf format - copies of relevant publications, or url-pointers to them - the names of at least 2 referees - a statement outlining the applicant's suitability to the project. Applications should be sent to Nabil Layaida and Pierre Geneves . Informal enquiries about the position are welcomed. From cesar.a.munoz at nasa.gov Thu Jan 28 10:32:58 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Thu, 28 Jan 2010 09:32:58 -0600 Subject: [TYPES/announce] 2nd Call for Papers IWS2010 In-Reply-To: Message-ID: 2nd CALL FOR PAPERS International Workshop on Strategies in Rewriting, Proving, and Programming IWS 2010 iws2010.inria.fr (A satellite workshop of FLoC 2010) July 9 2010, Edinburgh, UK *** IMPORTANT DATES *** Abstract submission: March 26, 2010 Notification date: April 11, 2010 Abstract final version: April 25, 2010 Workshop: July 9, 2010 Submission of full paper for the proceedings: September 5, 2010 Strategies are ubiquitous in programming languages, automated deduction and reasoning systems, yet only since about ten years have they been studied in their own right. In the two communities of Rewriting and Programming on one side, and of Deduction and Proof engines (Provers, Assistants, Solvers) on the other side, workshops have been launched to make progress towards a deeper understanding of the nature of strategies, their descriptions, their properties, and their usage, in all kinds of computing and reasoning systems. Since more recently, strategies are also playing an important role in rewrite-based programming languages, verification tools and techniques like SAT/SMT engines or termination provers. Moreover strategies have come to be viewed more generally as expressing complex designs for control in computing, modeling, proof search, program transformation, and access control. Possible topics to address in this workshop include: * Foundations for the definition and semantic description of strategies: models of search spaces, logical or mathematical formalisms to define strategies and prove properties about them. * Properties of strategies and corresponding computations: logical or mathematical formalisms to prove properties about them. * Analysis and optimization techniques for strategies: analysis of the search space, evaluation and comparison of strategies. * Integration of strategic deductions and/or strategic computations: interrelations, combinations and applications of deduction and computation under different strategies, control issues and strategies in the integration of systems, strategies in decision procedures for SMT. * Strategy languages: essential constructs, meta-level features. Definition, design, implementation and application. Comparison of strategies in (existing) systems. * Concrete types of (reduction/evaluation) strategies in rewriting and programming, lambda calculi, normalization, narrowing, constraint solving, as well as their properties and characteristics (complexity, decidability, ...). * Applications and case studies in which strategies play a major role. FLoC 2010 provides an excellent opportunity to foster exchanges between the communities of Rewriting and Programming on one side, and of Deduction and Proof engines on the other side. This workshop is a joint follow-up of two series of workshops, held since 1997: the Strategies workshops held by the CADE-IJCAR community and the Workshops on Reduction Strategies (WRS) held by the RTA-RDP community. Submissions ---------- The submission process is in two stages. 1) Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style http://www.easychair.org/easychair.zip through the EasyChair submission site: http://www.easychair.org/conferences/?conf=iws2010 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in the electronic journal: Electronic Proceedings in Theoretical Computer Science (http://eptcs.org). Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. Invited Speakers ------------- Dan Dougherty, Worcester Polytechnic Institute http://web.cs.wpi.edu/~dd/ Assia Mahboubi, INRIA Saclay http://www.lix.polytechnique.fr/~assia/index-eng.html Organizers --------- Helene Kirchner, INRIA Bordeaux - Sud-Ouest, France Cesar Munoz, NASA Langley Research Center, Hampton, USA Program Committee ----------------- Maria Paola Bonacina, Univ. degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitat Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, LORIA-INRIA Nancy, France Natarajan Shankar, SRI International, Menlo Park, CA, USA Eelco Visser, Delft Univ. of Technology, The Netherlands Christoph Weidenbach, MPI-INF, Saarbrucken, Germany Web: iws2010.inria.fr Email: iws2010 at inria.fr From carlos.martin at urv.cat Sat Jan 30 15:11:05 2010 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Sat, 30 Jan 2010 21:11:05 +0100 Subject: [TYPES/announce] LATA 2010: early registration deadline Message-ID: 4th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2010) Trier, Germany, May 24-28, 2010 ******************************************************* Early registration deadline: February 15, 2010 !!! Please visit: http://grammars.grlmc.com/LATA2010/ ******************************************************* INVITED LECTURES John Brzozowski Complexity in Convex Languages Alexander Clark Three Learnable Models for the Description of Language Lauri Karttunen to be announced (tutorial) Borivoj Melichar Arbology: Trees and Pushdown Automata Anca Muscholl Analysis of Communicating Automata (tutorial) CONTRIBUTED PAPERS Vincent Aravantinos, Ricardo Caferra, and Nicolas Peltier Complexity of the Satisfiability Problem for a Class of Propositional Schemata Pablo Arrighi and Jonathan Grattage A Simple n-dimensional Intrinsically Universal Quantum Cellular Automata Abdullah N. Arslan A Fast Longest Common Subsequence Algorithm for Similar Strings Francine Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa, and Sean Simmons Abelian Square-Free Partial Words Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, and Eric Weissenstein Avoidable Binary Patterns in Partial Words Nicolas Bousquet and Christof Loeding Equivalence and Inclusion Problem for Strongly Unambiguous B?chi Automata Wojciech Buszkowski and Lin Zhe Pregroup Grammars with Letter Promotions J?r?mie Cabessa and Alessandro Villa A Hierarchical Classification of First-Order Recurrent Neural Networks Rafael Carrascosa, Fran?ois Coste, Matthias Gall?, and Gabriel Infante-L?pez Choosing Word Occurrences for the Smallest Grammar Problem Claudia Casadio Agreement and Cliticization in Italian: a Pregroup Analysis Jean-Marc Champarnaud, Jean-Philippe Dubernard, and Hadrien Jeanne Geometricity of Binary Regular Languages Christian Choffrut, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano On the Expressive Power of FO[+] Christophe Costa Florencio and Henning Fernau Finding Consistent Categorial Grammars of Bounded Value: a Parameterized Approach Stefano Crespi Reghizzi and Dino Mandrioli Operator Precedence and the Visibly Pushdown Property Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen On the Maximal Number of Cubic Runs in a String William de la Cruz de los Santos and Guillermo Morales Luna On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT Barbara Di Giampaolo, Salvatore La Torre, and Margherita Napoli Parametric Metric Interval Temporal Logic R?diger Ehlers Short Witnesses and Accepting Lassos in omega-automata Travis Gagie and Pawel Gawrychowski Grammar-Based Compression in a Streaming Model Hermann Gruber and Stefan Gulan Simplifying Regular Expressions. A Quantitative Perspective Reinhard Hemmerling, Katarina Smolenova, and Winfried Kurth A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks Dag Hovland The Inclusion Problem for Regular Expressions Sanjay Jain, Qinglong Luo, and Frank Stephan Learnability of Automatic Classes Charles Jordan and Thomas Zeugmann Untestable First-Order Sentences: Four Universal and One Existential Quantifier Makoto Kanazawa and Sylvain Salvati The Copying Power of Well-nested Multiple Context-free Grammars Barbara Klunder and Wojciech Rytter Post Correspondence Problem with Partially Commutative Alphabets Timo K?tzing and Anna Kasprzik String Extension Learning using Lattices Martin Kutrib and Andreas Malcher Reversible Pushdown Automata Alexander Letichevsky, Arsen Shoukourian, and Samvel Shoukourian The Equivalence Problem of Deterministic Multitape Finite Automata. A New Proof of Solvability Using A Multidimensional Tape Peter Leupold Primitive Words Are Unavoidable for Context-Free Languages Florin Manea and Catalin Tiseanu Hard Counting Problems for Partial Words Tobias Marschall and Sven Rahmann Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata Nimrod Milo, Tamar Pinhas, and Michal Ziv-Ukelson SAPC - Sequence Alignment with Path Constraints Sakthi Muthiah and Parameswaran Seshan Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem Benedek Nagy and Friedrich Otto CD-Systems of Stateless Deterministic R(1)-Automata Accept all Rational Trace Languages Turlough Neary A Boundary Between Universality and Non-universality in Extended Spiking Neural P Systems Rafael Pe?aloza Using Sums-of-products for Non-standard Reasoning Martin Platek, Frantisek Mraz, and Marketa Lopatkova Restarting Automata with Structured Output and Functional Generative Description Alberto Policriti, Alexandru I. Tomescu, and Francesco Vezzi A Randomized Numerical Aligner (rNA) Fernando Rosa-Velardo and Giorgio Delzanno A Language-based Comparison of Nets with Black Tokens, Pure Names and Ordered Data Neda Saeedloei and Gopal Gupta Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) Sarai Sheinvald, Orna Grumberg, and Orna Kupferman Variable Automata over Infinite Alphabets Hellis Tamm Some Minimality Results on BiRFSA and Biseparable Automata Frank Weinberg and Markus Nebel Extending Stochastic Context-Free Grammars for an Application in Bioinformatics Ryo Yoshinaka, Yuichi Kaji, and Hiroyuki Seki Chomsky-Sch?tzenberger-Type Characterization of Multiple Context-Free Languages Hans Zantema Complexity of Guided Insertion-Deletion in RNA-editing Lin Zhe Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-freeness From zambon at cs.utwente.nl Mon Feb 1 05:14:04 2010 From: zambon at cs.utwente.nl (Eduardo Zambon) Date: Mon, 01 Feb 2010 11:14:04 +0100 Subject: [TYPES/announce] 2nd Call for Papers: ICGT 2010 -- Abstract submission: 9 Apr '10 Message-ID: <4B66A96C.7020000@cs.utwente.nl> [Our apologies for multiple receptions of this message.] -------------------------------------------------------------------------------- 5th International Conference on Graph Transformation (ICGT 2010) University of Twente, Enschede, The Netherlands 29 September - 1 October 2010 ---------------------------------------------- 2nd Call for Papers The 5th International Conference on Graph Transformation (ICGT 2010) will be held at the University of Twente in Enschede (The Netherlands) in the last week of September 2010. It continues the line of conferences previously held in Barcelona (Spain) in 2002, Rome (Italy) in 2004, Natal (Brazil) in 2006 and Leicester (UK) in 2008, as well as a series of six International Workshops on Graph Transformation with Applications in Computer Science between 1978 and 1998. The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Awards will be given by EATCS and EASST for the best theoretical and application-oriented papers. Proceedings will be published by Springer in the Lecture Notes in Computer Science series (http://www.springer.com/lncs). ICGT 2010 will be colocated with the SPIN 2010 workshop on Software Model Checking, and will also host several satellite events. Invited Speakers ================ We are pleased to announce the following invited speakers: - Javier Esparza, University of Munich (joint keynote speaker with SPIN 2010) - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg Satellite events ================ The following workshops will take place as ICGT satellite events: - 3rd Workshop on Graph Computation Models (GCM 2010) - 6th International Workshop on Graph-Based Tools (GraBaTs 2010) - 4th Workshop on Petri Nets and Graph Transformations (PNGT 2010) - Workshop and Tutorial on Natural Computing (WTNC 2010) Scope ===== Graphs are among the simplest and most universal models for a variety of systems, not just in computer science, but throughout engineering and the life sciences. When systems evolve we are interested in the way they change, to predict, support, or react to their evolution. Graph transformation combines the idea of graphs as a universal modelling paradigm with a rule-based approach to specify evolution. The area is concerned with both the theory of graph transformation and their application to a variety of domains. The conference aims at bringing together researchers and practitioners interested in the foundations and application of graph transformation to a variety of areas. Topics of interest include, but are not limited to * Foundations and theory of o General models of graph transformation o High-level and adhesive replacement systems o Node-, edge-, and hyperedge replacement grammars o Parallel, concurrent, and distributed graph transformation o Term graph rewriting o Hierarchical graphs and decompositions of graphs o Graph theoretical properties of graph languages o Geometrical and topological aspects of graph transformation o Automata on graphs and parsing of graph languages o Analysis and verification of graph transformation systems o Structuring and modularization concepts for transformation systems o Graph transformation and Petri nets * Languages, tool support and applications in o Software architecture o Workflows and business processes o Software quality, testing and evolution o Access control and security models o Aspect-oriented development o Model-driven development, especially model transformations o Domain-specific languages o Implementation of programming languages o Bioinformatics and system biology o Natural computing o Image generation and pattern recognition techniques o Massively parallel computing o Self-adaptive systems and ubiquitous computing o Service-oriented applications and semantic web Paper submission is at http://www.easychair.org/conferences/?conf=icgt2010. Submitted papers may not exceed fifteen (15) pages using Springer's LNCS format (http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. Selected papers will be invited for submission to special issues of Fundamenta Informaticae (for theoretically oriented papers) and Software and Systems Modeling (for application-oriented papers). Important Dates: ================ Abstract submission: 9 April 2010 Full paper submission: 16 April 2010 Notification of acceptance: 7 June 2010 Final version due: 28 June 2010 Main conference: 29 September - 1 October 2010 Satellite events: 28 September and 2 October 2010 Venue: ====== The University of Twente is located in a beautiful green area between the cities of Hengelo and Enschede, in the eastern part of The Netherlands. It has good connections to the airports of Schiphol (Amsterdam, The Netherlands) and M?nster (Germany). The main town, Enschede, lies directly on the Dutch/German border, and it is a characteristic, modern and lively university town. Elegant historic buildings in the town and surrounding area are evocative of Enschede's rich textile past. Some of the town's most notable monuments are the beautiful town hall, several beautiful churches and a unique synagogue. The University of Twente is an entrepreneurial research university. It was founded in 1961 and offers education and research in areas ranging from public policy studies and applied physics to biomedical technology. The UT is the Netherlands' only campus university. It counts in the order of 10,000 students. Programme Committee: ==================== - Paolo Baldan, University of Padova (Italy) - Luciano Baresi, University of Milano (Italy) - Michel Bauderon, University of Bordeaux (France) - Artur Boronat, University of Leicester (UK) - Paolo Bottoni, University of Rome La Sapienza (Italy) - Andrea Corradini, University of Pisa (Italy) - Juan de Lara, Autonomous University of Madrid (Spain) - Hartmut Ehrig, Technical University of Berlin (Germany) - Gregor Engels, University of Paderborn (Germany) - Claudia Ermel Technical University of Berlin (Germany) - Holger Giese, University of Potsdam (Germany) - Annegret Habel, University of Oldenburg (Germany) - Reiko Heckel, University of Leicester (UK) - Dirk Janssens, University of Antwerp (Belgium) - Garbor Karsai, Vanderbilt University (USA) - Ekkart Kindler, Technical University of Denmark (Denmark) - Barbara Koenig, University of Duisburg-Essen (Germany) - Hans-J?rg Kreowski, University of Bremen (Germany) - Ralf L?mmel, University of Koblenz (Germany) - Mark Minas, Universit?t der Bundeswehr M?nchen (Germany) - Ugo Montanari, University of Pisa (Italy) - Mohamed Mosbah, University of Bordeau (France) - Manfred Nagl, RWTH Aachen University (Germany) - Fernando Orejas, Technical University of Catalonia (Spain) - Francesco Parisi-Presicce, University of Rome La Sapienza (Italy) - Rinus Plasmeijer, Radboud University (The Netherlands) - Detlef Plump, University of York (UK) - Arend Rensink (PC co-chair), University of Twente (The Netherlands) - Leila Ribeiro, Federal University of Rio Grande do Sul (Brazil) - Andy Sch?rr (PC co-chair), Technische Universit?t Darmstadt (Germany) - Gabriele Taentzer, University of Marburg (Germany) - Pieter Van Gorp, Technical University of Eindhoven (The Netherlands) - D?niel Varr?, Budapest University of Technology and Economics (Hungary) - Gergely Varr?, Budapest University of Technology and Economics (Hungary) - Jens-Holger Weber-Jahnke, University of Victoria (USA) - Albert Z?ndorf, University of Kassel (Germany) Organisation ============ Program Chairs - Arend Rensink , University of Twente, The Netherlands - Andy Sch?rr , Technische Universit?t Darmstadt, Germany Local Organisation - Maarten de Mol , University of Twente, The Netherlands Publicity Chair: - Eduardo Zambon , University of Twente, The Netherlands Workshop Chair: - Amir Ghamarian , University of Twente, The Netherlands Further information can be found at: http://www.utwente.nl/icgt2010 -------------------------------------------------------------------------------- From ronchi at di.unito.it Mon Feb 1 10:22:40 2010 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Mon, 1 Feb 2010 16:22:40 +0100 Subject: [TYPES/announce] Workshop on Logic and Computational Complexity (LCC'10) Message-ID: ======================================================================== ======================================================== Preliminary call for papers 11th International Workshop on Logic and Computational Complexity LCC'10 http:// web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html Edinburgh, July 10, 2010 affiliated to LICS 2010 ======================================================================== ======================================================== The Eleventh International Workshop on Logic and Computational Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as an affiliated meeting of Logic in Computer Science (LiCS) 2010 as part of the 2010 Federated Logic Conference (FLoC). LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The LCC'10 program consists of invited lectures as well as contributed papers selected by the program committee. Details on invited speakers will be made available later. Types of submission This year we invite two forms of submissions: full papers and abstracts for short presentation. Submissions published elsewhere or which are simultaneouosly being submitted to another conference or workshop are welcome, but this information must be revealed to the PC chairs. Complete submissions: Complete papers have a page limit of 15 pages, and their acceptance implies a presentation of half an hour. Abstract submissions: Abstracts have a page limit of 4 pages, they are supposed to be used for communicating problems or not yet developed ideas, and their acceptance imply a short presentation of ten minutes. Proceedings: Post-preceedings could be considered, depending on the number and the quality of the submissions. Important Dates: Submission deadline: 1 May 2010, 1am CET (GMT +1). The submission server will remain open till 7am CET. Author notification: 1 June 2010 Program Committee Andrei Bulatov (Vancouver) Phokion Kolaitis (Santa Cruz) Jan Krajicek (Prague) Stephan Kreutzer (Oxford, co-chair) Olivier Laurent (Lyon) Jean Yves Moyen (Paris 13) Damian Niwinski (Warsaw) Simona Ronchi Della Rocca (Torino, co-chair) Steering Committee Michael Benedikt (Oxford) (Co-chair) Robert Constable (Cornell) Anuj Dawar (Cambridge) Fernando Ferreira (Lisbon) Martin Hofmann (U Munich) Neil Immerman (U Mass. Amherst) Neil Jones (Copenhagen) Bruce Kapron (U Victoria) Daniel Leivant (Indiana U) (Co-chair) Jean-Yves Marion (LORIA Nancy) Luke Ong (Oxford) Martin Otto (Darmstadt) James Royer (Syracuse) Helmut Schwichtenberg (U Munich) Pawel Urzyczyn (Warsaw) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100201/df03f435/attachment.htm From xinyu.feng at gmail.com Mon Feb 1 20:38:50 2010 From: xinyu.feng at gmail.com (Xinyu Feng) Date: Mon, 01 Feb 2010 19:38:50 -0600 Subject: [TYPES/announce] Postdoctoral Research Fellows in, Methods of Model-Based Design and, Verification (UNU-IIST) Message-ID: <4B67822A.7020605@gmail.com> See below. If you are interested, please send your applications or contact Dr. Zhiming Liu following the instructions (do *not* contact me). - Xinyu ======================== cut here ================== Vacancy Announcement United Nations University International Institute for Software Technology (UNU-IIST ) Three Postdoctoral Research Fellows *Model-Based Design and Verification* The rCOS Team at UNU-IIST is looking for three postdoctoral research fellows in the area of model-based design and verification techniques, and tool development. http://rcos.iist.unu.edu/rcos-postdocs-2010 Research topics include, but are not limited to: * Research on Formal Methods with application to Software Engineering (e.g. semantics of OO, model- and program transformation, correctness by construction, refinement). * Formal use of UML and tool development for model-driven design and analysis. * Specification languages for verification properties, their expressiveness and visualization. * Efficiency of runtime monitors: analyse, visualize and improve performance of runtime monitors. * Guided runtime verification: combine testing and runtime verification. * Synthesize and monitor runtime checks in generated code from specifications. Requirements: We are seeking young research scientists with (or in the process of obtaining) a PhD in computer science. The successful applicants should have background in one of the following fields: model checking, runtime verification, (model based) testing, theorem proving. OO programming experience is of advantage. Good English speaking and writing skills are necessary. The rCOS Modeler for use case-driven design of component-based systems using UML covers both the rCOS specification language in a pre/postcondition style, and a graphical editor to develop component models. Several back-ends address verification/model checking, code generation, and test case-generation. The tool is made available as an Open Source product. Besides research, the successful applicants will also be involved in helping to supervise postgraduate students from developing countries recruited to the project as UNU-IIST fellows, and are invited to participate in other activities of the institute. Conditions: The postdoctoral positions are contract appointments starting with one year, renewable depending on performance. Salary will be in the range 2,500-3,500 USD per month paid without deduction of tax. UNU-IIST will provide medical insurance and a fully-furnished apartment (exclusive of utility expenses). Research Group: The rCOS group has a track record of attracting young international Post Docs to jump start their academic careers. Research will be conducted in close cooperation with the international rCOS team, colleagues at UNU-IIST, and colleagues in Norway, Denmark, Germany and China (including universities in Macau). The group is led by Dr. Zhiming Liu and part of UNU-IIST's Information Engineering Programme. There are current two projects, Harnessing Theories for Tool Support (HTTS ) and Applied Runtime Verification (ARV ). HTTS is a joint project with the University of Macau, ARV in collaboration with the University of Oslo, Norway, and the Institute of Software at the Chinese Academy of Sciences, Beijing. UNU-IIST is a Research and Training Centre of the United Nations University . Its mission is to help developing countries strengthen their education and research in computer science and their ability to produce computer software. It thus provides a unique setting with a proven record in the application of mathematical methods to the production of useful theories for practical problems and for training young researchers in Formal Methods and Theoretical Computer Science. Macao is a multi-cultural city blending Asian and Western elements, about one hour from Hong Kong, and offering easy access to China and South-East Asia. The positions are open immediately until filled. Prospective candidates should submit their electronic application giving a potential starting date, including CV and a list of publications. Please list the email addresses of two or three people to whom we can apply for references. Such people should be able to comment authoritatively on your work, education, skills, and abilities. Please indicate if you do not want us to contact them at this stage. You may also attach soft copies of up to three of your papers, e.g. if the publication is not easily/electronically available. Please direct applications to \n Mrs. Wendy Hoi This e-mail address is being protected from spambots. You need JavaScript enabled to view it (Administrative & Programme Services Officer). Feel free to contact Dr. Zhiming Liu or Dr. Volker Stolz directly for informal enquiries. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100201/a68d62a5/attachment-0001.htm From birkedal at itu.dk Tue Feb 2 07:36:17 2010 From: birkedal at itu.dk (Lars Birkedal) Date: Tue, 02 Feb 2010 13:36:17 +0100 Subject: [TYPES/announce] Ph.D. positions at the IT University of Copenhagen Message-ID: <4B681C41.3060607@itu.dk> Dear All, A number of Ph.D. positions are available in the Programming, Logic, and Semantics research group at the IT University of Copenhagen. Please see http://www1.itu.dk/graphics/ITU-library/Intranet/Personale/Stillingsopslag/VIP/Stillingsopslag%202010/PhD%20call_spring%202010_text.pdf for the official announcement and for information on how to apply. Application deadline is March 24, 2010. Potential applicants are welcome to contact me or other faculty members in the PLS group (www.itu.dk/research/pls) for more information. Best wishes, Lars Birkedal Professor, Head of PLS group and the FIRST research school. www.itu.dk/~birkedal From jfrazee at mail.utexas.edu Tue Feb 2 11:36:05 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Tue, 2 Feb 2010 10:36:05 -0600 Subject: [TYPES/announce] NASSLLI 2010: CALL FOR PARTICIPATION Message-ID: <103f6a951002020836k37ba07dla0dc46a28b9aa651@mail.gmail.com> CALL FOR PARTICIPATION Fourth North American Summer School in Logic, Language, and Information NASSLLI 2010 June 20-26, 2010 http://www.indiana.edu/~nasslli/ The North American Summer School in Logic, Language, and Information (NASSLLI) is a summer school with classes in the interface between computer science, linguistics, and logic. After previous editions at Stanford University, Indiana University, and UCLA, NASSLLI will return to Bloomington, Indiana, June 20?26, 2010. The summer school, loosely modeled on the long-running ESSLLI series in Europe, will consist of a number of courses and workshops, selected on the basis of the proposals. Courses and workshops meet for 90 or 120 minutes on each of five days, June 21?25, and there will be tutorials on June 20 and a day-long workshop on June 26. The instructors are prominent researchers who volunteer their time and energy to present basic work in their disciplines. Many are coming from Europe just to teach at NASSLLI. NASSLLI courses are aimed at graduate students and advanced undergraduates in wide variety of fields. The instructors know that people will be attending from a wide range of disciplines, and they all are pleased to be associated with an interdisciplinary school. The courses will also appeal to post-docs and researchers in all of the relevant fields. We hope to have 100-150 participants. In addition to classes in the daytime, the evenings will have social events and plenary lectures. Bloomington is a wonderful place to visit, known for arts, music, and ethnic restaurants. All of this is within 15 minutes walking from campus. We aim to make NASSLLI fun and exciting. Joey Frazee Student Program Committee From vs at ecs.soton.ac.uk Tue Feb 2 12:38:14 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Tue, 2 Feb 2010 17:38:14 +0000 Subject: [TYPES/announce] call for papers: IFIP-TCS 2010 References: <924D2C6F-B7F7-438D-ADCB-3AD6ACCC8A8D@ecs.soton.ac.uk> Message-ID: Dear colleagues, please consider submitting a paper to the 6th IFIP International Conference on Theoretical Computer Science a part of the IFIP World Computer Congress 2010 Brisbane, Australia 20-23 September 2010 www.wcc2010.com Deadline for abstracts: Feb 12th Deadline for papers: Feb 19th. The CfP is available at http://www.wcc2010.com/migrated/TCS2010/TCS2010_cfp.html Submission at https://www.easychair.org/login.cgi?conf=tcs2010 With best regards, V. Sassone PC chair From rinard at csail.mit.edu Wed Feb 3 15:21:43 2010 From: rinard at csail.mit.edu (Martin Rinard) Date: Wed, 03 Feb 2010 15:21:43 -0500 Subject: [TYPES/announce] OOPSLA 2010 Call For Papers Message-ID: <4b69dad7.XiesKR5zZXIFBEkd%rinard@csail.mit.edu> Call for Papers OOPSLA 2010 Research Papers October 17 to 20 Reno/Tahoe Nevada, USA www.splashcon.org Paper Submission Deadline: March 25, 2010 Accept/Reject Notification Date: May 24, 2010 OOPSLA 2010 solicits research papers that present new research, report novel technical results, advance the state of the art, or discuss experience or experimentation. The scope of OOPSLA includes all aspects of programming languages and software engineering, broadly construed. Papers may address any aspect of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, project cancellation, maintenance, reuse, regeneration, replacement, and retirement of software systems. Papers on tools (such as new programming languages, dynamic or static program analyses, compilers, and garbage collectors) or techniques (such as new programming methodologies, type systems, design processes, code organization approaches, and management techniques) designed to reduce the time, effort, and/or cost of software systems are particularly welcome. Submitted papers should conform to the ACM Proceedings Format. There is no page limit on submitted papers. It is, however, the responsibility of the authors to keep the reviewers interested and motivated to read the paper. Reviewers are under no obligation to read all or even a substantial portion of a paper if they do not find the initial part of the paper interesting. The committee will not accept a paper if it is not clear to the committee that the paper will fit in the OOPSLA 2010 proceedings, which will limit accepted papers to 20 pages. We anticipate that the vast majority of accepted OOPSLA submissions will fit in 12 pages or less. OOPSLA particularly encourages the submission of papers that diverge from the dominant trajectory of the field or challenge the existing value system. Such papers are often controversial. To enhance the ability of the program committee to accept such papers, each member of the committee will have the unilateral right to accept one paper into the conference regardless of the opinions of the other committee members. This policy is designed to favor papers that elicit strong opinions (both positive and negative) over relatively predictable papers that simply reinforce the existing status quo. The program committee may consider the following criteria when evaluating submitted papers: Novelty - The paper presents new ideas and/or results and places these ideas and results appropriately within the context established by previous research in the field. Interest - The results in the paper are interesting, intriguing, or provocative. The paper challenges or changes informed opinion about what is possible, true, or likely. Evidence - The paper presents evidence supporting its claims. Examples of evidence include formalizations and proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes. Clarity - The paper presents its claims and results clearly. OOPSLA 2010 will continue a long-standing tradition of recognizing a student-authored paper of the conference. The program chair will select the recognized paper among those recommended by the program committee. Eligible papers will describe the work of one or more students, one of whom must be the primary author. Authors will indicate eligibility as part of the submission process. OOPSLA 2010 will also present an award for the most influential paper published 10 years ago at OOPSLA 2000. OOPSLA Research papers will be presented as part of the new Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH) Conference, which grew out of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). Program Chair: Martin Rinard (MIT) rinard at lcs.mit.edu Program Committee Ali-Reza Adl-Tabatabai (Intel) Elisa Baniassad (Australian National University) Emery Berger (University of Massachusetts, Amherst) Hans-J. Boehm (HP Labs) Michael Bond (University of Texas, Austin) Cristian Cadar (Imperial College) Robert Cartwright (Rice University) Wei-Ngan Chin (National University of Singapore) Jong-Deok Choi (Samsung) Brian Demsky (University of California, Irvine) Kathleen Fisher (AT&T Labs Research) Richard P. Gabriel (IBM Research) Robert Hirschfeld (Hasso-Plattner-Institut Potsdam) Antony Hosking (Purdue University) Maria Jump (King's College) Christoph Kirsch (University of Salzburg) Patrick Lam (Waterloo) Gary T. Leavens (University of Central Florida) Ondrej Lhotak (Waterloo) Benjamin Pierce (University of Pennsylvania) Bill Pugh (University of Maryland) Shaz Qadeer (Microsoft) Jakob Rehof (University of Dortmund) Dirk Riehle (Friedrich-Alexander-University of Erlangen-Nurnberg) Dave Thomas (Bedarra Research Labs) Vijay Saraswat (IBM Research) Koushik Sen (University of California, Berkeley) Eli Tilevich (Virginia Tech) Frank Tip (IBM Research) Westley Weimer (University of Virginia) Eran Yahav (IBM Research) Kwangkeun Yi (Seoul National University) Lenore Zuck (National Science Foundation, University of Illinois at Chicago) OOPSLA 2010 will not accept submissions from Program Committee members. OOPSLA 2010 submissions must conform to both the ACM Policy on Prior Publication and Simultaneous Submissions, available at http://www.acm.org/publications/policies/sim_submissions/, and the SIGPLAN Republication Policy, available at http://www.sigplan.org/republicationpolicy.htm. From Bob.Coecke at comlab.ox.ac.uk Thu Feb 4 08:13:17 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Thu, 4 Feb 2010 13:13:17 +0000 (GMT) Subject: [TYPES/announce] CSR 2010 Workshop on High Productivity Computations, Kazan, Russia, June 21-22 2010. Message-ID: CSR 2010 Workshop on High Productivity Computations, June 21-22 2010, Kazan, Russia. http://csr2010.antat.ru/HPC.html Scope: The workshop is intended to organize the discussions about high productivity computing means and models, including but not limited to high performance and quantum information processing. Work in the area of Computer Science Logic is particularly welcome. The workshop proceeds the 5th International Computer Science Symposium in Russia (CSR 2010) which is also held in Kazan, June 16--20. Program committee chairs: Farid Ablayev Bob Coecke Program committee: Rusins Freivalds Aida Gainutdinova Alexander Holevo Richard Jozsa Airat Khasianov Vladimir Korepin Alexander Razborov Alexander Vasiliev Mingsheng Ying Scope: The workshop is intended to organize the discussions about high productivity computing means and models, including but not limited to high performance and quantum information processing. The workshop proceeds the 5th International Computer Science Symposium in Russia (CSR 2010) which is also held in Kazan, June 16--20. http://csr2010.antat.ru/index.html Submissions: Authors are invited to submit an up to 6 pages abstract which provides an essence of results allowing the program committee to evaluate the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions of both original and already presented research are welcome. Submissions should be in Postscript or PDF format and should be sent to HPC.CSR2010 at gmail.com by February 25, 2010, with a subject ``Submission''. We're applying to publish the extended versions of abstracts in Electronic Proceedings in Theoretical Computer Science Further information and contact: http://csr2010.antat.ru/HPC.html HPC.CSR2010 at gmail.com From sacerdot at cs.unibo.it Thu Feb 4 19:06:36 2010 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Fri, 05 Feb 2010 01:06:36 +0100 Subject: [TYPES/announce] Call for papers: User Interfaces for Theorem Provers, UITP 2010 Message-ID: <1265327816.21285.291.camel@zenone> [Apologies if you receive multiple copies] CALL FOR PAPERS User Interfaces for Theorem Provers, UITP 2010 A satellite workshop of FLoC'10 Edinburgh, Scotland, 15th July 2010 http://uitp10.cs.unibo.it/ The User Interfaces for Theorem Provers workshop series brings together researchers interested in designing, developing and evaluating interfaces for interactive proof systems, such as theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. While the reasoning capabilities of interactive proof systems have increased dramatically over the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with proof systems. We welcome participation and contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. UITP 2010 is a one-day workshop to be held the 15th July 2010 in Edinburgh, Scotland, as a FLoC'10 workshop. Submissions Submissions are encouraged in one of the following two categories: - Regular paper: Submissions in this category should describe previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. Papers should be formated following the ENTCS guidelines and up to 15 pages long - System description: Submissions in this category are intended to describe existing systems. Papers should be formated following the ENTCS guidelines and up to 5 pages long The additional UTIP'10-specific ENTCS macro file can be downloaded from: http://www.entcs.org/files/uitp10/prentcsmacro.sty Suggested topics include, but are not restricted to: * Application-specific interaction mechanisms or designs for prover interfaces * Experiments and evaluation of prover interfaces * Languages and tools for authoring, exchanging and presenting proofs * Implementation techniques (e.g. web services, custom middleware, DSLs) * Integration of interfaces and tools to explore and construct proof * Representation and manipulation of mathematical knowledge or objects * Visualisation of mathematical objects and proofs * System descriptions Authors are encouraged to bring along versions of their systems suitable for informal demonstration during breaks in the program of talks. The workshop proceedings will be distributed at the workshop as a collection of the accepted papers. Final versions of accepted papers have to be prepared with LaTeX. Following up the workshop the (revised) accepted papers will be published in a volume of ENTCS devoted to the workshop. Dates Deadline for submissions: April 5th 2010 Notification: April 28th 2010 Final versions due: May 22nd 2010 Workshop: July 15th 2010 Submission is via EasyChair (thanks to Andrei Voronkov) http://www.easychair.org/conferences/?conf=uitp09 More information can be found on the UITP web page at http://uitp10.cs.unibo.it/ Program Committee David Aspinall (University of Edinburgh, UK) (Co-Chair) Serge Autexier (DFKI Bremen, DE) Christoph Benzm?ller (Saarland University, DE) Yves Bertot (INRIA Sophia-Antipolis - M?diterran?e, FR) Ewen Denney (NASA Ames Research Center, USA) Cezary Kaliszyk (Technical University M?nchen, DE) Paul Libbrecht (University of Saarlandes and DFKI Saarbr?cken, DE) Christoph L?th (University of Bremen and DFKI Bremen, DE) Michael Norrish (NICTA, AU) Claudio Sacerdoti Coen (University of Bologna, IT) (Co-Chair) Geoff Sutcliffe (University of Miami, USA) Laurent Thery (INRIA Sophia-Antipolis - M?diterran?e, FR) Gem Stapleton (University of Brighton, UK) Makarius Wenzel (TU Munich, DE) Burkhart Wolff (University Paris-Sud 11, FR) Organizers and PC Chairs David Aspinall (University of Edinburgh, DE) Claudio Sacerdoti Coen (University of Bologna, IT) From david.pichardie at irisa.fr Fri Feb 5 03:47:59 2010 From: david.pichardie at irisa.fr (David Pichardie) Date: Fri, 5 Feb 2010 09:47:59 +0100 Subject: [TYPES/announce] Final Call for Participation: BYTECODE 2010 Message-ID: <0349C322-E158-4C0C-9772-999FF8AB0A99@irisa.fr> ******************************************************************** FINAL CALL FOR PARTICIPATION BYTECODE 2010 5th workshop on Bytecode Semantics, Verification, Analysis and Transformation (Satellite Event of the European Joint Conferences on Theory and Practice of Software, ETAPS 2010) March 27, 2010 Paphos, Cyprus http://bytecode2010.inria.fr/ ******************************************************************** IMPORTANT DATES Early registration deadline for ETAPS: February 15, 2010 REGISTRATION To register for BYTECODE 2010, follow the link from the ETAPS 2010 page, at http://www.etaps10.cs.ucy.ac.cy/ SCOPE Bytecode, such as produced by e.g. Java and .NET compilers, has become an important topic of interest, both for industry and academia. The industrial interest stems from the fact that bytecode is typically used for Internet and mobile devices (smart-cards, phones, etc.) applications, where security is a major issue. Moreover, bytecode is device-independent and allows dynamic loading of classes, which provides an extra challenge for the application of formal methods. In addition, the unstructuredness of the code and the pervasive presence of the operand stack also provide extra challenges for the analysis of bytecode. This workshop will focus on theoretical and practical aspects of semantics, verification, analysis, certification and transformation of bytecode. Both new theoretical results and tool demonstrations are welcome. INVITED SPEAKERS Mark Marron, IMDEA Software, Spain Francesco Logozzo, Microsoft Research, USA Matthew Parkinson, University of Cambridge, UK Fausto Spoto, University of Verona, Italy PRELIMINARY PROGRAM ---------------------- ** Session I 9:00-10:30 *** 09:00 Invited Speaker: Francesco Logozzo (Microsoft Research, USA) Language-agnostic Contract specification and checking with CodeContracts and Clousot *** 10:00 Jacek Chrzqszcz, Patryk Czarnik and Aleksy Schubert (The University of Warsaw, Poland) A dozen instructions make Java bytecode ---------------------- ** 10:30 coffee break ---------------------- ** Session II 11:00-12:30 *** 11:00 Invited Speaker: Mark Marron (IMDEA Software, Spain) Spec-tacular: heap assertions for .net bytecode *** 12:00 Jaroslav Bauml and Premek Brada (University of West Bohemia, Czech Republic) Reconstruction of Type Information from Java Bytecode for Component Compatibility ---------------------- ** 12:30 lunch ---------------------- ** Session III 14:00-16:00 *** 14:00 Invited Speaker: Matthew Parkinson (University of Cambridge, UK) The design of jStar *** 15:00 Philippe Wang, Adrien Jonquet and Emmanuel Chailloux (LIP6- UPMC, France) Non Intrusive Structural Coverage for Objective Caml *** 15:30 Jevgeni Kabanov (Tartu University, Estonia) JRebel Tool Demo ---------------------- ** 16:00 coffee break ---------------------- ** Session IV 16:30-18:00 *** 16:30 Invited Speaker: Fausto Spoto (University of Verona, Italy) Static Analysis of Java: from the Julia Perspective *** 17:30 Michael Eichberg and Andreas Sewe (Technische Universit?t Darmstadt, Germany) Encoding the Java Virtual Machine's Instruction Set PROGRAM COMMITTEE * David Aspinall, University of Edinburgh, Scotland * Stephen Chong, Harvard University, USA * Alessandro Coglio, Kestrel Institute, USA * Pierre Cr?gut, Orange Labs, France T?l?com, France * Samir Genaim, Complutense University of Madrid, Spain * Bart Jacobs, Katholieke Universiteit Leuven, Belgium * Gerwin Klein, University of New South Wales, Australia * Victor Kuncak, EPFL, Switzerland * Patrick Lam, University of Waterloo, Canada * Francesco Logozzo, Microsoft Research, USA * Matthew Parkinson, University of Cambridge, UK * David Pichardie (chair), INRIA Rennes, France * Rene Rydhof Hansen, Aalborg University, Denmark * Fausto Spoto, University of Verona, Italy From d.sannella at contemplateltd.com Fri Feb 5 04:05:52 2010 From: d.sannella at contemplateltd.com (Don Sannella) Date: Fri, 05 Feb 2010 09:05:52 +0000 Subject: [TYPES/announce] Jobs in Program Analysis R&D Message-ID: <4B6BDF70.2070000@contemplateltd.com> Contemplate Ltd, a spin-out from the University of Edinburgh, is working on tools for improving software quality, using type-based static analysis and related technologies. Our current focus is multi-threaded Java programs. Our current implementation languages include OCaml, Java, and Datalog. Contemplate has openings for a small number of Researcher Engineers and Software Engineers. Researcher Engineers should have PhD-level or equivalent training and also be excellent software engineers, capable of directing others. Software Engineers should have an outstanding academic and/or industrial record of achievement. For more details of desirable background experience, please see our recruiting page at http://www.contemplateltd.com/jobs.html Send notes of interest and enquiries to jobs at contemplateltd.com. -- -------------------------------------------------------- Don Sannella d.sannella at contemplateltd.com Contemplate Ltd www.contemplateltd.com From michaelw at cs.utwente.nl Fri Feb 5 16:36:44 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Fri, 5 Feb 2010 22:36:44 +0100 Subject: [TYPES/announce] PDMC 2010 Call for Papers Message-ID: <638671C5-577D-44B1-AF9B-3B4CE861C782@cs.utwente.nl> Call for Papers - PDMC 2010 ======================================================================= 9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2010) joint with 2nd International Workshop on High Performance Computational Systems Biology (HiBi 2010) ======================================================================= September 30 - October 1, 2010, Twente, The Netherlands http://www.pdmc.cz/PDMC10/ Co-locating with the joint ICGT/SPIN conference, Sep 27 - Oct 2 ----------------------------------------------------------------------- IMPORTANT DATES: ---------------- * Abstract submission: June 14, 2010 * Paper submission: June 21, 2010 * Author notification: July 31, 2010 * Workshop: September 30 - October 1, 2010 AIM AND SCOPE: -------------- The aim of the PDMC workshop series is to cover all aspects related to the verification and analysis of very large and complex systems using methods and techniques that exploit state-of-the-art hardware architectures. As such, the workshop provides a working forum for presenting, sharing, and discussing recent achievements in the field of high-performance verification. Topics of interest include, but are not limited to: * multi-core model checking * distributed model checking * multi-threaded/distributed equivalence checking * distributed state space generation * slicing and distributing the state space * parallel/distributed satisfiability checking * parallel/distributed theorem proving * parallel/distributed constraint solving * parallel methods in probabilistic model checking * parallel methods in performance evaluation * I/O efficient algorithms for verification * GPU accelerated verification * (libraries for) distributed graph algorithms * tools and case studies * industrial applications SUBMISSIONS: ------------ We accept * regular papers (max. 8 pages in IEEE format) * tool papers (max. 2 pages in IEEE format) * work-in-progress presentations All submissions must be original and unpublished. Regular and tool papers accepted for the presentation at the workshop will appear in IEEE post-proceedings. High-quality and mature work-in-progress papers might be invited for the proceedings, depending on the presentation at the workshop. INVITED SPEAKERS: ----------------- To be announced. PROGRAMME CHAIRS: ----------------- Jiri Barnat (Masaryk University, Czech Republic) Michael Weber (University of Twente, Netherlands) PROGRAMME COMMITTEE: -------------------- Henri Bal (Free University Amsterdam, Netherlands) Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Lubos Brim (Masaryk University, Czech Republic) Gianfranco Ciardo (University of California at Riverside, USA) Stefan Edelkamp (TZI Bremen, Germany) Ganesh Gopalakrishnan (University of Utah, USA) Keijo Heljanko (Aalto University, Finland) Gerard Holzmann (NASA/JPL, USA) William Knottenbelt (Imperial College, UK) Radu Mateescu (INRIA, France) Jaco van de Pol (University of Twente, Netherlands) Wheeler Ruml (University of New Hampshire, USA) Anna Slobodova (Centaur Technology, USA) -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From urzy at mimuw.edu.pl Sat Feb 6 15:14:11 2010 From: urzy at mimuw.edu.pl (=?UTF-8?B?UGF3ZcWCIFVyenljenlu?=) Date: Sat, 06 Feb 2010 21:14:11 +0100 Subject: [TYPES/announce] Workshop on Higher-Order Recursion Schemes & Pushdown Automata Message-ID: <4B6DCD93.3090705@mimuw.edu.pl> Workshop on Higher-Order Recursion Schemes & Pushdown Automata 10-12 March 2010 Paris, France http://www.liafa.jussieu.fr/~serre/WorkshopSchemes *** Subject *** The Workshop on Higher-Order Recursion Schemes and Pushdown Automata will be an opportunity to assess and disseminate recent advances in higher-order recursion schemes, higher-order pushdown automata, related models and their applications. It aims to promote interaction and collaboration between experts in these areas, and stimulate interest from researchers in related fields. *** Important Dates *** Registration by the 28th of February. Workshop the 10th (afternoon only), 11th and 12th (morning only) of March 2010. *** Confirmed Speakers *** Achim Blumensath (Technische Universit?t Darmstadt) A Pumping Lemma for Higher-order Pushdown Automata. Arnaud Carayol (LIGM ? Universit? Paris-Est & CNRS) Linear Orders in the Pushdown Hierarchy. Didier Caucal (LIGM ? Universit? Paris-Est & CNRS) An Extension of the Pushdown Hierarchy. Bruno Courcelle (Universit? Bordeaux 1 & Institut Universitaire de France) Syntactic Tools for Equivalence Problems. Ir?ne Guessarian (LIAFA & Universit? Paris 6) Program schemes: early results about semantics. Alexander Kartzow (Technische Universit?t Darmstadt) Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. Naoki Kobayashi (Tohoku University) Types and Recursion Schemes for Higher-Order Program Verification. Christof L?ding (RWTH Aachen) Finite Set Interpretations and Tree Automatic Structures of Higher Order. Luke Ong (Oxford University Computing Laboratory) Recursion Schemes and Collapsible Pushdown Automata. Sylvain Salvati (INRIA Bordeaux Sud-Ouest, Universit? de Bordeaux, LaBRI) Extending Recognizability to the Simply Typed lambda-Calculus. G?raud S?nizergues (Universit? Bordeaux 1) Automata on Free Groups and Regular Sets of Words of Level k. Olivier Serre (LIAFA ? Universit? Paris 7 & CNRS) Applications of the Equi-expressivity Theorem. Colin Stirling (School of Informatics, University of Edinburgh) To be announced. Igor Walukiewicz (LaBRI ? Universit? Bordeaux 1 & CNRS) A Model-Theoretic Approach to Model Checking Recursion Schemes. *** Registration Fees & Financial Support *** There will be no registration fee. We will be able to cover travel and accomodation costs for a limited number of participants (especially students). For more information on this support, please contact Olivier Serre. *** Sponsors *** The workshop is sponsored by the following Research Networking Programmes of the European Science Foundation: - Automata: from Mathematics to Applications (AutoMathA) - Games for Design and Verification (GAMES) *** Organisers *** Arnaud Carayol (Arnaud.Carayol at univ-mlv.fr) Luke Ong (lo at comlab.ox.ac.uk) Olivier Serre (Olivier.Serre at liafa.jussieu.fr) Pawe? Urzyczyn (urzy at mimuw.edu.pl) From Jeremy.Gibbons at comlab.ox.ac.uk Sun Feb 7 16:54:43 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Sun, 7 Feb 2010 21:54:43 GMT Subject: [TYPES/announce] Call for Papers: Haskell Symposium 2010 Message-ID: <201002072154.o17LshYf013834@merc4.comlab.ox.ac.uk> Haskell 2010 ACM SIGPLAN Haskell Symposium 2010 Baltimore MD, United States 30th September, 2010 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2010/ The ACM SIGPLAN Haskell Symposium 2010 will be co-located with the 2010 International Conference on Functional Programming (ICFP), in Baltimore, Maryland. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, Practice, and Experience, using Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth, as well as general experience with Haskell in education and industry. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Before 2008, the Haskell Symposium was known as the Haskell Workshop. The name change reflects both the steady increase of influence of the Haskell Workshop on the wider community, as well as the increasing number of high quality submissions. The selection process is highly competitive. After eleven Haskell Workshops between 1995 and 2007, the first Haskell Symposium was held in Victoria in 2008, and the second in Edinburgh in 2009. Submission Details * Submission Deadline: Monday, 14th June 2010, 15:00 UTC * Author Notification: Monday, 12th July 2010 * Final Papers Due : Monday, 2nd August 2010 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 text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2010, the 2010 Haskell Symposium web page. * http://www.icfpconference.org/icfp2010, the ICFP 2010 web page. Programme Committee * Jeremy Gibbons, University of Oxford (chair) * James Cheney, University of Edinburgh * Duncan Coutts, Well-Typed LLP * Sharon Curtis, Oxford Brookes University * Fritz Henglein, Kobenhavns Universitet * Tom Schrijvers, Katholieke Universiteit Leuven * Chung-chieh Shan, Rutgers - The State University of New Jersey * Martin Sulzmann, Informatik Consulting Systems AG * Wouter Swierstra, Vector Fabrics * Peter Thiemann, Universitaet Freiburg * Andrew Tolmach, Portland State University * Malcolm Wallace, University of York From A.M.Silva at cwi.nl Mon Feb 8 04:17:13 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Mon, 8 Feb 2010 10:17:13 +0100 Subject: [TYPES/announce] ICE 2010: First call for papers Message-ID: <20100208091713.GA28088@wendy.sen.cwi.nl> [- Apologies for multiple copies -] 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html === Highlights === - Innovative selection procedure - Travel grants for young researchers === Important Dates === - Abstract submission: 22 March 2010 - Full paper submission: 29 March 2010 - Reviews, rebuttal and PC discussion: 30 March - 28 April 2010 - Notification to authors: 30 April 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past two editions of ICE, this considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of accepted papers, and the discussion during the workshop. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions which the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Depending on the quality of submissions a special issue in a journal will be considered. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (University of Pisa, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: ? Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). ? Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From anindya.banerjee at imdea.org Mon Feb 8 08:42:05 2010 From: anindya.banerjee at imdea.org (Anindya Banerjee) Date: Mon, 8 Feb 2010 14:42:05 +0100 Subject: [TYPES/announce] Second Call for Papers: PLAS 2010, Toronto, Canada Message-ID: <431427801002080542p326dfe85qedb9aff46a64522f@mail.gmail.com> *********************************************************************** Second Call for Papers Fifth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ********************************* Submissions due: Friday, March 12, 2010 Author notification: Friday, April 23, 2010 Revised papers due: Monday, May 10, 2010 PLAS 2010 workshop: Thursday, June 10, 2010 Submission URL: https://www.easychair.org/login.cgi?conf=plas2010 SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software) (co-chair) Gilles Barthe (IMDEA Software) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100208/123495af/attachment.htm From eabonelli at gmail.com Mon Feb 8 08:53:54 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Mon, 8 Feb 2010 10:53:54 -0300 Subject: [TYPES/announce] HOR'2010 - 2nd CFP Message-ID: ************************************** * * * HOR 2010 2nd CALL FOR ABSTRACTS * * * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 25, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fern?ndez King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Fr?d?ric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Universit? di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Publication of post-workshop proceedings in EPTCS is under consideration. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts at inf.ed.ac.uk) From jv at cs.purdue.edu Mon Feb 8 18:31:17 2010 From: jv at cs.purdue.edu (Jan Vitek) Date: Mon, 8 Feb 2010 18:31:17 -0500 Subject: [TYPES/announce] Third Summer School on Trends in Concurrency Message-ID: <94962BDF-09C1-4873-B7EF-819F2AFB2BFE@cs.purdue.edu> ****************************************************************** *** TiC'10 *** *** Third International Summer School on Trends in Concurrency *** *** IIT-Bangalore, India *** *** May 23 - 30, 2010 *** ****************************************************************** email: tic10 at cs.purdue.edu Web: http://web.me.com/vitekj/TIC10 Speakers: * Madan Musuvavthi, Microsoft Research. * Mark Moir, Sun Microsystems * G. Ramalingam, Microsoft Research * Vijay Saraswat, IBM Research * Peter Sewell, Cambridge University. * Satnam Singh, Microsoft Research. * Matthew Parkinson, Cambridge University * Jean Pierre Talpin, INRIA * Adam Welc, Intel Research. Topics: Concurrency is a pervasive and essential characteristic of modern computer systems. Whether it is the design of new hyper-threading techniques in computer architectures, specification of non-blocking data structures and algorithms, implementation of scalable computer farms for handling massive data sets, or the design of a robust software architecture for distributed business processes, a deep understanding of mechanisms and foundations for expressing and controlling concurrency is required. Recent architectural advances in multi-core and many-core architectures have made this an essential topic for any serious student of computer science. This summer school will bring together outstanding researchers from academia and industry to discuss current research and future trends in concurrent systems design and implementation. All instructors have had significant impact in the area of concurrency, and play an active role in substantial ongoing research and commercial efforts. The goal of this school is to expose graduate students and young researchers to new and important ideas in concurrent programming. The focus this year is on programming language design, program analysis, specification, and implementation as they relate to concurrent and real-time systems. To encourage free discussion, attendance will be limited to 40 participants. Admission will be competitive, and preference will be given to students actively pursuing a Ph.D in the topic areas being covered. A small number of travel grants will be available. Sponsors: * Microsoft Research * Infosys * National Science Foundation Organizers: * Suresh Jagannathan * Ananth Gramma * Jan Vitek From cbraga at ic.uff.br Tue Feb 9 06:02:56 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 9 Feb 2010 09:02:56 -0200 Subject: [TYPES/announce] SBLP 2010 - 1st Call for Paper Message-ID: <4388158A-8D95-4A2F-8CA5-FA9F4403F6EE@ic.uff.br> [We apologize in advance if you receive multiple copies of this CFP] ============================================================= CALL FOR PAPERS 14th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Salvador, Bahia, Brazil September 27-29, 2010 http://cbsoft.dcc.ufba.br/ Abstract Submission: May 17, 2010 Paper Submission: May 24, 2010 ============================================================= The 14th Brazilian Symposium on Programming Languages, SBLP 2010, will be held in Salvador, Bahia, Brazil, on September 27-29, 2010. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. This year the symposium will be part of the 1st Brazilian Conference on Software: Theory and Practice, CBSoft 2010, http://cbsoft.dcc.ufba.br, which will host three traditional, well-established symposia: * IV Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) * XIV Brazilian Symposium on Programming Languages (SBLP) * XXIV Brazilian Symposium on Software Engineering (SBES) SBLP 2010 invites authors to contribute with Technical Papers and Tutorial Proposals related (but not limited) to: * Programming language design and implementation * Formal semantics of programming languages * Theoretical foundations of programming languages * Design and implementation of programming language environments * Object-oriented programming languages * Functional programming * Aspect-oriented programming languages * Scripting languages * Domain-specific languages * Programming languages for mobile, web and network computing * New programming models * Program transformations * Program analysis and verification * Compilation and interpretation techniques Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Selected papers written in English should be invited for a journal publication. ** We are currently in contact with Elsevier to ** ** have a special issue with selected papers. ** Papers should be presented in the language of submission. Detailed submission guidelines will be available at http://cbsoft.dcc.ufba.br/ IMPORTANT DATES Paper abstract submission (15 lines): May 17, 2010 Full paper submission: May 24, 2010 Notification of acceptance: July 09, 2010 Final papers due: August 02, 2010 BEST PAPER AWARD Awards will be given for the best papers at the symposium. GENERAL CHAIR Rita Suzana Pitangueira Maciel, UFPB, Brazil PROGRAMME CHAIR Ricardo Massa F. Lima, UFPE, Brazil PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alfio Martini, PUC-RS Alvaro Freitas Moreira, UFRGS Andre Rauber Du Bois, UCPel Andr? Santos, UFPE Carlos Camarao, UFMG Christiano Braga, Univ. Comp. de Madrid Cristiano Damiani, UFPEL Edward Hermann Haeusler, PUC-Rio Fernando Castor Filho, UFPE Francisco Heron de Carvalho Junior, UFC Isabel Cafezeiro, UFF Jo?o Saraiva, Universidade do Minho Johan Jeuring, Utrecht Univ. Jose Guimaraes, UFSCAR Jose E. Labra Gayo, Univ. of Oviedo Jose Luiz Fiadeiro, Univ. of Leicester Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Luis Carlos Meneses, UFPE Marcelo A. Maia, UFU Marco Tulio Valente, PUC Minas Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Paulo Borba, UFPE Peter Mosses, Swansea University Renato Cerqueira, PUC-Rio Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Rodolfo Jardim de Azevedo, UNICAMP Sandro Rigo, UNICAMP Sergio de Mello Schneider, UFU Sergio Soares, UFPE Sergiu Dascalu, Univ. of Nevada Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Vladimir Di Iorio, UFV Vitor Santos Costa, UFRJ ORGANIZATION Brazilian Computer Society and Universidade Federal da Bahia From cbraga at ic.uff.br Tue Feb 9 06:07:30 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 9 Feb 2010 09:07:30 -0200 Subject: [TYPES/announce] ICTAC 2010: FINAL Call for Papers Message-ID: ********************************************************************* FINAL Call for Papers - ICTAC 2010 International Colloquium on Theoretical Aspects of Computing Natal, Rio Grande do Norte, Brazil 1-3 September, 2010 http://www.ictac.net/ictac2010 ********************************************************************** ********************************************************************** * News *************************************************************** ** ** Submission site now open: ** http://www.easychair.org/conferences/?conf=ictac2010 ** ** Authors of a selection of the accepted papers will be invited to ** submit an extended version of their papers to a special issue of ** Elsevier's journal Theoretical Computer Science. * ** LNCS proceedings confirmed. * ********************************************************************** Background and Objectives ICTAC is an International Colloquium on Theoretical Aspects of Computing created by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous six ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006), Macau (2007), Istanbul, Turkey (2008) and Kuala Lumpur, Malaysia (2009). ICTAC 2010 includes two special tracks: a track on Formal Approaches to Testing, chaired by Marie-Claude Gaudel, and a track on the Grand Challenge in Verified Software, chaired by Jim Woodcock. The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, verification and testing, - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of theories, formal methods and tools for engineering computing systems - service-oriented development - service-oriented architectures: models and development methods - document-driven development - models of concurrency, security, and mobility - theory of parallel, distributed, and grid computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies, theories, tools and experiments of verified systems - domain-specific modeling and technology: examples, frameworks and experience ICTAC 2010 will be held in Brazil, in the city of Natal, Rio Grande do Norte. It will be organized jointly with the 3rd edition of the Pernambuco School on Software Engineering, to be held in Recife, Pernambuco, on the the topic of Formal Component Based Development and Coordination. ICTAC 2010 will include tutorials and technical sessions. Sponsors and Organisation ICTAC 2010 will be organized jointly by the Federal University of Rio Grande do Norte and UNU-IIST. They are also sponsors of ICTAC 2010. Invited Speakers Paulo Borba (Universidade Federal de Pernambuco, Brazil) Wolfram Schulte (Microsoft Research) Submission and Publication Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see www.springer.de/comp/lncs/authors.html for details).Papers should be submitted at www.easychair.org/conferences/?conf=ictac2010. All queries should be sent to: ictac2010 at iist.unu.edu. Important Dates Submission of abstracts: March 08th, 2010; Submission deadline: March 15th, 2010; Notification of results: April 30th, 2010; Final version: May 16th, 2010 Steering Committee John Fitzgerald, UK Martin Leucker, Germany Zhiming Liu (Chair), Macao Tobias Nipkow, Germany Augusto Sampaio, Brazil Natarajan Shankar, USA Jim Woodcock, UK Special Tracks Chairs Marie-Claude Gaudel, France Jim Woodcock, UK Program Committee Bernhard Aichernig, Austria Keijiro Araki, Japan Jonathan Bowen, UK Christiano Braga, Brazil Michael Butler, UK Andrew Butterfield, Ireland Ana Cavalcanti, UK (chair) Antonio Cerone, Macao Jim Davies, UK David Deharbe, Brazil (chair) John Fitzgerald, UK Wan Fokkink, Netherlands Pascal Fontaine, France Marcelo Frias, Argentina Lindsay Groves, New Zealand Michael Hansen, Denmark Robert Hierons, UK Monzoo Kim, South Korea Maciej Koutny, UK Pascale Le Gall, France Martin Leucker, Germany Zhiming Liu, Macao Patricia Machado, Brazil Marius Minea, Romania Ali Mili, USA Michael Mislove, USA Tobias Nipkow, Germany Jose Nuno Oliveira, Portugal Paritosh Pandya, India Alberto Pardo, Uruguay Anders P Ravn, Denmark Leila Ribeiro, Brazil Markus Roggenbach, UK Augusto Sampaio, Brazil Bernhard Schaetz, Germany Gerhard Schellhorn, Germany Emil Sekerinski, Canada Natarajan Shankar, USA Marjan Sirjani, Iran Jin Song Dong, Singapore Dang Van Hung, Vietnam Daniel Varro, Hungary Helmut Veith, Germany Ji Wang, China Martin Wirsing, Germany Burkhart Wolff, France Husnu Yenigun, Turkey Naijun Zhan, China Organising Committee David Deharbe, Brazil Anamaria Moreira, Brazil Martin Musicante, Brazil Marcel Oliveira, Brazil Bartira Rocha, Brazil From Bob.Coecke at comlab.ox.ac.uk Tue Feb 9 10:17:27 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Tue, 9 Feb 2010 15:17:27 +0000 (GMT) Subject: [TYPES/announce] CFP: 7th workshop on QUANTUM PHYSICS AND LOGIC (QPL), Oxford University, May 29-30, 2010. Message-ID: 7th workshop on QUANTUM PHYSICS AND LOGIC (QPL) Oxford University, May 29-30, 2010. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html The workshop succeeds a Spring School marking the end of the EU FP6 STREP QICS on Foundational Structures in Quantum Computation and Information, Oxford University, May 24-28, 2010. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html Invited Speakers at QPL: Antonio Acin (Barcelona; TBC) John Baez (UCR & Singapore) Louis Crane (Kansas State) QPL Organizers: Bob Coecke (co-chair) Prakash Panangaden (co-chair) Peter Selinger (co-chair) QPL Program Committee: Howard Barnum (Los Alamos) Dan Browne (UCL - London) Bob Coecke (Oxford) Andreas Doering (Oxford) John Harding (NMSU) Viv Kendon (Leeds) Keye Martin (NRL - Washington) Prakash Panangaden (McGill) Simon Perdrix (Grenoble) Peter Selinger (Dalhousie) Alex Wilce (Susquehanna) Deadlines: March 28: Submission April 13: Notification of authors May 16: Corrected papers due Description: This event has as its goal to bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science methods for the study physical behaviour in general. Over the past couple of years there has been a growing activity in these foundational approaches together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation. A predecessor of this event, with the same acronym, called Quantum Programming Languages, was held in Ottawa (2003), Turku (2004), Chicago (2005) and Oxford (2006). The first QPL under the new name Quantum Physics and Logic was held in Reykjavik (2008) and the second in Oxford (2009); with the change of name and a new program committee we emphasise the intended much broader scope of this event, aiming to nourish interaction between modern computer science logic, quantum computation and information, models of spatio-temporal causality, and quantum foundations. Submission: Prospective speakers are invited to submit a 2-5 pages abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allows the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. We both encourage submissions of original research as well as research submitted elsewhere. Submissions should be in Postscript or PDF format and should be sent to Bob Coecke by March 28, with as subject line QPL Submission. Receipt of all submissions will be acknowledged by return email. Extended versions of accepted original research contributions will be published as a special issue of a jounal - we are currently still exploring the options. From blume at tti-c.org Tue Feb 9 21:05:27 2010 From: blume at tti-c.org (Matthias Blume) Date: Tue, 9 Feb 2010 20:05:27 -0600 Subject: [TYPES/announce] *** FLOPS 2010: Call for Participation *** Message-ID: <4A1829C3-04E3-462E-8732-E80C36370941@tti-c.org> Call For Participation Tenth International Symposium on Functional and Logic Programming FLOPS 2010 April 19-21, 2010 Sendai, JAPAN http://www.kb.ecei.tohoku.ac.jp/flops2010/ ** Early registration ends on April 2, 2010 ** FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). VENUE The meeting will be held at the Aoba Memorial Hall, in the Aoba-yama Campus of the Tohoku University. REGISTRATION The registration is now open at the Symposium home page: http://www.kb.ecei.tohoku.ac.jp/flops2010/wiki/index.php?Registration PROCEEDINGS The proceedings will be published as volume 6009 of Lecture Notes in Computer Science, Springer, and distributed at the Symposium. INVITED SPEAKERS Brigitte Pientka (McGill University, Canada) Kostis Sagonas (National Technical University of Athens, Greece) Naoyuki Tamura (Kobe University, Japan) PROGRAM April 19 (Monday) 12:00-13:20 Registration and lunch 13:20-14:20 Invited talk Beluga: programming with dependent types and higher-order data Brigitte Pientka 14:40-16:10 Types - A Church-Style Intermediate Language for MLF Didier Remy, Boris Yakobowski - ??: Dependent Types without the Sugar Thorsten Altenkirch, Nils Anders Danielsson, Andres L?h, Nicolas Oury - Haskell Type Constraints Unleashed Dominic Orchard, Tom Schrijvers 16:30-18:00 Program analysis and transformation - A Functional Framework for Result Checking Gilles Barthe, Pablo Buiras, C?sar Kunz - Tagfree Combinators for Binding-Time Polymorphic Program Generation Peter Thiemann, Martin Sulzmann - Code Generation via Higher-Order Rewrite Systems Florian Haftmann, Tobias Nipkow April 20 (Tuesday) 09:00-10.00 Invited talk Using Static Analysis to Detect Type Errors and Race Conditions in Erlang Programs Konstantinos Sagonas 10:20-11:50 Foundations - A Complete Axiomatization of Strict Equality Javier ?lvez, Francisco Javier L?pez-Fraguas - Standardization and B?hm trees for Lambda-mu calculus Alexis Saurin - An Integrated Distance for Atoms Vicent Estruch, C?sar Ferri, Jos? Hern?ndez-Orallo, M.Jos? Ram?rez-Quintana 11:50- Lunch, excursion, and banquet April 21 (Wednesday) 09:00-10:00 Invited talk Solving Constraint Satisfaction Problems with SAT Technology Naoyuki Tamura 10:20-11:50 Logic programming - A Pearl on SAT Solving in Prolog Jacob Howe, Andy King - Automatically Generating Counterexamples to Naive Free Theorems Daniel Seidel, Janis Voigtl?nder - Applying Constraint Logic Programming to SQL Test Case Generation Yolanda Garc?a-Ruiz, Rafael Caballero, Fernando S?enz-P?rez 11:50-12:50 Lunch 12:50-14:20 Evaluation and normalization - Internal Normalization, Compilation and Decompilation for System F Stefano Berardi, Makoto Tatsuta - Normalization by Evaluation for the beta-eta Calculus of Constructions Andreas Abel - Defunctionalized Interpreters for Call-by-Need Evaluation Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny 14:40-16:10 Term rewriting - Complexity Analysis by Graph Rewriting Martin Avanzini, Georg Moser - Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus Jeroen Ketema, Jakob Grue Simonsen - Proving Injectivity of Functions via Program Inversion in Term Rewriting Naoki Nishida, Masahiko Sakai 16:30-18:00 Parallelism and control - Delimited Control in OCaml, Abstractly and Concretely. System Description Oleg Kiselyov - Automatic Parallelization of Recursive Functions using Quanti?er Elimination Akimasa Morihata, Kiminori Matsuzaki - A Skeleton for Distributed Work Pools in Eden Mischa Dieterle, Jost Berthold, Rita Loogen PC CO-CHAIRS Matthias Blume (Google, Chicago, USA) German Vidal (Technical University of Valencia, Spain) CONFERENCE CHAIR Naoki Kobayashi (Tohoku University, Sendai, Japan) PC MEMBERS Nick Benton (Microsoft Research, Cambridge, UK) Manuel Chakravarty (University of New South Wales, Australia) Michael Codish (Ben-Gurion University of the Negev, Israel) Bart Demoen (Katholieke Universiteit Leuven, Belgium) Agostino Dovier (University of Udine, Italy) John P. Gallagher (Roskilde University, Denmark) Maria Garcia de la Banda (Monash University, Australia) Michael Hanus (University of Kiel, Germany) Atsushi Igarashi (Kyoto University, Japan) Patricia Johann (Rutgers University, USA) Shin-ya Katsumata (Kyoto University, Japan) Michael Leuschel (University of Dusseldorf, Germany) Francisco Lopez-Fraguas (Complutense University of Madrid, Spain) Paqui Lucio (University of the Basque Country, Spain) Yasuhiko Minamide (University of Tsukuba, Japan) Frank Pfenning (Carnegie Mellon University, USA) Francois Pottier (INRIA, France) Tom Schrijvers (Katholieke Universiteit Leuven, Belgium) Chung-chieh "Ken" Shan (Rutgers University, USA) Zhong Shao (Yale University, USA) Jan-Georg Smaus (University of Freiburg, Germany) Nobuko Yoshida (Imperial College London, UK) LOCAL CHAIR Eijiro Sumii (Tohoku University, Sendai, Japan) SOME PREVIOUS FLOPS: FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR Japan Society for Software Science and Technology (JSSST), SIG-PPL Graduate School of Information Sciences, Tohoku University International Information Science Foundation IN COOPERATION with AAFS (Asian Association for Foundation of Software) ACM SIGPLAN ALP (Association for Logic Programming) INQUIRIES to flops2010 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100209/c2dfc1c6/attachment-0001.htm From stavros.tripakis at gmail.com Wed Feb 10 14:01:35 2010 From: stavros.tripakis at gmail.com (Stavros Tripakis) Date: Wed, 10 Feb 2010 11:01:35 -0800 Subject: [TYPES/announce] Two phase reviewing for POPL; a response Message-ID: Dear Simon, all, Thanks for sharing your thoughts. A complementary idea, or maybe a cheaper starting point, would be to separate dissemination from selection: http://www-verimag.imag.fr/~tripakis/papers/lets.pdf I'd be happy to get comments on this. Thank you and best regards, Stavros From olivier.laurent at ens-lyon.fr Wed Feb 10 16:34:54 2010 From: olivier.laurent at ens-lyon.fr (Olivier Laurent) Date: Wed, 10 Feb 2010 22:34:54 +0100 Subject: [TYPES/announce] Galop V @ ETAPS 2010: Call for participation Message-ID: <4B73267E.7050907@ens-lyon.fr> ====================================================================== *** CALL FOR PARTICIPATION *** GaLoP V 5th Workshop on Games for Logic and Programming Languages (satellite event of ETAPS 2010) Paphos, Cyprus 20-21 March 2010 http://perso.ens-lyon.fr/olivier.laurent/galop10/ ====================================================================== REGISTRATION http://www.etaps10.cs.ucy.ac.cy/ * early registration: before February 15 * normal registration: between February 16 and February 28 * late registration: after March 1 PROGRAM Saturday, March 20th Morning * [Invited talk] Jean Goubault-Larrecq * AJM-games revisited (Nikos Tzevelekos and Samson Abramsky) * Pointer game semantics for polymorphism (Paul Blain Levy and Soren B. Lassen) * Understanding Game Semantics through Coherence Spaces (Ana C. Calderon and Guy McCusker) Afternoon * [Invited talk] Jacques Duparc * The lambda lambda-bar calculus: a calculus for static, fine grained control of the view (Alexis Goyet) * Game semantics and normalization (Pierre Clairambault) * Realizability for games (Olivier Laurent) Sunday, March 21st Morning * [Invited talk] Kazushige Terui * Graphs of Interaction : Multiplicatives (Thomas Seiller) * Incarnation in Ludics and maximal cliques (Christophe Fouquere and Myriam Quatrini) * Multiparty Session Types (Nobuko Yoshida) Afternoon * [Invited talk] Andrzej Murawski * Algorithmic Game Semantics and Symbolic Execution (David Hopkins and Luke Ong) * Type Systems for Control of Pipelining (Dan Ghica) INVITED SPEAKERS * Jacques Duparc, Lausanne * Jean Goubault-Larrecq, Cachan * Andrzej Murawski, Oxford * Kazushige Terui, Kyoto ABOUT GALOP GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as contributed papers. The fifth GaLoP will be held in Paphos (Cyprus) between March 20 and 21 and will be part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2010). From yu at docomolabs-usa.com Wed Feb 10 17:07:52 2010 From: yu at docomolabs-usa.com (Dachuan Yu) Date: Wed, 10 Feb 2010 14:07:52 -0800 Subject: [TYPES/announce] Internship Positions at DOCOMO USA Labs Message-ID: <2FD61F37AFF16D4DB46149330E4273C702AC00BE@dcl-ex.dcml.docomolabs-usa.com> The Mobile Service Laboratory at DOCOMO USA Labs has 4 internship positions available for Summer 2010. An HTML version of this announcement is available at http://www.docomolabs-usa.com/car_open_msl-int.html -2010 Summer internship positions- US working permit is required for the following positions! 1. Software Specification and Testing The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on an applied research project related to handset specification and testing. The multiplicity of handsets and heterogeneous software stacks add unique challenges to the software assurance problem in this domain. We are interested in building software specification and testing frameworks and researching new techniques in this area, that take into account the particular software production and distribution models supported by a mobile operator. The selected candidate will work closely with a team of researchers on the project, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: formal methods, programming languages, and software testing. Interested candidates must be pursuing an M.S. or Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-SST" in Subject) Attn: MSL-Int-SST recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 2. Mobile Usability The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on a systems project aimed at fostering a mobility-centric lifestyle. The number of cell phone users is constantly on the rise worldwide, and an increasingly larger percentage of them use cell phones for daily tasks. However, the small form-factor of mobile devices, as well as the design of software user interfaces and available services can be a limiting factor impacting the usability of cell phones for daily activities. Our work focuses on approaches for improving mobile usability through service and interface design and analysis, that can be adopted by a mobile operator towards consumer-centric solutions. The selected candidate will work closely with a researcher, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: usability, mobile user interfaces, user-centric service design, natural language processing, data mining, and web-based middleware. Interested candidates must be pursuing a Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential, and Experiences with the mobile Web and/or browser/server extensions are big pluses. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-MU" in Subject) Attn: MSL-Int-MU recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 3. Content Analytics The Mobile Services Lab at DOCOMO USA Labs is looking for a bright and motivated candidate to work on technologies related to content analytics to facilitate new classes of mobile applications. By now, cell phones are the world's largest and most widespread computing platform, and have access to unique context and sensor information that is accessible to mobile applications through middleware APIs. Today, consumers express their intent either in natural language by using communication channels like email, SMS, status updates, etc., or by directly interacting with the interface of software applications. This project will investigate techniques for analyzing the content created by mobile consumers in interacting with other consumers or with software applications, with the goal of connecting the intent expressed in natural language with software application interactions and vice versa. The selected candidate will work closely with a researcher, and will have the opportunity to enable direct industrial impact through their work here, in addition to any publications that may arise out of the work. A strong background in one or more of the following areas is desirable: natural language processing, data mining, intelligent agents, cognitive modeling, artificial intelligence. Interested candidates must be pursuing a Ph.D. degree in CS or EE, and must have strong research experience. A strong programming background is also essential, and Experiences with the mobile Web and/or browser/server extensions are big pluses. The ability to work well with a team is expected. Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-Int-CA" in Subject) Attn: MSL-Int-CA recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 4. Adaptive Approximations of Visual Data The Mobile Services Lab (Media Technology Project) at DOCOMO USA Labs is seeking a strong PhD student for a summer internship position. Many types of signals can be modeled as arising from known families of approximation spaces. Yet there are many other signals for which such models do not hold. In this project we will construct adaptive approximations for "difficult" signals by developing highly nonlinear analytical and algorithmic techniques. The project will allow us to better understand the statistical nature of visual data so that we can design better processing algorithms targeting mobile augmented reality applications. -PhD student in Electrical Engineering, Computer Science, or Mathematics -Very strong mathematical skills -Very strong knowledge of basic signal and image processing techniques -Excellent programming skills in C/C++ Applicants must have, or should be able to obtain, the relevant authorization to work as an intern in a U.S. company. Applications and enquiries should be sent to msl_intern2_recruit at docomolabs-usa.com or mail it to:(Please write "MSL-MTP" in Subject) Attn: MSL-MTP recruiting DOCOMO Communications Laboratories USA, Inc. 3240 Hillview Avenue Palo Alto, CA 94304-1201 Thank you for your consideration. Dachuan Yu Mobile Service Laboratory DOCOMO USA Labs -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100210/e965790e/attachment-0001.htm From roberto at dicosmo.org Thu Feb 11 10:56:48 2010 From: roberto at dicosmo.org (Roberto Di Cosmo) Date: Thu, 11 Feb 2010 16:56:48 +0100 Subject: [TYPES/announce] Two phase reviewing for POPL; a response In-Reply-To: References: Message-ID: <20100211155648.GE13227@traveler> Dear Stavros, thanks for the refreshing reading. Since you touch upon dissemination and not only selection, I might suggest you to have a look also to this contribution that tries to clarify several issues with scientific publishing (but not selection, which is IMHO a delicate point with too many parameters for me to have a significant contribution to make). http://www.upgrade-cepis.org/issues/2006/3/up7-3DiCosmo.pdf --Roberto On Wed, Feb 10, 2010 at 11:01:35AM -0800, Stavros Tripakis wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Dear Simon, all, > > Thanks for sharing your thoughts. > > A complementary idea, or maybe a cheaper starting point, would be to > separate dissemination from selection: > > http://www-verimag.imag.fr/~tripakis/papers/lets.pdf > > I'd be happy to get comments on this. > > Thank you and best regards, > Stavros -- --Roberto Di Cosmo ------------------------------------------------------------------ Professeur En delegation a l'INRIA PPS E-mail: roberto at dicosmo.org Universite Paris Diderot WWW : http://www.dicosmo.org Case 7014 Tel : ++33-(0)1-44 27 86 55 5, Rue Thomas Mann Fax : ++33-(0)1-44 27 86 54 F-75205 Paris Cedex 13 FRANCE. ------------------------------------------------------------------ Attachments: MIME accepted Word deprecated, http://www.rfc1149.net/documents/whynotword ------------------------------------------------------------------ Office location: Bureau 6C15 (6th floor) 175, rue du Chevaleret, XIII Metro Chevaleret, ligne 6 ------------------------------------------------------------------ From andrei at chalmers.se Thu Feb 11 12:58:55 2010 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Thu, 11 Feb 2010 18:58:55 +0100 Subject: [TYPES/announce] OWASP AppSec Research deadline extended to March 7 Message-ID: <4B74455F.7040008@chalmers.se> Dear TYPES-announce subscribers, The deadline for the "Publish or Perish" track (full papers) at the OWASP AppSec Research in Stockholm is extended to March 7. If you have a suitable paper in the pipeline, please submit it to AppSec to make both academic and industrial impact and support this exciting event that connects academia and industry. As before, type-based submissions are warmly welcome! More information: http://www.owasp.org/index.php/OWASP_AppSec_Research_2010_-_Stockholm%2C_Sweden#tab=CFP Best, -Andrei From ldixon at inf.ed.ac.uk Fri Feb 12 05:37:42 2010 From: ldixon at inf.ed.ac.uk (Lucas Dixon) Date: Fri, 12 Feb 2010 10:37:42 +0000 Subject: [TYPES/announce] PLMMS 2010 Call for Papers Message-ID: <4B752F76.1020106@inf.ed.ac.uk> [Apologies for possible multiple postings.] ------------------------------------------------------------------- First CALL FOR PAPERS ------------------------------------------------------------------- In co-operation with ACM SIGSAM, the International Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2010) Part of CICM-2010, in CNAM, Paris, France; 8th of July 2010 ------------------------------------------------------------------- Important Dates --------------- * Abstract submission: Fri 26 March 2010 * Paper submission: Fri 9 April 2010 * Reviews sent to authors: Mon 10 May 2010 * Author's response deadline: Mon 17 May 2010 * Notification of acceptance: Mon 24 May 2010 * Camera ready copy due: Mon 7 June 2010 * Workshop: Thu 8 July 2010 PLMMS Scope ----------- The program committee welcomes submissions on programming language issues related to all aspects of mechanised mathematics systems (MMS). In particular: - Mathematical algorithms - Tactics and proof search - Proofs - Mathematical notation Of particular interest are the dimensions of: - Expressiveness - Efficiency - Correctness - Understandability and Usability - Modularity and Extensibility - Design and implementation Mechanised mathematics systems, whether stand-alone or embedded in larger systems, include but are not limited to: - Dependent typed programming languages - Proof assistants - Computer algebra systems - Proof planning systems - Theorem proving systems - Theory formation systems These issues have a very colourful history. Why are all the languages of mainstream computer algebra systems untyped? Why are the (strongly typed) proof assistants so much harder to use than a typical computer algebra systems? What forms of polymorphism exist in mathematics? What forms of dependent types may be used in mathematical modelling? How can MMS regain the upper hand on issues of "genericity" and "modularity"? What are the biggest barriers when using more mainstream languages for computer algebra systems, proof assistants or theorems provers? Many programming language innovations appeared in either computer algebra or proof systems first, before migrating into more mainstream programming languages. This workshop is an opportunity to present the latest innovations in the design of MMS that may be relevant to future programming languages, or conversely novel programming language principles that improve upon the implementation and deployment of MMS. Submission Details ------------------ Accepted papers will appear in the ACM Digital Library. Papers should be submitted via the PLMMS 2010 easychair website: http://www.easychair.org/conferences/?conf=plmms2010 Submissions must describe original unpublished work which is not been submitted for publication elsewhere. At least one author of each accepted paper is expected to attend PLMMS 2010 and present her or his paper. Papers should be no more than 8 pages in length and are to be submitted in PDF format. They must conform to the ACM SIGPLAN style guidelines using 9-point font size (see http://www.acm.org/sigs/sigplan/authorInformation.htm - this also provides latex templates). Each submission must also adhere to SIGPLAN's republication policy (http://www.sigplan.org/republicationpolicy.htm). Papers will be reviewed by at least three reviewers and the authors will have an opportunity for rebuttal by the response deadline. Links ----- * http://www.easychair.org/conferences/?conf=plmms2010 abstract and paper submission webpage * ttp://www.acm.org/sigs/sigplan/authorInformation.htm submission style guide * http://www.sigplan.org/republicationpolicy.htm republication policy * http://dream.inf.ed.ac.uk/events/plmms-2010/ the PLMMS 2010 web site * http://cicm2010.cnam.fr/ the CICM 2010 conference web site Program Committee ----------------- * Thorsten Altenkirch (University of Nottingham, UK) * Serge Autexier (DFKI, Germany) * David Delahaye (CNAM, Paris, France) * James Davenport [PC co-chair] (University of Bath, UK) * Lucas Dixon [PC co-chair] (University of Edinburgh, UK) * Gudmund Grov (University of Edinburgh, UK) * Ewen Maclean (University of Herriot Watt, UK) * Dale Miller (INRIA, France) * Gabriel Dos Reis (Texas A&M University, USA) * Carsten Schuermann (IT University of Copenhagen, Denmark) * Tim Sheard (Portland State University, USA) * Sergei Soloviev (IRIT, Toulouse, France) * Stephen Watt (The University of Western Ontario, Canada) * Makarius Wenzel (ITU Munich, Germany) * Freek Wiedijk (Radboud University Nijmegen, Netherlands) -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From wadler at inf.ed.ac.uk Tue Feb 16 05:36:39 2010 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Tue, 16 Feb 2010 10:36:39 +0000 Subject: [TYPES/announce] Chair and Readership in Computer Security and Algorithms and Computational Complexity Message-ID: Readers familiar with the School of Informatics and LFCS will know that we have a special affinity for types, so we would welcome applications from those following type-based approaches to security and complexity. (Not that we exclude those following other approaches!) We are hoping to fill the positions with a professor and a reader, but we welcome applications from strong candidates at any level; the chair may go to either the security or complexity post. Note that the professorial salary listed is the low end of the scale. Please contact me if you have any questions. Cheers, -- P The University of Edinburgh School of Informatics Chair and Readership in (A) Computer Security and (B) Algorithms and Computational Complexity The University of Edinburgh invites applications for two posts, from candidates with research of international standing, one Chaired Professorship and one Readership (approximately associate professorship), in TWO areas: (A) Computer Security The appointee will have an outstanding research record in one or more areas of computer security. Areas that match our current strengths include: theoretical foundations of security, database security, programming language based security, security properties of mobile and concurrent systems, automated logical analysis of protocol correctness, and security analysis of APIs. Applications are also highly encouraged from areas that complement our current strengths: cryptography and network security. The post will be associated with the Scottish Informatics and Computer Science Alliance (SICSA) and it is anticipated that the appointee will join the Laboratory for Foundations of Computer Science (LFCS). (B) Algorithms and Computational Complexity The appointee will have an excellent research record in any active area of algorithms and computational complexity including: randomized algorithms, approximation algorithms, combinatorial optimization, algorithmic game theory, complexity theory, and distributed algorithms. The successful candidate is anticipated to join the Laboratory for Foundations of Computer Science within the School of Informatics. The laboratory?s current research in algorithms and complexity covers randomized algorithms, algorithmic game theory, computational complexity, approximation algorithms, combinatorial and stochastic optimization, algebraic complexity, quantum computing, and descriptive complexity. Salary details Chair: Grade 10 ? salary from ?53,650 pa. Reader: Grade 9 ? salary ?47,278 to ?52,086 pa. Candidates for the posts may be in either area. Appointment at lecturer level (grade 8: ?36,532 - ?43,622 pa) may be considered for a less experienced, but exceptional candidate. Closing date for applications for both posts: 26 February 2010. -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From tom.hirschowitz at univ-savoie.fr Tue Feb 16 10:14:01 2010 From: tom.hirschowitz at univ-savoie.fr (Tom Hirschowitz) Date: Tue, 16 Feb 2010 16:14:01 +0100 Subject: [TYPES/announce] CFP Types postproceedings Message-ID: <3BB7B463-29E3-4BE7-84D7-A8B89B731FCD@univ-savoie.fr> Post-Proceedings of TYPES 2009 The Post-Proceedings of the TYPES 2009 Annual Workshop http://lama.univ-savoie.fr/types09/ will be published, after a formal referee process, as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series http://eptcs.org/ . Submissions are not restricted to works presented at the workshop, nor are authors expected to be formally involved in the Types project. Deadlines - abstract submission: Wednesday, May 19th, 2010, 12:00 Paris time, - paper submission: Wednesday, May 26th, 2010, 12:00 Paris time. We encourage submissions on the themes of the Types Project http://www.cs.chalmers.se/Cs/Research/Logic/Types/ . The aim of Types is to develop the technology of formal reasoning and computer programming based on Type Theory. This is done by improving the languages and computerised tools for reasoning, and by applying the technology in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. We invite submission of high quality papers, written in English and typeset in LaTeX2e using the EPTCS style: http://style.eptcs.org/ . Submissions should not have been published and should not be under consideration for publication elsewhere. We encourage authors to keep their submissions below 30 pages. Authors should submit their papers electronically to Tom Hirschowitz. The guest editors, Thorsten Altenkirch, Tom Hirshowitz, Christophe Raffalli, and Alan Schmitt. From A.M.Silva at cwi.nl Tue Feb 16 12:04:45 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Tue, 16 Feb 2010 18:04:45 +0100 Subject: [TYPES/announce] CMCS 2010: Call for Short Submissions & Call for Participation Message-ID: <20100216170445.GA24278@wendy.sen.cwi.nl> ------------------------------------------------------------------------ CMCS 2010 Call for Short Submissions & Call for Participation ------------------------------------------------------------------------ The 10th International Workshop on Coalgebraic Methods in Computer Science 26-28 March 2010, Paphos, Cyprus (co-located with ETAPS 2010) Aims and scope ------------------------- The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. Over the last two decades, coalgebra has developed into a field of its own, presenting a mathematical foundation for various kinds of dynamical systems, infinite data structures, and logics. Coalgebra has an ever growing range of applications in and interactions with other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). An anniversary: the 10th CMCS --------------------------------------------- CMCS took place for the first time when ETAPS started, in 1998. Since then, it has always been collocated with ETAPS, becoming bi-annual since the start of CALCO (Conference on Algebra and Coalgebra) in 2005. In 2010, we will celebrate the 10th edition of CMCS, by inviting a number of specialists in the field to present overviews of both obtained results and future challenges. Invited Speakers ------------------------- At this tenth meeting the following invited speakers will present overviews of important subareas. * Venanzio Capretta: Coalgebra in functional programming and type theory * Bartek Klin: Operational semantics coalgebraically * Dirk Pattinson: Logic and coalgebra * Ana Sokolova: Probabilistic systems coalgebraically Short contributions ----------------------------- Apart from the presentation of regular papers (see list below) and invited contributions, some time has been reserved for *short contributions* . These will not be published in the proceedings but will be bundled in a CWI technical report. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. The instructions for submitting short contributions can be found at: Important dates ------------------- * 27 February 2010: strict submission deadline short contributions * 28 February 2010: deadline normal registration * 6 March 2010: notification short contributions * 26-28 March 2010: the workshop List of accepted regular papers --------------------------------------------- * Jan Komenda . Coinduction in concurrent timed systems * Jiri Adamek, Stefan Milius and Jiri Velebil . Recursive Program Schemes and Context-Free Monads * Bartek Klin . Structural operational semantics and modal logic, revisited * Hauhs Michael and Baltasar Tranc n y Widemann . Applications of Algebra and Coalgebra in Scientific Modelling: Illustrated with the Logistic Map * Kazuyuki Asada and Ichiro Hasuo . Categorifying Computations into Components via Arrows as Profunctors * Corina Cirstea . Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics * Vincenzo Ciancia, Alexander Kurz and Ugo Montanari . Families of symmetries for the semantics of programming languages * Jiho Kim . Higher-order algebras and coalgebras from parameterized endofunctors * Bart Jacobs . From Coalgebraic to Monoidal Traces * Adriana Balan and Alexander Kurz . On coalgebras over algebras Programme Committee ---------------------------------- Jiri Adamek (Braunschweig) Alexandru Baltag (Oxford) Luis Barbosa (Braga) Marcello Bonsangue (Leiden) Corina Cirstea (Southampton) Robin Cockett (Calgary) Andrea Corradini (Pisa) Neil Ghani (Glasgow) Peter Gumm (Marburg) Furio Honsell (Udine) Bart Jacobs (Nijmegen, co-chair) Bartek Klin (Cambridge) Clemens Kupke (London) Alexander Kurz (Leicester) Marina Lenisa (Udine) Stefan Milius (Braunschweig) Ugo Montanari (Pisa) Larry Moss (Bloomington) Milad Niqui (Amsterdam) Dirk Pattinson (London) Dusko Pavlovic (Oxford) John Power (Edinburgh) Horst Reichel (Dresden) Grigore Rosu (Urbana) Jan Rutten (Amsterdam, co-chair) Davide Sangiorgi (Bologna) Lutz Schr der (Bremen) Alexandra Silva (Amsterdam) Hendrik Tews (Nijmegen) Tarmo Uustalu (Tallinn) Yde Venema (Amsterdam) Hiroshi Watanabe (Osaka) James Worrell (Oxford) Organising Committee -------------------------- Bart Jacobs, Milad Niqui (co-chair, CWI), Jan Rutten, Alexandra Silva (co-chair, CWI). Contact ---------- cmcs10 at cwi.nl . From eernst at cs.au.dk Wed Feb 17 11:37:24 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Wed, 17 Feb 2010 17:37:24 +0100 Subject: [TYPES/announce] CFP - MASPEGHI 2010 Message-ID: <6DD11865-9EF1-4725-B8F5-843DAE2B8DCD@cs.au.dk> [Apologies if you receive multiple copies of this] Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 19, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 21 or 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From naumann at cs.stevens.edu Wed Feb 17 12:33:28 2010 From: naumann at cs.stevens.edu (David Naumann) Date: Wed, 17 Feb 2010 12:33:28 -0500 (EST) Subject: [TYPES/announce] Theory workshop at VSTTE 2010 - call for papers Message-ID: ********************************************************** ??????????????????CALL FOR PAPERS ???????????????????VS-THEORY 2010 ???????The THEORY Workshop at VSTTE 2010 (Verified ???????Software: Theories, Tools and Experiments) ???http://www.cs.stevens.edu/~naumann/vstte-theory-2010/ ???????????????Edinburgh, Scotland, UK ??????????????????19th August, 2010 ???????The THEORY Workshop is part of VSTTE 2010 ???????http://www.macs.hw.ac.uk/vstte10/Home.html *********************************************************** VS-THEORY 2010 invites submissions of technical papers of up to 10 pages (LNCS format) related to software verification in a broad sense. This includes research on proof methods for various programming paradigms (object-oriented, functional, imperative, concurrent etc), program/proof codesign, requirements modeling, specification languages, formal calculi, programming languages, language semantics, software design methods, software testing, automatic code generation, meta-programming and multi-stage computation, refinement methodologies, type systems, computer security, model checking and theorem proving. Evaluations, comparisons, and unification of rival methods are welcome. This list of topics is indicative, and is explicitly intended to be non-exhaustive. In addition to technical papers we welcome challenge papers, up to 5 pages, that pose specific or general problems in theory that pertain to the Verified Software Initiative. Such submissions should have the word ``challenge'' in their title. Accepted papers will be made available online as an informal proceedings, but there will be no formal proceedings so publication elsewhere is not precluded. IMPORTANT DATES: Submission deadline: 21 May Notification of acceptance: ?25 June Final versions due: 23 July VSTTE 2010 main conference: 16 - 18 August Workshop: 19 August PROGRAM COMMITTEE Amal Ahmed, Indiana University, US Rajeev Alur, University of Pennsylvania, US Anupam Datta, Carnegie Mellon University, US Yannis Kassios, ETH Zurich, CH Neel Krishnaswami, Microsoft Research, UK Daniel Kroening, Oxford University, UK Antoine Mine, CNRS, FR Aleks Nanevski, IMDEA Software, SP David Naumann, Stevens Institute of Technology, US (co-chair) Tamara Rezk, INRIA, FR Dave Schmidt, Kansas State University, US Ashish Tiwari, SRI International, US Viktor Vafeiadis, University of Cambridge, UK Hongseok Yang, Queen Mary University of London, UK (co-chair) From alur at seas.upenn.edu Wed Feb 17 17:23:06 2010 From: alur at seas.upenn.edu (Rajeev Alur) Date: Wed, 17 Feb 2010 17:23:06 -0500 Subject: [TYPES/announce] Post-doctoral positions in Formal Verification / Software Analysis / Hybrid Systems at Penn Message-ID: <4B7C6C4A.6070807@seas.upenn.edu> Postdoctoral research positions are available at University of Pennsylvania in the broad areas of formal verification, software analysis, and hybrid systems. Research in formal methods at Penn spans foundations in logics, automata, and abstractions, tools for analysis and synthesis of software systems, and model-based design of embedded control systems (see http://www.cis.upenn.edu/~alur/) University of Pennsylvania is conveniently located in central Philadelphia. Department of Computer and Information Science has strong research groups in related areas such as programming languages, embedded software systems, and robotics. The appointment can be upto two years starting Summer 2010. Please email enquiries and applications to Rajeev Alur (alur at cis.upenn.edu) From damiano.mazza at lipn.univ-paris13.fr Wed Feb 17 17:30:35 2010 From: damiano.mazza at lipn.univ-paris13.fr (Damiano Mazza) Date: Wed, 17 Feb 2010 23:30:35 +0100 Subject: [TYPES/announce] Post-doc position at Paris 13 Message-ID: <4B7C6E0B.2030002@lipn.univ-paris13.fr> _______________________________________________________ Post-doctoral position at LIPN, Universit? Paris 13 Linear logic and implicit computational complexity http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique4 ________________________________________________________ A 12-month post-doctoral position is available at the Laboratoire d'Informatique de Paris Nord (LIPN), Universit? Paris 13 within the research project COMPLICE (Implicit Computational Conmplexity, Concurrency and Extraction, http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique4), founded by the French national research agency (ANR). _______________________________________________________ ________________ Scientific context ___________________ COMPLICE is a four-year project whose partner sites are ENS Lyon, Universit? Paris 13 and LORIA-Nancy. The project's goal is to investigate the foundations and applications of implicit computational complexity (ICC), along the lines of semantics and logic, functional programming, program extraction from proofs, quantitative properties and ICC for concurrent systems. _______________________________________________________ ______________________ Location _______________________ LIPN (http://www-lipn.univ-paris13.fr/?lang=uk) plays a major role in research in computer science within the northern Paris area. The post-doc researcher will work within the Logic, Computation and Reasoning group (http://www-lipn.univ-paris13.fr/LCR/?lang=uk), among whose main research directions there are proof theory, linear logic, lambda-calculus, implicit computational complexity, denotational semantics, system specification and verification, and algebraic combinatorics. LIPN is situated in Villetaneuse, in the northern suburbs of Paris, within the campus of the University Paris 13 (about 45 minutes from the city center by public transportation). Interaction with the other sites of the COMPLICE project is also expected. Additionally, LIPN has long established interactions with the following sites: - Preuves, Programmes et Syst?mes, Paris 7; - Institut de Mathematiques de Luminy, Marseille; - Dipartimento di Informatica, Universit? di Torino; - Dipartimento di Filosofia, Universita Roma Tre, Rome; _______________________________________________________ ________________ Salary and benefits __________________ The monthly salary will be around 2000 EUR. This is then subject to income tax. The position is for 12 months, but might be extendable for a longer period. The post-doc researchers will be affiliated to the French social security system, and will be entitled to unemployment benefit at the end of the contract. _______________________________________________________ ____________________ Requirements _____________________ The applicants should hold a PhD. We are especially interested in candidates with background in one or several of the following fields: - linear logic (proof nets, geometry of interaction, ludics) - rewriting theory (lambda-calculus, interaction nets) - denotational semantics (category theory, games semantics, vectorial semantics) - implicit computational complexity (light logics, type systems for complexity) _______________________________________________________ _______________ Application procedure _________________ Applications should be sent EXCLUSIVELY by email, to the addresses Damiano.Mazza at lipn.univ-paris13.fr Virgile.Mogbil at lipn.univ-paris13.fr preferably with the subject containing the words "Complice Application" (to be sure that the application is not accidentally eaten by spam filters...). The application must include: - a detailed resume; - a short research project (1 page); - contact information of two possible references. Applications are currently open and will stay open until the position is filled, without a specific deadline. Potentially interested candidates are invited to contact us as soon as possible. The starting date of the post-doc will be decided with the candidate (earlier dates are preferred). Further information, including the notification of when the position will be filled, will be made available on the following web page: http://www-lipn.univ-paris13.fr/complice/spip.php?rubrique14 From brunocdsoliveira at googlemail.com Thu Feb 18 06:59:21 2010 From: brunocdsoliveira at googlemail.com (Bruno Oliveira) Date: Thu, 18 Feb 2010 20:59:21 +0900 Subject: [TYPES/announce] WGP 2010 Call for Papers Message-ID: 6th ACM SIGPLAN Workshop on Generic Programming, 2010 Baltimore, Maryland, US Sunday, September 26th, 2010 http://osl.iu.edu/wgp2010 Goals of the workshop Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * polytypic programming, * programming with dependent types, * programming with type classes, * programming with (C++) concepts, * generic programming, * programming with modules, * meta-programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organisers: Co-Chair Bruno C. d. S. Oliveira, Seoul National University Co-Chair Marcin Zalewski, Indiana University Programme Committee: Alley Stoughton, Kansas State University Andrei Alexandrescu, Facebook Bruno C. d. S. Oliveira (Co-Chair), Seoul National University Doug Gregor, Apple Gilad Bracha, I am a Computational Theologist Emeritus Magne Haveraaen, Universitetet i Bergen Marcin Zalewski (Co-Chair), Indiana University Neil Mitchell, Standard Chartered Ralf L?mmel, University of Koblenz-Landau Shin-Cheng Mu, Academia Sinica Thorsten Altenkirch, University of Nottingham Ulf Norell, Chalmers University We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Sunday 2010-06-13 Notification of acceptance: Monday 2010-07-12 Final submission due: Tuesday 2010-07-27 Workshop: Sunday 2010-09-26 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP09 EasyChair instance by 13th of June 2010. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming This year: * Baltimore, Maryland, US 2010 (affiliated with ICFP10) Earlier Workshops on Generic Programming have been held in * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J Gibbons, R Hinze, P Jansson, J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100218/ed5d2e9f/attachment-0001.htm From kaufmann at cs.utexas.edu Thu Feb 18 09:53:28 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Thu, 18 Feb 2010 08:53:28 -0600 Subject: [TYPES/announce] Call for Votes on bids to host ITP-2011 Message-ID: <201002181453.o1IErSEL014760@sundance.cs.utexas.edu> Bidding has now closed for ITP-2011, and the bids can be viewed at http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html Voting is now open to decide which bid should be adopted. If you are seriously thinking of attending ITP-2011, then you may vote. Please read the bids and judge them by the plans as a whole: are the facilities appropriate? Are the transportation links adequate? Do you have confidence in the organisers? TPHOLs had a tradition of alternating between Europe and North America, but bids were opened world-wide since the first call for bids was unsuccessful. It is up to you, the electorate, to decide which location will be best for 2011. Voting will be by single transferable vote: each ballot will consist of your preferences in decreasing order. Votes will be counted in a series of rounds until a candidate wins a majority. At each round, the least popular candidate will be eliminated. Your second choice vote will only be counted if your first choice candidate is eliminated, and so forth. This system is known by many other names: instant run-off voting (IRV), alternative vote (AV), etc. To ensure that your ballot is counted, please adhere carefully to following formatting instructions. List your choices from most to least preferable (any positive number of choices up to five is acceptable). For example, the following ballot (with fictitious choices) indicates a preference first for Alice, then for Bob, and so on. Alice Bob Frank Mary Each choice should be one of the tags shown on the above web page: China, Netherlands, Spain, Denmark, or USA. Send your vote by March 1, by email to Matt Kaufmann, kaufmann at cs.texas.edu. Regards, Matt Kaufmann and Larry Paulson (ITP-10 co-chairs) From dvanhorn at ccs.neu.edu Thu Feb 18 14:46:45 2010 From: dvanhorn at ccs.neu.edu (David Van Horn) Date: Thu, 18 Feb 2010 14:46:45 -0500 Subject: [TYPES/announce] Higher-Order Flow Analysis (HOFA) Forum Message-ID: <4B7D9925.1000406@ccs.neu.edu> [ There are well known connections between types and flow analyses, so the HOFA forum should be of interest to many TYPES readers. Also, the forum itself is modeled closely on TYPES. Please join the forum if you are interested in flow analysis, and send mail if you or your lab should be listed on the researchers page. -- David ] Higher-Order Flow Analysis (HOFA) Forum http://hofa.lambda-calcul.us/ The HOFA forum is an email forum for the discussion and dissemination of research results in the area of higher-order flow analysis, broadly construed, within computer science and related disciplines. Flow analysis and related static analyses are a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The HOFA forum aims to facilitate theoretical, practical, and application advances in the area of functional, object-oriented, concurrent, distributed, and mobile programming. From txa at Cs.Nott.AC.UK Mon Feb 22 09:15:08 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Mon, 22 Feb 2010 14:15:08 +0000 Subject: [TYPES/announce] DEPENDENTLY TYPED PROGRAMMING 2010 (CFP) Message-ID: <326A9189-5E67-48C5-AA56-FCAA9FDCAAA3@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- 1st Call for Talks Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Dependently typed programming is here today: where will it go tomorrow? We invite contributed talks for the latest in a series of workshops on dependently typed programming which started in 1999. The workshop will have two invited talks --- from Ana Bove and Matthieu Sozeau --- and however many contributed talks you contribute. We expect there will be plenty of provocation, and plenty of time for discussion. If you want to volunteer a talk or a demo at the workshop, please send us a title and abstract before Friday 4 June 2010 at dtp10 at cs.nott.ac.uk Slots will be at least 30 minutes (unless you ask for less), and we hope to fit everyone in. Clearly, if we're overwhelmed, we'll be very pleased, and we'll have to think again. We plan to organize a special issue of Fundamenta Informaticae to contain refereed papers related to the topic of the workshop. In a nutshell, what: Dependently Typed Programming 2010 where: Edinburgh, Scotland when: 9&10 July, 2010 invited: Ana Bove, Matthieu Sozeau requested: titles and abstracts for contributed talks and demos slot time: 30 minutes deadline: 4 June 2010 afterwards: refereed selected postproceedings in FI We look forward to an exciting two days exploring the very latest activity in this growing and challenging field. In fact, in type-theoretic style, we can hardly contain ourselves. All the best Thorsten and Conor From patrick.baillot at ens-lyon.fr Mon Feb 22 09:58:16 2010 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Mon, 22 Feb 2010 15:58:16 +0100 Subject: [TYPES/announce] DICE @ ETAPS 2010: call for participation Message-ID: <20100222155816.160358klzdhcy4js@webmail.ens-lyon.fr> ====================================================== Call for participation International Workshop on Developments in Implicit Computational complExity (DICE 2010) http://www.ens-lyon.fr/LIP/DICE2010/ March 27-28, 2010, Paphos, Cyprus as part of ETAPS 2010 ====================================================== REGISTRATION http://www.etaps10.cs.ucy.ac.cy/ * normal registration: between February 16 and February 28 * late registration: after March 1 PROGRAMME Saturday, march 27. =================== 9:30-10:30 (invited talk) A.Ben-Amram. On decidable growth-rate properties of imperative programs. 10:30-11:00 coffee break 11:00-12:30 U. Dal Lago, S. Martini and M. Zorzi. General Ramified Recurrence is Sound for Polynomial Time. G. Bonfante. Non confluence in implicit complexity characterizations. 14:00-16:00 M. Lasson. Controlling program extraction in Elementary Linear Logic. P. Boudes, D. Mazza, L. Tortora de Falco. A Categorical Construction for Linear Logic by Levels. S. Ronchi Della Rocca. TBA. M. Gaboardi, M. Pagani. Can Resource Calculus Be Resource Conscious? 16:00-16:30 coffee break 16:30-17:30 B. Redmond. PTIME + a distributive law = PSPACE. U. Dal Lago, U. Sch ?pp. Experiments on logspace-programming with IntML. o Sunday, march 28. ================= 9:30-10:30 (invited talk) S. Martini. Implicit computational complexity in the small. 10:30-11:00 coffee break Alois Brunel, K. Terui. Church ? Scott= Ptime: an application of resource sensitive realizability. 11:00-12:30 L. Roversi, L. Vercelli. Safe Recursion on Notation into a light logic by levels. 14:00-15:00 Y. Zhang, D. Nowak. A calculus for game-based security proofs. J.-Y. Marion. Non-interference types and tier recursion. SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity. - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) From dg at cs.cmu.edu Mon Feb 22 13:03:00 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Mon, 22 Feb 2010 13:03:00 -0500 Subject: [TYPES/announce] Call for papers: FCS-PrivMod 2010 Message-ID: <4B82C6D4.7090906@cs.cmu.edu> +-------------------------------------------------------------------------+ ! ! ! FCS-PrivMod 2010 ! ! Edinburgh, UK ! ! July 14-15, 2010 ! ! http://www.loria.fr/~cortier/FCS-PrivMod10/ ! ! ! ! Affiliated with FLoC 2010 ! ! ! +-------------------------------------------------------------------------+ IMPORTANT DATES =============== Papers due: March 23, 2010 Notification: April 25, 2010 BACKGROUND, AIM AND SCOPE ========================= Formal foundations for computer security have emerged in recent years, including the formal specification and analysis of security protocols, programming languages, access control systems, and their applications. A particular aspect of security is personal privacy, which may be threatened whenever users interact with services and devices which are not directly under their control. From a user's point of view, privacy is often seen as a part of security; but from a service provider's point of view, privacy and security are often opposites that have to be balanced with each other. FCS-PrivMod aims to bring together international researchers from industry and academia in formal methods, computer security, and privacy, to develop advances and new perspectives in security and privacy models and analysis. It comprises the FCS workshop (Foundations of Computer Security), a satellite of LICS since 2002, and PrivMod (Privacy: Models & Analysis), a new workshop specifically about privacy-supporting protocols and systems. We are interested both in new results in theories of computer security and privacy and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories, as well as in new results on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. We thus solicit submissions of papers both on mature work and on work in progress. Because FCS-PrivMod is not published in archival form, we also welcome papers that overlap with papers recently or simultaneously submitted for publication. In such cases, overlaps should be clearly cited and the potential to generate interesting discussion at the workshop will be a factor in the selection process. Topics of interest include, but are not limited to: Automated reasoning Decidability & complexity Formal methods Foundations of verification Information flow analysis Language-based security Linkability & traceability Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management Verification for Anonymity & pseudonymity Access control and resource usage control Authentication Availability and denial of service Cloud computing Communication Confidentiality Electronic voting Health care Integrity and privacy Intrusion detection Mobile computing Mutual distrust Privacy RFID Social networks Security policies Security protocols SUBMISSION ========== All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Submissions should be at most 15 pages (a4 paper, 11pt), including references in the Springer LNCS style available at the URL http://www.springer.de/comp/lncs/authors.html The cover page should include title, names of authors, coordinates of the corresponding author, an abstract, and a list of keywords. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referees but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Authors are invited to submit their papers electronically, as portable document format (pdf) or postscript (ps); please, do not send files formatted for word processing packages (e.g., Microsoft Word or Wordperfect files). The only mechanism for paper submissions will be through the dedicated easychair submission web page. http://www.easychair.org/conferences/?conf=fcsprivmod2010 PUBLICATION =========== Informal proceedings will be made available in electronic format and they will be distributed to all participants of the workshop. PROGRAM COMMITTEE ================= * Myrto Arapinis (University of Birmingham, UK) * Kostas Chatzikokolakis (University of Eindhoven, Netherlands) * Liqun Chen (HP Labs Bristol, UK) * Stephen Chong (Harvard University, USA) * Tom Chothia (University of Birmingham, UK) * Veronique Cortier (LORIA INRIA-Lorraine, France; co-chair) * George Danezis (Microsoft Cambridge, UK) * St?phanie Delaune (CNRS - ENS de Cachan, France) * Deepak Garg (Carnegie Mellon University, USA) * Hans H?ttel (Aalborg University, Denmark) * Steven Murdoch (University of Cambridge, UK) * Catuscia Palamidessi (INRIA and Ecole Polytechnique, France) * Mark Ryan (University of Birmingham, UK; co-chair) * Pierangela Samarati (Universita` degli Studi di Milano, Italy) * Vitaly Shmatikov (University of Texas at Austin, USA; co-chair) * Ben Smyth (University of Birmingham, UK & ENS Paris, France) * Paul Syverson (Naval Research Laboratory, USA) * Gene Tsudik (University of California, Irvine, USA) * Luca Vigano (University of Verona, Italy) From chong at seas.harvard.edu Mon Feb 22 18:14:35 2010 From: chong at seas.harvard.edu (Stephen Chong) Date: Mon, 22 Feb 2010 18:14:35 -0500 Subject: [TYPES/announce] 2nd CFP: Analysis and Programming Languages for Web Apps and Cloud Apps 2010 In-Reply-To: <4B1006B3.3000602@seas.harvard.edu> References: <4AF313AD.60906@seas.harvard.edu> <4B022FBF.7020204@seas.harvard.edu> <4B0E11E6.5040903@seas.harvard.edu> <4B0E9C5B.7080303@seas.harvard.edu> <4B1006B3.3000602@seas.harvard.edu> Message-ID: <4B830FDB.6050709@seas.harvard.edu> CALL FOR PAPERS *Analysis and Programming Languages for Web Applications and Cloud Applications * (APLWACA 2010) http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Toronto, Canada, Sunday June 6, 2010 Co-located with PLDI 2010 Submission due date: Friday March 26, 2010 Analysis and Programming Languages for Web Applications and Cloud Applications (APLWACA, pronounced "apple-whacka") is a new workshop that provides a forum for exploring and evaluating ideas on the use of program analysis and programming language techniques to improve web and cloud applications. Web applications are distributed systems that communicate using Web protocols, and contain client systems executing within commodity web browsers. Cloud applications are distributed systems that utilize cloud computing technologies. The focus of the workshop is primarily on reliability, security, and performance of web and cloud applications. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of important existing and emerging problems. The scope of APLWACA includes, but is not limited to: * Static analysis of web and cloud applications * Runtime analysis of web and cloud applications and enhanced web and cloud application runtimes * Program analysis techniques for discovering reliability issues, security vulnerabilities, or performance bottlenecks * Testing and model checking of web and cloud applications * Compiler- and language-based mechanisms for security and performance * New languages, techniques, and runtimes for programming web and cloud applications, including client-side programming * Characterizing web and cloud application workloads and benchmarks, especially as it comes to large distributed applications like Facebook or Hotmail More details can be found on the APLWACA website: http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Important Dates Submission due date Friday, March 26, 2010 Author notification Friday, April 30, 2010 Revised papers due Friday, May 14, 2010 APLWACA 2010 workshop Sunday, June 6, 2010 Technical Program Committee Stephen Chong Harvard University (co-chair) Ranjit Jhala University of California San Diego Trevor Jim AT&T Labs Research Shriram Krishnamurthi Brown University Benjamin Livshits Microsoft Research (co-chair) Sergio Maffeis Imperial College London John C. Mitchell Stanford University Anders M?ller Aarhus University -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100222/a3758835/attachment-0001.htm From andrei at chalmers.se Wed Feb 24 09:11:25 2010 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Wed, 24 Feb 2010 15:11:25 +0100 Subject: [TYPES/announce] CFP: MMM-ACNS 2010 Message-ID: <4B85338D.3090200@chalmers.se> Type-based submissions welcome! -Andrei Call for papers --------------- Fifth International Conference on Mathematical Methods, Models, and Architectures for Computer Networks Security St Petersburg, Russia, September 8-11, 2010 Invited speakers ---------------- * Herve Debar (Institut Telecom - Telecom SudParis, France) * Dieter Gollmann (Technical University of Hamburg-Harburg, Germany) * Greg Morrisett (School of Engineering and Applied Sciences, Harvard University, USA) * Bart Preneel (Electrical Engineering Department, Katholieke Universiteit Leuven, Belgium) * Ravi Sandhu (University of Texas at San Antonio, Institute for Cyber Security, USA) Important dates --------------- * Papers dues: March 7, 2010 * Notification: May 2, 2010 * Camera ready papers May 23, 2010 Further information ------------------- Conference web page: http://www.comsec.spb.ru/mmm-acns10/ From till at informatik.uni-bremen.de Wed Feb 24 10:05:30 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Wed, 24 Feb 2010 16:05:30 +0100 Subject: [TYPES/announce] Call for Papers: 20th WADT (Workshop on Algebraic Development Techniques) Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: April 30, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From jfrazee at mail.utexas.edu Wed Feb 24 14:29:50 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Wed, 24 Feb 2010 13:29:50 -0600 Subject: [TYPES/announce] CFP: NASSLLI 2010 Student Session Message-ID: <103f6a951002241129n53f628ebt4966e70a652818fa@mail.gmail.com> CALL FOR PAPERS NASSLLI 2010 STUDENT SESSION June 26, 2010 The Student Session is organized as part of the Fourth North American Summer School in Logic, Language, and Information to be held in Bloomington, IN USA from June 20-26, 2010. ABOUT THE STUDENT SESSION The NASSLLI Student Session provides an opportunity for pre-doctoral students to present original, unpublished work to an interdisciplinary audience. Authors will also receive useful feedback on their submissions from multiple reviewers. We invite submissions in all areas related to the school: logic, computation, language, and any combinations thereof. Papers to the Student Session must represent original work. They should be written with an eye towards two audiences: the wide multi-disciplinary body of students and researchers who will attend NASSLLI, and also the narrower set of people in the particular area of the paper. In short, they should be substantial contributions that can be appreciated by both insiders and outsiders. The organizers anticipate accepting between 10 and 20 papers. PROGRAM COMMITTEE Joey Frazee, UT Austin Joshua Herring, Indiana University Wes Holliday, Stanford University Thomas Icard, Stanford University Joshua Sack, Reykjav?k University Robert Rose (chair), Indiana University Elizabeth Allyn Smith, Ohio State University Andreas Stuhlm?ller, MIT SUBMISSION DETAILS Submissions should be formatted as PDF files, and should not exceed 10 pages. All authors on the papers need to be pre-doctoral students. Please make your submission at the EasyChair site for the NASSLLI Student Session by the deadline listed below. Submissions will be reviewed by the Student Session's program committee and additional reviewers. IMPORTANT DATES * Submissions: April 5, 2010 * Notification: April 19, 2010 * Presentation Date: June 26, 2010 LOCAL ARRANGEMENTS All presenters at the Student Session will be required to register for NASSLLI. The registration fee for authors presenting a paper will correspond to the early student registration fee. There will be no reimbursement for travel costs and accommodation. Presenters who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. From icfp.publicity at googlemail.com Wed Feb 24 15:12:08 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Wed, 24 Feb 2010 21:12:08 +0100 Subject: [TYPES/announce] ICFP 2010: Second call for papers Message-ID: <53ff55481002241212m5734c922ka264dd7ef9c30eed@mail.gmail.com> ===================================================================== Second Call for Papers ICFP 2010: International Conference on Functional Programming Baltimore, Maryland, 27 -- 29 September 2010 http://www.icfpconference.org/icfp2010 ===================================================================== Important Dates (at 14:00 UTC) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Submission: 2 April 2010 Author response: 24 -- 25 May 2010 Notification: 7 June 2010 Final papers due: 12 July 2010 Scope ~~~~~ ICFP 2010 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to object-oriented or logic programming; interoperability * Implementation: abstract machines; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proof * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words and a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadline will be strictly enforced and papers exceeding the page limits will be summarily rejected. Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. A submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LATEX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm. Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on 24 May 2010, to read and respond to reviews. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2010. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Organization ~~~~~~~~~~~~ Conference Chair Paul Hudak, Yale University Program Chair Stephanie Weirich, University of Pennsylvania Program Committee: Umut Acar, Max Planck Institute for Software Systems Zena Ariola, University of Oregon James Cheney, University of Edinburgh Peter Dybjer, Chalmers University of Technology Robert Bruce Findler, Northwestern University Andy Gill, Kansas University Fritz Henglein, University of Copenhagen Michael Hicks, University of Maryland, College Park Patricia Johann, University of Strathclyde Andres L?h, Utrecht University Simon L. Peyton Jones, Microsoft Research Didier R?my, INRIA Paris-Rocquencourt John Reppy, University of Chicago Manuel Serrano, INRIA Sophia-Antipolis Matthieu Sozeau, Harvard University From heinz.koeppl at epfl.ch Thu Feb 25 10:06:51 2010 From: heinz.koeppl at epfl.ch (Koeppl Heinz) Date: Thu, 25 Feb 2010 16:06:51 +0100 Subject: [TYPES/announce] Postdocs and PhD positions - Formal methods in computational systems and synthetic biology, ETH Zurich Message-ID: The Swiss Federal Institute of Technology Zurich (ETHZ), Switzerland Automatic Control Lab has vacant positions at the postdoctoral (2) and doctoral (2) level within a new group dedicated to "Formal methods in computational systems and synthetic biology" Topics of interest: - Robustness analysis; bounding reachables for uncertain nonlinear systems using "hybridization". - Rule-based models (Kappa) and their extension to include spatial effects. - Stochastic modeling and hybrid stochastic simulation algorithms. - Applied modeling; construction and parameter estimation for hybrid models of cellular signal transduction systems. - Compositional theory of biomolecular circuits; accounting for retroactivity. For more details please see http://lanos.epfl.ch/positions/ Questions can be addressed to Heinz Koeppl, heinz.koeppl at epfl.ch From david.delahaye at cnam.fr Thu Feb 25 18:38:27 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Fri, 26 Feb 2010 00:38:27 +0100 (CET) Subject: [TYPES/announce] Calculemus 2010: Deadline Extension and Final Call for Papers Message-ID: <63889.87.231.38.95.1267141107.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ---------------------------------------------------------------- CALCULEMUS 2010 - Deadline Extension and Final Call for Papers ---------------------------------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ ************************************* >>>> DEADLINE EXTENSION <<<< Abstract submission: March 12, 2010 Submission deadline: March 15, 2010 ************************************* Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and must not exceed 15 pages for full papers and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all full papers submitted to a peer review. Emerging trends papers will be lightly reviewed. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== The proceedings of full papers of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. In addition to the formal proceedings published by Springer, we will provide links to online versions of the published papers from the conference website. Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates =============== For (reviewed) full paper submissions: Abstract submission: March 12, 2010 Submission deadline: March 15, 2010 Notification of acceptance: April 14, 2010 Camera ready copies due: April 28, 2010 For extended abstracts on emerging trends: Abstract submission: April 30, 2010 Submission deadline: May 7, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 6-7, 2010. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From katoen at cs.rwth-aachen.de Fri Feb 26 04:05:34 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 26 Feb 2010 10:05:34 +0100 Subject: [TYPES/announce] ETAPS 2010: Final Call For Participation Message-ID: <4B878EDE.3020205@cs.rwth-aachen.de> [We apologise for multiple copies.] ==================================================================== CALL FOR PARTICIPATION: ETAPS 2010 *** 5 Conferences, 19 Workshops, 4 Tutorials *** European Joint Conferences on Theory And Practice of Software March 20 - March 28, 2010 Paphos, Cyprus http://www.etaps.org http://www.etaps10.cs.ucy.ac.cy/ ==================================================================== -- REGISTRATION -- For online registration, please visit http://www.etaps10.cs.ucy.ac.cy/ and click on the menu item "Registration". **** The registration deadline is February 28, 2010. **** -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2010 is the thirteenth event in the series. -- THE HOST CITY: PAPHOS, CYPRUS -- The west coast town of Paphos, with its pleasant harbour and medieval fort, combines a cosmopolitan holiday resort, spectacular countryside and historical sites. With a population of just 28.000 inhabitants, Paphos nestles in the lee of the Western Troodos Mountains and close to the Akamas National Park which add another dimension to this area of scenic beauty. Paphos has an air of holiday charm combined with history, and olden-day elegance is lent to the town by its classical style buildings in the upper part of town which leads to the shopping area. The lower part of the town has a life of its own, down near the sea, home of the harbour, the fish taverns, souvenir shops and several hotels with important archaeological sites around them. Paphos was the island's capital, and it is famous for the remains of the Roman Governor's palace, where extensive, fine mosaics are a major tourist attraction. The town of Paphos is included in the official UNESCO list of cultural and natural treasures of the world's heritage. ETAPS 2010 is organized by the University of Cyprus and will take place at the Coral Beach Hotel and Resort in Paphos, Cyprus, a 5-start hotel overlooking the golden sandy beaches and sparkling waters of Coral bay and adjacent to the Akamas National Park. For more information about Paphos, please visit the Cyprus Tourism Organization website: http://www.visitcyprus.com/wps/portal For travel information, please consult the ETAPS'10 website: http://www.etaps10.cs.ucy.ac.cy/ -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction ( http://www.cs.ucr.edu/~gupta/CC%202010.htm ) - ESOP: European Symposium on Programming ( http://research.microsoft.com/en-us/um/people/adg/ESOP2010/ ) - FASE: Fundamental Approaches to Software Engineering ( http://www.mathematik.uni-marburg.de/~swt/fase2010/ ) - FOSSACS: Foundations of Software Science and Computation Structures ( http://users.comlab.ox.ac.uk/luke.ong/FoSSaCS2010/ ) - TACAS: Tools and Algorithms for the Construction and Analysis of Systems ( http://tacas10.in.tum.de/ ) -- INVITED SPEAKERS -- Mark Harman (KCL, UK) Jim Larus (MSR, Redmond USA) Dave Naumann (Stevens, USA) Jean-Francois Raskin (Brussels, Belgium) Joseph Sifakis (IMAG, France) Colin Stirling (Edinburgh, UK) Philip Wadler (Edinburgh, UK) -- SATELLITE EVENTS -- The ETAPS 2010 satellite events comprise of workshops and tutorials which will be held on the Saturday/Sunday (March 20/21) before and the Saturday/Sunday (March 27/28) after the main conferences. WORKSHOPS - ACCAT, Applied and Computational Category Theory - ARSPA-WITS, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security - BYTECODE, Bytecode Semantics, Verification, Analysis and Transformation - CMCS, Coalgebraic Methods in Computer Science - COCV, Compiler Optimization Meets Compiler Verification - DCC, Designing Correct Circuits - DICE, Developments in Implicit Computational Complexity - FBTC, From Biology to Concurrency and back - FESCA, Formal Engineering approaches to Software Components and Architectures - FOSS-AMA, Free and Open Source Software - for Accessible Mainstream Applications - GaLoP, Games for Logics and Programming Languages - GT-VMT, Graph Transformation and Visual Modeling Techniques - LDTA, Language Descriptions, Tools and Applications - MBT, Model-Based Testing - PLACES, Programming Language Approaches to Concurrency and Communication-cEntric Software - QAPL, Quantitative Aspects of Programming Languages - SafeCert, Certification of Safety-Critical Software Controlled Systems - WGT, Workshop on Generative Technologies - WRLA, Workshop on Rewriting Logic and its Applications TUTORIALS * Uncertainty Modeling in Cyber-Physical Systems (Manuela Bujorianu) * Security, specification and refinement (Annabelle McIver) * Executable Models of Gene Regulatory Networks (Wan Fokkink) * The DisCoVeri continues ... (On the Application of Concurrency Theory to Fault-Tolerant Distributed Algorithms) (Uwe Nestmann) Additional information about the satellite events is available on the ETAPS web page: http://www.etaps10.cs.ucy.ac.cy/ -- FURTHER INFORMATION AND ENQUIRIES -- ETAPS 2010 is organised by the Dept. of Computer Science, University of Cyprus. For further information, do not hesitate to contact the Local Organisers at the following address: etaps10 at cs.ucy.ac.cy +---------------------------------------------------------------+ | Joost-Pieter Katoen email: my_last_name[at]cs.rwth-aachen.de | | RWTH Aachen University URL: moves.rwth-aachen.de/~katoen | | LS2: Software Modeling and Verification tel: +49 241 8021200 | | D-52056 Aachen, Germany fax: +49-241 8022217 | +---------------------------------------------------------------+ From vxc at Cs.Nott.AC.UK Fri Feb 26 06:53:33 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Fri, 26 Feb 2010 11:53:33 +0000 Subject: [TYPES/announce] MSFP: Call for Papers Message-ID: <4B87B63D.6090306@cs.nott.ac.uk> Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Karl Crary, Carnegie Mellon University, Pittsburgh, USA * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia From rseba at disi.unitn.it Fri Feb 26 18:00:08 2010 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Sat, 27 Feb 2010 00:00:08 +0100 Subject: [TYPES/announce] PhD position in ICT on Formal Verification via SMT available in Trento Message-ID: <20100226230008.GA7195@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- Posted: February 26, 2010 One Doctoral Student Position in Information and Communication Technologies on the research project "WORD-LEVEL FORMAL VERIFICATION VIA SMT SOLVING" is available at the International Doctorate School in Information and Communication Technologies (http://www.ict.unitn.it/) of the University of Trento, Italy, under the joint supervision of Dr. ALESSANDRO CIMATTI, Embedded Systems Research Unit, FBK-Irst, via Sommarive 18, I-38100 Povo, Trento, Italy http://sra.fbk.eu/people/cimatti/, cimatti[at]fbk[dot]eu Prof. ROBERTO SEBASTIANI Software Engineering & Formal Methods Research Program DISI, University of Trento, via Sommarive 14, I-38100 Povo, Trento, Italy http://disi.unitn.it/~rseba/. rseba[at]disi[dot]unitn[dot]it The research activity will be carried out jointly within the Embedded Systems (ES) Research Unit of the Center for Scientific and Technological Research of the Fondazione Bruno Kessler (FBK), Trento, and the Software Engineering & Formal Methods (SE&FM) Research Program, at Department of Information Engineering and Computer Science (DISI) of University of Trento. The research activity will aim at investigating and developing novel techniques, methodologies and support tools for Satisfiability Modulo Theories (SMT) for the verification of WORD-level circuit designs. This work will be part of the "Word-Level Formal Verification via SMT Solving" (WOLFLING) project, a three-year custom research project supported by SRC/GRC (http://grc.src.org/fr/S200802_Call.asp), in strict collaboration with the Formal Verification Group at Intel, Haifa, Israel. SMT tools will be developed on top of the MathSAT SMT platform (http://mathsat4.disi.unitn.it), and Formal Verification tools will be developed on top of the NuSMV Model Checking platform (http://nusmv.fbk.eu). Both platforms are jointly developed and maintained by ES and SE&FM. The selected candidate will be initially enrolled in a stage and, if he/she passes the selection of the Ph.D. school, he/she will be enrolled as Ph.D. students. Ph.D. courses will start in Autumn 2010, and the thesis must be completed in three or four years. People enrolled in a stage and subsequent Ph.D. courses are expected to move to Trento, and will receive monetary support during both phases of their activity. Candidate Profile ================= The ideal candidate should have an MS or equivalent degree in computer science, mathematics or electronic engineering, and combine solid theoretical background and excellent software development skills. The candidate should be able to work in a collaborative environment, with a strong commitment to reaching research excellence and achieving assigned objectives. Background knowledge and/or previous experience in the following areas (in order of preference), though not strictly mandatory, will be considered very favorably: - Satisfiability Modulo Theory (SMT) - Propositional Satisfiability (SAT) - Embedded Systems Design Languages (e.g. Verilog, VHDL) - Symbolic Model Checking - Automated Reasoning - Constraint Solving and Optimization Applications and Inquiries ========================== Interested candidates should inquire for further information and/or apply by sending email to Prof. Sebastiani (rseba[at]disi[dot]unitn[dot]it) with Dr. Cimatti (cimatti[at]fbk[dot]eu) in CC. Applications should contain a statement of interest, with a Curriculum Vitae, and three reference persons. PDF format is strongly encouraged. Emails will be automatically processed and should have 'PHD ON WOLFLING PROJECT' as subject. Contact Person ============== Prof. ROBERTO SEBASTIANI Software Engineering & Formal Methods Research Program DISI, University of Trento, via Sommarive 14, I-38100 Povo, Trento, Italy http://disi.unitn.it/~rseba/. mailto: rseba[at]disi[dot]unitn[dot]it The Embedded Systems Research Unit at FBK ========================================= The Embedded Systems Unit consists of about 15 persons, including researchers, post-Doc, Ph.D. students, and programmers. The Unit carries out research, tool development and technology transfer in the fields of design and verification of embedded systems. Current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems (Verilog, SystemC, C/C++, StateFlow/Simulink). * Formal Requirements Analysis based on techniques for temporal logics (consistency checking, vacuity detection, input determinism, cause-effect analysis, realizability and synthesis). * Formal Safety Analysis, based on the integration of traditional techniques (e.g. Fault-tree analysis, FMEA) with symbolic verification techniques. The Embedded Systems Unit is part of Fondazione Bruno Kessler, formerly Istituto Trentino di Cultura, a public research institute of the Autonomous Province of Trento (Italy), founded in 1976. The institute, through its center for the scientific and technological research, is active in the areas of Information Technology, Microsystems, and Physical Chemistry of Surfaces and Interfaces. Today, FBK is an internationally recognized research institute, collaborating with industries, universities, and public and private laboratories in Italy and abroad. The institute's applied and basic research activities aim at resolving real-world problems, driven by the need for technological innovation in society and industry. The SW Engineering & Formal Methods Research Program at DISI ============================================================ The SW Engineering & Formal Methods R. P. at DISI currently consists on 5 faculties, 4 post-docs and 19 PhD students. The Unit carries out research, tool development and technology transfer in the fields of Goal-Oriented Requirements Engineering, Agent-oriented SW engineering, Security, and Formal Methods. Referring to formal methods, current research directions include: * Satisfiability Modulo Theory, and its application to the verification of hardware, embedded critical software, and hybrid systems. * Advanced Model Checking Techniques for Formal Verification of hardware, embedded critical software, and hybrid systems. * Applications of Propositional Satisfiability (SAT) to various domains. The R.P. is part of the Department of Information Engineering and Computer Science, DISI (http://disi.unitn.it/) of University of Trento. University of Trento in the latest years has always been rated among the top-three small&medium-size universities in Italy. DISI currently consists of 50 faculties, 68 research staff and support people, 21 postdocs and 146 Doctoral students, plus administrative and technical staff. DISI covers all the different areas of information technology (computer science, telecommunications, and electronics) and their applications. These disciplines above are studied individually but also with a strong focus on their integration, Location ======== Trento is a lively town of about 100.000 inhabitants, located 130 km south of the border between Italy and Austria. It is well known for the beauty of its mountains and lakes, and it offers the possibility to practice a wide range of sports. Trento enjoys a rich cultural and historical heritage, and it is the ideal starting point for day trips to famous towns such as Venice or Verona, as well as to enjoy great naturalistic journeys. Detailed information about Trento and its region can be found at http://www.trentino.to/home/index.html?_lang=en. From luigi.santocanale at lif.univ-mrs.fr Sat Feb 27 03:45:46 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Sat, 27 Feb 2010 09:45:46 +0100 Subject: [TYPES/announce] FICS 2010 -- call for papers Message-ID: <4B88DBBA.4060909@lif.univ-mrs.fr> /* Apologies for multiple posting */ Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * tba * tba Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by June 13 2010. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From Manuela.Bujorianu at manchester.ac.uk Sat Feb 27 08:37:06 2010 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Sat, 27 Feb 2010 13:37:06 +0000 Subject: [TYPES/announce] Lectures on inter-disciplinary analysis of cyber-physical systems Message-ID: <20100227133706.155639gk11sog742@webmail.manchester.ac.uk> Please accept our apologies in case of message multiplication and feel free to distribute to the potentially interested colleagues. Dear Colleague, The following lectures will be presented at the ETAPS2010 tutorial on " Uncertainty Modeling in Cyber-Physical Systems": ? Cyber-physical systems: Quo vadis? (M. Bujorianu) ? Nano-systems: The next big thing will be really small! (M. Bujorianu) ? Controlling uncertainty in renewable energy systems (M. Bujorianu) ? Modelling physics/computation interaction by the hybrid discrete/continuous paradigm (M. Bujorianu) ? Modelling a water cleaning facility using Hybrid Petri nets with general transitions (A. Remke) ? Parametric reachability analysis of Hybrid Petri nets with general transitions (A. Remke) ? Modelling networked automation systems using probabilistic hybrid automata (T. Teige) ? Bounded model checking of probabilistic hybrid automata (T. Teige) The tutorial will take place on 21st March? 2010 in Paphos, Cyprus. http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/ETAPStutorial.htm The normal registration fee is available until 7th March 2010. After that date registration is still possible but an increased fee will apply. The lectures will be presented by a team of Young and enthusiastic researchers (Anne Remke, University of Twente, NL; Tino Teige, Oldenburg University, DE; Manuela Bujorianu, Manchester University, UK - tutorial organizer) with experience in interdisciplinary research combining formal methods, software verification, control engineering and stochastic modelling. The tutorial format is designed to allow the maximum interaction between audience and speakers. Key topics: ? Inter-disciplinary nanoscience ? Energy informatics ? Networked control systems ? Stochastic hybrid systems ? Hybrid Petri nets ? Bounded model checking ? Stochastic and parametric reachability analysis Many thanks and hoping to see you in Paphos, Manuela Bujorianu From rwh at cs.cmu.edu Sun Feb 28 19:03:41 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Sun, 28 Feb 2010 19:03:41 -0500 Subject: [TYPES/announce] University of Oregon Programming Languages Summer School Message-ID: We are pleased to announce this year's program for the University of Oregon Programming Languages Summer School, which will be held June 15-25, 2010 in Eugene, Oregon. This year's theme is Logic, Languages, Compilation, and Verification, and features an impressive roster of speakers, including Robert Constable (Cornell), Anupam Datta (Carnegie Mellon), Robert Harper (Carnegie Mellon), Xavier Leroy (INRIA), Conor McBride (Strathclyde), Greg Morrisett (Harvard), Frank Pfenning (Carnegie Mellon), Benjamin Pierce (Penn), and Andrew Tolmach (Portland State). Please see http://www.cs.uoregon.edu/Activities/summerschool/summer10/ for complete information about this year's summer school. Please note that the registration deadline is MARCH 22, 2010. We look forward to a great program! Zena Ariola Pierre-Louis Curien Robert Harper Hugo Herbelin -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 3910 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100228/33930f49/smime.p7s From Yves.Bertot at sophia.inria.fr Mon Mar 1 03:41:45 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Mon, 01 Mar 2010 09:41:45 +0100 Subject: [TYPES/announce] CFP: Call for papers, Coq Workshop (Edinburgh, July 9) Message-ID: <4B8B7DC9.2080501@sophia.inria.fr> lease help disseminate this call for papers Two changes in the call for papers: 1/ papers describing experiments in other type theory-based proof assistants are explicitly invited to this workshop, 2/ EPTCS (http://eptcs.org/) has agreed to host the proceedings. Call for papers The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted papers, invited talks and a plenary discussion on the evolution and design of Coq. Topics for submitting a paper include: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit their paper through EasyChair at the following link: http://www.easychair.org/conferences/?conf=coq2 Submitted papers should be in (postscript or) portable document format. Papers should not exceed 12 pages in length in single-column full-page 11pt A4 style. If there is sufficient demand, we will try to organize a time slot for demonstrations. Similarly, we may also organize a session on the lessons learned from teaching Coq. If you are interested, please send a brief proposal. Venue FLoC 2010, Edinburgh, Scotland Important Dates * March 22nd: Deadline for submission of papers * May 1st: Acceptance Notification * May 31st: Final version of articles * July 9th: Workshop in Edinburgh Program Committee * Andrew Appel * Yves Bertot (Chair) * Adam Chlipala * Georges Gonthier * Benjamin Gr?goire * Hugo Herbelin * Micaela Mayero * Christine Paulin-Mohring * Bas Spitters From gvidal at dsic.upv.es Mon Mar 1 14:41:18 2010 From: gvidal at dsic.upv.es (German Vidal) Date: Mon, 1 Mar 2010 20:41:18 +0100 Subject: [TYPES/announce] CFP CICLOPS-WLPE 2010 at FLoC (Edinburgh, 15 July) References: <6679813A-9FD1-42EB-A189-6C6A4984450D@dsic.upv.es> Message-ID: <0202FFD2-8454-4C56-BD30-A8759F1FF000@dsic.upv.es> ******************************************************************* Call For Papers CICLOPS-WLPE 2010 Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments Edinburgh, Scotland, U.K. July 15, 2010 http://users.dsic.upv.es/~ciclops-wlpe10/ Satellite event of the 26th International Conference on Logic Programming (ICLP 2010) http://www.floc-conference.org/ICLP-home.html ******************************************************************* Important Dates: Paper Submission: March 31, 2010 Notification of Authors: April 29, 2010 Camera-ready: May 17, 2010 (tentative) Workshop: July 15, 2010 Invited talks: Programming with Boolean Satisfaction Michael Codish, Ben-Gurion University of the Negev (Israel) Solving Constraint Satisfaction Problems by a SAT Solver Naoyuki Tamura, Kobe University (Japan) Workshop description CICLOPS is a series of colloquia on the implementation of constraint logic programming. Logic and Constraint programming is an important declarative programming paradigm. The features offered by this paradigm such as rule-basedness, pattern matching, automated backtracking, recursion, tabling, and constraint solving have been proved convenient for many programming tasks. Recent improvements in implementation technologies combined with advances in hardware and systems software have made logic and constraint programming a viable choice for many real-world problems. CICLOPS'10 continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held with in Budapest (1993) and Ithaca (1994), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and more recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (Cyprus, 2001), Copenhagen (2002), Mumbai (2003), Saint Malo (France, 2004), Sitges (Spain, 2005), Seattle (U.S.A., 2006), Porto (Portugal, 2007), Udine (Italy, 2008), and Pasadena (U.S.A, 2009). WLPE is a series of workshops on practical logic-based software development methods and tools. Software plays a crucial role in modern society. While software keeps on growing in size and complexity, it is more than ever required to be delivered on time, free of error and meeting the most stringent efficiency requirements. Thus more demands are placed on the software developer, and consequently, the need for methods and tools that support the programmer in every aspect of the software development process is widely recognized. Logic plays a fundamental role in analysis, verification and optimization in all programming languages, not only in those based directly on logic. The use of logic-based techniques in software development is a very active area in computing; emerging programming paradigms and growing complexity of the properties to be verified pose new challenges for the community, while emerging reasoning techniques can be exploited. WLPE'10 continues the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington D.C., USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges (Barcelona), Spain (2005), Seattle, USA (2006), Porto, Portugal (2007) and Udine, Italy (2008). More information about the series of WLPE workshops can be found at http://www.cs.usask.ca/projects/envlop/WLPE/ CICLOPS-WLPE 2010 aims at bringing together, in an informal setting, people involved in research in the design and implementation of logic and constraint programming languages and systems and on logic-based methods and tools which support program development and analysis. In addition to papers describing more conceptual and theoretical work, papers describing the implementation of, and experience with, such tools will be welcome. Topics: * Abstract machines and compilation techniques * Compile-time analysis and its application to code generation * Memory management, indexing, and garbage collection issues * Profiling tools and performance evaluation * Implementation of concurrent, parallel, and distributed systems * Extensions such as tabling, constraints, probabilistic reasoning, and learning * New features such as ASP and coinduction * Object-oriented and module systems * Integration with other systems such as CP, SAT, LP/MLP, and Database systems * Experiences from using systems in real-life applications * Static and dynamic analysis * Debugging and testing * Program verification and validation, * Code generation from specifications, * Termination analysis, * Constraints * Rewriting * Profiling and performance analysis, * Type and mode analysis, * Module systems, * Optimization tools, * Program understanding, * Refactoring * Logical meta-languages Authors who are interested in taking part in the workshop, but are unsure if their work falls within its scope, are invited to contact the organizers and will be given suitable advice. Submission details: All papers must be written in English, in Springer LNCS format (http://www.springeronline.com/lncs/), and not exceed 15 pages. Submissions must be made through the easychair system available at http://www.easychair.org/conferences/?conf=ciclopswlpe2010 All accepted papers will be included in the workshop proceedings to be published as a technical report and distributed at the workshop, as well as electronically at the Computing Research Repository (CoRR). Program Committee: Rafael Caballero, Complutense University Madrid, Spain Vitor Santos Costa, Universidade do Porto, Portugal Martin Gebser, University of Potsdam, Germany Samir Genaim, Complutense University of Madrid, Spain Yoshitaka Kameya, Tokyo Institute of Technology, Japan Andy King, University of Kent, UK Huiqing Li, University of Kent, U.K. Lunjin Lu, Oakland University, MI, USA Paulo Moura, Universidade da Beira Interior, Portugal Ulrich Neumerkel, Technische Universit?t Wien, Austria Enrico Pontelli, New Mexico State University, USA Joachim Schimpf, Monash University, Australia Peter Schneider-Kamp, University of Southern Denmark, Denmark Wim Vanhoof, University of Namur, Belgium German Vidal, Technical University of Valencia Neng-Fa Zhou, The City University of New York, NY, USA Workshop organizers: German Vidal DSIC, Universidad Politecnica de Valencia Camino de Vera S/N, 46022 Valencia, Spain http://www.dsic.upv.es/~gvidal/ Neng-Fa Zhou Department of Computer and Information Science, Brooklyn College The City University of New York 2900 Bedford Avenue, Brooklyn, NY 11210-2889 http://www.sci.brooklyn.cuny.edu/~zhou/ From kutsia at risc.uni-linz.ac.at Mon Mar 1 16:53:16 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Mon, 01 Mar 2010 22:53:16 +0100 Subject: [TYPES/announce] 2nd CfP: PPDP'10 Message-ID: <4B8C374C.6050002@risc.uni-linz.ac.at> ====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: Program Design and Development * Declarative Aspects of Object-Oriented Programming * Concurrent Extensions to Declarative Languages * Declarative Mobile Computing * Integration of Paradigms * Proof Theoretic and Semantic Foundations * Type and Module Systems * Program Analysis and Verification * Program Transformation * Abstract Machines and Compilation * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: Maria Paola Bonacina (Universit? degli Studi di Verona, Italy) Sumit Gulwani (Microsoft Research) Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From venneri at dsi.unifi.it Tue Mar 2 04:02:15 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Tue, 02 Mar 2010 10:02:15 +0100 Subject: [TYPES/announce] ITRS 2010 - 2nd CFP Message-ID: <4B8CD417.6080303@dsi.unifi.it> ========================================================================== 2nd CALL FOR PAPERS Deadline: March 31, 2010 **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Intersection types were introduced near the end of the 1970s to overcome the limitations of Curry's type assignment system and to provide a characterization of the strongly normalizing terms of the Lambda Calculus. They have been one of the first examples of behavioural type theory: namely, they provide an abstract specification of computational properties, by expressing a finer and more precise input/output relation than standard, commonly used, type systems can do. Although intersection types were initially intended for use in analysing and/or synthesizing lambda models as well as in analysing normalization properties, over the last twenty years the scope of the research on intersection types and related systems has broadened in many directions. Restricted (and more manageable) forms have been investigated, such as refinement types. Type systems based on intersection type theory have been extensively studied for practical purposes, such as program analysis. The dual notion of union types turned out to be quite useful for programming languages. Finally, the behavioural approach to types, which can give a static specification of computational properties, has become central in the most recent research on type theory. The ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission of extended abstracts: March 31, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From kremer at lsv.ens-cachan.fr Tue Mar 2 07:48:05 2010 From: kremer at lsv.ens-cachan.fr (Steve Kremer) Date: Tue, 02 Mar 2010 13:48:05 +0100 Subject: [TYPES/announce] SecReT 2010 Message-ID: <4B8D0905.8010009@lsv.ens-cachan.fr> 5th International Workshop on Security and Rewriting Techniques (SecReT 2010) Valencia (Spain), June 18-20. Aims and Scope: We need to increase our confidence in security related applications. Formal verification is one of the most important methods of achieving this goal, and term rewriting has already played an important part. In particular, since the beginning of formal verification of security protocols, term rewriting has played a central role, both as a computation model and as a deduction strategy. Because of this, we believe that it can play an important role in solving other security-related formal verification problems as well. That is why it is important to bring together experts in term rewriting, constraint solving, equational reasoning on the one side and experts in security on the other side. This is precisely the aim of this workshop. A possible (non exhaustive) list of topics include application of rewriting or constraint solving to authentication, encryption, access control and authorization, protocol verification, specification and analysis of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. Submission instructions: The workshop will have no formal proceedings. We therefore encourage submission of ongoing work as well as recently published work. Submissions should be 1 page abstract summarizing the work the authors would like to present. Detailed submission instructions will soon be available on the workshop's website. Important dates: - Submission deadline: April 2 - Notification: April 23 - Workshop: June 18-20 Invited speakers: - Bruno Blanchet - Ralf Kuesters - Catherine Meadows - Michael Rusinowith Program Committee: - Yannick Chevalier - Hubert Comon-Lundh - Dan Dougherty - Santiago Escobar - Steve Kremer (co-chair) - Chris Lynch - Jose Meseguer - Paliath Narendran (co-chair) From cesar.a.munoz at nasa.gov Tue Mar 2 11:44:32 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Tue, 2 Mar 2010 10:44:32 -0600 Subject: [TYPES/announce] Call for Participation NFM 2010 Message-ID: ---------------------------------------------------- CALL FOR PARTICIPATION: 2nd NASA Formal Methods Symposium ----------------------------------------------------- The NASA Formal Methods community invites you to attend the Second NASA Formal Methods Symposium (NFM 2010) http://shemesh.larc.nasa.gov/NFM2010 nfm2010 at lists.nasa.gov April 13-15, 2010 Washington D.C. Theme of Conference ---- The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia and industry, with the goals of identifying challenges and providing solutions to achieving assurance in safety-critical systems. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other safety-critical systems. Invited Speakers ---- Nikolaj Bjorner, Microsoft Guillaume Brat, NASA John Harrison, Intel John Kelly, NASA http://shemesh.larc.nasa.gov/NFM2010/speakers.html Program ---- The program committee selected 20 regular papers and 4 short papers for presentation, covering various aspects of the theory and practice of formal methods in safety-critical domains. http://shemesh.larc.nasa.gov/NFM2010/program.html Registration ---- Attendance to the symposium is free, but all attendees must register in order to participate. Registration closes April 9, 2010. http://shemesh.larc.nasa.gov/NFM2010/registration.html Travel and Local Information ---- The conference will take place in the James Webb Memorial Auditorium at NASA Headquarters in Washington D.C. http://shemesh.larc.nasa.gov/NFM2010/local.html Note that there are room blocks reserved at two hotels. These reservations will expire in the March 13-15 time frame. http://shemesh.larc.nasa.gov/NFM2010/travel.html Contact ---- Mike Hinchey, Conference Chair Cesar Munoz, Program Chair nfm2010 at lists.nasa.gov From kaufmann at cs.utexas.edu Tue Mar 2 11:42:58 2010 From: kaufmann at cs.utexas.edu (Matt Kaufmann) Date: Tue, 2 Mar 2010 10:42:58 -0600 Subject: [TYPES/announce] Result of Call for Votes on bids to host ITP-2011 Message-ID: <201003021642.o22GgwLQ013803@sundance.cs.utexas.edu> Hello -- Voting has closed for the Call for Votes on bids to host ITP-2011, as announced on Feb. 18 (see http://www.cs.utexas.edu/users/kaufmann/itp-2011-bids.html). The result was computed using VoteEngine 0.99, downloaded from http://vote.sourceforge.net/, and the output is shown below. (I also wrote my own little program to compute each round and checked that its results completely agreed with those of VoteEngine. I also checked and fixed spelling typos.) Congratulations to the team from The Netherlands on its winning bid! And thank you to all of those who submitted bids, which we found to be very impressive. In the output below, we have of course: C = China D = Denmark N = Netherlands S = Spain U = USA .......... VOTES 61 IRV Cand Plurality score N 12 S 9 C 17 D 9 U 14 Unresolved Tie .......... So I resolved the tie by branching: In one run, I removed Spain while in the other, I instead removed Denmark. The respective results are below. (Note: 3 people voted only for Denmark while 1 person voted only for Spain, which explains the discrepancy in "VOTES".) .......... removing Spain: .......... VOTES 60 IRV Cand Plurality score N 17 C 17 D 11 U 15 Cand Plurality score N 20 C 21 U 16 Cand Plurality score N 33 C 24 Winner N .......... removing Denmark: .......... VOTES 58 IRV Cand Plurality score N 13 S 11 C 19 U 15 Cand Plurality score N 20 C 21 U 16 Cand Plurality score N 33 C 24 Winner N .......... Regards, Matt Kaufmann (and Larry Paulson; ITP-10 co-chairs) From vs at ecs.soton.ac.uk Wed Mar 3 01:20:58 2010 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Wed, 3 Mar 2010 06:20:58 +0000 Subject: [TYPES/announce] deadline extension: IFIP TCS 2010 References: <0F7D3114-86BE-4BCD-979C-BA305D68B7EA@ecs.soton.ac.uk> Message-ID: Dear colleagues, This is to announce a deadline extension for submissions of papers to 6th IFIP International Conference on Theoretical Computer Science a part of the IFIP World Computer Congress 2010 Brisbane, Australia 20-23 September 2010 www.wcc2010.com Please consider submitting your work by the new deadline: Deadline for abstracts: Mar 12th Deadline for papers: Mar 15th. The CfP is available at http://www.wcc2010.com/migrated/TCS2010/TCS2010_cfp.html (please ignore the old submission date on that page). Submission at https://www.easychair.org/login.cgi?conf=tcs2010 With best regards, V. Sassone PC chair From mtf at cs.rit.edu Wed Mar 3 10:08:48 2010 From: mtf at cs.rit.edu (Matthew Fluet) Date: Wed, 3 Mar 2010 10:08:48 -0500 (EST) Subject: [TYPES/announce] Workshop on ML 2010 - Call for Content Message-ID: The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Content ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Important Dates ~~~~~~~~~~~~~~~ Submission: 25 June, 2010 Notification: 9 August, 2010 Format ~~~~~~ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ~~~~~ We primarily seek research presentations on topics related to ML, including (but not limited to): * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials are intended to show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or application software built on or related to ML technology. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able provide a projector.) Submission Guidelines and Instructions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Email submissions to mtf AT cs.rit.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Program Chair ~~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander LuleÃ¥ University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google From Stephan.Merz at loria.fr Thu Mar 4 03:37:27 2010 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Thu, 4 Mar 2010 09:37:27 +0100 Subject: [TYPES/announce] CFP: iFM 2010 Message-ID: <842A5E3A-FD6B-4316-8D1D-E86AD03AC22F@loria.fr> CALL FOR PAPERS 8th International Conference on Integrated Formal Methods (iFM 2010) October 11-14, 2010, Nancy, France http://ifm2010.loria.fr/ Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Integration of formal modeling and analysis methods - Integration of formal and semi-formal modeling and analysis methods - Integration of formal methods into software engineering practice - Semantics, Logics, Type systems - Verification, Model checking, Static analysis, Theorem proving - Refinement, Model transformations - Tools, Experience reports, Case studies Invited Speakers: - Christel Baier, TU Dresden - John Fitzgerald, Newcastle University - Rajeev Joshi, Laboratory for Reliable Software, JPL iFM 2010 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. All papers must be original, unpublished, and not submitted for publication elsewhere. Submission will be electronically as PDF or Postscript, using the Springer LNCS format. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. The conference proceedings will be published by Springer Verlag in the LNCS series. Important Dates: - Abstract submission: May 14, 2010 - Full paper submission: May 21, 2010 - Notification: July 4, 2010 - Final version: July 18, 2010 Contact: ifm2010 at loria.fr From michaelw at cs.utwente.nl Fri Mar 5 04:29:36 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Fri, 5 Mar 2010 10:29:36 +0100 Subject: [TYPES/announce] SPIN 2010 2nd Call for Papers Message-ID: <6CE39F20-385C-4482-8704-1C45954A9799@cs.utwente.nl> 17th International SPIN Workshop on Model Checking of Software September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, NEWS ==== Invited speakers are confirmed: * Javier Esparza, Technical University of Munich, Germany (joint keynote speaker with ICGT 2010) * Alessandro Cimatti, FBK-IRST, Italy * Darren Cofer, Rockwell Collins, USA Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From dg at cs.cmu.edu Sat Mar 6 10:58:18 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Sat, 06 Mar 2010 10:58:18 -0500 Subject: [TYPES/announce] PLAS 2010: Final call for papers Message-ID: <4B927B9A.8020800@cs.cmu.edu> *********************************************************************** Final Call for Papers Fifth ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: Friday, March 12, 2010 Author notification: Friday, April 23, 2010 Revised papers due: Monday, May 10, 2010 PLAS 2010 workshop: Thursday, June 10, 2010 Submission URL: https://www.easychair.org/login.cgi?conf=plas2010 SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software) (co-chair) Gilles Barthe (IMDEA Software) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) From phil at site.uottawa.ca Sun Mar 7 18:58:07 2010 From: phil at site.uottawa.ca (Philip Scott) Date: Sun, 7 Mar 2010 18:58:07 -0500 Subject: [TYPES/announce] MFPS XXVI, in Ottawa (May 6--10): call for participation Message-ID: <3FBD50E4-2EA4-4244-BB56-22615E28773C@site.uottawa.ca> This is an early call for participation for MFPS XXVI (Mathematical Foundations of Programming Semantics), to be held at the University of Ottawa, May 6-10 2010 , partially sponsored by the US Office of Naval Research and the Fields Institute. Information on the aims and scope of the conference, as well as invited speakers, tutorials and special sessions can be found at: http://www.math.tulane.edu/~mfps/mfps26/MFPS_XXVI.html The list of accepted papers will be available roughly mid-March. The Fields registration webpage is at: http://www.fields.utoronto.ca/programs/scientific/09-10/MFPS26/ Registration and early requests for student support can be done online at the Fields Institute address above. Note: some money is available to partially support graduate students, postdocs and researchers without grants. Those who wish to apply for this support should do so right away on the Fields registration page (before March 31). In your application for support, please state clearly what your research program is, in what way MFPS is relevant to your research, and whether you have access to other funds. Priority will be given to students who do not have access to other funding for travel. Graduate students please note: there will be a special student session of short presentations, and students who wish to apply to speak should also tell us. There is a planned conference banquet, to be announced soon. Accommodation: we have reserved rooms in several hotels near campus, as well as in the university residence. The university residence suites are a very good deal: a two room suite and kitchen is $90. On the local web page of the event you will find more information on this. Please note that in order to take advantage of the discount rate most bookings have to be done before April. Here is the local web page: http://aix1.uottawa.ca/~mwarren/MFPS/index.html If you have any questions please do not hesitate to contact one of the organizers, Richard Blute rblute at uottawa.ca Philip Scott phil at site.uottawa.ca Michael Warren mwarren at uottawa.ca From bove at chalmers.se Tue Mar 9 06:29:11 2010 From: bove at chalmers.se (Ana Bove) Date: Tue, 9 Mar 2010 12:29:11 +0100 Subject: [TYPES/announce] PAR'10 at FLOC'10: 2nd CFP Message-ID: <4B963107.10402@chalmers.se> Please distribute to those you might think are interested. ======================================================================== 2nd Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop > ======================================================================== Note the changes: # Second invited speaker is now confirmed: Alexander Krauss, Munich # Pre-proceedings will be published and maintained by EasyChair # Change in the deadline for the final version (will affect only accepted papers) PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the Program Committee for publication in the proceedings of the workshop. In accordance with FLoC'10 requirements, PAR'10 proceedings will be published in an electronic collection available online and maintained by EasyChair. The USB memory sticks with accepted papers will be distributed during the workshop. The post-proceedings of PAR'10 will be published after the workshop as a special issue of EPTCS. Details on how and when to produce the post-workshop version of the articles will be communicated after the workshop to the authors of the accepted papers. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EasyChair latex package( http://www.easychair.org/easychair.zip). The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 18 May 2010: Final version of accepted papers (Notice the slight change compared to previous announcements) * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * Alexander Krauss (Technical University of Munich) Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui ________________________________ From Alex.Simpson at ed.ac.uk Tue Mar 9 10:42:21 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 09 Mar 2010 15:42:21 +0000 Subject: [TYPES/announce] Proof Systems for Program Logics 2010: call for talks Message-ID: <20100309154221.i3wzk05mskwgog80@www.staffmail.ed.ac.uk> Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ A new workshop bringing together researchers working on any aspect of the design, study and application of proof systems for program logics. Invited speakers: Andre Platzer (Carnegie Mellon University) Viktor Vafeiadis (University of Cambridge) CALL FOR CONTRIBUTED TALKS The emphasis of the workshop is on reporting current and ongoing research. 30-minute contributed talks will be selected on the basis of two-page abstracts. Submission deadline for two-page abstracts: Monday 12th April 2010. Author notification : Monday 26th April 2010. Possible topics include, but are not restricted to: * Proof systems for modular/compositional verification * Proof systems for substructural/spatial/nominal logics * Proof systems for concurrent/mobile/distributed systems * Proof systems for timed/continuous/probabilistic/stochastic/hybrid systems * Structural proof theory (e.g. natural deduction and sequent calculus systems) for program logics * Proof-theoretic mechanisms for induction/coinduction/fixed points * Proof systems formalizing operational semantics * Proof systems for program synthesis * Constructive type theories and logics for verification/synthesis * Curry-Howard and generalisations to non-functional computation * Proof-theoretic accounts of decidability/complexity results * Completeness and relative completeness proofs for program logics * Proof systems designed to facilitate proof search Abstracts will appear in the FLoC Workhops electronic proceedings. It is planned to follow the workshop with a journal special issue. For more details see: http://homepages.inf.ed.ac.uk/als/PSPL2010/ PROGRAMME COMMITTEE * Luis Caires (Universidade Nova de Lisboa) * Robert Harper (Carnegie Mellon University) * Peter O'Hearn (Queen Mary London) * Dale Miller (INRIA) * Matthew Parkinson (Microsoft Research Cambridge) * Dana Scott (Carnegie Mellon University, Emeritus) * Alex Simpson (Edinburgh) * Luca Vigano (Verona) -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From emilio at mcs.le.ac.uk Tue Mar 9 11:00:53 2010 From: emilio at mcs.le.ac.uk (Emilio Tuosto) Date: Tue, 9 Mar 2010 16:00:53 +0000 Subject: [TYPES/announce] GT-VMT 2010: cfp Message-ID: <201003091600.54239.emilio@mcs.le.ac.uk> ================================================================ Call for Participation 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) http://www.cs.le.ac.uk/events/gtvmt10/ Satellite Event of ETAPS 2010, Cyprus -- March 20-21, 2010 ============================================================== * Scope * GT-VMT 2010 is the ninth workshop of a series that serves as a forum for all researchers and practitioners interested in the use of graph-based notation, techniques, and tools for the specification, modeling, validation, manipulation and verification of complex systems. The aim of the workshop is to promote engineering approaches that provide effective sound tool support for visual modeling languages, enhancing formal reasoning at the semantic level (e.g., for model analysis, transformation, and consistency management) in different domains, such as UML, Petri nets, Graph Transformation or Business Process/Workflow Models. * Workshop Program SATURDAY 20 MARCH 2010 9:00-9:15 Opening 9:15-10:30 Invited talk: Fernando Orejas: Symbolic Attributed Graphs and Attributed Graph Transformation 10:30-11:00 Break 11:00-12:30 Session on Foundations Maarten de Mol and Arend Rensink. A Graph Representation for Ordered Edges. Davide Grohmann and Marino Miculan. Graph Algebras for Bigraphs. Christoph Blume, Sander Bruggink, and Barbara K?nig. Recognizable Graph Languages for Checking Invariants. 12:30-14:00 Lunch 14:00-15:30 Session on Modeling and Modeling Environments Frank Hermann, Andrea Corradini, Hartmut Ehrig, and Barbara K?nig. Efficient Process Analysis of Transformation Systems Based on Petri nets. Berthold Hoffmann and Mark Minas. Defining Models - Meta Models versus Graph Gammars. Torsten Strobl and Mark Minas. Specifying and generating editing environments for interactive animated visual models. 15:30-16:00 Break 16:00-17:00 Session on Interactions Vojtech Rehak, Petr Slovak, Jan Strejcek, and Loic Helouet. Decidable Race Condition and Open Coregions in HMSC. Abubakar Hassan, Ian Mackie, and Shinya Sato. A light-weight abstract machine for interaction nets. 17:00-17:30 Discussion SUNDAY 21 MARCH 2010 9:30-11:00 Session on Model Transformation Eugene Syriani and Hans Vangheluwe. De-/Re-constructing Model Transformation Languages. Bernhard Schaetz. Verification of Model Transformations. Paolo Bottoni, Andrew Fish, and Francesco Parisi-Presicce. Preserving constraints in horizontal model transformations. 11:00-11:30 Break 11:30-12:30 Session on Foundations Paolo Torrini, Reiko Heckel, Istvan Rath, and Gabor Bergmann. Stochastic Graph Transformation with Regions. Wolfram Kahl. Cotabulations, Bicolimits and Van-Kampen Squares in Collagories. 12:30-14:00 Lunch * Workshop organizers Jochen Kuester, IBM Research, Switzerland Emilio Tuosto, University of Leicester, UK * Program Committee Paolo Baldan (University of Padova, Italy) Artur Boronat (University of Leicester, UK) Andrea Corradini (University of Pisa, Italy) Claudia Ermel (TU Berlin, Germany) Gregor Engels (University of Paderborn, Germany) Reiko Heckel (University of Leicester, UK) Thomas Hildebrandt (ITU, Denmark) Holger Giese (HPI Potsdam, Germany) Barbara K?nig (University of Duisburg-Essen, Germany) Jochen K?ster (IBM Research - Zurich, Germany) Alberto Lluch Lafuente (IMT Institute for Advanced Studies Lucca, Italy) Juan de Lara (Universidad Aut?noma de Madrid, Spain) Mark Minas (Universit?t der Bundeswehr M?nchen, Germany) Francesco Parisi-Presicce (University of Rome, Italy) Arend Rensink (University of Twente, Netherlands) Gabriele Taentzer (University of Marburg, Germany) Emilio Tuosto (University of Leicester, UK) D?niel Varr? (TU Budapest, Hungary) Erhard Weinell (RWTH Aachen University, Germany) Albert Z?ndorf (University of Kassel, Germany) * More information on the workshop is available through the webpage: http://www.cs.le.ac.uk/events/gtvmt10/ -- *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 *************************************************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100309/901fb8fd/attachment-0001.htm From thomas.ehrhard at pps.jussieu.fr Wed Mar 10 03:24:54 2010 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Wed, 10 Mar 2010 09:24:54 +0100 Subject: [TYPES/announce] Logic Colloquium 2010 Message-ID: <4B975756.6020002@pps.jussieu.fr> Logic Colloquium 2010 Paris 25 July - 31 July Deadline for submissions: 19 April, 2010 http://www.logic2010.org/ ********************************************************************* The Logic Colloquium is the annual European conference on logic, organised under the auspices of the Association for Symbolic Logic (ASL). This year, the Programme Committee consists of: A. Atserias, Z. Chatzidakis, T. Coquand, P.-L. Curien, M. Detlefsen, C. Dimitracopoulos, J. Floyd, I. Juhasz, M. Magidor, M. Rathjen, T. Scanlon, A. Soskova and Y. Venema. The main events in this year's conference are as follows. Tutorials: Uri Abraham (University Ben Gurion, Beer-Sheva ) Ted Slaman (University of California, Berkeley) Plenary talks: Fran?oise Delon (University Paris Diderot) Nicola Gambino (Palermo University) Mai Gehrke (Nijmegen University) Jean-Yves Girard (University Marseille M?diterran?e) Moti Gitik (Tel-Aviv University) Valentin Goranko (Technical University of Denmark, Lyngby) Leila Haaparanta (University of Helsinki) Ian Hodkinson (Imperial College) Julia Knight (University of Notre Dame) Piotr Koszmider (Technical University of Lodz) Jan Krajicek (Charles University in Prague) Angus MacIntyre (Queen Mary, University of London) Paulo Oliva (Queen Mary, University of London) Kobi Peterzil (Haifa University) Simon Thomas (Rutgers University) G?ran Sundholm (Leiden University) Andreas Weiermann (Ghent University) Thomas Wilke (Kiel University) Alex Wilkie (University of Manchester) Special sessions: * Model Theory. Co-chairs: Tom Scanlon (University of California, Berkeley) and Frank Wagner (University Lyon I) * Computability Theory. Co-chairs: Alexandra Soskova (Sofia University) and Andrea Sorbi (Siena University) * Set Theory. Co-chairs: Mirna Dzamonja (University of East Anglia), Istvan Juhasz (Hungarian Academy of Science) and Boban Velickovic (University Paris Diderot) * Symposium on the Beytr?ge of Bernard Bolzano. Co-chairs: Michael Detlefsen (University of Notre-Dame) et Juliet Floyd (Boston University) * Symposium on Simplicity (Complexity) of proofs: Mathematical and Philosophical Issues. Co-chairs: Michael Detlefsen (University of Notre-Dame), Juliet Floyd (Boston University) and Michael Rathjen (University of Leeds) The Programme Committee cordially invites all researchers to submit contributed papers that have logic research content that lies within the scope of the interests of the ASL. Submission Deadline: 19 April 2010 Notification of Authors: 4 May 2010 The rules for abstract submission can be found at the conference webpage http://www.logic2010.org The ASL will make available modest travel awards to graduate students in logic and to recent PhD's to attend the 2010 ASL European Summer Meeting in Paris. The European Summer Meeting is also supported by a grant from the US National Science Foundation; NSF funds may be awarded only to students at USA universities and to citizens and permanent residents of the USA. Applications and recommendations must be received before the deadline of March 30, 2010, by e-mail to application at logic2010.org or by surface mail to LC2010 Thomas Ehrhard Laboratoire PPS Universit? Paris Diderot - Paris 7 Case 7014 75205 PARIS Cedex 13 France Fax: (+33) 1 44 27 86 54 by the Organizing Committee: S. Abbes, O. Ainardi, V. Balat, T. Colcombet, R. Cori (chair), A. Durand, T. Ehrhard (co-chair), M. Hils, R. Labib-Sami, R. Lassaigne, Y. Legrandg?rard, G. Malod, A. Mansuet, S. P?rifel, J.-E. Pin (co-chair), F. Point, P. Rozi?re, T. Tsankov, B. Velikovic. From kohei at dcs.qmul.ac.uk Wed Mar 10 04:47:25 2010 From: kohei at dcs.qmul.ac.uk (Kohei Honda) Date: Wed, 10 Mar 2010 09:47:25 +0000 Subject: [TYPES/announce] PLACES'10: call for participation Message-ID: CALL FOR PARTICIPATION PLACES'10 Programming Language Approaches to Concurrency and communication-cEntric Software 21st March 2010, Paphos, Cyprus Affiliated with ETAPS 2010 http://places10.di.fc.ul.pt/ Dear colleagues, This is the call for participation for PLACES'2010, a workshop for foundations of concurrent and distributed programming. Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Many normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream- based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures, to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. With these backgrounds, PLACES'10 is held welcoming as an invited speaker William Cook from Texas Austin, and excellent contributions from researchers from divsese fields of programming studies. We cordially invite your participation in this workshop. We attach the basic information below. Very best wishes, Alan and Kohei Co-Chairs of PLACES'10 * Invited Speaker William Cook (University of Texas, Austin) * Programme Morning (a) Type Inference for Communications: 9:00-10:30 Alastair Donaldson, Daniel Kroening and Philipp Ruemmer. Analysing DMA Races in Multicore Software Lu?sa Louren?o and Luis Caires. Type Inference for Conversation Types Keigo Imai, Shoji Yuen and Kiyoshi Agusa. Session Type Inference in Haskell (b) Controlling Imperative Concurrency: 11:00-12:30 Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas. A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering Francisco Martins, Vasco Vasconcelos and Tiago Cogumbreiro. An Investigation on Types for X10 Clocks Joana Campos and Vasco T. Vasconcelos. Channels as Objects in Concurrent Object-Oriented Programming Lunch 12:30-14:00 Afternoon: invited talk: 14:00-15:00 William Cook (c) Language and Runtime Design: 15:00-16:00 Nuno Alves, Raymond Hu, Nobuko Yoshida and Pierre-Malo Deni?lou. Secure Execution of Distributed Session Programs Julien Lange and Emilio Tuosto. A Modular Toolkit for Theories of Distributed Interactions Break 16:00-16:30 (d) Logical and Semantic Foundations of Distributed Programming: 16:30-17:30 Marco Carbone, Thomas Hildebrandt and Hugo A. Lopez. Towards a Modal Logic for the Global Calculus Thomas Hildebrandt and Raghava Rao Mukkamala. Distributed Dynamic Condition Response Structures * Further Information For information on PLACES'10, please see: http://places10.di.fc.ul.pt/ For information on ETAPS'10, please see: http://www.etaps10.cs.ucy.ac.cy/ [end] From lengrand at lix.polytechnique.fr Wed Mar 10 05:34:23 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Wed, 10 Mar 2010 11:34:23 +0100 Subject: [TYPES/announce] CfP: Proof-Search in Type Theories (PSTT'10) Message-ID: <4B9775AF.7080903@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Title + short abstract submission: April 10 Paper / long abstract submission: April 15 Notification: April 30 Final papers due: May 15 Workshop: July 15 DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) Gopalan Nadathur (University of Minnesota) From miculan at dimi.uniud.it Wed Mar 10 08:16:03 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Wed, 10 Mar 2010 14:16:03 +0100 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for Papers Message-ID: 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) http://lfmtp10.dimi.uniud.it July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) CALL FOR PAPERS Important dates: --------------------------------------------------------------------- Abstract submission: 18 April 2010 Paper submission: 25 April 2010 Author notification: 30 May 2010 Final version: 13 June 2010 Workshop day: 14 July 2010 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. 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. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP are: * 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 theoretical and practical issues concerning the encoding of variable binding and fresh name generation, 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 are particularly welcome. Topics include, but are 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 Program Committee: Stefan Berghofer (TU Munich) Yves Bertot (INRIA Sophia-Antipolis) Karl Crary (Carnegie Mellon University, PC co-chair) Amy Felty (University of Ottawa) Marino Miculan (University of Udine, PC co-chair) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (Cambridge University) Carsten Sch?rmann (IT University of Copenhagen) Steering Committee: Andreas Abel (INRIA) Karl Crary (Carnegie Mellon University) Amy Felty (University of Ottawa) Marino Miculan (University of Udine) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Carsten Sch?rmann (IT University of Copenhagen) Paper Submission Submission of papers is electronic. Authors must submit the paper through the EasyChair server, at http://www.easychair.org/conferences/?conf=lfmtp10. Authors are required to submit a paper title and a short abstract before submitting the paper (see im- portant dates aside). Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will be made available in electronic form. After the workshop, authors of accepted papers will be invited to submit revised versions for inclusion in final post-proceedings, which will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS) http://eptcs.org. Papers are to be submitted in PDF format, should not exceed 15 pages including references, and must be prepared in LATEX using the EPTCS macro package (http://style.eptcs.org). For further information and submission instructions, see the LFMTP 2010 web page. The organizers: Karl Crary Marino Miculan School of Computer Science Dept. of Mathematics and Computer Science Carnegie Mellon University University of Udine crary at cs.cmu.edu miculan at dimi.uniud.it From herman at cs.ru.nl Wed Mar 10 11:49:15 2010 From: herman at cs.ru.nl (Herman Geuvers) Date: Wed, 10 Mar 2010 17:49:15 +0100 Subject: [TYPES/announce] Scientific Programmer Vacancy Message-ID: <4B97CD8B.9050400@cs.ru.nl> Scientific Programmer for the Intelligent Systems Section of ICIS (1,0 fte) *Faculty of Science* *Maximum Salary: ? 3,755 gross/month* *Vacancy number: 62.10.10* *Closing date: 15 March 2010* *Job description* The Intelligent Systems Section of the Institute for Computing and Information Sciences (ICIS) at Radboud University Nijmegen has a vacancy for a Scientific Programmer. The job consists of two aspects, each being roughly 0.5 FTE (more details below): 1. Computer support for the section staff and, together with scientific programmers from other sections, computer support for ICIS as a whole ("Computer Support). 2. Programming support for the Section?s scientific research projects, in particular for the projects of the Foundations Group (Research Support). Further particulars: The Intelligent Systems Section of ICIS concerns itself with making computer systems more 'intelligent'. Research at the Section pursues both the connectionist and the symbolic approach. The connectionist approach adheres to the statistical view on knowledge; our specific expertise lies in Bayesian methods and machine learning with main applications in bioinformatics and neuroscience. The symbolic approach adheres to the (formal) logical view on knowledge; the specific expertise of the Foundations Group lies in type theory and proof assistants with applications in software verification and formalization of mathematics. The Section has an excellent international reputation, which is supported by the latest national research assessment. Keywords: type theory, lambda calculus, term rewriting, reflection, proof assistants, formalizing mathematics, machine learning, bioinformatics. As a Scientific Programmer, you will contribute to the two aspects of the work performed at the Section as indicated above. Research Support. The Section has developed and continues to further develop various tools and systems: CoRN (the Constructive Repository of formalized mathematics in the proof assistant Coq at Nijmegen), ProofWeb (a web interface for the proof assistant Coq, to teach logic and formalizing mathematics) and MathWiki (a generic Wikipedia-like web portal for formalized mathematics). The section staff are users of the proof assistants Coq, Mizar and Hol-light. You will be expected to support and contribute to these projects. Prior experience with these systems would be advantageous. Computer Support. You will: - give advice on purchase and install new computer software and hardware; - support and maintain these systems; - keep close contacts with the faculty computer support department C&CZ; - maintain the web pages and information databases; - provide computer support for educational purposes. *Requirements* You should meet the following requirements: - a Bachelor's degree (or equivalent) in Computer Science, with an interest in functional programming and formal methods; - commitment and a cooperative attitude; - proficiency in written and spoken English. *Organization* Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green leafy campus, modern buildings, and state-of-the-art equipment, it has nine faculties and over 17,500 students enrolled in approximately 90 study programmes. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal. The city has a rich history and one of the liveliest city centres in the Netherlands. Website: http://www.ru.nl/icis/ *Conditions of employment* Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ? 3,755 gross/month Salary scale: 10 *Additional conditions of employment* The appointment is initially for a period of one year, at the end of which your performance will be evaluated. If the evaluation is positive, you will be offered a contract for a permanent position. *Additional Information* Herman Geuvers Telephone: +31 24 3652603 E-mail: herman at cs.ru.nl *Application* You can apply for the job (mention the vacancy number 62.10.10) before *15 March 2010* by sending your application -preferably by email- to: RU Nijmegen, FNWI, P&O, mrs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl -- Herman Geuvers Professor of Computer Science Intelligent Systems, iCIS Faculty of Science Radboud University Nijmegen, NL From cbraga at ic.uff.br Wed Mar 10 16:34:55 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 10 Mar 2010 18:34:55 -0300 Subject: [TYPES/announce] ICTAC'10: Deadline extension Message-ID: ********************************************************************* Call for Papers - ICTAC 2010 International Colloquium on Theoretical Aspects of Computing Natal, Rio Grande do Norte, Brazil 1-3 September, 2010 http://www.ictac.net/ictac2010 ********************************************************************** ********************************************************************** * News *************************************************************** ** ** DEADLINE EXTENSION: ** SUBMISSION OF ABSTRACTS: 22 MARCH, 2010 ** SUBMISSION OF PAPERS: 29 MARCH, 2010 ** ** Submission site now open: ** http://www.easychair.org/conferences/?conf=ictac2010 ** ** Authors of a selection of the accepted papers will be invited to ** submit an extended version of their papers to a special issue of ** Elsevier's journal Theoretical Computer Science. * ** LNCS proceedings confirmed. * ********************************************************************** Background and Objectives ICTAC is an International Colloquium on Theoretical Aspects of Computing created by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous six ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006), Macau (2007), Istanbul, Turkey (2008) and Kuala Lumpur, Malaysia (2009). ICTAC 2010 includes two special tracks: a track on Formal Approaches to Testing, chaired by Marie-Claude Gaudel, and a track on the Grand Challenge in Verified Software, chaired by Jim Woodcock. The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, verification and testing, - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of theories, formal methods and tools for engineering computing systems - service-oriented development - service-oriented architectures: models and development methods - document-driven development - models of concurrency, security, and mobility - theory of parallel, distributed, and grid computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies, theories, tools and experiments of verified systems - domain-specific modeling and technology: examples, frameworks and experience ICTAC 2010 will be held in Brazil, in the city of Natal, Rio Grande do Norte. It will be organized jointly with the 3rd edition of the Pernambuco School on Software Engineering, to be held in Recife, Pernambuco, on the the topic of Formal Component Based Development and Coordination. ICTAC 2010 will include tutorials and technical sessions. Sponsors and Organisation ICTAC 2010 will be organized jointly by the Federal University of Rio Grande do Norte and UNU-IIST. They are also sponsors of ICTAC 2010. Invited Speakers Paulo Borba (Universidade Federal de Pernambuco, Brazil) Wolfram Schulte (Microsoft Research) Submission and Publication Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see www.springer.de/comp/lncs/authors.html for details).Papers should be submitted at www.easychair.org/conferences/?conf=ictac2010. All queries should be sent to: ictac2010 at iist.unu.edu. Important Dates Submission of abstracts: 22 March, 2010 Submission deadline: 29 March, 2010 Notification of acceptance: 14 May, 2010 Final version: 30 May, 2010 Steering Committee John Fitzgerald, UK Martin Leucker, Germany Zhiming Liu (Chair), Macao Tobias Nipkow, Germany Augusto Sampaio, Brazil Natarajan Shankar, USA Jim Woodcock, UK Special Tracks Chairs Marie-Claude Gaudel, France Jim Woodcock, UK Program Committee Bernhard Aichernig, Austria Keijiro Araki, Japan Jonathan Bowen, UK Christiano Braga, Brazil Michael Butler, UK Andrew Butterfield, Ireland Ana Cavalcanti, UK (chair) Antonio Cerone, Macao Jim Davies, UK David Deharbe, Brazil (chair) John Fitzgerald, UK Wan Fokkink, Netherlands Pascal Fontaine, France Marcelo Frias, Argentina Lindsay Groves, New Zealand Michael Hansen, Denmark Robert Hierons, UK Monzoo Kim, South Korea Maciej Koutny, UK Pascale Le Gall, France Martin Leucker, Germany Zhiming Liu, Macao Patricia Machado, Brazil Marius Minea, Romania Ali Mili, USA Michael Mislove, USA Tobias Nipkow, Germany Jose Nuno Oliveira, Portugal Paritosh Pandya, India Alberto Pardo, Uruguay Anders P Ravn, Denmark Leila Ribeiro, Brazil Markus Roggenbach, UK Augusto Sampaio, Brazil Bernhard Schaetz, Germany Gerhard Schellhorn, Germany Emil Sekerinski, Canada Natarajan Shankar, USA Marjan Sirjani, Iran Jin Song Dong, Singapore Dang Van Hung, Vietnam Daniel Varro, Hungary Helmut Veith, Germany Ji Wang, China Martin Wirsing, Germany Burkhart Wolff, France Husnu Yenigun, Turkey Naijun Zhan, China Organising Committee David Deharbe, Brazil Anamaria Moreira, Brazil Martin Musicante, Brazil Marcel Oliveira, Brazil Bartira Rocha, Brazil From miculan at dimi.uniud.it Thu Mar 11 03:44:31 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Thu, 11 Mar 2010 09:44:31 +0100 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for Papers (CORRECT DATES) Message-ID: <5083E754-253F-4D2F-AAC5-DCB4540D025A@dimi.uniud.it> Apologies for the duplication, but the CFP circulated before contained wrong dates. New and corrected date are below. ======================================= 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) http://lfmtp10.dimi.uniud.it July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) CALL FOR PAPERS Important dates (NEW): --------------------------------------------------------------------- Abstract submission: April 1, 2010 Submission deadline: April 4, 2010 Author notification: May 1, 2010 Pre-proceedings versions due: May 14, 2010 Workshop: July 14, 2010 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. 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. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP are: * 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 theoretical and practical issues concerning the encoding of variable binding and fresh name generation, 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 are particularly welcome. Topics include, but are 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 Program Committee: Stefan Berghofer (TU Munich) Yves Bertot (INRIA Sophia-Antipolis) Karl Crary (Carnegie Mellon University, PC co-chair) Amy Felty (University of Ottawa) Marino Miculan (University of Udine, PC co-chair) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (Cambridge University) Carsten Sch?rmann (IT University of Copenhagen) Steering Committee: Andreas Abel (INRIA) Karl Crary (Carnegie Mellon University) Amy Felty (University of Ottawa) Marino Miculan (University of Udine) Michael Norrish (NICTA) Brigitte Pientka (McGill University) Carsten Sch?rmann (IT University of Copenhagen) Paper Submission Submission of papers is electronic. Authors must submit the paper through the EasyChair server, at http://www.easychair.org/conferences/?conf=lfmtp10. Authors are required to submit a paper title and a short abstract before submitting the paper (see im- portant dates aside). Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will be made available in electronic form. After the workshop, authors of accepted papers will be invited to submit revised versions for inclusion in final post-proceedings, which will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS) http://eptcs.org. Papers are to be submitted in PDF format, should not exceed 15 pages including references, and must be prepared in LATEX using the EPTCS macro package (http://style.eptcs.org). For further information and submission instructions, see the LFMTP 2010 web page. The organizers: Karl Crary Marino Miculan School of Computer Science Dept. of Mathematics and Computer Science Carnegie Mellon University University of Udine crary at cs.cmu.edu miculan at dimi.uniud.it From Paul-Andre.Mellies at pps.jussieu.fr Thu Mar 11 12:59:20 2010 From: Paul-Andre.Mellies at pps.jussieu.fr (Paul-Andre Mellies) Date: Thu, 11 Mar 2010 18:59:20 +0100 (CET) Subject: [TYPES/announce] LOLA 2010 -- call for contributed talks Message-ID: ============================================================ *** CALL FOR CONTRIBUTED TALKS *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ ============================================================ IMPORTANT DATES Submission deadline Monday 26th April 2010 Author notification Friday 14th May 2010 Workshop Friday 9th July 2010 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified compilation - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects PROGRAMME COMMITTEE * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 INVITED SPEAKERS To be announced soon. From gerwin.klein at nicta.com.au Fri Mar 12 02:44:02 2010 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Fri, 12 Mar 2010 18:44:02 +1100 Subject: [TYPES/announce] CFP: SSV'10 @ USENIX OSDI 2010 Message-ID: Call for Papers 5th International Workshop on Systems Software Verification (SSV'10) Real Software, Real Problems, Real Solutions October 6-7, Vancouver, Canada co-located with OSDI'10 http://usenix.org/events/ssv10/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum discusses software analysis and development techniques and tools; it will serves as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems level code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (at most 9 pages, 8.5" x 11", including figures, tables, and references, formatted in two columns, using 10 point type on 12 point (single-spaced) leading, with the text block being no more than 6.5" wide by 9" deep) to https://papers.usenix.org/hotcrp/ssv10/ by June 4th 2010 Samoan time. All papers will be subject to peer review under conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published online by USENIX. Submissions must be in pdf format and follow the USENIX style instructions above. Important dates 28.05.2010 Abstract Deadline 04.06.2010 Submission Deadline 20.07.2010 Notification of accepted papers 20.08.2010 Final version 06.10.2010 Workshop The workshop is organized as a 1.5-day workshop (Oct 6-7, 2010). Location The workshop will be held in Vancouver, Canada, co-located with OSDI'10. Program Chair Ralf Huuck (NICTA & UNSW, Australia) Gerwin Klein (NICTA & UNSW, Australia) Bastian Schlich (ABB Corporate Research, Germany) Program Committee Adam Chlipala (Harvard University, USA) Dino Distefano (Queen Mary University London, UK) Klaus Havelund (Jet Propulsion Laboratory, USA) Chris Hawblitzel (Microsoft Research, USA) Andy King (University of Kent, UK) Stefan Kowalewski (RWTH Aachen University, Germany) Kim Larsen (Aalborg University, Denmark) John Matthews (Galois Inc, USA) Thomas Noll (RWTH Aachen University, Germany) Wolfgang Paul (University of Saarbruecken, Germany) Jan Peleska (University of Bremen, Germany) John Regehr (University of Utah, USA) Wolfram Schulte (Microsoft Research, USA) Zhong Shao (Yale University, USA) Junfeng Yang (Columbia, USA) Kwangkeun Yi (Seoul National University, South Korea) We thank our sponsors NICTA and Microsoft Research for their support. From rlc3 at mcs.le.ac.uk Fri Mar 12 03:50:28 2010 From: rlc3 at mcs.le.ac.uk (Roy Crole) Date: Fri, 12 Mar 2010 08:50:28 +0000 Subject: [TYPES/announce] LECTURESHIPS IN (THEORETICAL) COMPUTER SCIENCE Message-ID: <4B9A0054.6010000@mcs.le.ac.uk> Dear Colleagues, I would be grateful if you could forward the lectureship advertisement below around your Department and to interested colleagues. Best Regards, Roy Crole. ======= * Lecturer in Computer Science (3 Posts) * * Department of Computer Science* * * *University of Leicester* * * *http://www.cs.le.ac.uk/* * * Salary Grade 8 - ?35,646 to ?43,840 pa Ref: SEN00056 The University of Leicester has an international reputation for its research and teaching. In order to build further on the recent successes of the Department of Computer Science, the University is making a strategic investment by creating three new lectureships in computer science. The successful candidates will have a strong research record, with a background in the theoretical foundations of computer science, and will be able to contribute to undergraduate and postgraduate teaching and supervision of mainstream projects in a broad range of topics. We are keen to make appointments that will contribute to our research excellence in either the foundations of computational models, processes or structures, or the way they support the engineering of software-intensive systems, including socio-technical systems. Ability to teach software re-engineering, software measurement and quality, or web technologies would be desirable. Ability to attract funding or engage with industry are other aspects that we will rate very highly. *Important dates* Closing date for applications: April 9th Invitations for the interview: after April 19th Interview: May 17th, 18th and 19th Start date: September 1st (or as close as possible) *Other information* A lecturer position in the UK is similar to an assistant professorship in the North-American system. Informal enquiries are welcome and should be made to Jos? Fiadeiro on jose at mcs.le.ac.uk For further information and to apply on-line, please visit our website: http://www2.le.ac.uk/jobs Candidates short-listed for interview will be contacted by the University. If you do not receive a communication from the University within 4 weeks of the closing date, please assume that your application has been unsuccessful. * * * * From prakash at cs.mcgill.ca Fri Mar 12 09:41:49 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Fri, 12 Mar 2010 09:41:49 -0500 Subject: [TYPES/announce] Call for Papers DCM 2010 Message-ID: <4B9A52AD.3010409@cs.mcgill.ca> ========================================================================= Second Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 Deadline for extended abstracts: 01 April, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 01 April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). IMPORTANT DATES: Submission deadline for extended abstracts: 01 April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 CONFIRMED INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From quaglia at disi.unitn.it Fri Mar 12 14:45:30 2010 From: quaglia at disi.unitn.it (Paola Quaglia) Date: Fri, 12 Mar 2010 20:45:30 +0100 Subject: [TYPES/announce] CMSB 2010 - Second Call For Papers Message-ID: <201003121945.o2CJjGjd022570@disi.unitn.it> _Apologies for multiple posting_ (NEW: submission guidelines) ================================================================ Second call for papers CMSB 2010 (8th Conference on Computational Methods in Systems Biology) in cooperation with ACM September 29 - October 1, 2010 Trento, Italy http://www.cosbi.eu/cmsb2010/ ================================================================ The CMSB series solicits innovative research focussing on the dynamics and on the analysis of biological systems, networks, and data. The Conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological systems. CMSB 2010 invites submissions of both papers and posters covering a broad range of research in systems biology. Topics of interest include, but are not limited to: original models or paradigms for modelling biological processes together with their application domains; frameworks and techniques for verifying, validating, analyzing, and simulating biological systems; inference from high-throughput experimental data; model integration from biological databases. Contributions on modelling and analysis of relevant biological case studies are especially encouraged. PROGRAMME COMMITTEE: Erik de Vink - Technische Universiteit Eindhoven, NL Pierpaolo Degano - University of Pisa, Italy Diego Di Bernardo - TIGEM and University of Naples "Federico II", Italy Finn Drabl?s - Norwegian University of Science and Technology, Norway Fran?ois Fages - INRIA Rocquencourt, France Jasmin Fisher - Microsoft Research Cambridge, UK John Heath - University of Birmingham, UK Monika Heiner - TU Cottbus, Germany Ina Koch - Max Planck Institute for Molecular Genetics, Germany Marta Z. Kwiatkowska - Oxford University, UK Christopher Langmead - Carnegie Mellon University, USA Hiroshi Mamitsuka - Kyoto University, Japan Flemming Nielson - Technical University of Denmark, Lyngby, Denmark Ion Petre - ?bo Akademi University, Finland Gordon Plotkin - University of Edinburgh, UK Alberto Policriti - University of Udine, Italy Paola Quaglia (Chair) - CoSBi and University of Trento, Italy Scott A. Smolka - SUNY at Stony Brook, USA Adelinde M. Uhrmacher - University of Rostock, Germany Verena Wolf - Saarland University, Germany STEERING COMMITTEE: Finn Drabl?s - Norwegian University of Science and Technology, Norway Fran?ois Fages - INRIA Rocquencourt, France David Harel - Weizmann Institute of Science, Israel Monika Heiner - TU Cottbus, Germany Michael H?rnquist - Link?ping University, Sweden Satoru Miyano - University of Tokyo, Japan Gordon Plotkin - University of Edinburgh, UK Corrado Priami - CoSBi and University of Trento, Italy Adelinde M. Uhrmacher - University of Rostock, Germany IMPORTANT DATES: Abstract submission: April 25, 2010 Paper submission: May 02, 2010 Notification of paper acceptance: June 16, 2010 Poster submission: June 23, 2010 Notification of poster acceptance: July 07, 2010 Camera ready version of papers: July 07, 2010 SUBMISSION GUIDELINES: Paper submission: CMSB solicits the submission of papers describing original research not published nor currently under review for another conference or journal. Authors will have to submit their papers via EasyChair (https://www.easychair.org/login.cgi?conf=cmsb2010). All papers will be refereed by the Programme Committee. Submission implies the willingness of at least one of the authors to present the work described in the accepted paper at the conference. Papers should be in the standard two-column ACM conference format, and should not exceed 10 pages. Templates for the ACM style, as well as detailed guidelines for using them, can be found at http://www.acm.org/sigs/publications/proceedings-templates. Proceedings will be published in the ACM Digital Library, which requires a copyright transfer from the authors of accepted papers to ACM after the ACM copyright policy (http://www.acm.org/publications/policies/copyright_policy). Print-outs of the proceedings will be available at the conference. The templates for ACM conference style provide space for ACM Computing Classification categories and terms (see http://www.acm.org/about/class/1998). This indexing is not required of submissions. Accepted authors will receive suggestions and guidelines on categories and terms. Poster submission: To be announced at a later stage. AWARD: CMSB 2010 is organized by The Microsoft Research - University of Trento Centre for Computational and Systems Biology (CoSBi) that offers a 4000 EUR award to the best paper reporting on BlenX-based research results, and authored by people not affiliated with CoSBi. The award will be presented only if there are at least three competing eligible papers, and will be judged by the Programme Committee. From nswamy at microsoft.com Sat Mar 13 16:40:44 2010 From: nswamy at microsoft.com (Nikhil Swamy) Date: Sat, 13 Mar 2010 21:40:44 +0000 Subject: [TYPES/announce] Formal Techniques for Java-like Program (FTFJP) 2010 --- Call for Papers Message-ID: <095FBE2C2209B74DA465AC5C2815740724CBBC91@TK5EX14MBXC103.redmond.corp.microsoft.com> CALL FOR PAPERS 12th Workshop on Formal Techniques for Java-like Programs Co-located with ECOOP 2010 June, Maribor (Slovenia) URL: http://distrinet.cs.kuleuven.be/events/ftfjp10/ Overview Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties, - verification logics, - language semantics, - type systems, - dynamic linking and loading, - security. Call for contributions Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. The workshop is intended for around 25 participants. The workshop will be organized into four or more sessions, each focused on a specific topic, and initiated by a presentation of few related position papers by the respective participants, or the introduction of the specific topic by a single speaker, and followed by discussions. Depending on the nature of the contributions, we may be organising a special journal issue as a follow-up to the workshop, as has been done for some of the previous FTfJP workshops. Contributions must be in English, in pdf format, and are limited to 6 pages in ACM 2-column style. Papers must be submitted electronically via Easy Chair. A plain-text ASCII abstract must be submitted one week before the paper submission deadline. Submission site: http://www.easychair.org/conferences/?conf=ftfjp12 A PC member, other than the chair, may be an author or co-author on any paper under consideration but will be excluded from any evaluation or discussion of the paper, and will get access to reviews of the paper(s) only in the same manner and time as other authors. The ECOOP organisation is negotiating with the ACM for workshop proceedings to appear in ACM Digital Library. Important dates abstract submission: April 12, 2010 full paper submission: April 19, 2010 notification: May 5, 2010 workshop: June 21 or 22, 2010 Program Committee Bernhard Beckert, Karlsruhe Institute of Technology, Germany Lars Birkedal IT University of Copenhagen, Denmark Dino Distefano, Queen Mary University of London, UK Cl?ment Hurlin, INRIA Bordeaux, France Bart Jacobs, Katholieke Universiteit Leuven, Belgium (co-chair) Adriaan Moors, EPFL Lausanne, Switzerland Peter M?ller, ETH Zurich, Switzerland Frank Piessens Katholieke, Universiteit Leuven, Belgium (chair) Erik Poll, Radboud University Nijmegen, The Netherlands Robby, Kansas State University, US Wolfram Schulte, Microsoft Research, US Isabelle Simplot-Ryl, INRIA Lille, France Jan Smans, Katholieke Universiteit Leuven, Belgium Nikhil Swamy, Microsoft Research, US Viktor Vafeiadis, University of Cambridge, UK Organization Sophia Drossopoulou, Imperial College, London, Great Britain Susan Eisenbach, Imperial College, London, Great Britain Bart Jacobs, Katholieke Universiteit Leuven, Belgium (co-chair) Gary T. Leavens, University of Central Florida, Orlando, US Peter M?ller, ETH Zurich, Switzerland Frank Piessens, Katholieke Universiteit Leuven, Belgium (chair) Arnd Poetzsch-Heffter, Universit?t Kaiserlautern, Germany Erik Poll, Radboud University Nijmegen, The Netherlands -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100313/e759f5d7/attachment-0001.htm From kutsia at risc.uni-linz.ac.at Mon Mar 15 19:57:55 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 16 Mar 2010 00:57:55 +0100 Subject: [TYPES/announce] Deadline extension: PPDP'10 Message-ID: <4B9EC983.5020400@risc.uni-linz.ac.at> ====================================================================== PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== EXTENDED DEADLINES ----------------- Abstract submission: 21 March, 2010 Full paper: 25 March, 2010 ===================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: Program Design and Development * Declarative Aspects of Object-Oriented Programming * Concurrent Extensions to Declarative Languages * Declarative Mobile Computing * Integration of Paradigms * Proof Theoretic and Semantic Foundations * Type and Module Systems * Program Analysis and Verification * Program Transformation * Abstract Machines and Compilation * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: Maria Paola Bonacina (Universit? degli Studi di Verona, Italy) Sumit Gulwani (Microsoft Research) Important Dates: # Submission: title and abstract: 21 March 2010 (extended) full paper: 25 March 2010 (extended) # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez at kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia at risc.uni-linz.ac.at From mjas at imm.dtu.dk Tue Mar 16 09:49:22 2010 From: mjas at imm.dtu.dk (Michael Smith) Date: Tue, 16 Mar 2010 14:49:22 +0100 Subject: [TYPES/announce] Call for Posters: MLQA 2010 - Models and Logics for Quantitative Analysis Message-ID: Second Annual Meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA 2010) http://wiki.ercim.eu/wg/MLQA/index.php/July_2010:_MLQA_meeting_at_FLoC_2010%2C_Edinburgh July 9th, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference (FLoC 2010) Affiliated with Logic in Computer Science (LICS 2010) CALL FOR POSTERS Important dates: ----------------------------------------------------- Abstract submission: June 18th, 2010 Submission deadline: June 25th, 2010 Author notification: June 28th, 2010 Meeting: July 9th, 2010 ----------------------------------------------------- We invite posters under two categories: - Presentation of recent or on-going work relating to models, logics, tools, and/or applications with respect to discrete, stochastic and/or continuous systems and properties. - Overview of the recent research activities of a group, in relation to the themes of MLQA. We equally encourage submissions from both research leaders, and junior researchers and PhD students. Posters should be readable in size A3, and should be submitted in pdf format to mlqa at imm.dtu.dk. Notification of your intention to submit, along with a title and short description of the poster, should be sent by June 18th. We require that we receive the final poster no later than June 25th, in order to arrange their printing before the meeting. -- Flemming Nielson (acting chairman of MLQA) Michael Smith, Nataliya Skrupnyuk (poster session organisers) http://wiki.ercim.eu/wg/MLQA From troina at di.unito.it Tue Mar 16 10:14:23 2010 From: troina at di.unito.it (Angelo Troina) Date: Tue, 16 Mar 2010 15:14:23 +0100 Subject: [TYPES/announce] CS2Bio'10 - Final Call for Papers (Submission deadline extended) In-Reply-To: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> References: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> Message-ID: <4B9F923F.7010109@di.unito.it> ====================================================================== Final call for papers CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - Luca Cardelli (Microsoft Research - Cambridge, UK) - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio10). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** DISSEMINATION *** The post-proceedings of the workshop will be published in a volume of the Electronic Notes on Theoretical Computer Science series (Elsevier ENTCS). The quality of the received papers permitting, publication in a special issue of Mathematical Structures in Computer Science, with a second round of reviews, is planned. *** IMPORTANT DATES *** - Submission deadline: 30 March 2010 - Reviews due: 30 April 2010 - Notification to authors: 06 May 2010 - Workshop: 10 June 2010 *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Angelo Troina (Co-chair) - Verena Wolf - Gianluigi Zavattaro From Ralf.Gerstner at springer.com Tue Mar 16 12:41:07 2010 From: Ralf.Gerstner at springer.com (Gerstner, Ralf, Springer DE) Date: Tue, 16 Mar 2010 17:41:07 +0100 Subject: [TYPES/announce] New Book on "Parallel Programming" Message-ID: <5263A5E88D701F4883EEC88B0BA37810B9B0DA@SEDEHETI0035.springer-sbm.com> Rauber, Thomas; R?nger, Gudula Parallel Programming for Multicore and Cluster Systems 1st Edition., 2010, X, 450 p., Hardcover ISBN: 978-3-642-04817-3 Features and Benefits: + Broad coverage of all aspects of parallel programming + Special emphasis on runtime efficiency and memory organization + Presented material has been used in courses for many years + Complemented by many examples and an additional website with teaching material Innovations in hardware architecture, like hyper-threading or multicore processors, mean that parallel computing resources are available for inexpensive desktop computers. In only a few years, many standard software products will be based on concepts of parallel programming implemented on such hardware, and the range of applications will be much broader than that of scientific computing, up to now the main application area for parallel computing. Rauber and R?nger take up these recent developments in processor architecture by giving detailed descriptions of parallel programming techniques that are necessary for developing efficient programs for multicore processors as well as for parallel cluster systems and supercomputers. Their book is structured in three main parts, covering all areas of parallel computing: the architecture of parallel systems, parallel programming models and environments, and the implementation of efficient application algorithms. The emphasis lies on parallel programming techniques needed for different architectures. The main goal of the book is to present parallel programming techniques that can be used in many situations for many application areas and which enable the reader to develop correct and efficient parallel programs. Many examples and exercises are provided to show how to apply the techniques. The book can be used as both a textbook for students and a reference book for professionals. The presented material has been used for courses in parallel programming at different universities for many years. Keywords: Distributed Programming - Grid Computing - Multithreading - Networking - Parallel Programming - Scientific Programming Read more detailed information (including detailed table of contents and sample chapter): www.springer.com/978-3-642-04817-3 ORDER INFORMATION: Springer: www.springer.com/978-3-642-04817-3 Amazon: http://www.amazon.com/Parallel-Programming-Multicore-Cluster-Systems/dp/364204817X --- Ralf Gerstner Springer Senior Editor | Computer Science Editorial --- Tiergartenstrasse 17 | 69121 Heidelberg | Germany tel +49 (0)6221 / 487 8144 fax +49 (0)6221 / 487 6 8144 ralf.gerstner at springer.com www.springer.com --- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100316/4a4b5e64/attachment-0001.htm From kutsia at risc.uni-linz.ac.at Tue Mar 16 15:39:48 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 16 Mar 2010 20:39:48 +0100 Subject: [TYPES/announce] Last CfP: LOPSTR'10 Message-ID: <20100316193948.GA23099@risc.uni-linz.ac.at> [Please distribute. Apologies for multiple copies.] ========================================================================= Call for papers 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate the feedback in the published papers. The 20th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2010) will be held in Hagenberg, Austria; previous symposia were held in Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2010 will be co- located with PPDP 2010 (12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in- the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation specialization inversion composition program/model manipulation certification security transformational techniques in SE applications and tools Survey papers that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. 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. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, formal post-conference proceedings will be published by Springer-Verlag in the LNCS series. IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: March 25, 2010 Notification (for pre-proceedings): May 15, 2010 Camera-ready (for pre-proceedings): June 15, 2010 Symposium: July 23-25, 2010 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages, respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2010 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2010 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal post-proceedings. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=lopstr2010 They should be in PDF format and interpretable by Acrobat Reader. Invited Speakers: Bruno Buchberger RISC, Johannes Kepler University Linz, Austria Olivier Danvy University of Aarhus, Denmark Johann Schumann RIACS/NASA Ames Research Center, USA Program Committee: Maria Alpuente Tech. University of Valencia (Chair), Spain Sergio Antoy Portland State University, USA Gilles Barthe IMDEA Software, Madrid Manuel Carro Tech. University of Madrid, Spain Marco Comini University of Udine, Italy Danny De Schreye K.U.Leuven, Belgium Santiago Escobar Tech. University of Valencia, Spain Moreno Falaschi University of Siena, Italy Fabio Fioravanti University of Chieti - Pescara, Italy John Gallagher Roskilde University, Denmark Michael Hanus University of Kiel, Germany Patricia M Hill University of Parma, Italy Andy King University of Kent, UK Temur Kutsia Johannes Kepler University Linz, Austria Ralf Lämmel Universität Koblenz-Landau, Germany Michael Leuschel University of Southampton, UK Yanhong Annie Liu State University of New York at Stony Brook, USA Julio Mariño Tech. University of Madrid, Spain Ricardo Peña University Complutense of Madrid, Spain Peter Schneider-Kamp University of Southern Denmark Alicia Villanueva Tech. University of Valencia, Spain Contacts Program Chair Maria Alpuente DSIC - Technical University of Valencia Camino de Vera s/n Apdo. 22.012 E-46022 Valencia (Spain) Email: alpuente at dsic.upv.es Conference Chair Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Email: kutsia at risc.uni-linz.ac.at From olivier.laurent at ens-lyon.fr Thu Mar 18 08:15:20 2010 From: olivier.laurent at ens-lyon.fr (Olivier Laurent) Date: Thu, 18 Mar 2010 13:15:20 +0100 Subject: [TYPES/announce] MALOA PhD position in logic at ENS Lyon Message-ID: <4BA21958.3080201@ens-lyon.fr> ********************************************************* * * * PhD Position in Logic at ENS Lyon (MALOA project) * * * * * * October 1st, 2010 -- September 30th, 2013 * * * ********************************************************* MALOA (From MAthematical LOgic to Applications) is a European Initial Training Network: http://www.logique.jussieu.fr/MALOA/ Amongst the proposed PhD positions, one will be open in the Plume team of the computer science laboratory of the ENS Lyon (France). http://www.ens-lyon.fr/LIP/PLUME/ The main research topics of the team are: * Proof theory and computer science * Curry-Howard correspondence * Programming languages semantics * Linear logic, game semantics, realisability * Implicit computational complexity * Concurrency theory * Computer assisted reasoning Applications are now open. Submissions including : * a detailed curriculum vitae * a list of topics of interest * the names and e-mail addresses of two references should be sent by e-mail to "olivier.laurent at ens-lyon.fr" by April 30th, 2010. Before applying, please check you satisfy the eligibility conditions: http://www.logique.jussieu.fr/MALOA/Eligibility.html Important dates: * applications: April 30th, 2010 * starting date: October 1st, 2010 Do not hesitate to contact us if you want some additional informations: Olivier.Laurent at ens-lyon.fr -- Olivier LAURENT e-mail : Olivier.Laurent at ens-lyon.fr www : http://perso.ens-lyon.fr/olivier.laurent/ From Yves.Bertot at sophia.inria.fr Thu Mar 18 09:58:28 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 18 Mar 2010 14:58:28 +0100 Subject: [TYPES/announce] CFP: Call for papers, Coq Workshop (deadline March 22nd) Message-ID: <4BA23184.4040904@sophia.inria.fr> lease help disseminate this call for papers Two changes in the call for papers: 1/ papers describing experiments in other type theory-based proof assistants are explicitly invited to this workshop, 2/ EPTCS (http://eptcs.org/) has agreed to host the proceedings. Call for papers The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted papers, invited talks and a plenary discussion on the evolution and design of Coq. Topics for submitting a paper include: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit their paper through EasyChair at the following link: http://www.easychair.org/conferences/?conf=coq2 Submitted papers should be in (postscript or) portable document format. Papers should not exceed 12 pages in length in single-column full-page 11pt A4 style. If there is sufficient demand, we will try to organize a time slot for demonstrations. Similarly, we may also organize a session on the lessons learned from teaching Coq. If you are interested, please send a brief proposal. Venue FLoC 2010, Edinburgh, Scotland Important Dates * March 22nd: Deadline for submission of papers * May 1st: Acceptance Notification * May 31st: Final version of articles * July 9th: Workshop in Edinburgh Program Committee * Andrew Appel * Yves Bertot (Chair) * Adam Chlipala * Georges Gonthier * Benjamin Gr?goire * Hugo Herbelin * Micaela Mayero * Christine Paulin-Mohring * Bas Spitters Contact Yves.Bertot at sophia.inria.fr From pmt6sbc at maths.leeds.ac.uk Fri Mar 19 08:15:52 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 19 Mar 2010 12:15:52 GMT Subject: [TYPES/announce] CiE 2010 - Call for Participation and Informal Presentations Message-ID: <201003191215.o2JCFqnr003883@amsta.leeds.ac.uk> COMPUTABILITY IN EUROPE 2010: Programs, Proofs, Processes Ponta Delgada (Azores), Portugal June 30 to July 4, 2010 http://www.cie2010.uac.pt/ ************************************************************ Call for Participation and Informal Presentations ************************************************************ CALL FOR INFORMAL PRESENTATIONS There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication. Again continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and half a page) by the DEADLINE: MAY 15, 2010. Please submit your abstract electronically, via EasyChair, selecting the category "Informal Presentation". You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission, so if you intend to apply for ASL ASL Student Travel Awards you should submit your abstract before March 23rd. Let us remind you that we are planning several post-conference publications, which will contain full articles of selected CiE 2010 presentations, including informal presentations. You can find these instructions at http://www.cie2010.uac.pt/contents/call_for_informal_presentations.html *********************************************************************** IMPORTANT DATES: Submission of applications for ASL Student Grants: MARCH 30 Early registration deadline: MAY 28 Submission of informal presentations: MAY 15 Late registration deadline: JUNE 20 *********************************************************************** DETAILS OF PROGRAMME: TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Natasha Jonoska, Giancarlo Mauri, Yasubumi Sakakibara, Stephane Vialette Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Cris Calude, Barry Cooper Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Fernando Ferreira, Martin Hyland Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Invited speakers: Nimrod Bar-Am, Michele Friend, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Thomas Erlebach, Martin Olsen Invited speakers: Hannah Bast, Debora Donato, Alex Hall, Jeannette Janssen SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. *********************************************************************** PROGRAMME COMMITTEE: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) http://www.cie2010.uac.pt/ __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From sobocinski at gmail.com Fri Mar 19 10:59:01 2010 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Fri, 19 Mar 2010 15:59:01 +0100 Subject: [TYPES/announce] SOS `10 call for papers Message-ID: This workshop should be of interest to those members of the types mailing list who are interested in operational semantics. ********************************************************** SOS `10 - Structural Operational Semantics 2010 An Affiliated Workshop of CONCUR 2010 August 30, 2010, Paris, France http://www.ru.is/faculty/luca/SOS2010/ ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair by Wednesday, 2nd June 2010. (If you do not have an Easychair account, you can create it by following the link). Papers should take the form of a pdf file in EPTCS format, whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speakers ---------------- MohammadReza Mousavi (Eindhoven, NL) Catuscia Palamidessi (INRIA Saclay and ?cole Polytechnique, FR) Program Committee ----------------- Luca Aceto (Reykjavik, IS, co-chair) Robert Amadio (Paris Diderot, FR) Wan Fokkink (Amsterdam, NL) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL and Cambridge, UK) Cosimo Laneve (Bologna, IT) Andrew Pitts (Cambridge, UK) Michel Reniers (Eindhoven, NL) Grigore Rosu (Urbana-Champaign IL, USA) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Important Dates --------------- Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 Notification: Monday, 5th July 2010 Final version: Friday 16th July 2010 Workshop: Monday 30th August 2010 From A.M.Silva at cwi.nl Fri Mar 19 12:18:55 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Fri, 19 Mar 2010 17:18:55 +0100 Subject: [TYPES/announce] ICE 2010: Final call for papers (Submission deadline extended) Message-ID: <20100319161855.GA31701@tetra.sen.cwi.nl> [- Apologies for cross-postings -] 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html *************************************** *** Submission deadline extended! *** *************************************** === Highlights === - Invited talks by Tom A. Henzinger (IST, Austria) and Joost-Pieter Katoen (RWTH Aachen University, Germany) - Innovative selection procedure - Travel grants for young researchers === Important Dates === - Abstract submission: 29 March 2010 - Full paper submission: 05 April 2010 (hard deadline) - Reviews, rebuttal and PC discussion: 06-28 April 2010 - Notification to authors: 30 April 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As witnessed by the past two editions of ICE, this considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of accepted papers, and the discussion during the workshop. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access will be restricted to the authors and to all the PC members not in conflict of interests. The PC members post comments / questions which the authors shall reply to. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Papers must report previously unpublished work and not be simultaneously submitted to other conferences / workshops with refereed proceedings. The ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Depending on the quality of submissions a special issue in a journal will be considered. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 15 pages with EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (CNR, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: - Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). - Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From kos at informatik.uni-marburg.de Mon Mar 22 04:36:51 2010 From: kos at informatik.uni-marburg.de (Klaus Ostermann) Date: Mon, 22 Mar 2010 09:36:51 +0100 Subject: [TYPES/announce] Open Postdoc and PhD positions at University of Marburg, Germany Message-ID: <4ca09aca1003220136y979795et36545147889612e8@mail.gmail.com> There are open PostDoc and PhD positions in the "Programming Languages and Software Engineering" group at Philipps-Universit?t Marburg. Potential topics for these positions include, but are not limited to: - software architecture and design techniques - aspect-oriented and feature-oriented programming - code generation and compiler techniques - domain-specific languages - object-oriented programming - functional programming - program analysis and verification - compilers and virtual machines - type systems - mathematical foundations of programming Marburg is a beautiful small town in Hesse, Germany, with one of the oldest universities in Germany. The positions are well-paid (according to standard German scalary scales), have few (teaching) obligations, and include a lot of freedom to develop one's own research program. Fluency in German is not required. Please send informal enquiries to: Klaus Ostermann Contact data available at: http://www.informatik.uni-marburg.de/~kos/ From jfrazee at mail.utexas.edu Mon Mar 22 09:42:38 2010 From: jfrazee at mail.utexas.edu (Joey Frazee) Date: Mon, 22 Mar 2010 08:42:38 -0500 Subject: [TYPES/announce] NASSLLI 2010: Open for Registration Message-ID: <103f6a951003220642u56358974n878ff7d6f1886ef8@mail.gmail.com> NASSLLI 2010 is Open for Registration! Fourth North American Summer School in Logic, Language, and Information NASSLLI 2010 June 20-26, 2010 http://www.indiana.edu/~nasslli/ The North American Summer School in Logic, Language, and Information (NASSLLI) is a summer school with classes in the interface between computer science, linguistics, and logic. After previous editions at Stanford University, Indiana University, and UCLA, NASSLLI will return to Bloomington, Indiana, June 20?26, 2010. The summer school, loosely modeled on the long-running ESSLLI series in Europe, will consist of a number of courses and workshops, selected on the basis of the proposals. Courses and workshops meet for 90 or 120 minutes on each of five days, June 21?25, and there will be tutorials on June 20 and a day-long workshop on June 26. The instructors are prominent researchers who volunteer their time and energy to present basic work in their disciplines. Many are coming from Europe just to teach at NASSLLI. NASSLLI courses are aimed at graduate students and advanced undergraduates in wide variety of fields. The instructors know that people will be attending from a wide range of disciplines, and they all are pleased to be associated with an interdisciplinary school. The courses will also appeal to post-docs and researchers in all of the relevant fields. We hope to have 100-150 participants. In addition to classes in the daytime, the evenings will have social events and plenary lectures. Bloomington is a wonderful place to visit, known for arts, music, and ethnic restaurants. All of this is within 15 minutes walking from campus. We aim to make NASSLLI fun and exciting. Joey Frazee Student Program Committee From Richard.Moot at labri.fr Mon Mar 22 13:21:35 2010 From: Richard.Moot at labri.fr (Richard Moot) Date: Mon, 22 Mar 2010 18:21:35 +0100 Subject: [TYPES/announce] E. W. Beth Dissertation Prize: 2010 call for nominations Message-ID: <59271156-9580-48BA-9347-29A809B7B651@labri.fr> [ Please redistribute. Apologies for multiple postings. ] E. W. Beth Dissertation Prize: 2010 call for nominations Since 2002, FoLLI (the Association for Logic, Language, and Information, http://www.folli.org) awards the E.W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. We invite submissions for the best dissertation which resulted in a Ph.D. degree in the year 2009. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of three fields of Logic, Language, and Computation. Interdisciplinarity is an important feature of the theses competing for the E.W. Beth Dissertation Prize. Who qualifies. Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2009 and December 31st, 2009. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2009 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for 2010). The present call for nominations for the E.W. Beth Dissertation Award 2010 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2008 or 2009. Prize. The prize consists of: -a certificate -a donation of 2500 euros provided by the E.W. Beth Foundation -an invitation to submit the thesis (or a revised version of it) to the FoLLI Publications on Logic, Language and Information (Springer). For further information on this series see the FoLLI site. How to submit. Only electronic submissions are accepted. The following documents are required: 1. The thesis in pdf or ps format (doc/rtf not accepted); 2. A ten page abstract of the dissertation in ascii or pdf format; 3. A letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. Two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to buszko at amu.edu.pl. Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days, nominators should write to buszko at amu.edu.pl. Important dates: Deadline for Submissions: April 30, 2010. Notification of Decision: July 20, 2010. Committee : Natasha Alechina (Nottingham) Lev Beklemishev (Moscow) Wojciech Buszkowski (chair) (Poznan) Didier Caucal (IGM-CNRS) Nissim Francez (Haifa) Alexander Koller (Saarbruecken) Alberto Policriti (Udine) Ian Pratt-Hartmann (Manchester) Rob van der Sandt (Nijmegen) Colin Stirling (Edinburgh) Rineke Verbrugge (Groningen) Heinrich Wansing (Dresden) From eabonelli at gmail.com Mon Mar 22 17:03:22 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Mon, 22 Mar 2010 18:03:22 -0300 Subject: [TYPES/announce] HOR'2010 - Extended deadline Message-ID: ******************** extended deadline ******************** ******************** extended deadline ******************** ************************************** * * * HOR 2010 - CALL FOR ABSTRACTS * * (extended deadline) * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 31, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fern?ndez King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Fr?d?ric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Universit? di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands http://style.eptcs.org/ HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). The suggested formatting style is that of EPTCS (cf. http://style.eptcs.org/). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Post-workshop proceedings of extended abstracts of selected contributions will be published as a volume of EPTCS. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts at inf.ed.ac.uk) From icfp.publicity at googlemail.com Tue Mar 23 03:59:56 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 23 Mar 2010 08:59:56 +0100 Subject: [TYPES/announce] ICFP 2010: Final Call for Papers Message-ID: <53ff55481003230059p2c790e66uc3b7767a5b3327e@mail.gmail.com> ===================================================================== Final Call for Papers ICFP 2010: International Conference on Functional Programming Baltimore, Maryland, 27 -- 29 September 2010 http://www.icfpconference.org/icfp2010 ===================================================================== Important Info ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Submission: 2 April 2010 Author response: 24 -- 25 May 2010 Notification: 7 June 2010 Final papers due: 12 July 2010 All deadlines are at 14:00 UTC. Submission is now open at http://icfp2010.seas.upenn.edu/ Scope ~~~~~ ICFP 2010 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to object-oriented or logic programming; interoperability * Implementation: abstract machines; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proof * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words and a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadline will be strictly enforced and papers exceeding the page limits will be summarily rejected. Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. A submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LATEX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm. Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on 24 May 2010, to read and respond to reviews. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2010. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Organization ~~~~~~~~~~~~ Conference Chair Paul Hudak, Yale University Program Chair Stephanie Weirich, University of Pennsylvania Program Committee: Umut Acar, Max Planck Institute for Software Systems Zena Ariola, University of Oregon James Cheney, University of Edinburgh Peter Dybjer, Chalmers University of Technology Robert Bruce Findler, Northwestern University Andy Gill, Kansas University Fritz Henglein, University of Copenhagen Michael Hicks, University of Maryland, College Park Patricia Johann, University of Strathclyde Andres L?h, Utrecht University Simon L. Peyton Jones, Microsoft Research Didier R?my, INRIA Paris-Rocquencourt John Reppy, University of Chicago Manuel Serrano, INRIA Sophia-Antipolis Matthieu Sozeau, Harvard University From chong at seas.harvard.edu Tue Mar 23 18:47:56 2010 From: chong at seas.harvard.edu (Stephen Chong) Date: Tue, 23 Mar 2010 18:47:56 -0400 Subject: [TYPES/announce] Final CFP: Analysis and Programming Languages for Web Apps and Cloud Apps 2010 In-Reply-To: <4B1006B3.3000602@seas.harvard.edu> References: <4AF313AD.60906@seas.harvard.edu> <4B022FBF.7020204@seas.harvard.edu> <4B0E11E6.5040903@seas.harvard.edu> <4B0E9C5B.7080303@seas.harvard.edu> <4B1006B3.3000602@seas.harvard.edu> Message-ID: <4BA9451C.8010603@seas.harvard.edu> CALL FOR PAPERS *Analysis and Programming Languages for Web Applications and Cloud Applications * (APLWACA 2010) http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Toronto, Canada, Sunday June 6, 2010 Co-located with PLDI 2010 Submission due date: Friday March 26, 2010 Analysis and Programming Languages for Web Applications and Cloud Applications (APLWACA, pronounced "apple-whacka") is a new workshop that provides a forum for exploring and evaluating ideas on the use of program analysis and programming language techniques to improve web and cloud applications. Web applications are distributed systems that communicate using Web protocols, and contain client systems executing within commodity web browsers. Cloud applications are distributed systems that utilize cloud computing technologies. The focus of the workshop is primarily on reliability, security, and performance of web and cloud applications. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of important existing and emerging problems. The scope of APLWACA includes, but is not limited to: * Static analysis of web and cloud applications * Runtime analysis of web and cloud applications and enhanced web and cloud application runtimes * Program analysis techniques for discovering reliability issues, security vulnerabilities, or performance bottlenecks * Testing and model checking of web and cloud applications * Compiler- and language-based mechanisms for security and performance * New languages, techniques, and runtimes for programming web and cloud applications, including client-side programming * Characterizing web and cloud application workloads and benchmarks, especially as it comes to large distributed applications like Facebook or Hotmail More details can be found on the APLWACA website: http://research.microsoft.com/en-us/um/redmond/events/APLWACA2010 Important Dates Submission due date Friday, March 26, 2010 Author notification Friday, April 30, 2010 Revised papers due Friday, May 14, 2010 APLWACA 2010 workshop Sunday, June 6, 2010 Technical Program Committee Stephen Chong Harvard University (co-chair) Ranjit Jhala University of California San Diego Trevor Jim AT&T Labs Research Shriram Krishnamurthi Brown University Benjamin Livshits Microsoft Research (co-chair) Sergio Maffeis Imperial College London John C. Mitchell Stanford University Anders M?ller Aarhus University -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100323/982e9fa7/attachment-0001.htm From ueda at ueda.info.waseda.ac.jp Thu Mar 25 02:05:36 2010 From: ueda at ueda.info.waseda.ac.jp (Kazunori UEDA) Date: Thu, 25 Mar 2010 15:05:36 +0900 (JST) Subject: [TYPES/announce] APLAS 2010 Call For Papers Message-ID: <20100325.150536.41647511.ueda@ueda.info.waseda.ac.jp> CALL FOR PAPERS APLAS 2010 Eighth Asian Symposium on Programming Languages and Systems Shanghai, China November 28-December 1, 2010 http://basics.sjtu.edu.cn/conference/aplas2010/ BACKGROUND APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops held in Shanghai ('02), Daejeon ('01) and Singapore ('00). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, 4279, 4807, 5356, and 5904. The 2010 edition will be held at Shanghai Jiao Tong University, China. TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: * semantics, logics, foundational theory; * design of languages and foundational calculi; * type systems; * compilers, interpreters, abstract machines; * program derivation, analysis, transformation; * software security, safety, verification; * concurrency, constraints, domain-specific languages; * tools for programming, verification, implementation. APLAS 2010 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. SUBMISSION INFORMATION We solicit submissions in two categories: 1. REGULAR RESEARCH PAPERS, describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. 2. SYSTEM AND TOOL PRESENTATIONS, describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool presentations papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page at http://www.easychair.org/conferences/?conf=aplas2010. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. INVITED SPEAKERS Gerwin Klein National ICT Australia Dale Miller INRIA Saclay - Ile-de-France Mingsheng Ying Tsinghua University, China and University of Technology Sydney ZHOU Chaochen Chinese Academy of Sciences IMPORTANT DATES Abstract Deadline: Monday, June 7, 2010 Submission Deadline: Monday, June 14, 2010 (Samoa Time) Notification: August 16, 2010 Camera-Ready: September 3, 2010 Symposium: November 28-December 1, 2010 GENERAL CHAIR Yuxi Fu Shanghai Jiao Tong University, China PROGRAM CHAIR Kazunori Ueda Waseda University, Japan PROGRAM COMMITTEE Roberto Amadio Universite Paris Diderot, France Lennart Beringer Princeton University, USA Dino Distefano Queen Mary, University of London, UK Yuxi Fu Shanghai Jiao Tong University, China Joxan Jaffar National University of Singapore, Singapore Yukiyoshi Kameyama University of Tsukuba, Japan Gabriele Keller University of New South Wales, Australia Ralf Laemmel University of Koblenz-Landau, Germany Aditya V. Nori Microsoft Research India, India Sungwoo Park Pohang University of Science and Technology, Korea Sanjiva Prasad Indian Institute of Technology Delhi, India Christian Schulte Royal Institute of Technology, Sweden Eijiro Sumii Tohoku University, Japan Alwen Tiu Australian National University, Australia Yih-Kuen Tsay National Taiwan University, Taiwan Kazunori Ueda Waseda University, Japan Hongwei Xi Boston University, USA Jian Zhang Chinese Academy of Sciences, China LOCAL ARRANGEMENTS CHAIR Xiaoju Dong Shanghai Jiao Tong University, China POSTER SESSION CHAIR Guoqiang Li Shanghai Jiao Tong University, China From bove at chalmers.se Thu Mar 25 05:24:04 2010 From: bove at chalmers.se (Ana Bove) Date: Thu, 25 Mar 2010 10:24:04 +0100 Subject: [TYPES/announce] PAR'10 at FLOC'10: -- Final CFP In-Reply-To: <59733.145.99.144.107.1269473637.squirrel@webmail.cwi.nl> References: <59733.145.99.144.107.1269473637.squirrel@webmail.cwi.nl> Message-ID: <4BAB2BB4.2030804@chalmers.se> ** Submission deadline on Monday 29th of March ** If you need a few days extension please send an email to Ana Bove with the request. A title and the abstract will still be required by the 29th of March. ======================================================================== Final Call for Papers PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers. Theorem provers with inductive types provide a restricted programming language together with a formal meta-theory for reasoning about the language. When propositions are represented as types and proofs as programs, non-terminating proofs are disallowed for consistency and decidability of type checking. As a result, there is no trivial way to represent partial functions, and termination is syntactically ensured by imposing that the recursive calls must be made on structurally smaller arguments. Similar issues exist for productivity of functions on infinite objects where syntactic methods are used to ensure an infinite flow of data. The workshop aims to address these issues and various approaches for dealing with them. We invite submissions on all aspects of partiality and termination of general (co)recursive functions in a logical framework. The topics of this workshop include but are not limited to: * partial functions and functions over partial objects in theorem provers; * specialised type systems for general (co)recursion; * syntactical tests to guarantee termination of general recursive functions; * syntactical tests to guarantee productivity of functions on infinite objects; * methods to ensure termination of special classes of recursion definitions, eg nested recursion, simultaneous inductive-recursive data types and functions; * semantic approaches to termination and productivity, eg based on domain theory and topology; * categorical approaches to termination and productivity; * algebra of programming with partial functions and general (co)recursion. Description of software tools and case studies for dealing with the issues in the scope of the workshop are welcome. Submissions ----------- The articles will be evaluated by the Program Committee for publication in the proceedings of the workshop. In accordance with FLoC'10 requirements, PAR'10 proceedings will be published in an electronic collection available online and maintained by EasyChair. The USB memory sticks with accepted papers will be distributed during the workshop. The post-proceedings of PAR'10 will be published after the workshop as a special issue of EPTCS. Details on how and when to produce the post-workshop version of the articles will be communicated after the workshop to the authors of the accepted papers. The articles must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Submissions should preferably not exceed 16 pages (excluding bibliography). Submissions must be prepared in LaTeX using the EasyChair latex package (). The web-based system EasyChair will be used for submission (). Important dates --------------- * 29 March 2010: Submission deadline * 29 April 2010: Notification of acceptance * 18 May 2010: Final version of accepted papers (Notice the slight change compared to previous announcements) * 15 July 2010: the workshop Invited Speakers ---------------- * Conor McBride (University of Strathclyde) * Alexander Krauss (Technical University of Munich) Programme Committee ------------------- Andreas Abel (Ludwig Maximilians University Munich, D) Yves Bertot (INRIA Sophia-Antipolis, FR) Ana Bove (Chalmers University of Technology, SE) Ekaterina Komendantskaya (University of St Andrews, UK) Ralph Matthes (IRIT Toulouse, FR) Milad Niqui (CWI, NL) Anton Setzer (Swansea University, UK) Organisers ---------- Ana Bove Ekaterina Komendantskaya Milad Niqui ________________________________ From Alex.Simpson at ed.ac.uk Thu Mar 25 09:58:27 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Thu, 25 Mar 2010 13:58:27 +0000 Subject: [TYPES/announce] Proof Systems for Program Logics 2010: student grants available Message-ID: <20100325135827.k9l721076scsksg0@www.staffmail.ed.ac.uk> Further to the CFP for PSPL2010, we are pleased to announce that a number of grants for PhD students to attend this workshop are available. For further information, please email: pspl2010 at easychair.org stating "Student grants" in the subject header. ----- Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ A new workshop bringing together researchers working on any aspect of the design, study and application of proof systems for program logics. Invited speakers: Andre Platzer (Carnegie Mellon University) Viktor Vafeiadis (University of Cambridge) CALL FOR CONTRIBUTED TALKS The emphasis of the workshop is on reporting current and ongoing research. 30-minute contributed talks will be selected on the basis of two-page abstracts. Submission deadline for two-page abstracts: Monday 12th April 2010. Author notification : Monday 26th April 2010. For more details see: http://homepages.inf.ed.ac.uk/als/PSPL2010/ -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From kutsia at risc.uni-linz.ac.at Thu Mar 25 12:51:52 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Thu, 25 Mar 2010 17:51:52 +0100 Subject: [TYPES/announce] LOPSTR 2010: Deadline extension Message-ID: <4BAB94A8.6000402@risc.uni-linz.ac.at> ===================================================================== 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ===================================================================== EXTENDED DEADLINE Paper (or extended abstract) submission: March 31, 2010 From cesar.a.munoz at nasa.gov Thu Mar 25 13:07:12 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Thu, 25 Mar 2010 12:07:12 -0500 Subject: [TYPES/announce] IWS 2010: Extended Deadline In-Reply-To: Message-ID: *** IWS 2010: Submissions will be open until April 2, 2010 *** LAST CALL FOR PAPERS International Workshop on Strategies in Rewriting, Proving, and Programming IWS 2010 iws2010.inria.fr (A satellite workshop of FLoC 2010) July 9 2010, Edinburgh, UK Abstract submission: March 26, 2010 (extended until April 2, 2010) Notification date: April 16, 2010 Abstract final version: April 30, 2010 Workshop: July 9, 2010 Submission of full paper for the proceedings: September 5, 2010 Possible topics to address in this workshop include: * Foundations for the definition and semantic description of strategies: models of search spaces, logical or mathematical formalisms to define strategies and prove properties about them. * Properties of strategies and corresponding computations: logical or mathematical formalisms to prove properties about them. * Analysis and optimization techniques for strategies: analysis of the search space, evaluation and comparison of strategies. * Integration of strategic deductions and/or strategic computations: interrelations, combinations and applications of deduction and computation under different strategies, control issues and strategies in the integration of systems, strategies in decision procedures for SMT. * Strategy languages: essential constructs, meta-level features. Definition, design, implementation and application. Comparison of strategies in (existing) systems. * Concrete types of (reduction/evaluation) strategies in rewriting and programming, lambda calculi, normalization, narrowing, constraint solving, as well as their properties and characteristics (complexity, decidability, ...). * Applications and case studies in which strategies play a major role. Invited Speakers ------------- Dan Dougherty, Worcester Polytechnic Institute http://web.cs.wpi.edu/~dd/ Assia Mahboubi, INRIA Saclay http://www.lix.polytechnique.fr/~assia/index-eng.html Submissions ---------- The submission process is in two stages. 1) Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style http://www.easychair.org/easychair.zip through the EasyChair submission site: http://www.easychair.org/conferences/?conf=iws2010 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. 2) After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in the electronic journal: Electronic Proceedings in Theoretical Computer Science (http://eptcs.org). Beyond original ideas and recent results not published nor submitted elsewhere, we also invite authors to submit a 5-pages abstract describing relevant work that has been or will be published elsewhere, or work in progress. These submissions will be only considered for presentation at the workshop and inclusion in the preliminary proceedings but not in the final proceedings. Organizers --------- Helene Kirchner, INRIA Bordeaux - Sud-Ouest, France Cesar Munoz, NASA Langley Research Center, Hampton, USA Program Committee ----------------- Maria Paola Bonacina, Univ. degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitat Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, LORIA-INRIA Nancy, France Natarajan Shankar, SRI International, Menlo Park, CA, USA Eelco Visser, Delft Univ. of Technology, The Netherlands Christoph Weidenbach, MPI-INF, Saarbrucken, Germany Web: iws2010.inria.fr Email: iws2010 at inria.fr From lengrand at lix.polytechnique.fr Thu Mar 25 17:26:48 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Thu, 25 Mar 2010 22:26:48 +0100 Subject: [TYPES/announce] 1 PhD and 1 Post-Doc at CNRS - Ecole Polytechnique Message-ID: <4BABD518.1090302@lix.polytechnique.fr> The Laboratoire d'Informatique de l'Ecole Polytechnique, France, offers 1 doctoral and 1 postdoctoral positions within the PSI project dedicated to "Proof Search control in Interaction with domain-specific methods" The doctoral position is funded for 3 years while the post-doc position is funded for 1 year, both starting in September 2010 or soon after. We are particularly interested in applicants with a background in one or several of the following fields: -Proof Theory -Logic Programming, in particular with constraints -Automated or Interactive Theorem Proving -Proof search in Type Theory and First-order logic -Sat Modulo Theory For more details please see http://lix.polytechnique.fr/~lengrand/PSI For the application procedure, please contact Stephane Lengrand at lengrand at lix.polytechnique.fr, as soon as possible and BEFORE 1st MAY 2010. Indeed, the deadline for the formal application procedure will be a few weeks later. Stephane Lengrand CNRS - Ecole Polytechnique From adg at microsoft.com Fri Mar 26 01:40:27 2010 From: adg at microsoft.com (Andy Gordon (MSR)) Date: Fri, 26 Mar 2010 05:40:27 +0000 Subject: [TYPES/announce] RADICAL: workshop on data, types, languages at MSR Cambridge, May 10-11 Message-ID: <7FB3CBF7E3BB674BAFF6AC938A13226323E3A135@DB3EX14MBXC315.europe.corp.microsoft.com> Dear colleagues, We're putting together an informal workshop on data, types, and languages, at MSR Cambridge in May. RADICAL: Relations and Data Integrity Constraints and Languages http://research.microsoft.com/~adg/RADICAL2010/ As of mid-March, we are delighted and excited to have gathered a fairly full programme of 30 minute talks, and we have only a few slots left. We aim to have a late-afternoon session of lightning announcements of recent work, position statements, or provocations, so we hope to fit in everyone who wants to speak, on a relevant topic, either as a 30 minute or lightning talk. If you'd like to speak at or attend the workshop, please mail me as soon as possible, please, and no later than one week's time, April 1. Please include title and short abstract. Regards, Andy (on behalf of the other organisers David Langworthy, Microsoft SQL Server, and Philip Wadler, University of Edinburgh) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100326/2acf3a71/attachment.htm From Cedric.Lhoussaine at lifl.fr Fri Mar 26 08:25:15 2010 From: Cedric.Lhoussaine at lifl.fr (Cedric Lhoussaine) Date: Fri, 26 Mar 2010 13:25:15 +0100 Subject: [TYPES/announce] 3 years PhD position at CNRS in Computational Biology Message-ID: <1269606315.2182.28.camel@silencieuse> We are seeking candidates for a PhD position with backgrounds in programming language semantics and/or probabilistic model-checking to work on the design and analysis of new programming languages tailored for biological modeling and simulation. Please find here: http://www2.lifl.fr/BioComputing/developPhD2010/0.html the more detailed advertisement for this 3 years PhD position funded by the CNRS in the BioComputing group of the LIFL in Lille, France. The deadline for application is 30th April 2010 but a preliminary contact at bio-computing-apply at lists.gforge.inria.fr as soon as possible (and for application details) is strongly recommended. best regards, -- Cedric Lhoussaine LIFL, UMR 8022 CNRS, USTL Batiment M3, 59655 Villeneuve d'Ascq Cedex FRANCE Phone (Lifl) : +33 (0)3 28 77 85 70 , Fax: 03 28 77 85 37 Phone (IRI): +33 (0)3 62 53 17 09 Web: www.lifl.fr/~lhoussai From Bob.Coecke at comlab.ox.ac.uk Fri Mar 26 21:07:15 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Sat, 27 Mar 2010 01:07:15 +0000 (GMT) Subject: [TYPES/announce] QICS School: Foundational Structures in Quantum Comp & Inf, May 24-28, Oxford (followed by Quantum Physics and Logic workshop) Message-ID: Spring School that marks the end of an EU FP6 FET STREP on: Foundational Structures in Quantum Computation and Information May 24-28, 2010, Oxford University, UK http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html It consists on extended tutorials on the main research strands within QICS, namely: * Structures and methods for measurement-based quantum computation * Categorical semantics, logics, diagrammatic methods * Classical-quantum interaction and information flow * Quantum automata, machines, calculi Topics that will be covered include: * measurement-based quantum computing (MBQC); properties of graph states; MBQC and condensed matter physics; blind quantum computation; determinism in MBQC; measurement-based classical computation and non-locality; * monoidal categories, Frobenius algebras, and their graphical calculus; (co)algebra of complementary observables and multipartite quantum entanglement, and applications to MBQC; phase groups and non-locality; * classical simulation of quantum circuits; categorical topological quantum computation; graphical calculus for measurements and channels; generalized probabilistic theories; convex operational models and non-locality; * quantum cellular automata (QCA); QCAs and causality; higher types in quantum computing; quantum logics and quantum machines; colagebraic methods; Confirmed lecturers include (more to be announced closer to date): Samson Abramsky (Oxford), Pablo Arrighi (Grenoble), Howard Barnum (Perimeter), Jonathan Barrett (Bristol, TBC), Dan Browne (UCL - London), Bob Coecke (Oxford), Ross Duncan (Oxford), Joe Fitzsimons (Oxford), Akimasa Miyake (Perimeter), Prakash Panangaden (McGill), Simon Perdrix (Grenoble), Peter Selinger (Dalhousie), Maarten van den Nest (Max-Planck, TBC), Reinhard F. Werner (Hannover) If you are interested in attending the QICS School please write Ross Duncan . Please feel free to forward this message to your group or on relevant local mailing lists. --------- Satellite workshop: Quantum Physics and Logic, May 29-30. http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html Invited speakers: - John Baez (UCR & Singapore) - Louis Crane (Kansas State) - Benjamin Schumacher (Kenyon College) PC chairs: - Bob Coecke (Oxford) - Prakash Panangaden (McGill) - Peter Selinger (Dalhousie) From txa at Cs.Nott.AC.UK Sun Mar 28 17:37:37 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Mon, 29 Mar 2010 06:37:37 +0900 Subject: [TYPES/announce] DEPENDENTLY TYPED PROGRAMMING 2010 (CFP) Message-ID: <0AFC538B-B8C2-4C97-B67C-0C42842A0EAA@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- 2nd Call for Talks Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ NOTE: EARLIER DEADLINE FOR TALK TITLES (FRIDAY 16 APRIL) (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Dependently typed programming is here today: where will it go tomorrow? We invite contributed talks for the latest in a series of workshops on dependently typed programming which started in 1999. The workshop will have two invited talks --- from Ana Bove and Matthieu Sozeau --- and however many contributed talks you contribute. We expect there will be plenty of provocation, and plenty of time for discussion. If you want to volunteer a talk or a demo at the workshop, please send us a title and abstract before Friday 16 April 2010 at dtp10 at cs.nott.ac.uk. PLEASE LET US KNOW BEFORE 16 APRIL WHETHER YOU WANT TO GIVE A TALK (IF POSSIBLE WITH TITLE). Slots will be at least 30 minutes (unless you ask for less), and we hope to fit everyone in. Clearly, if we're overwhelmed, we'll be very pleased, and we'll have to think again. We've moved the deadline forward to get as much information as possible into the general FLoC programme, but we still want to give space to as many fresh ideas as possible. We'll correspondingly schedule plenty of time for structured discussion and continue to respond constructively to proposals for provocation which reach us by our original deadline of Friday 4 June. We plan to organize a special issue of Fundamenta Informaticae to contain refereed papers related to the topic of the workshop. In a nutshell, what: Dependently Typed Programming 2010 where: Edinburgh, Scotland when: 9&10 July, 2010 invited: Ana Bove, Matthieu Sozeau requested: titles and abstracts for contributed talks and demos slot time: 30 minutes deadlines: 16 April 2010 (for inclusion in FLoC programme), 4 June 2010 (for last minute inspiration) afterwards: refereed selected postproceedings in FI We look forward to an exciting two days exploring the very latest activity in this growing and challenging field. In fact, in type-theoretic style, we can hardly contain ourselves. All the best Thorsten and Conor -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100328/22372907/attachment.htm From laurent.vigneron at loria.fr Mon Mar 29 08:25:11 2010 From: laurent.vigneron at loria.fr (Laurent Vigneron) Date: Mon, 29 Mar 2010 14:25:11 +0200 Subject: [TYPES/announce] UNIF 2010: submission deadline extended Message-ID: <4BB09C27.50208@loria.fr> Dear colleagues, As requested by several authors, the submission deadline of the 24th International Workshop on Unification has been extended to 4 April. So, you have one more week for submitting a 5 pages abstract related to one of the following topics: * General E-unification and calculi * Narrowing * Matching algorithms * Special unification algorithms * Higher-order and nominal unification * Constraint solving * Disunification * Combination problems * Complexity analysis * Implementation techniques * Applications: type checking and reconstruction, automated theorem proving, programming language design, etc. For submission (and workshop information), http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html Best regards, Laurent Vigneron. UNIF 2010 PC member From francesco.zappa.nardelli at gmail.com Tue Mar 30 02:51:02 2010 From: francesco.zappa.nardelli at gmail.com (Francesco Zappa Nardelli) Date: Tue, 30 Mar 2010 08:51:02 +0200 Subject: [TYPES/announce] summer school on Coq In-Reply-To: <15d5f0d81003290644n1e244444rf1f56c408ea33e92@mail.gmail.com> References: <15d5f0d81003290644n1e244444rf1f56c408ea33e92@mail.gmail.com> Message-ID: <15d5f0d81003292351w594729c8naf41f841d7a34c19@mail.gmail.com> Dear all, I'd like to announce a CEA-EDF-INRIA summer school on: ? ?Modelling and verifying algorithms in Coq: an introduction 7- 11 juin 2010 - INRIA Paris, France. Objectives The Coq system provides a functional programming language and a reasoning framework based on higher order logic to perform proofs on the programs. The expressive power of the language is such that advanced notions of mathematics (such as the graph theory in the four color theorem) or programs of high complexity (such as a compiler for a significant kernel of the C Programming language) can be described formally. In this school, we address the basic programming techniques and approaches to prove properties of the programs. The covered notions involve structural recursive programming, list and integer handling, proof by induction, in the key definition of data-types, pattern matching constructs and case-based reasoning, and inductive properties. Audience This school is a 5 days course for students, researchers and engineers. Participants should be familiar with programming (in C, Java, or ML). Participants are invited to bring their own laptop to profit of the afternoon exercise sessions. Speakers Yves Bertot ? ? INRIA Pierre Cast?ran ?LABRI, Universit? de Bordeaux Pierre Letouzey Universit? de Paris VII et INRIA Assia Mahboubi ?INRIA Venue The school will be held in Paris, France at the new "Antenne Parisienne" of INRIA (23, avenue d'Italie, 75013 Paris). ?The school fees include lunches but no accommodation in provided. ?A list of hotels is available upon request. On the web http://www.inria.fr/actualites/colloques/cea-edf-inria/2010/model-algo/index.en.html http://www.inria.fr/actualites/colloques/cea-edf-inria/2010/model-algo/programme.en.html For information, please contact symposia at inria.fr. Best regards ?Francesco Zappa Nardelli From venneri at dsi.unifi.it Tue Mar 30 05:37:36 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Tue, 30 Mar 2010 11:37:36 +0200 Subject: [TYPES/announce] Extended Deadline: ITRS 2010 Message-ID: <4BB1C660.4030400@dsi.unifi.it> ========================================================================== ***Submission deadline extended to April 12, 2010*** **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems (A FLoC workshop affiliated with LICS 2010) July 9, 2010, Edinburgh, UK http://gdn.dsi.unifi.it/itrs/ ========================================================================== Call for papers: http://gdn.dsi.unifi.it/itrs/index.php/call-for-papers/ TOPICS Possible topics for submitted papers include, but are not limited to: * Formal properties of systems with intersection types. * Results for related systems, such as union types, refinement types, or singleton types. * Applications to lambda calculus and similar systems. * Applications to pi-calculus and similar systems. * Applications for programming languages. * Applications for other areas, such as database query languages and program extraction from proofs. * Related approaches using behavioural types to characterize computational properties. SUBMISSIONS The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format, using the Easychair submission site http://www.easychair.org/conferences/?conf=itrs2010. Accepted papers will be presented at the workshop and included in the preliminary proceedings, which will made available in electronic form. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in final post-proceedings. The post-proceedings will be published as a special issue of Electronic Proceedings in Theoretical Computer Science (EPTCS). Submissions must be prepared in LaTeX using the EPTCS macro package (http://style.eptcs.org/). IMPORTANT DATES Submission deadline (extended): April 12, 2010 Author notification: April 30, 2010 Final version for preliminary proceedings: May 26, 2010 Workshop: July 9, 2010 Submission for EPTC Post-Proceedings: September 30, 2010 (TBC) PROGRAM COMMITTEE Mariangiola Dezani-Ciancaglini (Univ.di Torino) Joshua Dunfield (McGill Univ. Montreal) Silvia Ghilezan (Univ. of Novi Sad) Atsushi Igarashi (Kyoto Univ.) Elaine Pimentel (Belo Horizonte Univ.) Betti Venneri (Univ. di Firenze) Chair Joe Wells (Heriot-Watt Univ.Edinburgh). ______________________________________________ From icfp.publicity at googlemail.com Tue Mar 30 08:34:10 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 30 Mar 2010 14:34:10 +0200 Subject: [TYPES/announce] ICFP 2010 deadline Message-ID: <53ff55481003300534g4c12aaafw4630ce1798c0e74f@mail.gmail.com> On behalf of Stephanie Weirich, this year's PC Chair, I would like to emphasize that the deadline for ICFP this year is at *14:00 UTC*. You may want to double check what time this is using the following link: http://www.timeanddate.com/worldclock/fixedtime.html?day=2&month=4&year=2010&hour=14&min=0&sec=0&p1=0 Submission is already open through: http://icfp2010.seas.upenn.edu/ All the best, Wouter From pmt6sbc at maths.leeds.ac.uk Wed Mar 31 04:48:02 2010 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Wed, 31 Mar 2010 09:48:02 +0100 (BST) Subject: [TYPES/announce] Funding opportunity - Foundational Questions Message-ID: ___________________________________________________________________________ Foundational Questions in the Mathematical Sciences There is a grant opportunity in: A) foundations of: mathematics, mathematical sciences, computer science; B) artificial intelligence; C) closely related fields. The John Templeton Foundation accepts research proposals that directly or indirectly address one of the following questions: (1) What are the limits of mathematics in advancing human knowledge? (2) What have the difficulties of AI taught us about the nature of mind and intelligence? Deadline for the initial inquiry is April 15, 2010. For more information, please visit http://www.amsta.leeds.ac.uk/~pmt6sbc/templeton.pdf or http://bit.ly/aMwinQ Please feel free to pass the information on to others who might be interested in the grant opportunity. ___________________________________________________________________________ From prakash at cs.mcgill.ca Wed Mar 31 08:29:45 2010 From: prakash at cs.mcgill.ca (Prakash Panangaden) Date: Wed, 31 Mar 2010 08:29:45 -0400 Subject: [TYPES/announce] Deadline Extension for DCM 2010, FLoC affiliated workshop Message-ID: <4BB34039.1010501@cs.mcgill.ca> ========================================================================= ** DCM 2010 - EXTENSION OF DEADLINE * DCM 2010 - EXTENSION OF DEADLINE ** ========================================================================= Final Call for Papers DCM 2010 6th International Workshop on Developments in Computational Models ** Causality, Computation, and Physics ** http://www.amsta.leeds.ac.uk/~pmt6sbc/DCM10/ Edinburgh, Scotland 9-10 July 2010 EXTENDED DEADLINE FOR SUBMISSIONS: FRIDAY 9th APRIL, 2010 A satellite event of FLoC - http://www.floc-conference.org/ ========================================================================= INVITED SPEAKERS: Cristian Calude (Auckland, New Zealand) Lucien Hardy (Perimeter Institute, Canada) Russ Harmer (Paris/Harvard) Gordon Plotkin (Edinburgh) Vlatko Vedral (Oxford) IMPORTANT DATES: Submission deadline for extended abstracts: 9th April, 2010 Notification: 26 April Workshop: 9-10 July, 2010 After the workshop, full versions of selected papers will be invited for a special issue of the internationally leading journal Mathematical Structures in Computer Science (MSCS). ========================================================================= DCM 2010 is the sixth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one. And to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2010 will be a two-day satellite event of FLoC 2010, with a special focus on the theme 'Causality, Computation, and Physics'. Day 2 of the Workshop will have an emphasis on quantum computation and physics, held as Quantum Information Science Scotland (QUISCO), and is co-sponsored by Scottish Universities Physics Alliance (SUPA) and Scottish Informatics and Computer Science Alliance (SICSA). Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. ========================================================================= PLEASE SUBMIT an extended abstract (of around 12 pages or less) in PDF format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2010 by the deadline: 9th April, 2010. Accepted contributions will appear in a pre-proceedings special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). ========================================================================= PROGRAMME COMMITTEE: S Barry Cooper (Leeds, Co-chair) Prakash Panangaden (McGill, Co-chair) Elham Kashefi (Edinburgh, Chair QUISCO 2010) Paola Bonizzoni (Milan) Olivier Bournez (Paris) Vincent Danos (Edinburgh, CNRS) Mariangiola Dezani (Torino) Andreas Doering (Oxford) Maribel FernC!ndez (London) Joseph Fitzsimons (Oxford) Ivette Fuentes-Schuller (Nottingham) Simon Gay (Glasgow) Jean Krivine (Paris) Ian Mackie (Ecole Polytechnique) Damian Markham (Paris) Daniel Oi (Strathclyde) Simon Perdrix (Edinburgh and Paris) Susan Stepney (York) John Tucker (Swansea) ========================================================================= Further information: Barry Cooper, pmt6sbc at leeds.ac.uk, Prakash Panangaden prakash at cs.mcgill.ca ========================================================================= From mwh at cs.umd.edu Wed Mar 31 16:53:26 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 31 Mar 2010 16:53:26 -0400 Subject: [TYPES/announce] Program Director positions (programming languages & formal methods) application deadline May 3, 2010 References: <121A92FE9A85CD458BF1825AAFB7B29C031CAA08@NSF-BE-03.ad.nsf.gov> Message-ID: <908873E4-6932-42A1-9901-9425F8E80713@cs.umd.edu> The US National Science Foundation funds much of the research in the US on programming languages and type systems. Per the e-mail below (which Dr. Greenspan agreed that I could forward), the NSF is looking to hire new program directors in this area. If US readers of this list are interested in serving the research community in this capacity, that would be great! Cheers, -Mike Begin forwarded message: > From: "Greenspan, Sol J." > Date: March 28, 2010 4:13:24 PM EDT > To: > Subject: Program Director positions (programming languages & formal methods) application deadline May 3, 2010 > > Dear Mike, > > I want to call your attention to a new job posting at http://jobview.usajobs.gov/GetJob.aspx?OPMControl=1832220 which seeks three program directors for the Software and Hardware Foundations program. As stated there: ?While the SHF program covers a number of topic areas, we are currently seeking 3 Program Directors, one with expertise in the area of Computer Architecture, one in Software Engineering with an emphasis on Formal Methods, and one with expertise in Programming Languages and Compilers.? > > Serving as a program director at NSF is an opportunity for a productive/successful researcher to expand horizons by serving the research community and influence future directions of the field. Program directors tend to meet a lot of people and learn about a wide variety of research activities and funding mechanisms. It?s a lot of fun, and the more you take on, the more fun it is. > > The application deadline is May 03, 2010. An application is simple to submit: just a CV with a cover letter stating your interest in a position. > > It is extremely important to find members of the community who want to serve and will do a good job. Please forward this email to friends and colleagues. > > > If anyone reading this message has questions, feel free to call me or send me an email. > > > Thanks. > > Sol > > Sol J. Greenspan, PhD > > Program Director > > Division of Computing and Communication Foundations > > Directorate for Computer and Information Science and Engineering (CISE) > > sgreensp at nsf.gov > > 703-292-7841 > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100331/9984a8e3/attachment-0001.htm From gmb at microsoft.com Thu Apr 1 09:26:45 2010 From: gmb at microsoft.com (Gavin Bierman) Date: Thu, 1 Apr 2010 13:26:45 +0000 Subject: [TYPES/announce] Multiparadigm Programming with OO Languages (MPOOL) Workshop - Call for papers Message-ID: We apologize if you receive this CfP multiple times ---------------------------------------------------- SECOND CALL FOR CONTRIBUTIONS AND PARTICIPATION Workshop on MULTIPARADIGM PROGRAMMING WITH OO LANGUAGES (MPOOL 2010) at the EUROPEAN CONFERENCE ON OBJECT-ORIENTED PROGRAMMING (ECOOP 2010) 21 or 22 July 2010, Maribor, Slovenia While OO has become ubiquitously employed for design, implementation, and even conceptualization, many practitioners recognize the concomitant need for other programming paradigms according to problem domain. We seek answers to the question of how to address the need for other programming paradigms--or even domain specific languages--in the general context of OO languages. Can OO programming languages effectively support other programming paradigms or the embedding of other languages? The answer seems to be affirmative, at least for some paradigms. For example, significant progress has been made for the case of functional programming in C++. Additionally, several efforts have been made to integrate support for other paradigms as a front-end for OO languages (the Pizza language, extending Java, is a prominent example). Libraries and extensions for concurrency are also being developed for new and upcoming multi-core and heterogeneous architectures. This workshop seeks to bring together practitioners and researchers in this developing field to `compare notes' on their work--describe existing, developing, or proposed techniques, idioms, methodologies, language extensions, or software for expressing non-OO paradigms in OO languages; or theoretical work supporting or defining the same. High-level presentations of position are welcome, and reports of work in progress, are welcome. Specific areas of interest include, but are not limited to: - non-OO programming with OO languages; - merging functional/logic/OO/other programs (language crossbinding); - non-OO programming at the meta level (e.g. template metaprogramming); - techniques for language embeddings (e.g. multistage programming); - language embedding in OO languages (domain specific languages - DSLs) - module systems vs. object systems; - OO design patterns and their relation to functional patterns; - multiparadigm and multilingual programming in the .NET framework; - type system relationships across languages; - theoretical foundations of multiparadigm programming with OO languages; - multiparadigm approaches to support emerging hardware architectures (e.g. multi/many-core CPUs, GPGPUs, IBM Cell, etc). The workshop will consist of short presentations with interspersed discussion sessions, and longer general discussions of themes or topics derived from some common element of subsets of presentations. We expect the majority of the participants to give presentations. Prospective participants may submit either presentation abstracts or full papers. All accepted materials will be distributed at the workshop, made available at the MPOOL 2010 Web site and will nbe published by the ACM Digital Library. Papers need to be formatted accordingly -- see http://www.acm.org/sigs/publications/proceedings-templates for details. For authors of accepted presentations who require justification for travel the organizers can provide official letters of invitation. SUBMISSION PROCEDURE Prospective authors are invited to submit abstracts or full papers in PDF, postscript, or Microsoft Word. Authors of accepted papers are responsible for submitting the final version using an appropriate ACM template to ensure inclusion in the proceedings. Submission and email correspondence to mpool10 at multiparadigm.net . AUTHORS' SCHEDULE May 4th, 2008: Abstracts due. May 19th, 2008: Notification of acceptance. ORGANIZATION This workshop is a joint organization by the University of Applied Sciences, Regensburg, Germany, and the Los Alamos National Laboratory, USA. ORGANIZERS / PROGRAMME COMMITTEE Gerald Baumgartner (Louisiana State University, Louisiana, USA) Gavin Bierman (Microsoft Research, UK) Kei Davis (Los Alamos National Laboratory, New Mexico, USA) Zoltan Horvath (University Eotvos Lorand of Sciences, Budapest, Hungary) Jaakko Jarvi (Texas A&M University, Texas, USA) Herbert Kuchen (University of Muenster, Germany) Philippe Narbel (University of Bordeaux I, France) Joerg Striegnitz (University Of Applied Sciences Regensburg, Germany) FURTHER INFORMATION More information is available at http://www.multiparadigm.net From tfpc at bachman.cs.ou.edu Fri Apr 2 13:32:34 2010 From: tfpc at bachman.cs.ou.edu (TFP 2010) Date: Fri, 2 Apr 2010 12:32:34 -0500 (CDT) Subject: [TYPES/announce] TFP 2010 - Final Call: Submission deadline one week away, April 9 Message-ID: TFP 2010: 11th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING May 17-19, 2010 University of Oklahoma http://www.cs.ou.edu/tfp2010/ (web search: "tfp 2010") TFP 2010 is an international forum for researchers with interests in any aspect of functional programming. Papers must be submitted by April 9, one week from today. Acceptance notifications will go out April 15. Early (reduced rate) registration closes April 16, two weeks from today. SUBMISSION and REGISTRATION DEADLINES April 9: Submission deadline April 15: Acceptance notification April 16: Early registration closes ($350, $200 for students) May 7: Late registration deadline ($425) May 17-19: TFP Symposium POST-SYMPOSIUM PROCEEDINGS Springer series: Lecture Notes in Computer Science Details about the event schedule, symposium scope, submissions, and registration may be found on the symposium website. http://www.cs.ou.edu/tfp2010/ (Web search: "tfp 2010") In addition to the symposium's stimulating presentations and discussions, highlights include an invited talk by J Strother Moore, an outing to view the superb collection of art of the American West at the Cowboy Hall of Fame, and a festive banquet. Submitted papers and extended abstracts are reviewed for presentation at the symposium, and a formal refereeing process after the symposium selects the best presentations for publication in the Springer series, Lecture Notes in Computer Science. We invite you to participate in TFP 2010. REGISTRATION IS OPEN! Register now at reduced rates, and reserve your accommodations. - Rex Page, University of Oklahoma, Program Chair - Viktia Zs and Zolt Horvath, Ev Lord University, Symposium Co-Chairs Sponsors: Erlang Solutions Ltd The University of Oklahoma, School of Computer Science From kutsia at risc.uni-linz.ac.at Fri Apr 2 14:30:24 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Fri, 2 Apr 2010 20:30:24 +0200 Subject: [TYPES/announce] LOPSTR'10: New deadline for extended abstract submission Message-ID: <20100402183024.GA23813@risc.uni-linz.ac.at> ========================================================================= 20th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2010 http://www.risc.uni-linz.ac.at/conferences/lopstr2010/ Hagenberg, Austria, July 23-25, 2010 (co-located with PPDP 2010) ========================================================================= New deadline for extended abstract submission: April 7, 2010 From vxc at Cs.Nott.AC.UK Sat Apr 3 04:03:38 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Sat, 03 Apr 2010 09:03:38 +0100 Subject: [TYPES/announce] MSFP: last call for papers Message-ID: <4BB6F65A.8080807@cs.nott.ac.uk> FINAL CALL FOR PAPERS Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. INVITED SPEAKERS Martin Escardo, University of Birmingham, UK Amy Felty, University of Ottawa, Canada SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia From miculan at dimi.uniud.it Sat Apr 3 04:55:29 2010 From: miculan at dimi.uniud.it (Marino Miculan) Date: Sat, 3 Apr 2010 10:55:29 +0200 Subject: [TYPES/announce] LFMTP 2010 at FLoC: extended deadline Message-ID: <7A396F34-DE8A-490D-919E-A81DB19743E9@dimi.uniud.it> [Apologies for multiple copies] 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10) July 14, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference Affiliated with Logic in Computer Science (LICS 2010) *** New submission deadline: April 7, 2010 *** More details at http://lfmtp10.dimi.uniud.it -- Marino Miculan - Dept Math Compu Sci, University of Udine miculan at dimi.uniud.it http://www.dimi.uniud.it/miculan/ From zambon at cs.utwente.nl Sat Apr 3 11:32:28 2010 From: zambon at cs.utwente.nl (Eduardo Zambon) Date: Sat, 03 Apr 2010 17:32:28 +0200 Subject: [TYPES/announce] Final Call for Papers: ICGT 2010 -- Abstract submission: 9 Apr '10 Message-ID: <4BB75F8C.9070007@cs.utwente.nl> [Our apologies for multiple receptions of this message.] -------------------------------------------------------------------------------- 5th International Conference on Graph Transformation (ICGT 2010) University of Twente, Enschede, The Netherlands 29 September - 1 October 2010 ---------------------------------------------- Final Call for Papers The 5th International Conference on Graph Transformation (ICGT 2010) will be held at the University of Twente in Enschede (The Netherlands) in the last week of September 2010. It continues the line of conferences previously held in Barcelona (Spain) in 2002, Rome (Italy) in 2004, Natal (Brazil) in 2006 and Leicester (UK) in 2008, as well as a series of six International Workshops on Graph Transformation with Applications in Computer Science between 1978 and 1998. The conference takes place under the auspices of EATCS, EASST, and IFIP WG 1.3. Awards will be given by EATCS and EASST for the best theoretical and application-oriented papers. Proceedings will be published by Springer in the Lecture Notes in Computer Science series (http://www.springer.com/lncs). ICGT 2010 will be colocated with the SPIN 2010 workshop on Software Model Checking, and will also host several satellite events. Invited Speakers ================ We are pleased to announce the following invited speakers: - Javier Esparza, University of Munich (joint keynote speaker with SPIN 2010) - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg Satellite events ================ The following workshops will take place as ICGT satellite events: - 3rd Workshop on Graph Computation Models (GCM 2010) - 6th International Workshop on Graph-Based Tools (GraBaTs 2010) - 4th Workshop on Petri Nets and Graph Transformations (PNGT 2010) - Workshop and Tutorial on Natural Computing (WTNC 2010) Scope ===== Graphs are among the simplest and most universal models for a variety of systems, not just in computer science, but throughout engineering and the life sciences. When systems evolve we are interested in the way they change, to predict, support, or react to their evolution. Graph transformation combines the idea of graphs as a universal modelling paradigm with a rule-based approach to specify evolution. The area is concerned with both the theory of graph transformation and their application to a variety of domains. The conference aims at bringing together researchers and practitioners interested in the foundations and application of graph transformation to a variety of areas. Topics of interest include, but are not limited to * Foundations and theory of o General models of graph transformation o High-level and adhesive replacement systems o Node-, edge-, and hyperedge replacement grammars o Parallel, concurrent, and distributed graph transformation o Term graph rewriting o Hierarchical graphs and decompositions of graphs o Graph theoretical properties of graph languages o Geometrical and topological aspects of graph transformation o Automata on graphs and parsing of graph languages o Analysis and verification of graph transformation systems o Structuring and modularization concepts for transformation systems o Graph transformation and Petri nets * Languages, tool support and applications in o Software architecture o Workflows and business processes o Software quality, testing and evolution o Access control and security models o Aspect-oriented development o Model-driven development, especially model transformations o Domain-specific languages o Implementation of programming languages o Bioinformatics and system biology o Natural computing o Image generation and pattern recognition techniques o Massively parallel computing o Self-adaptive systems and ubiquitous computing o Service-oriented applications and semantic web Paper submission is at http://www.easychair.org/conferences/?conf=icgt2010. Submitted papers may not exceed fifteen (15) pages using Springer's LNCS format (http://www.springer.com/lncs), and should contain original research. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. Selected papers will be invited for submission to special issues of Fundamenta Informaticae (for theoretically oriented papers) and Software and Systems Modeling (for application-oriented papers). Important Dates: ================ Abstract submission: 9 April 2010 Full paper submission: 16 April 2010 Notification of acceptance: 7 June 2010 Final version due: 28 June 2010 Main conference: 29 September - 1 October 2010 Satellite events: 28 September and 2 October 2010 Venue: ====== The University of Twente is located in a beautiful green area between the cities of Hengelo and Enschede, in the eastern part of The Netherlands. It has good connections to the airports of Schiphol (Amsterdam, The Netherlands) and M?nster (Germany). The main town, Enschede, lies directly on the Dutch/German border, and it is a characteristic, modern and lively university town. Elegant historic buildings in the town and surrounding area are evocative of Enschede's rich textile past. Some of the town's most notable monuments are the beautiful town hall, several beautiful churches and a unique synagogue. The University of Twente is an entrepreneurial research university. It was founded in 1961 and offers education and research in areas ranging from public policy studies and applied physics to biomedical technology. The UT is the Netherlands' only campus university. It counts in the order of 10,000 students. Programme Committee: ==================== - Paolo Baldan, University of Padova (Italy) - Luciano Baresi, University of Milano (Italy) - Michel Bauderon, University of Bordeaux (France) - Artur Boronat, University of Leicester (UK) - Paolo Bottoni, University of Rome La Sapienza (Italy) - Andrea Corradini, University of Pisa (Italy) - Juan de Lara, Autonomous University of Madrid (Spain) - Hartmut Ehrig, Technical University of Berlin (Germany) - Gregor Engels, University of Paderborn (Germany) - Claudia Ermel Technical University of Berlin (Germany) - Holger Giese, University of Potsdam (Germany) - Annegret Habel, University of Oldenburg (Germany) - Reiko Heckel, University of Leicester (UK) - Dirk Janssens, University of Antwerp (Belgium) - Garbor Karsai, Vanderbilt University (USA) - Ekkart Kindler, Technical University of Denmark (Denmark) - Barbara Koenig, University of Duisburg-Essen (Germany) - Hans-J?rg Kreowski, University of Bremen (Germany) - Ralf L?mmel, University of Koblenz (Germany) - Mark Minas, Universit?t der Bundeswehr M?nchen (Germany) - Ugo Montanari, University of Pisa (Italy) - Mohamed Mosbah, University of Bordeau (France) - Manfred Nagl, RWTH Aachen University (Germany) - Fernando Orejas, Technical University of Catalonia (Spain) - Francesco Parisi-Presicce, University of Rome La Sapienza (Italy) - Rinus Plasmeijer, Radboud University (The Netherlands) - Detlef Plump, University of York (UK) - Arend Rensink (PC co-chair), University of Twente (The Netherlands) - Leila Ribeiro, Federal University of Rio Grande do Sul (Brazil) - Andy Sch?rr (PC co-chair), Technische Universit?t Darmstadt (Germany) - Gabriele Taentzer, University of Marburg (Germany) - Pieter Van Gorp, Technical University of Eindhoven (The Netherlands) - D?niel Varr?, Budapest University of Technology and Economics (Hungary) - Gergely Varr?, Budapest University of Technology and Economics (Hungary) - Jens-Holger Weber-Jahnke, University of Victoria (USA) - Albert Z?ndorf, University of Kassel (Germany) Organisation ============ Program Chairs - Arend Rensink , University of Twente, The Netherlands - Andy Sch?rr , Technische Universit?t Darmstadt, Germany Local Organisation - Maarten de Mol , University of Twente, The Netherlands Publicity Chair: - Eduardo Zambon , University of Twente, The Netherlands Workshop Chair: - Amir Ghamarian , University of Twente, The Netherlands Further information can be found at: http://www.utwente.nl/icgt2010 -------------------------------------------------------------------------------- From michaelw at cs.utwente.nl Tue Apr 6 05:26:04 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Tue, 6 Apr 2010 11:26:04 +0200 Subject: [TYPES/announce] SPIN 2010 Last Call for Papers Message-ID: <4A478930-927C-4C8C-9078-0611E5598FB2@cs.utwente.nl> 17th International SPIN Workshop on Model Checking of Software September 27--29, 2010, University of Twente, The Netherlands URL: Co-located with: ICGT 2010 , PDMC+HiBi 2010, NEWS ==== Invited speakers are confirmed: * Javier Esparza, Technical University of Munich, Germany (joint keynote speaker with ICGT 2010) * Alessandro Cimatti, FBK-IRST, Italy * Darren Cofer, Rockwell Collins, USA Aim and Scope ============= The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. The focus of the workshop is on theoretical advances and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker or other tools, or techniques based on combinations of explicit and other symbolic representations. We welcome papers describing the development and application of state-space and path-exploration techniques for the testing and the verification of security-critical software, enterprise and web applications, embedded software, and other interesting software platforms. The workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of Interest include (but are not limited to): ==================================================== * Algorithms and storage methods for explicit-state model checking * Theoretical and algorithmic foundations of model-checking based analysis * Directed model checking using heuristics * Parallel or distributed model checking * Model checking of timed and probabilistic systems * Abstraction and symbolic execution techniques in relation to software verification * Static analysis for state space reduction * Combinations of enumerative and symbolic techniques * Analysis for modeling languages, such as UML/state charts * Property specification languages, including new forms of temporal logic * Model checking for various programming languages and code analysis * Automated testing using state space and/or path exploration techniques * Derivation of specifications, test cases, or other useful material from state spaces * Combination of model-checking techniques with other analysis techniques * Modularity and compositionality * Comparative studies, including comparisons with other model-checking techniques * Case studies of interesting systems or with interesting results * Engineering and implementation of model-checking tools and platforms * Benchmarks for software verification Solicited Contributions ======================= We solicit two kinds of papers: * TECHNICAL PAPERS. These papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format and should be no longer than 18 pages. * TOOL PAPERS. These papers should describe novel tools or tool extensions. If previous versions of the described tool have been published before, the novel features of the tool should be explained clearly. These papers should also specify availability of the tool, number of users, and applications/case studies. Tool paper submissions should consist of two parts. The first part is at most 5 pages in LNCS format. The name "Tool Presentation" should appear in the title. If accepted, this 5 page paper will be published in the workshop proceedings. The second part should describe an informal plan for the oral presentation of the tool. This part will not be included in the proceedings. If accepted, both regular and tool papers will be presented at the conference and will be included in the workshop proceedings. At least one author of each accepted paper is expected to be present at the conference. Submissions are held confidential until publication. Submission and Publication ========================== As in previous years, the proceedings of this edition of the workshop will appear in Lecture Notes in Computer Science. Important Dates =============== Abstract submission: April 9, 2010 Paper submission: April 16, 2010 Notification of acceptance: June 7, 2010 Final papers due: June 28, 2010 Workshop: September 27--29, 2010 ORGANIZATION ============ Program Chairs: Jaco van de Pol, U Twente, Netherlands Michael Weber, U Twente, Netherlands Program Committee: Dragan Bosnacki (TU Eindhoven, The Netherlands) Jiri Barnat (Masaryk University Brno, Czech Republic) Stefan Edelkamp (University of Bremen, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Ganesh Gopalakrishnan (University of Utah, USA) Jan Friso Groote (TU Eindhoven, The Netherlands) Orna Grumberg (Technion, Israel) Gerard Holzmann (NASA/JPL, USA) Radu Iosif (Verimag Grenoble, France) Stefan Leue (University of Konstanz, Germany) Rupak Majumdar (University of California at Berkeley, USA) Eric G. Mercer (Brigham Young University, USA) Albert Nymeyer (University of New South Wales, Australia) Dave Parker (Oxford Univerisity, UK) Corina Pasareanu (CMU/NASA Ames, USA) Doron Peled (Bar-Ilan University, Israel) Paul Pettersson (Malardalen University, Sweden) Scott Stoller (Stony Brook University, USA) Willem Visser (Stellenbosch University, South Africa) Tomohiro Yoneda (National Institute of Informatics, Japan) Steering Committee: Susanne Graf, VERIMAG, France Gerard Holzmann, JPL, USA Stefan Leue (chair), U Konstanz, Germany Pierre Wolper, U Liege, Belgium -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From bengt at chalmers.se Tue Apr 6 10:47:23 2010 From: bengt at chalmers.se (Bengt Nordstrom) Date: Tue, 6 Apr 2010 16:47:23 +0200 Subject: [TYPES/announce] Assistant professorship in Natural Language Technology in Gothenburg, Sweden Message-ID: The following position should be interesting for people in the Types community interested in type theory, language technology and functional programming. * ** * *Assistant Professor * Computer Science, Gothenburg University, Sweden *Deadline for application:* 2010-04-27 The Department of Computer Science and Engineering (CSE, http://www.chalmers.se/cse/EN/) at Chalmers University of Technology and University of Gothenburg announces a position of Assistant Professor with tenure track (Swedish "bitr?dande lektor") in the area of Natural Language Technology ( http://www.cse.chalmers.se/research/group/Language-technology/). The position is associated with the Centre of Language Technology (CLT, http://www.clt.gu.se/), which is a focus area of research of the University of Gothenburg, and affiliated at the CSE Department at the University of Gothenburg and Chalmers University of Technology. Extent of employment The position is for 4 years. Before the end of the 4-year period, the position holder will be evaluated for a tenure as Associate Professor ("lektor"). A suggested start date for the position is September 2010, but can be negotiated with the appointed candidate. Requirements The qualifications for the position include: - PhD in computer science, computational linguistics, or related subject, in 2005 or later - excellent research record in Natural Language Technology - documented experience in university-level teaching - good ability to use English as working language Job description The research in CLT is performed in three areas: grammar technology (including syntax, semantics, machine translation, authoring support, and logic), text technology (including information extraction, lexicology, and corpus studies), and dialogue technology (including speech-based interaction and speech technology). The full CLT has ca 30 members, divided between the departments of CSE, Swedish Language, and Linguistics and Philosophy. The language technology research group at CSE has ca. 10 members. Its focus is on grammar-based methods for machine translation, multilingual resources, localization, and human-computer interaction. The group traditionally works in close connection to type theory, functional programming, and compiler construction. But we are also interested in applicants with strong profiles in statistical methods or speech technology. In addition to a strong publication record, we appreciate the ability to create software. The announced position involves, in the first 4 years, 75% research time in the CSE language technology group and the CLT, plus 25% teaching in computer science on BSc and/or MSc level. In the tenured phase, research and teaching time is dependent on available funding. We follow an equal opportunities policy and will in particular encourage female applicants. Further information of the position can be obtained from Professor Aarne Ranta, email: aarne dot chalmers dot se Application procedure The application shall be written in English and include the following items: 1. A first page containing name, reference number E333 5550/09 and a list of all documents that have been enclosed. 2. Description of the applicant's research and pedagogical qualifications, as well as other qualifications. 3. Curriculum Vitae (CV). 4. Complete list of publications. 5. Plans for future work within the area of the announced position, both scientific and educational, if appointed. 6. Two reference persons who can be contacted by the University of Gothenburg (describe association with them and give their contact addresses). 7. Copies of the applicant's best scientific publications (not more than 5). 8. Documents about software created by the applicant. 9. Copies of a maximum of 5 other publications (such as pedagogy, and popular science) in support of pedagogical and other merits. The applications should be marked with ref no E333 5550/09. Application together with all additional documents must arrive not later than 27 April 2010 and should be addressed to University of Gothenburg, Registrator, Box 100, SE-405 30 G?teborg, Sweden Trade Union Representatives OFR-S Astrid Igerud, +46-31-786 1167, SACO Martin Selander +46-31-786 1987, SEKO Lennart Olsson +46-31786 1173 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100406/97701c71/attachment.htm From cbraga at ic.uff.br Tue Apr 6 16:24:48 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Tue, 6 Apr 2010 17:24:48 -0300 Subject: [TYPES/announce] SBLP 2010 Message-ID: <3D41E400-69C2-4E17-BD39-0182865F3A2C@ic.uff.br> [We apologize in advance if you receive multiple copies of this CFP] ============================================================= CALL FOR PAPERS 14th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Salvador, Bahia, Brazil September 27-29, 2010 http://wiki.dcc.ufba.br/CBSOFT/SBLP2010 Abstract Submission: May 17, 2010 Paper Submission: May 24, 2010 ============================================================= The 14th Brazilian Symposium on Programming Languages, SBLP 2010, will be held in Salvador, Bahia, Brazil, on September 27-29, 2010. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. This year the symposium will be part of the 1st Brazilian Conference on Software: Theory and Practice, CBSoft 2010, http://wiki.dcc.ufba.br/CBSOFT, which will host three traditional, well-established symposia: * IV Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) * XIV Brazilian Symposium on Programming Languages (SBLP) * XXIV Brazilian Symposium on Software Engineering (SBES) SBLP 2010 invites authors to contribute with Technical Papers and Tutorial Proposals related (but not limited) to: * Programming language design and implementation * Formal semantics of programming languages * Theoretical foundations of programming languages * Design and implementation of programming language environments * Object-oriented programming languages * Functional programming * Aspect-oriented programming languages * Scripting languages * Domain-specific languages * Programming languages for mobile, web and network computing * New programming models * Program transformations * Program analysis and verification * Compilation and interpretation techniques Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Selected papers written in English should be invited for a journal publication. * Best papers will be published as a special issue of the * * Elsevier Journal of Science of Computing Programming * Papers should be presented in the language of submission. Detailed submission guidelines will be available at http://wiki.dcc.ufba.br/CBSOFT/PaperSubmission IMPORTANT DATES Paper abstract submission (15 lines): May 17, 2010 Full paper submission: May 24, 2010 Notification of acceptance: July 09, 2010 Final papers due: August 02, 2010 BEST PAPER AWARD Awards will be given for the best papers at the symposium. GENERAL CHAIR Rita Suzana Pitangueira Maciel, UFBA, Brazil PROGRAMME CHAIR Ricardo Massa F. Lima, UFPE, Brazil Jonathan Aldrich, Carnegie Mellon University, USA PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alfio Martini, PUC-RS Alvaro Freitas Moreira, UFRGS Andre Rauber Du Bois, UFPEL Andr? Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Cristiano Damiani, UFPEL Edward Hermann Haeusler, PUC-Rio Fernando Castor Filho, UFPE Francisco Heron de Carvalho Junior, UFC Isabel Cafezeiro, UFF Jo?o Saraiva, Universidade do Minho Johan Jeuring, Utrecht Univ. Jose Guimaraes, UFSCAR Jose E. Labra Gayo, Univ. of Oviedo Jose Luiz Fiadeiro, Univ. of Leicester Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Luis Carlos Meneses, UPE Marcelo A. Maia, UFU Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Paulo Borba, UFPE Peter Mosses, Swansea University Renato Cerqueira, PUC-Rio Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Rodolfo Jardim de Azevedo, UNICAMP Sandro Rigo, UNICAMP Sergio Soares, UFPE Sergiu Dascalu, Univ. of Nevada Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Vladimir Di Iorio, UFV Vitor Santos Costa, UFRJ ORGANIZATION Brazilian Computer Society and Universidade Federal da Bahia From ronchi at di.unito.it Wed Apr 7 05:52:59 2010 From: ronchi at di.unito.it (Ronchi Della Rocca Simona) Date: Wed, 7 Apr 2010 11:52:59 +0200 Subject: [TYPES/announce] Workshop on Logic and Computational Complexity (LCC '10) Message-ID: = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = ======================================================================== call for papers 11th International Workshop on Logic and Computational Complexity LCC '10 http://web.comlab.ox.ac.uk/people/stephan.kreutzer/lcc10/index.html Edinburgh , July 10, 2010 affiliated to LICS 201 ATTENTION : DEADLINE CHANGED!!!!! = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = ======================================================================== The Eleventh International Workshop on Logic and Computational Complexity (LCC'10) will be held in Edinburgh on 10th July 2010, as an affiliated meeting of Logic in Computer Science (LiCS) 2010 as part of the 2010 Federated Logic Conference (FLoC). LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The LCC'10 program consists of invited lectures as well as contributed papers selected by the program committee. Invited Speakers There will be two invited 1-hour lectures. Ugo Dal Lago, Bologna Albert Atserias, Barcelona Submissions Submissions must be in English and in the form of abstracts of about 3-4 pages. Submissions published elsewhere or which are simultaneously being submitted to another conference or workshop are welcome, as well as work in progress or not yet completely developed ideas. There will be no proceedings for this edition of LCC. LCC 10 uses the EasyChair system for managing the submission process. Submissions must be made electronically using the easychair system at http://www.easychair.org/conferences/?conf=lcc10 . Important dates Submission deadline: Revised earlier deadline: 18 April 2010, 1am CET (GMT +1). The submission server will remain open till approximately 7am CET. Author notification: Beginning of May 2010 Program Committee Andrei Bulatov (Vancouver) Phokion Kolaitis (Santa Cruz) Jan Krajicek (Prague) Stephan Kreutzer (Oxford, co-chair) Olivier Laurent (Lyon) Jean Yves Moyen (Paris 13) Damian Niwinski (Warsaw) Simona Ronchi Della Rocca (Torino, co-chair) Steering Committee Michael Benedikt (Oxford) (Co-chair) Robert Constable (Cornell) Anuj Dawar (Cambridge) Fernando Ferreira (Lisbon) Martin Hofmann (U Munich) Neil Immerman (U Mass. Amherst) Neil Jones (Copenhagen) Bruce Kapron (U Victoria) Daniel Leivant (Indiana U) (Co-chair) Jean-Yves Marion (LORIA Nancy) Luke Ong (Oxford) Martin Otto (Darmstadt) James Royer (Syracuse) Helmut Schwichtenberg (U Munich) Pawel Urzyczyn (Warsaw) _____________________ Simona Ronchi Della Rocca full professor of "Foundations of Computer Science" Dipartimento di Informatica Universit? di Torino c. Svizzera 185, 10149 Torino e-mail: ronchi at di.unito.it phone:+39-011-6706734 fax: +39-011-751603 mobile: +39-320-4205121 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100407/3e7c085a/attachment-0001.htm From sunj at comp.nus.edu.sg Wed Apr 7 07:40:28 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Wed, 7 Apr 2010 19:40:28 +0800 Subject: [TYPES/announce] Deadline Extended: 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010) Message-ID: Final CALL FOR PAPERS ===================== 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010) 21 - 24 September 2010, SINGAPORE http://atva10.comp.nus.edu.sg/ Final DEADLINE extended to: Abstract Due : 8 April 2010 (23:59 Apia-time) Full Paper Due : 15 April 2010 (23:59 Apia-time) The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis in East Asia by providing a forum for interaction between the regional and the international research communities and industry in the field. The previous six events were held in Taiwan (2003-5), Beijing (2006), Tokyo (2007), Seoul (2008) and Macao (2009). The proceedings of ATVA 2010 will be published by Springer as a volume in the LNCS series. SCOPE ----- The scope of interest is intentionally kept broad; it includes: Theories useful for providing designers with automated support for obtaining correct software or hardware systems, including both functional and non functional aspects, such as: theory of (timed and hybrid) automata, process calculi, Petri-nets, concurrency theory, compositionality, model-checking, automated theorem proving, synthesis, performance analysis, correctness-by-construction, infinite state systems, abstract interpretation, decidability results, parametric analysis or synthesis. Applications of theory in engineering methods and other particular domains and handling of practical problems occurring in tools, such as analysis and verification tools, synthesis tools, model transformation tools. Techniques of reducing complexity of verification by abstraction, improved representations. Methods and tools in handling user level notations, such as UML. Practice in industrial applications to hardware, software or real-time and embedded systems. Case studies, illustrating the usefulness of tools or a particular approach are also welcome. Theory papers should be motivated by practical problems and applications should be rooted in sound theory. We are interested both in algorithms and in methods and tools for integrating formal approaches into industrial practice. SUBMISSION ---------- Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. ATVA 2010 calls for two types of contributions: RESEARCH PAPERS and TOOL DEMONSTRATION PAPERS. Both types of contributions will appear in the proceedings and have oral presentations at the conference. Papers should be written in English in LNCS format. Research papers: Research papers should contain original research, and sufficient detail to assess the merits and relevance of the contribution. Submissions reporting on industrial case studies are welcome, and should describe both strengths and weaknesses in sufficient depth. Research papers should be no more than 15 pages. Tool demonstration papers: Tool demonstration papers present tools based on aforementioned theories or fall into the above application areas. Tool demonstration papers allow researchers to stress the technical and practical side, illustrating how one can apply the theoretic contributions in practice. Tool demonstration papers should be no more than 6 pages. Further information and instruction about submission can be found at the conference website http://atva10.comp.nus.edu.sg. -- yours, Sun Jun -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100407/ffcb42cc/attachment.htm From lengrand at lix.polytechnique.fr Wed Apr 7 23:37:17 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Thu, 08 Apr 2010 05:37:17 +0200 Subject: [TYPES/announce] CfP: Proof-Search in Type Theories (PSTT'10) Message-ID: <4BBD4F6D.3080500@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Title + short abstract submission: April 10 Paper / long abstract submission: April 15 Notification: April 30 Final papers due: May 15 Workshop: July 15 DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) James McKinna (Radboud University, Nijmegen) Gopalan Nadathur (University of Minnesota) From cconway at cs.nyu.edu Thu Apr 8 16:19:15 2010 From: cconway at cs.nyu.edu (Christopher L Conway) Date: Thu, 8 Apr 2010 16:19:15 -0400 Subject: [TYPES/announce] Amir Pnueli Memorial Symposium, NYU, May 7-9, 2010 Message-ID: ======================================================================= Amir Pnueli Memorial Symposium New York University New York, New York, USA May 7-9, 2010 ======================================================================= Amir Pnueli was one of the most influential computer scientists of our time. He published more than 250 papers, many of them groundbreaking, including the 1977 paper, "The Temporal Logic of Programs," for which he won the 1996 ACM Turing Award. On November 2, 2009, Amir unexpectedly passed away. His loss is felt deeply by friends and colleagues around the world. The Amir Pnueli Memorial Symposium is an opportunity for the computer science community to remember Amir by revisiting the ideas and challenges which inspired and defined his life's work. It will feature talks by a select group of internationally acclaimed researchers, including colleagues and former students of Amir. The symposium will take place at New York University on May 7-9, 2010. It is open to all who wish to attend. For more information and to register, please visit http://www.cs.nyu.edu/acsys/pnueli. ================== Schedule ================== May 7 4:00 PM Remembering Amir Pnueli, with tributes from his family, friends, colleagues, and students. 6:00 PM Receptionm, 13th floor of Courant building. May 8 08:15 AM Welcome 08:30 AM Moshe Vardi, From L?wenheim to Pnueli, from Pnueli to PSL and SVA 09:00 AM Krzysztof Apt, Juggling using Temporal Logic 09:30 AM Willem-Paul De Roever, What is in a Step: New Perspectives on a Classical Question 10:00 AM Break 10:30 AM Egon B?rger, Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy, Realizability of System Interface Specifications 11:30 AM Ofer Strichman, Proving Equivalence between Similar Programs: A Progress Report 12:00 PM Jayadev Misra, An Operational/Denotational Semantics of Orc 12:30 PM Lunch 02:00 PM Robert Kurshan, Verification-Guided Hierarchical Design 02:30 PM Werner Damm, Towards Component Based Design of Hybrid Systems 03:00 PM Ken McMillan, TBA 03:30 PM Break 04:00 PM E. Allen Emerson, Time for Time 04:30 PM Leslie Lamport, Temporal Logic: The Lesser of Three Evils 05:00 PM Stephan Merz, A Mechanized Proof System for TLA+ Specifications 05:30 PM Giora Slutzki, Inverting Proof Systems for Secrecy under OWA May 9 08:30 AM David Harel, Can we Verify an Elephant? 09:00 AM Tom Henzinger, Quantitative Modeling and Verification 09:30 AM Patrick Cousot, A Scalable Segmented Decision Tree Abstract Domain 10:00 AM Break 10:30 AM Oded Maler, Properties and Verification in the Continuous Domain 11:00 AM Roni Rosner, New Challenges for the Verification Community 11:30 AM Javier Esparza, Newtonian Program Analysis: Solving Sharir and Pnueli's Equations. 12:00 PM Nir Piterman, p-Automata: New Foundations for Discrete-Time Probabilistic Verification 12:30 PM Lunch 02:00 PM Catuscia Palamidessi, Information-Theoretic Approaches to Information Flow and Model Checking Techniques to Measure It 02:30 PM Rajeev Alur, List Processing Programs as Regular Word Transducers 03:00 PM Doron Peled, TBA 03:30 PM Break 04:00 PM Muli Safra, TBA 04:30 PM Krishna Palem, TBA 05:00 PM Lenore Zuck, TBA From eernst at cs.au.dk Sat Apr 10 18:31:26 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Sun, 11 Apr 2010 00:31:26 +0200 Subject: [TYPES/announce] CFP - MASPEGHI 2010 (1 Week) Message-ID: [Apologies if you receive multiple copies of this] ** NB: Deadline in approximately ONE WEEK ** Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 19, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From kutsia at risc.uni-linz.ac.at Tue Apr 13 06:39:10 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 13 Apr 2010 12:39:10 +0200 Subject: [TYPES/announce] WWV'10: Deadline extension Message-ID: <4BC449CE.8070406@risc.uni-linz.ac.at> [Apologies if you receive multiple copies] *********************************************************** * CALL FOR PAPERS * * * * WWV 2010 * * Automated Specification and Verification of Web Systems * * 6th International Workshop * * * * Vienna University of Technology, Austria * * July 30-31, 2010 * * http://www.complang.tuwien.ac.at/WWV2010/ * *********************************************************** *************** EXTENDED DEADLINES *************** Abstract Submission April 26, 2010 Full Paper Submission May 3, 2010 From tom.hirschowitz at univ-savoie.fr Tue Apr 13 08:40:54 2010 From: tom.hirschowitz at univ-savoie.fr (Tom Hirschowitz) Date: Tue, 13 Apr 2010 14:40:54 +0200 Subject: [TYPES/announce] 2nd CFP Types postproceedings Message-ID: <4CD591F7-9313-4973-85ED-5B3BE4A64FF2@univ-savoie.fr> Post-Proceedings of TYPES 2009 The Post-Proceedings of the TYPES 2009 Annual Workshop http://lama.univ-savoie.fr/types09/ will be published, after a formal referee process, as a volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) series http://eptcs.org/ . Submissions are not restricted to works presented at the workshop, nor are authors expected to be formally involved in the Types project. Deadlines - abstract submission: Wednesday, May 19th, 2010, 12:00 Paris time, - paper submission: Wednesday, May 26th, 2010, 12:00 Paris time. We encourage submissions on the themes of the Types Project http://www.cs.chalmers.se/Cs/Research/Logic/Types/ . The aim of Types is to develop the technology of formal reasoning and computer programming based on Type Theory. This is done by improving the languages and computerised tools for reasoning, and by applying the technology in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. We invite submission of high quality papers, written in English and typeset in LaTeX2e using the EPTCS style: http://style.eptcs.org/ . Submissions should not have been published and should not be under consideration for publication elsewhere. We encourage authors to keep their submissions below 30 pages. Authors should submit their papers electronically to Tom Hirschowitz. The guest editors, Thorsten Altenkirch, Tom Hirshowitz, Christophe Raffalli, and Alan Schmitt. From Alex.Simpson at ed.ac.uk Tue Apr 13 09:29:08 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 13 Apr 2010 14:29:08 +0100 Subject: [TYPES/announce] 2nd Scottish Category Theory Seminar Message-ID: <20100413142908.r8zljoa42sg040kk@www.staffmail.ed.ac.uk> Talks on topics related to types would be very welcome at the seminar announced below. --- ******************************************************************** *** Scottish Category Theory Seminar *** Second Meeting *** Friday 21st May 2010, 2-5.30pm *** University of Edinburgh, Scotland *** http://personal.cis.strath.ac.uk/~ng/sct.html ******************************************************************** We are pleased to announce the second meeting of the Scottish Category Theory Seminar, which is a forum for discussion of all aspects of category theory, be they straight category theory or applications to computer science or physics etc. We request offers for contributed talks at this meeting. Meetings are open, and all are welcome to attend. The second meeting will take place on Friday 21st May at the Informatics Forum, University of Edinburgh from 2-5.30pm. Refreshments will be available from 1pm. As at the first meeting, there will be two 1-hour invited talks. We also invite offers for two contributed half-hour talks. We intend the meeting to be attractive to mathematicians, computer scientists and physicists working in topics related to category theory. Accordingly, offers of talks that would interest a broad audience are particularly encouraged. Straight category theory talks, and talks on applications of category theory are also welcome. Please send offers of talks, preferably accompanied by a title and short abstract, to scotcats at cis.strath.ac.uk, by Friday 23rd April. We aim to have the final programme decided by Friday 30th April. This meeting will receive financial support from the Edinburgh Mathematical Society. More details can be found at http://personal.cis.strath.ac.uk/~ng/sct.html If you would like more information about the Scottish Category Theory Seminar, please email scotcats at cis.strath.ac.uk Scottish Category Theory Seminar organisers: Neil Ghani Tom Leinster Alex Simpson -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From ross.duncan at comlab.ox.ac.uk Tue Apr 13 10:22:07 2010 From: ross.duncan at comlab.ox.ac.uk (Ross Duncan) Date: Tue, 13 Apr 2010 15:22:07 +0100 Subject: [TYPES/announce] Call for participation: QICS School, May 24-28, Oxford Message-ID: Apologies for multiple copies: ========================================== CALL FOR PARTICIPATION - QICS Spring School Foundational Structures in Quantum Computation and Information May 24-28, Oxford - http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html =========================================== If you wish to attend the QICS school PLEASE REGISTER. Places are limited! The QICS Spring School consists of extended tutorials on: * Structures and methods for measurement-based quantum computation * Categorical semantics, logics, diagrammatic methods * Classical-quantum interaction and information flow * Quantum automata, machines, calculi Topics that will be covered include: * measurement-based quantum computing (MBQC); properties of graph states; MBQC and condensed matter physics; blind quantum computation; determinism in MBQC; measurement-based classical computation and non- locality; * monoidal categories, Frobenius algebras, and their graphical calculus; (co)algebra of complementary observables and multipartite quantum entanglement, and applications to MBQC; phase groups and non- locality; * classical simulation of quantum circuits; categorical topological quantum computation; graphical calculus for measurements and channels; generalized probabilistic theories; convex operational models and non- locality; * quantum cellular automata (QCA); QCAs and causality; higher types in quantum computing; quantum logics and quantum machines; colagebraic methods; Confirmed lecturers: Samson Abramsky (Oxford), Pablo Arrighi (Grenoble), Howard Barnum (Perimeter), Jonathan Barrett (Bristol, TBC), Dan Browne (UCL - London), Bob Coecke (Oxford), Ross Duncan (Oxford), Bill Edwards (Oxford), Joe Fitzsimons (Oxford), Ottfried G?hne (Innsbruck), Chris Heunen (Oxford), Peter Hines (York), Richard Jozsa (Cambridge), Aleks Kissinger (Oxford), Akimasa Miyake (Perimeter), Prakash Panangaden (McGill), Simon Perdrix (Grenoble), Sandu Popescu (Bristol), Mehrnoosh Sadrzadeh (Oxford), Peter Selinger (Dalhousie), Maarten van den Nest (Max-Planck), Jamie Vicary (Oxford), Reinhard F. Werner (Hannover), Andreas Winter (Bristol). A full schedule is available on the school webpage: http://web.comlab.ox.ac.uk/people/Bob.Coecke/QICS_School.html The QICS Spring immediately precedes the Quantum Physics and Logic workshop, happening at the same location. --->http://web.comlab.ox.ac.uk/people/Bob.Coecke/QPL_10.html FEES and SUPPORT: For students there will be no registration fees; for others we ask that you bring ?35 in cash toward the costs of food and drink at the school. We will provide free youth hostel accommodation for a limited number of students. Please email ross.duncan at comlab.ox.ac.uk as soon as possible if you would like to take advantage of this. Places will be allocated on a first come first served basis. TO REGISTER: Email ross.duncan at comlab.ox.ac.uk. Please indicate whether or not you are a student, and whether you will also attend the QPL workshop. Best wishes, Ross Duncan Local Organiser QICS Spring School Oxford University Computing Laboratory From rwh at cs.cmu.edu Tue Apr 13 15:00:20 2010 From: rwh at cs.cmu.edu (Robert Harper) Date: Tue, 13 Apr 2010 15:00:20 -0400 Subject: [TYPES/announce] Oregon Programming Languages Summer School : Expanded Enrollment and Extended Deadline Message-ID: Due to very high demand, we are expanding the enrollment for this year's summer school, and will consider applications up to April 30, 2010. The annual University of Oregon Programming Languages Summer School will be held June 15-25, 2010 in Eugene, Oregon. This year's theme is Logic, Languages, Compilation, and Verification, and features an impressive roster of speakers, including Robert Constable (Cornell), Anupam Datta (Carnegie Mellon), Robert Harper (Carnegie Mellon), Xavier Leroy (INRIA), Conor McBride (Strathclyde), Greg Morrisett (Harvard), Frank Pfenning (Carnegie Mellon), Benjamin Pierce (Penn), and Andrew Tolmach (Portland State). Please see http://www.cs.uoregon.edu/Activities/summerschool/summer10/ for complete information about this year's summer school. We look forward to a great program! Zena Ariola Pierre-Louis Curien Robert Harper Hugo Herbelin -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 3910 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100413/f716b7bd/smime.p7s From nick at microsoft.com Wed Apr 14 13:17:27 2010 From: nick at microsoft.com (Nick Benton) Date: Wed, 14 Apr 2010 17:17:27 +0000 Subject: [TYPES/announce] LOLA 2010 -- final call for contributed talks Message-ID: <829B73AE2485A845AD2F3EEA8C98E2381416F267@TK5EX14MBXC138.redmond.corp.microsoft.com> ============================================================ *** FINAL CALL FOR CONTRIBUTED TALKS *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ **NEW** Invited speakers: G?rard Berry, Alex Simpson **NEW** Invited tutorial: Dan Ghica **NOTE** Submission deadline is earlier than in first call ============================================================ IMPORTANT DATES Submission deadline Monday 19th April 2010 ** REVISED (EARLIER) ** Author notification Saturday 1st May 2010 Workshop Friday 9th July 2010 SUBMISSION LINK The submissions will be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. >From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: - Typed assembly languages - Certified compilation - Proof-carrying code - Program optimization - Modal logic and realizability in machine code - Realizability and double orthogonality in assembly code, - Implicit complexity, sublinear programming and Turing machines - Parametricity, modules and existential types - General references, Kripke models and recursive types - Closures and explicit substitutions - Linear logic and separation logic - Game semantics, abstract machines and hardware synthesis - Monoidal and premonoidal categories, traces and effects INVITED SPEAKERS - G?rard Berry (INRIA Sophia) "What could be the right balance between abstract and fine-grain computational properties?" - Alex Simpson (LFCS, Edinburgh University) TBA INVITED TUTORIALS (preliminary) - Dan Ghica (University of Birmingham) Game Semantics and Hardware Synthesis PROGRAMME COMMITTEE * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) SUBMISSION INSTRUCTIONS LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. The submissions should be made by easychair at http://www.easychair.org/conferences/?conf=lola2010 From lengrand at lix.polytechnique.fr Wed Apr 14 14:00:00 2010 From: lengrand at lix.polytechnique.fr (Stephane Lengrand (Work)) Date: Wed, 14 Apr 2010 20:00:00 +0200 Subject: [TYPES/announce] Deadline Extension!! Proof-Search in Type Theories (PSTT'10) Message-ID: <4BC602A0.8060108@lix.polytechnique.fr> Call for Papers PSTT 2010: International Workshop on Proof Search in Type Theories Edinburgh, Scotland July 15, 2010 http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/ Affiliated with FLOC, Edinburgh, Scotland IMPORTANT DATES Paper / long abstract submission: April 23 !! DEADLINE EXTENSION !! Notification: April 30 Final papers due: May 15 Workshop: July 15 PROGRAM COMMITTEE: Claudio Sacerdoti Coen (Universita di Bologna) Stephane Lengrand (CNRS, Ecole Polytechnique) James McKinna (Radboud University, Nijmegen) Gopalan Nadathur (University of Minnesota) DESCRIPTION: The PSTT workshop resumes a series of workshops on Proof Search in Type Theoretic Languages, in light of the progress that has been made over the last decade in e.g. the development of proof assistants or our understanding of proof theory. The declarative approach to programming has evolved two paradigms that are based on different aspects of the theories of proofs and types: Proof normalisation provides a foundation for functional programming and type systems --on which numerous proof assistants are based, while proof search provides a foundation for logic programming and other areas of automated deduction. On the one hand, proof search mechanisms and their automation are decisive features of proof assitants that have much to gain from a proper understanding and formalisation. On the other hand, the framework of logic programming has also extended to more expressive logics and more complex data structures, e.g. with bindings. Better specifying the proof search mechanisms in type theories is thus a key concern that brings both approaches forward, and closer together. This concern involves a wide range of issues and techniques (some of which directly arising from implementation) that both approaches share --or could share, and that form the scope of this workshop. TOPICS: Papers are solicited on topics including, but not limited to: - proof search strategies and tactics, complexity & completeness, - tactics specification language, - properties of inference systems, invertibility, polarity of connectives, - focusing, normal forms for proofs, - proof-term representation, - meta-variables, representation of partial proofs, - searching for proofs by induction, search for invariants, - unification, - variable binding, scoping management and freshness - logic programming and other paradigms based on proof search, termination & computational expressivity, - deduction-modulo, deduction vs. computation during search, - using failure in proof search, - model checking as deduction, - user interaction and interfaces, - systems implementing any of the above. SUBMISSIONS: Authors can submit either detailed and technical accounts of new research or work in progress. System descriptions are also welcome, with a demonstration on the day of the workshop. Surveys and comparative papers are also strongly encouraged. Papers / long abstracts are to be submitted electronically and are subject to a 12-page limit in LNCS format, including bibliography. They can be shorter. Authors are required to submit a title and a short abstract a few days before submitting the paper (see the dates section). At least one author of an accepted paper is expected to present that paper at the workshop. Informal proceedings will be distributed at the workshop. The possibility of having a special issue dedicated to the themes of this workshop is under consideration. For further information and submission instructions, see the PSTT web page: http://www.lix.polytechnique.fr/~lengrand/Events/PSTT10/. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100414/203cd5b7/attachment.htm From bove at chalmers.se Thu Apr 15 06:34:04 2010 From: bove at chalmers.se (Ana Bove) Date: Thu, 15 Apr 2010 12:34:04 +0200 Subject: [TYPES/announce] PAR-10 call for participation and informal presentations In-Reply-To: References: <4BC62D53.5070702@chalmers.se> Message-ID: <4BC6EB9C.6050605@chalmers.se> ======================================================================== Call for Informal Presentations and Participation PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 is a one-day workshop organised as a part of FLoC'10. It is a venue for researchers working on new approaches to cope with partial recursive or corecursive functions in interactive theorem provers. See for further details. The programme of the workshop will comprise of two invited talks, and several regular paper presentations. Additionally, we wish to provide an opportunity for informal discussion of ongoing research on partial recursion and co-recursion in interactive theorem provers. If you wish to contribute an informal presentation, please upload a title and an abstract by *28 April 2010* to EasyChair via . We will try to accommodate as many short presentations as our schedule allows. We take the opportunity to remind you that the early registration to FLoC and its workshops is open until the 17th of May. Please register and participate in PAR'10 even if you do not wish to submit any talks. -- PAR'10 organising committee From rpollack at inf.ed.ac.uk Fri Apr 16 14:11:30 2010 From: rpollack at inf.ed.ac.uk (Randy Pollack) Date: Fri, 16 Apr 2010 19:11:30 +0100 Subject: [TYPES/announce] PhD position in programming languages and formal proof Message-ID: <19400.43090.497848.507700@locatelli.inf.ed.ac.uk> Certified Complexity Preserving Compiler (CerCo): Programming and proving a compiler in Type Theory For details contact Randy Pollack . ** This is restricted to EU students. ** A 3 year PhD studentship is available in a project titled "A Certified Complexity Preserving Compiler" (CerCo), funded by the European Commission under "Future and Emerging Technologies" (FET). The studentship will be held within the Laboratory for Foundations of Computer Science, at the School of Informatics, University of Edinburgh, to begin in 2010, start date flexible. The CerCo project aims at the construction of a formally verified complexity preserving compiler from a large subset of the C programming language to some typical micro-controller assembly language of the kind used in embedded systems. The work comprises the definition of cost models for the input and target languages, coding the compiler in Type Theory and the machine-checked proof of preservation of complexity (concrete, not asymptotic) along compilation, using the *Matita* proof tool. The compiler will return certified cost annotations for the source program, providing a reliable infrastructure to draw temporal assertions on the executable code while reasoning on the source. The compiler will be open source, and all proofs will be public domain. The permanent researchers involved in the CerCo project are Randy Pollack in Edinburgh, Andrea Asperti and Claudio Sacerdoti-Coen in Bologna and Roberto Amadio and Yann Regis-Gianas in Paris. The Edinburgh site will focus on the compiler front end. We are interested in use of dependent types in programming as well as in proof. Suitable candidates will have a strong first degree in Computer Science and a strong interest in formal proof and type theory. Candidates are encouraged to contact Randy Pollack to informally discuss the project further. Formal application will be through the School's normal PhD application process: -- Randy Pollack Phone: +44 131 650 5145 URL: http://homepages.inf.ed.ac.uk/rpollack Edinburgh University, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From pierre.hyvernat at univ-savoie.fr Fri Apr 16 16:46:29 2010 From: pierre.hyvernat at univ-savoie.fr (Pierre Hyvernat) Date: Fri, 16 Apr 2010 22:46:29 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Workshop_=22Realizability_in_Cham?= =?iso-8859-1?q?b=E9ry=22?= Message-ID: <20100416204629.GB31527@noisette> Greetings to all! This is the first official announcement for the third workshop "R?alisabilit? ? Chamb?ry". This year's workshop will take place during week 22, that is Tuesday 1st of June -- Friday 4th of June. If enough participants express interest for it, Monday the 31st of May will be used for a preliminary course before the actual workshop. Partial information can already be found on the web page: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/ and you can register for the workshop there: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/index.php?page=registration There will be an invited "course" given by Martin Hyland as well as two invited seminars by Thomas Streicher and Jaap van Oosten. There will be 2 sessions for contributed talks, and PhD students are particularly encouraged to submit a talk. (There will be no official proceedings though.) More details about contents of invited talks and schedule will be added to the web page when available. Meanwhile, feel free to register (via the web page), submit talks or contact me for additional details (or comments). Note: the workshop will be similar in spirit to the last one. The intention is to have a nice and friendly week without all the glitter of big conferences. There is no registration fee, but the organizing committee doesn't organize much besides the actual workshop. There is a possibility to get a student room (on campus, very cheap, but only a bare room). Students will of course be given priority for those, but anyone can ask for one... Other possibilities for accommodation are given on the web page: http://www.lama.univ-savoie.fr/~hyvernat/Realisabilite2010/index.php?page=location Pierre Hyvernat -- I don't quite hear what you say, but I beg to differ entirely with you. -- Augustus De Morgan From schaefer at chalmers.se Sat Apr 17 09:43:42 2010 From: schaefer at chalmers.se (Ina Schaefer) Date: Sat, 17 Apr 2010 15:43:42 +0200 Subject: [TYPES/announce] FMSPLE 2010 - First Call for Papers Message-ID: <4BC9BB0E.4000106@chalmers.se> Please accept our apologies if you receive multiple copies of this CFP. FIRST CALL FOR PAPERS First Workshop on Formal Methods in Software Product Line Engineering (FMSPLE 2010) http://www.iese.fraunhofer.de/de/veranstaltungen_messen/fmsple/ Co-located with the 14th International Software Product Line Conference (SPLC 2010) http://splc2010.postech.ac.kr/ BACKGROUND AND OBJECTIVES Software product line engineering (SPLE) aims at developing a family of systems by reuse in order to reduce time to market and to increase product quality. The correctness of the development artifacts intended for reuse as well as the correctness of the developed products is of crucial interest for many safety-critical or business-critical applications. Formal methods have been successfully applied in single system engineering over the last years in order to rigorously establish critical system requirements. However, in SPLE, formal methods are not broadly applied yet, despite their potential to improve product quality. One of the reasons is that existing formal approaches from single system engineering do not consider variability, an essential aspect of product lines. The objective of the workshop ?Formal Methods in Software Product Line Engineering (FMSPLE)? is to bring together researchers and practitioners from the SPLE community with researchers and practitioners working in the area of formal methods. So far, both communities have only been loosely connected, despite very promising initial work on formal analysis techniques for software product lines. The workshop aims at reviewing the state of the art and the state of the practice in which formal methods are currently applied in SPLE. This leads to a discussion of a research agenda for the extension of existing formal approaches and the development of new formal techniques for dealing with the particular needs of SPLE. To achieve the above objectives, the workshop is intended as a highly interactive event fostering discussion and initiating collaborations between the participants from both communities. TOPICS The FMSPLE workshop focuses on the application of formal methods in all phases of SPLE, including family and application engineering, and on formal methods for ensuring the correctness and consistency of the artifacts considered in all phases of SPLE. The topics of interest include, but are not limited to: - Formal methods for variability modeling and analysis of feature models - Formal methods in domain analysis and scoping - Formal methods for product line architectures - Formal methods for component-based product line development - Formal methods for product line implementation, such as programming languages, formal language semantics, type systems - Formal verification of product lines and product line artifacts, including theorem proving, model checking, and static analysis techniques - Correctness-by-construction techniques applied in SPLE - Formal methods for non-functional properties in SPLE - Automated test case generation and formal testing in SPLE - Formal methods for product derivation and application engineering - Formal methods in model-based development of product lines - Tools and applications of formal methods in SPLE - Empirical evaluation and industrial experiences of applying formal methods in SPLE - Integration of formal methods into the software product line life-cycle - Formal methods for product line evolution LOCATION The conference will be held at Jeju Island (South Korea), co-located with the SPLC conference from 13 - 17 September 2010. http://splc2010.postech.ac.kr/ FORMAT The FMSPLE workshop will be a full-day event, starting with a keynote presentation by an expert in the area of formal methods applied in SPLE. (Keynote speaker to be confirmed). The keynote will be followed by presentations of selected peer-reviewed papers. To foster interaction within the workshop, a discussant will be assigned to each presented paper. The task of the discussant will be to prepare a summary of the paper and initiate the discussion of its results.The workshop will close with a panel discussion moderated by the organizers to summarize the state of the art and the state of the practice as presented in the workshop, to collect research challenges for the application of formal methods in SPLE and to identify research topics for future workshops. SUBMISSION AND PUBLICATION The contributed papers are expected to comprise research papers containing novel and previously unpublished results, experience reports, reports of industrial case studies, tool descriptions, and short papers describing work in progress or exploratory ideas. All papers have to follow the IEEE two-column conference proceedings format (Letter) and be 4 - 8 pages of length. For formatting instructions consult http://www.computer.org/portal/web/cscps/formatting The papers will be submitted via the EasyChair conference management system and reviewed by at least three members of the program committee. The program committee will select the best papers based on quality, relevance to the workshop, and potential to initiate discussions for presentation. The workshop proceedings will be published in the second volume of the SPLC proceedings. The submission page can be found at http://www.easychair.org/conferences/?conf=fmsple2010 IMPORTANT DATES - Workshop Paper Submission: June 7 - Workshop Paper Notification: July 1 - Camera-ready Copy of Papers: July 15 PROGRAM COMMITTEE (to be confirmed) Ina Schaefer (Chalmers, SE) (Co-Chair) Gerardo Schneider (U Gothenburg, SE) Martin Becker (IESE, DE) Ralf Carbon (IESE, DE) (Co-Chair) Sven Apel (U Passau, DE) Dirk Muthig (Lufthansa Systems, DE) Frank van der Linden (Philips, NL) Frank de Boer (CWI, NL) Dave Clarke (KU Leuven, BE) Patrick Heymans (Namur, BE) Manfred Broy (TU Munich, DE) Tomoji Kishi (Waseda University, JP) John McGregor (Clemson University, US) Mark Staples (NICTA, AU) David Benavides (U Seville, ES) ORGANIZING COMMITTEE Ina Schaefer (Chalmers, SE) Martin Becker (IESE, DE) Ralf Carbon (IESE, DE) Sven Apel (U Passau, DE) -- Dr.-Ing. Ina Schaefer Chalmers University of Technology Department of Computer Science and Engineering 412 96 Gothenburg, Sweden Phone: +46 - 31 - 772 - 1072 Email: schaefer at chalmers.se From beatrice at dsv.su.se Sun Apr 18 16:51:29 2010 From: beatrice at dsv.su.se (=?iso-8859-1?Q?Beatrice_=C5kerblom?=) Date: Sun, 18 Apr 2010 22:51:29 +0200 Subject: [TYPES/announce] Final Call For Submissions Doctoral Symposium and PhD Students Workshop ECOOP 2010 Message-ID: This is the final call for submissions to the ECOOP'10 Doctoral Symposium in Maribor, Slovenia. The deadline has been extended until the 30th of April to encourage additional submissions and because we are pleased to announce that AITO will once again be supporting the participants by subsidising their travel costs. Please remind any PhD students that might be interested that this is an excellent way to get valuable feedback on their work from both their peers and from leading researchers in their field, and also to attend a world-class conference. Regards, Beatrice ?kerblom Stockholm University, Sweden Call For Submissions -------------------- 20th Doctoral Symposium and PhD Students Workshop at ECOOP'10 Monday, June 21st, 2010, Maribor, Slovenia http://ecoop2010.uni-mb.si/doctoral_symposium.html Goals ----- The 2010 Doctoral Symposium and PhD Student Workshop provides a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice. The main objectives of this event are: * to allow PhD students to practice writing clearly and to effectively present their research proposal * to get constructive feedback from other researchers * to build bridges for potential research collaboration * to contribute to the conference goals through interaction with other researchers at the main conference. The 20th edition of the Doctoral Symposium and PhD Workshop will be held as part of ECOOP 2010, Maribor, Slovenia. As the name suggests, this is a two-session event: a Doctoral Symposium and a PhD Students Workshop. Please be advised that AITO has once again generously offered to subsidise the travel costs for attendees. Event Format ------------ This is a full-day event of interactive presentations. Morning and early afternoon will be dedicated to the Doctoral Symposium, with late afternoon dedicated to the PhD Workshop. Besides the formal presentations, there will be plenty of opportunities for informal interactions during lunch and (possibly) dinner. It is planned that, like in 2009, members of the academic panel will give short presentations on a variety of topics related to doing research. Important Dates --------------- Paper submission deadline: April 30th, 2010 Notification of acceptance: May 13th, 2010 Doctoral Symposium and PhD Workshop June 21, 2010 If accepted for presentation, the student's advisor must email the chair no later than June 14th and confirm that the advisor attended at least one of the student's presentation rehearsals. Call For Papers --------------- Potential topics are those of the main ECOOP'10 conference, i.e. all topics related to object technology including but not restricted to: * Architecture, Design Patterns * Aspects, Components, Modularity, Separation of Concerns * Collaboration, Workflow * Concurrency, Real-time, Embeddedness, Mobility, Distribution * Databases, Persistence, Transactions * Domain Specific Languages, Language Workbenches * Dynamicity, Adaptability, Reflection * Frameworks, Product Lines, Generative Programming * HCI, User Interfaces * Language Design, Language Constructs, Static Analysis * Language Implementation, Virtual Machines, Partial Evaluation * Methodology, Process, Practices, Metrics * Model Engineering, Design Languages, Transformations * Requirements Analysis, Business Modeling * Software Evolution, Versioning * Theoretical Foundations, Formal methods * Tools, Programming environments Doctoral Symposium ------------------ The goal of the doctoral symposium session is to provide PhD students with useful feedback towards the successful completion of their dissertation research. Each student is assigned an academic panel, based on the specifics of that student's research. The student will give a presentation of 15-20 minutes (exact time will be announced later), followed by 15-20 minutes of questions and feedback. The experience is meant to mimic a "mini-" defense interview. Aside from the actual feedback, this helps the student gain familiarity with the style and mechanics of such an interview (advisors of student presenters will not be allowed to attend their student's presentations). To participate, the students should be far enough in their research to be able to present: * the importance of the problem * a clear research proposal * some preliminary work/results * an evaluation plan The students should still have at least 12 months before defending their dissertation. We believe that students that are defending within a year would not be able to incorporate the feedback they receive. To participate, please submit: * a 3-4 page abstract in the llncs format. * a letter from your advisor. This letter should include an assessment of the current status of your dissertation research and an expected date for dissertation submission. The advisor should e-mail this letter to Beatrice ?kerblom (beatrice at dsv.su.se). Abstracts should be sumbitted to: http://www.easychair.org/conferences/?conf=dsecoop10 The abstract should focus on the following: * Problem Description - what is the problem? - what is the significance of this problem? - why the current state of the art can not solve this problem? * Goal Statement - what is the goal of your research? - what artifacts (tools, theories, methods) will be produced, and how do they address the stated problem? How are the artifacts going to help reach the stated goal? * Method - what experiments, prototypes, or studies need to be produced/executed? - what is the validation strategy? How will it demonstrate that the goal was reached? Note that this is not a typical technical paper submission, and that the focus is not on technical details, but rather on research method. Each submission will be reviewed by at least three members of the committee. Phd Students Workshop --------------------- This session is addressed primarily to PhD students in the early stages of their PhD work. The goal is to allow participants to present their research ideas and obtain feedback from the rest of the workshop attendees. Each participant will give a 10-15 minute presentation, followed by 10-15 minutes of discussions (exact times will be announced later). To participate, please submit: * 6-10 page position paper in the llncs format, presenting your idea or current work; * a support letter from your advisor. The advisor should e-mail this letter to Beatrice ?kerblom (beatrice at dsv.su.se). Position papers should be submitted to: http://www.easychair.org/conferences/?conf=dsecoop10 The position paper should contain (at least): * a problem description; * a detailed sketch of a proposed approach; * related work. As this is earlier-stage research, it is not necessary to have concrete results from this research presented in the paper. Instead, the goal of the paper is to inform the reader of a (well-motivated) problem and to present a high level (possible) solution. Committee --------- * Zaid Altahat * Cristian Dittamo, University of Pisa, Italy * Antonio Cuni, University of Genova, Italy * Salman Mirghasemi, EPFL, Switzerland * Khan Muhammad, INRIA Sophia, France * Marco Servetto * Beatrice ??kerblom (chair), Stockholm University, Sweden Academic panel: TBA Previous Experiences The ECOOP Doctoral Symposium is an excellent place to meet many interesting people and discuss new ideas related to your research topic. It has a friendly atmosphere which makes everybody welcomed and relaxed. By attending the PhD symposium last year, I had the opportunity to engage in new collaborations with researchers from different institutions. I also received feedback from both well-established researchers and fellow PhD students which had a great positive effect on my thesis. I would certainly recommend all PhD students to attend the ECOOP PhD Symposium and Workshop. Eduardo Figueiredo, participant DS ECOOP'08 The ECOOP Doctoral Symposium was a remarkable event. It was an honor to get feedback on my personal thesis topic from such well-established researchers in the field. Their comments not only encouraged me to continue with my thesis work but also gave me valuable feedback on how to refine my concrete topic and bring the overall topic into shape. In addition, I found the other students' talks to be some of the most interesting ones at ECOOP. Some of them were very inspiring even for my own work. Overall, my participation in the symposium will certainly have a great positive effect on my thesis. Apart from that it was a fun day which made me meet many interesting people. Eric Bodden, participant DS ECOOP'07 More information ---------------- Visit the event's page at: http://ecoop2010.uni-mb.si/doctoral_symposium.html From Yves.Bertot at sophia.inria.fr Mon Apr 19 05:06:10 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Mon, 19 Apr 2010 11:06:10 +0200 Subject: [TYPES/announce] Coq-workshop: Call for informal presentations Message-ID: <4BCC1D02.4080904@sophia.inria.fr> Coq Workshop Call for informal presentations and demonstrations The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From eernst at cs.au.dk Mon Apr 19 17:57:12 2010 From: eernst at cs.au.dk (Erik Ernst) Date: Mon, 19 Apr 2010 23:57:12 +0200 Subject: [TYPES/announce] CFP - MASPEGHI 2010 - 1 week extension Message-ID: [Apologies if you receive multiple copies of this] Following other ECOOP workshops we have postponed the submission deadline from today until April 26, more precisely to 24:00 Central European daylight-saving time (22:00 UTC). Hence: ** NB: The new deadline is in approximately ONE WEEK ** Call for Papers for the MASPEGHI 2010 Workshop MechAnisms for SPEcialization, Generalization and inHerItance Associated with ECOOP 2010, Maribor, Slovenia MASPEGHI 2010 invites papers suitable for generating insight and discussion about mechanisms for specialization, generalization, code reuse, and inheritance, with the following important dates: - Paper submission: April 26, 2010 - Notification of acceptance: May 5, 2010 - ECOOP early registration deadline: May 10, 2010 - Workshop: June 22 Please note that registration must be done with ECOOP itself. For more information, please visit the workshop web site: http://www.i3s.unice.fr/maspeghi2010/ Our apologies to those authors who have worked hard in order to submit a paper by the originally announced deadline. They may submit an updated version until the extended deadline. -- Erik Ernst - eernst at cs.au.dk Department of Computer Science, Aarhus University IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From ldixon at inf.ed.ac.uk Tue Apr 20 04:47:36 2010 From: ldixon at inf.ed.ac.uk (Lucas Dixon) Date: Tue, 20 Apr 2010 09:47:36 +0100 Subject: [TYPES/announce] Automatheo 2010 at FLoC: Final Call for Papers, Talks, and System Demonstrations Message-ID: <4BCD6A28.9060404@inf.ed.ac.uk> CALL FOR PAPERS, TALKS, and SYSTEM DEMONSTRATIONS AUTOMATHEO 2010 The 2010 Workshop on Automated Mathematical Theory Exploration http://dream.inf.ed.ac.uk/events/automatheo-2010/ 14-15 July 2010, Edinburgh, UK a FLoC 2010 affiliated workshop of IJCAR and ITP. Important Dates: Wed. 5 May 2010 - Extended abstract and demo submission deadline Wed. 2 June 2010 - Acceptance notification Wed. 16 June 2010 - Final version of extended abstracts due Wed 14 - Thu 15 July 2010 - Workshop About the Automatheo workshop: Automated mathematical theory exploration is an exciting emerging research topic for mathematicians, developers of formalised mathematics, and those working on verified software. This topic concerns the theory and practice of developing software systems that support the automated development of mathematical theories, including the invention of definitions, theorems, conjectures, problems, examples and algorithms. The workshop aims to highlight the research area and foster collaboration amongst those working in software verification, formalised mathematics, and mathematical research, as well as help provide a shared understanding of the theory and tools for automated invention and discovery of mathematical theories. In this workshop, we want to encourage dissemination of knowledge as well as interaction between researchers. To facilitate this, the programme will start with talks and be followed by demo and tutorial sessions in smaller groups. Participants will experiment with and use the various systems, pose challenge problems, and develop a clear understanding of the available technologies and concepts. Invited Speakers: John Harrison and Dana S. Scott Call for Participation and Submissions: We invite proposals to give a talk and/or to provide a demo. Topics and demonstrations of interest include all aspects of mathematical theory exploration, especially the invention and discovery steps in the development of mathematical theories. This includes, but is not limited to position statements, descriptions of important features, theories of theory exploration, and systems descriptions. We also welcome contributions on the application of theory exploration to other parts of mathematics, computer science and software engineering, as well as to other sciences such as physics and biology. Submissions will be accepted based on light reviewing of extended abstracts by a review panel of researchers interested in the area. The extended abstracts will not be archival publications, but will be published online. Accepted submissions will also be disseminated in an informal proceedings which will be available during the workshop. Please submit extended abstracts and demo proposals by easychair: https://www.easychair.org/login.cgi?conf=automatheo2010 These should not be longer than 15 pages and can be as short as 1 page. We suggest, but do not require, that you use the easychair style for formatting submissions. This is available from: http://www.easychair.org/easychair.zip We will also have a published post-proceedings some time after the workshop. Programme Commitee: Jacques Calmet Jacques Carette Adrian Craciun Lucas Dixon (co-chair) Bogdan Grechuk Moa Johansson Temur Kutsia Roy McCasland (co-chair) Alison Pease Florina Piroi Alan Smaill (co-chair) David Stanovsky Cristian Urban Wolfgang Windsteiger -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Ralph.Matthes at irit.fr Tue Apr 20 10:50:14 2010 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Tue, 20 Apr 2010 16:50:14 +0200 Subject: [TYPES/announce] ESSLLI 2011 Call for Course and Workshop Proposals Message-ID: <1271775014.6067.50.camel@amelior> --------------------------------------------------------------------- 23rd European Summer School in Logic, Language and Information ESSLLI 2011 August 1-12, 2011 Ljubljana, Slovenia Call for Course and Workshop Proposals --------------------------------------------------------------------- The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org/) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computer science. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within or around the three main areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. For more information, visit the FoLLI website, as well as the ESSLLI 2010 website: http://esslli2010cph.info/. CALL FOR COURSE AND WORKSHOP PROPOSALS The ESSLLI 2011 Program Committee invites proposals for foundational, introductory, and advanced courses, and for workshops for the 23rd annual Summer School on important topics of active research in the broad interdisciplinary area connecting logic, linguistics, computer science and the cognitive sciences. All proposals should be submitted, using a prescribed form that will be available soon on the ESSLLI 2011 website, no later than: June 14, 2010 Authors of proposals will be notified of the committee's decision by September 15, 2010. GUIDELINES FOR SUBMISSION Proposers of courses and workshops should follow the guidelines below while preparing their submissions; proposals that do not conform with these guidelines may not be considered. Courses are taught by 1 or max. 2 lecturers, and workshops are organized by 1 or max. 2 organizers. Lecturers and organizers must have obtained a Ph.D. or an equivalent degree at the time of the submission deadline. Courses and workshops run over one week (Monday-Friday) and consist of five 90-minute sessions. Lecturers who want to offer a long, two-week course should submit two independent one-week courses (for example, an introductory course in the first week and an advance course in the second). The ESSLLI program committee has the right to select only one of the two proposed courses. FOUNDATIONAL COURSES These are strictly elementary courses not assuming any background knowledge. They are intended for people who wish to get acquainted with the problems and techniques of areas new to them. Ideally, they should allow researchers from other fields to acquire the key competencies of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Foundational courses should have no special prerequisites, but may presuppose some experience with scientific methods and general appreciation of the field of the course. INTRODUCTORY COURSES Introductory courses are central to the activities of the Summer School. They are intended to provide an introduction to the (interdisciplinary) field for students, young researchers, and other non-specialists, and to equip them with a good understanding of the field's basic methods and techniques. Such courses should enable experienced researchers from other fields to acquire the key competencies of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Introductory courses in a topic at the interface of two fields can build on some knowledge of the component fields; e.g., an introductory course in computational linguistics should address an audience which is familiar with the basics of linguistics and computation. Proposals for introductory courses should indicate the level of the course as compared to standard texts in the area (if available). ADVANCED COURSES Advanced courses should be pitched at an audience of advanced Masters or Ph.D. students. Proposals for advanced courses should specify the prerequisites in detail. TIMETABLE FOR COURSE PROPOSAL SUBMISSION: Jun 14, 2010: Proposal Submission Deadline Sep 15, 2010: Notification Deadline Jun 1, 2011: Deadline for receipt of camera-ready course material by the ESSLLI 2011 local organizers WORKSHOPS The aim of the workshops is to provide a forum for advanced Ph.D. students and other researchers to present and discuss their work. Workshops should have a well-defined theme, and workshop organizers should be specialists in the theme of the workshop. The proposals for workshops should justify the choice of topic, give an estimate of the number of attendants and expected submissions, and provide a list of at least 15 potential submitters working in the field of the workshop. The organizers are required to give a general introduction to the theme during the first session of the workshop. They are also responsible for various organizational matters, including soliciting submissions, reviewing, drawing up the program, taking care of expenses of invited speakers, etc. In particular, each workshop organizer will be responsible for sending out a Call for Papers for the workshop and to organize the selection of the submissions by the deadlines specified below. The call for workshop submissions must make it clear that the workshop is open to all members of the ESSLLI community and should indicate that all workshop contributors must register for the Summer School. TIMETABLE FOR WORKSHOP PROPOSAL SUBMISSIONS: Jun 14, 2010: Proposal Submission Deadline Sep 15, 2010: Notification Deadline Oct 15, 2010: Deadline for submission of the Calls for Papers to ESSLLI 2011 PC chair Nov 1, 2010: Workshop organizers send out First Call for Papers Dec 15, 2010: Workshop organizers send out Second Call for Papers Jan 15, 2011: Workshop organizers send out Third Call for Papers Feb 15, 2011: Deadline for submissions to the workshops Apr 15, 2011: Suggested deadline for notification of workshop contributors Jun 1, 2011: Deadline for submission of camera-ready copy of workshop proceedings to the ESSLLI 2011 Local Organizers. Workshop speakers will be required to register for the Summer School; however, they will be able to register at a reduced rate to be determined by the Local Organizers. FORMAT FOR PROPOSALS A form for submitting course and workshop proposals will be available soon on the ESSLLI 2011 web site: http://esslli2011.ijs.si/. The proposers are required to submit the following information: * Contact address and fax number * Name, email, affiliation, homepage of each lecturer / workshop organizer (at most two per course or workshop) * Title of proposed course/workshop * Abstract (abstract of the proposal, max 150 words) * Type (workshop, foundational, introductory, or advanced course) * Areas (one or more of: Computation, Language, Logic, or Other) * Description (describe the proposed contents of the course and substantiate timeliness and relevance to ESSLLI in at most one A4 page) * Tentative outline of the course / expected participation in the workshop * External funding (whether the proposers will be able to obtain external funding for travel and accommodation expenses) * Further particulars (e.g., course prerequisites, previous teaching experiences, etc.) FINANCIAL ASPECTS Prospective lecturers and workshop organizers should be aware that all teaching and organizing at the summer schools is done on a voluntary basis in order to keep the participants' fees as low as possible. Lecturers and organizers are not paid for their contribution, but are reimbursed for travel and accommodation expenses (up to fixed maximum amounts, which will be communicated to the lecturers upon notification). Lecturers and workshop organizers will have their registration fee waived. In case a course or workshop is to be taught/organized by two people, a lump sum will be reimbursed to cover travel and accommodation expenses for one of them; the splitting of the sum is up to the lecturers/organizers. It should be stressed that while proposals from all over the world are welcomed, the School cannot guarantee full reimbursement of travel costs, especially from destinations outside Europe. The local organizers would highly appreciate it if, whenever possible, lecturers and workshop organizers find alternative funding to cover travel and accommodation expenses, as that would help us keep the cost of attending ESSLLI 2011 lower. ESSLLI 2011 PROGRAM COMMITTEE Chair: Makoto Kanazawa (National Institute of Informatics, Tokyo) Local Co-chair: Andrej Bauer (University of Ljubljana) Area specialists: Language and Computation: Markus Egg (Humboldt-Universitaet zu Berlin) Aline Villavicencio (Federal University of Rio Grande do Sul, Brazil) Language and Logic: Hans-Christian Schmitz (Fraunhofer FIT, Sankt Augustin) Louise McNally (UPF, Barcelona) Logic and Computation: Ralph Matthes (IRIT, CNRS and University of Toulouse) Eric Pacuit (Center for Logic and Philosophy of Science, Tilburg) ESSLLI 2011 ORGANIZING COMMITTEE: Chair: Darja Fiser (University of Ljubljana) ESSLLI 2011 website: http://esslli2011.ijs.si/ From Ewen.W.Denney at nasa.gov Tue Apr 20 23:05:45 2010 From: Ewen.W.Denney at nasa.gov (Ewen Denney) Date: Tue, 20 Apr 2010 20:05:45 -0700 Subject: [TYPES/announce] Positions in formal methods at NASA Message-ID: <4BCE6B89.5080804@nasa.gov> Two positions in formal methods at NASA (one postdoc, one research software engineer) are available on "Automating the Generation of Heterogeneous Aviation Safety Cases". The goal of the project is to develop formal techniques to develop safety cases for software-intensive systems looking, in particular, at combining evidence from a range of different sources. Candidates should have experience in formal methods, software assurance techniques, theorem proving. Knowledge of aeronautics an advantage. Based at NASA Ames Research Center in Silicon Valley, California. US permanent residence or citizenship preferred. Openings are also available for postgrad summer internships. Please contact Ewen.Denney at nasa.gov for further information. From Yves.Bertot at sophia.inria.fr Wed Apr 21 09:41:14 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Wed, 21 Apr 2010 15:41:14 +0200 Subject: [TYPES/announce] Coq-Workshop: Call for informal presentations (updated information) Message-ID: <4BCF007A.8030903@sophia.inria.fr> Coq Workshop Second Call for informal presentations and demonstrations The Coq workshop will take place on July 9th, as part as the FLoC federated conference in Edinburgh, Scotland. The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should consist of abstracts of approximately 1000 words and be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From till at informatik.uni-bremen.de Thu Apr 22 08:07:28 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Thu, 22 Apr 2010 14:07:28 +0200 Subject: [TYPES/announce] 2nd CfP: 20th WADT - deadline April, 30th Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: April 30, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From peterol at ifi.uio.no Fri Apr 23 07:19:30 2010 From: peterol at ifi.uio.no (=?ISO-8859-1?Q?Peter_Csaba_=D6lveczky?=) Date: Fri, 23 Apr 2010 13:19:30 +0200 Subject: [TYPES/announce] University of Oslo: PhD Position in Formal Methods. Message-ID: <7EFC9C03-46D2-4BBA-8F76-901DCD95ADDC@ifi.uio.no> The Formal Methods group at the Department of Informatics, University of Oslo, has available 1 PhD position. * The starting date of the employment should be no later than October 1, 2010. * The applicants should preferably have completed a Master's degree (or similar), or being on the verge of completing one. * The candidate should preferably have a background in formal methods (including type theory), concurrency and distributed systems, real- time systems, or probabilistic systems. * Applications must be received no later than May 15, 2010. The intended topic for the PhD project is modeling of Probabilistic Real-Time Systems in Rewriting Logic. This includes theoretical and practical investigations as well as tool implementation. The tool development will build on Real-Time Maude and Probabilistic Maude. (Information about rewriting logic and Maude can be found at http://maude.cs.uiuc.edu/). Applicants may submit a project proposal related to the research challenges outlined above, including a description of main approach, a more detailed outline of research topics, and proposals for choice of theory and method. The fellowship is for a period of up to 4 years, with 25 % compulsory work, and should lead to a PhD thesis at the University of Oslo *** Applications must be received no later than May 15, 2010! *** Information about how to apply is given in the following link: http://uio.easycruit.com/vacancy/401037/64290?iso=no The research group for formal methods ------------------------------------- The Formal Methods group at the Department of Informatics, University of Oslo, Norway, is working on tools and languages for object-oriented and component-based software development. Our current research focus includes * formal specification and analysis of real-time systems * object-orientation and open distributed systems * rewriting logic * specification and verification of OO-programs Our research combines theoretical foundations with the goal to develop practical tools and languages to capture software adaptability. The group's activities include both theoretical, foundational, and experimental work within formal methods, semantics, and language design. For more information, see the following web-page: http://www.ifi.uio.no/forskning/grupper/pma/index_e.html Terms of employment ------------------- The salary and terms at the University of Oslo are in accordance with Norwegian state regulations. Salary is in the range NOK 355,400 ? 394,200 (currently EUR 45.100 - 50.000 and USD 59.800 - 66.300) per year, depending on relevant work experience. Further details --------------- For further information about the position, informal requests, etc., please contact Professor Peter ?lveczky, email peterol AT ifi.uio.no, How to apply ------------ As mentioned, all information about how to apply can be found at http://uio.easycruit.com/vacancy/401037/64290?iso=no In addition to those requirements, an electronic copy of the application must be sent to Peter ?lveczky at e-mail peterol AT ifi.uio.no. Please make sure that you mention the reference number 2010/4800 in your aplications and inquiries. From kai at iam.unibe.ch Fri Apr 23 09:28:31 2010 From: kai at iam.unibe.ch (=?ISO-8859-1?Q?Kai_Br=FCnnler?=) Date: Fri, 23 Apr 2010 15:28:31 +0200 Subject: [TYPES/announce] PCC 2010 Second Call for Papers Message-ID: =============================== 2nd CALL FOR PAPERS 9th Proof, Computation and Complexity PCC 2010 June 18-19, 2010 Bern, Switzerland http://pcc2010.unibe.ch/ =============================== Please note that the submission deadline is May 1st. Aim and scope -------------------- The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity. Organisers ---------------- * Kai Br?nnler, Bern (co-chair) * Alessio Guglielmi, Loria Nancy & University of Bath * Reinhard Kahle, Coimbra * Thomas Studer, Bern (co-chair) Invited Speakers (confirmed) ---------------------------------------------- * Lev Beklemishev (Moscow) * Agata Ciabattoni (Vienna) * Rosalie Iemhoff (Utrecht) Contributions ------------------ PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (Pdf, 1-2 pages) to pcc2010.workshop at gmail.com. The collection of abstracts will be available at the meeting. Important Dates ---------------------- Submission deadline : May 1, 2010 Notification to authors : May 15, 2010 Workshop: June 18-19, 2010 =============================== From lerner at cs.ucsd.edu Fri Apr 23 16:55:07 2010 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Fri, 23 Apr 2010 13:55:07 -0700 (PDT) Subject: [TYPES/announce] PASTE 2010 Call for Participation Message-ID: <830133128.810981272056107574.JavaMail.root@csemailbox.ucsd.edu> ***************************************** *** 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 From Vincent.vanOostrom at phil.uu.nl Sat Apr 24 14:43:41 2010 From: Vincent.vanOostrom at phil.uu.nl (Vincent van Oostrom) Date: Sat, 24 Apr 2010 20:43:41 +0200 Subject: [TYPES/announce] 5th International School on Rewriting, Call for Participation Message-ID: <4BD33BDD.4010008@phil.uu.nl> Call for Participation ********** I S R 2010 ********** http://www.phil.uu.nl/isr2010/ 5th International School on Rewriting July 3-8, 2010, Utrecht, The Netherlands Background and Organisation --------------------------- Term rewriting is a powerful model of computation underlying much of declarative programming, which is heavily used in symbolic computation in logic and computer science. Applications can be found in theorem proving and protocol verification, but also in fields as diverse as mathematics, philosophy and biology. Following the editions in Nancy (twice, France), Obergurgl (Austria), and Brasilia (Brazil), the 5th International School on Rewriting takes place in Utrecht, The Netherlands. The school is aimed at master and PhD students, researchers and practitioners interested in the study of rewriting concepts and their applications. To accommodate the different backgrounds, we offer two tracks: (Basic) A full-fledged introductory course at master/PhD level accompanied with exercise sessions for students without previous exposure to term rewriting; (Advanced) A series of more advanced lectures at PhD/researcher level on recent developments and applications. Master students can obtain 3ECs for successfully participating in the Basic track. The school is organised under the auspices of IFIP WG 1.6 and takes place as part (course H16) of Utrecht Summer School 2010. The school is planned such that participants can subsequently attend the major yearly conference on rewriting, RTA 2010, or other conferences that are part of the federated logic conference, FLoC 2010, in Edinburgh. Lectures and lecturers ---------------------- Introduction to Term Rewriting (B) Aart Middeldorp, Univ. of Innsbruck, Austria Femke van Raamsdonk, VU Amsterdam, The Netherlands Applications of Rewriting in Design and Analysis of Algorithms (B & A) Ashish Tiwari, SRI International, Menlo Park, CA, USA Tree Automata and Rewriting (A) Ralf Treinen, PPS, Univ. Paris-Diderot, France Complexity Analysis of Term Rewrite Systems (A) Georg Moser, Univ. of Innsbruck, Austria Termination of Programs (A) Peter Schneider-Kamp, Univ. of Southern Denmark, Odense, Denmark Productivity (A) Joerg Endrullis, VU Amsterdam, The Netherlands Dimitri Hendriks, VU Amsterdam, The Netherlands Clemens Grabmayer, Utrecht Univ., The Netherlands SAT solving for term rewriting (A) Hans Zantema, Eindhoven Univ. of Tech., Radboud Univ. Nijmegen Coq and rewriting (A) Adam Koprowski, R&D MLstate, Paris, France Complete program and ISR 2010 brochure at http://www.phil.uu.nl/isr2010/ Location and Registration ------------------------- The school takes place in the historical city centre of Utrecht. Utrecht is located in the centre of the Netherlands, and is known for its university, its treaty, the 112m high Dom tower dating back to 1321, its wharves and its canal side terraces. The Netherlands has a sea climate and the average temperature in July is between 20 and 25 degrees Celsius. Utrecht has excellent public transport connections to the rest of the country and to the major international airports of Amsterdam (Schiphol, 30 minutes by train, every 15 minutes) and Frankfurt (3.5 hours by train, 8 times per day). Registration via the link to the program above or via *Courses* -> *Start data* -> *01-15 July 2010* at http://www.utrechtsummerschool.nl/ Basic track: 175 euro, Advanced track: 225 euro, Housing: 200 euro. Fees include participation, course material for both tracks, the ISR dinner event, and the Social Programme as offered by the Utrecht Summer School, e.g. world cup semi-finals, but do not include meals. We have grants available to cover the registration fee for a number of exceptional students. See the registration and/or ISR2010 site for details. From pschust at mathematik.uni-muenchen.de Mon Apr 26 13:46:05 2010 From: pschust at mathematik.uni-muenchen.de (Peter Schuster) Date: Mon, 26 Apr 2010 19:46:05 +0200 (CEST) Subject: [TYPES/announce] Initial MALOA Training Workshop September 2010, Fischbachau Message-ID: -------------------------------------------------------------------------- MALOA - From MAthematical LOgic to Applications Marie Curie Initial Training Network, PITN-GA-2009-238381 http://www.logique.jussieu.fr/MALOA/ --------------------------------------------------------------------------- Initial MALOA Training Workshop September 2010, Fischbachau, Germany --------------------------------------------------------------------------- Dates: Arrival Sunday, 5 September 2010. Departure Saturday, 11 September 2010 after noon. Scope of the Workshop: The workshop consists of main lecture courses and contributed talks across a range of logic as well as informal discussion groups in the evenings. It is intended particularly for PhD students and postdoctoral researchers working in or around mathematical logic and applications. It is primarily aimed at members of the involved research centres of the MALOA network, but participants from external sites are welcome as well. Location: The workshop is being held at the Hotel Aurachhof in Fischbachau, a picturesque small village outside of Munich. Costs: Full board accommodation is available from EUR 50 to EUR 80 per person and day, depending on the room type and includes the workshop costs. Further information: For more information, including a full timetable of lecture courses and talks, please see the website http://www.mathematik.uni-muenchen.de/~jberger/fisch.html If interested in participating, please email Emma Jones e.j.jones at leeds.ac.uk as soon as possible, and by Monday May 3 at absolute latest, as we need to make the accommodation booking in Fischbachau. ---------------------------------------------------------------------------- From kurz at mcs.le.ac.uk Tue Apr 27 03:50:03 2010 From: kurz at mcs.le.ac.uk (Alexander Kurz) Date: Tue, 27 Apr 2010 08:50:03 +0100 Subject: [TYPES/announce] CfP: WORKSHOP RP'2010 Message-ID: <4BD6972B.2080809@mcs.le.ac.uk> ================= Call for Papers ================= 4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010 (August 27-29, 2010, Masaryk University, Brno, Czech Republic) co-located with MFCS & CSL 2010 http://www.csc.liv.ac.uk/~rp2010/ --------------------------------------------------- Deadline for submissions is EXTENDED: May 11, 2010 Proceedings will be published in the Springer LNCS --------------------------------------------------- The Workshop on Reachability Problems will be hosted by the Faculty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010. RP'10 is the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. Scope: The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in - Algebraic structures - Computational models - Hybrid systems - Logic and Verification Invited Speakers: ================= - Markus Holzer (Giessen University, Germany) - Kim Guldstrand Larsen (Aalborg University, Denmark) - Alexander Rabinovich (Tel Aviv University, Israel) - Philippe Schnoebelen (ENS Cachan, France) Important dates: ================= Submission: May 11, 2010 Notification: June 3, 2010 Final version: June 10, 2010 Conference dates: Aug. 27-29, 2010 Topics of interest: ====================== Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. Topics of interest include (but are not limited to): Reachability for infinite state systems, rewriting systems; Reachability analysis in counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of semigroups, groups and rings; Reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms The reachability problems are in the core of many questions of computer science and mathematics. This topic covers many aspects about the analysis of computational traces/paths in classical and unconventional computational models, logic, algebraic structures as well as in mathematical systems and control theory. The classical reachability can be formulated as follows: Given a computational system or model with a set of allowed transformations (functions). Decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in term of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations, their equivalence; unavoidability of some dynamics and a possibility to avoid undesirable dynamic using a limited control. Proceedings =========== The Conference Proceedings will be published as the volume of the Springer Verlag Lecture Notes in Computer Science (LNCS) series www.springer.com/lncs and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure. Submissions: ============ Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via the conference web page. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in postscript or pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Program Committee: ================== - Parosh Aziz Abdulla, Uppsala - Eugene Asarin, Paris - Christel Baier, Bonn - Bernard Boigelot, Liege - Olivier Bournez, Palaiseau - Cristian S. Calude, Auckland - Stephane Demri, Cachan - Javier Esparza, Munich - Laurent Fribourg, Cachan - Vesa Halava, Turku - Oscar Ibarra, Santa Barbara - Franjo Ivancic, Princeton - Juhani Karhumaki, Turku - Joost-Pieter Katoen, Aachen - Antonin Kucera, Brno - Michal Kunc, Brno - Alexander Kurz, Leicester - Slawomir Lasota, Warsaw - Alexei Lisitsa, Liverpool - Luke Ong, Oxford - Igor Potapov, Liverpool - Wolfgang Thomas, Aachen - Hsu-Chun Yen, Taipei Organizing Committee: ===================== - Antonin Kucera (Masaryk University) - Igor Potapov (University of Liverpool) Contact details: RP'2010 Faculty of Informatics, Masaryk University, Emails: Antonin Kucera tony at fi.muni.cz Igor Potapov potapov at liverpool.ac.uk From Richard.Moot at labri.fr Tue Apr 27 08:09:17 2010 From: Richard.Moot at labri.fr (Richard Moot) Date: Tue, 27 Apr 2010 14:09:17 +0200 Subject: [TYPES/announce] E.W. Beth Dissertation Award 2010 - deadline extended Message-ID: <35770D94-61B3-4EA8-869F-3BA5219AEA5A@labri.fr> E. W. Beth Dissertation Prize: 2010 call for nominations Deadline extended: May 16, 2010 !!! Since 2002, FoLLI (the Association for Logic, Language, and Information, http://www.folli.org) awards the E.W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. We invite submissions for the best dissertation which resulted in a Ph.D. degree in the year 2009. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of three fields of Logic, Language, and Computation. Interdisciplinarity is an important feature of the theses competing for the E.W. Beth Dissertation Prize. Who qualifies. Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2009 and December 31st, 2009. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2009 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for 2010). The present call for nominations for the E.W. Beth Dissertation Award 2010 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2008 or 2009. Prize. The prize consists of: -a certificate -a donation of 2500 euros provided by the E.W. Beth Foundation -an invitation to submit the thesis (or a revised version of it) to the FoLLI Publications on Logic, Language and Information (Springer). For further information on this series see the FoLLI site. How to submit. Only electronic submissions are accepted. The following documents are required: 1. The thesis in pdf or ps format (doc/rtf not accepted); 2. A ten page abstract of the dissertation in ascii or pdf format; 3. A letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. Two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to buszko at amu.edu.pl. Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days, nominators should write to buszko at amu.edu.pl. Important dates: Deadline for Submissions: April 30, 2010 (extended: May 16, 2010) Notification of Decision: July 20, 2010. Committee : Natasha Alechina (Nottingham) Lev Beklemishev (Moscow) Wojciech Buszkowski (chair) (Poznan) Didier Caucal (IGM-CNRS) Nissim Francez (Haifa) Alexander Koller (Saarbruecken) Alberto Policriti (Udine) Ian Pratt-Hartmann (Manchester) Rob van der Sandt (Nijmegen) Colin Stirling (Edinburgh) Rineke Verbrugge (Groningen) Heinrich Wansing (Dresden) From stefano at di.unito.it Tue Apr 27 11:12:03 2010 From: stefano at di.unito.it (Stefano Berardi) Date: Tue, 27 Apr 2010 17:12:03 +0200 Subject: [TYPES/announce] First Call for papers for the workshop Classical Logic and Computation (CL&C'10) - 21-22 August 2010 - Brno, Czech Republic Message-ID: <4BD6FEC3.4020500@di.unito.it> As usual, apologies for multiple copies. This is the first call for papers for: International Workshop on Classical Logic and Computation (CL&C'10) http://www.doc.ic.ac.uk/~svb/CLaC10 21-22 August 2010 Brno, Czech Republic CL&C'10 is a joint workshop with PECP and a satellite of the federated conferences: CSL and MFCS IMPORTANT DATES Deadline for abstract: June, 13, 2010 Deadline for submission: June, 27, 2010 Notification of acceptance: July, 17, 2008 Final version due: July, 27, 2010 Workshop date: August, 21-22, 2010 INTRODUCTION CL&C'10 is the third of a conference series on "Classical Logic and Computation". It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as part of CSL and MFCS, jointly with PECP (Program Extraction and Constructive Proofs): http://www.cs.swansea.ac.uk/~csmona/pecp.html Through these two workshops we wish to honour Prof. Helmut Schwichtenberg's many important contributions to both fields. CL&C is focused on the interplay between program extraction from classical proofs and computer science, while PECP will focus on recent developments in Applied Proof Theory and Constructive Mathematics. The two fields have a substantial common interest, namely the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic, - design of programming languages inspired by classical logic, - cut-elimination for classical systems, - proof representation and proof search for classical logic, - translations of classical to intuitionistic proofs, - constructive interpretation of non-constructive principles, - witness extraction from classical proofs, - constructive semantics for classical logic (e.g. game semantics), - case studies (for any of the previous points). SUBMISSION AND PUBLICATION, This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. Post-proceedings of CL&C?06 and CL&C?08 were published as special issues of APAL. A special issue of a journal, with the post-proceedings of CL&C ?10, is being considered. It will contain full versions of selected papers. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at http://www.easychair.org/conferences/?conf=clac10 Submissions will be refereed according to interest and originality of the idea. A participants' proceedings will be distributed at the workshop. INVITED SPEAKERS Joint with PECP (see the PECP web page) http://www.cs.swansea.ac.uk/~csmona/pecp.html CONTACT u.berger at swansea.ac.uk (This message is sent through the types net and types forum to all former participants of the types project and all former types sites.) From f.rabe at jacobs-university.de Wed Apr 28 07:37:59 2010 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Wed, 28 Apr 2010 13:37:59 +0200 Subject: [TYPES/announce] Call for Participation: FLoC Workshop on Modules and Libraries for Proof Assistants Message-ID: Call for Participation Second International Workshop on Modules and Libraries for Proof Assistants (MLPA'10) July 15, 2010 http://kwarc.info/frabe/events/mlpa-10.html Affiliated with FLoC Edinburgh, Scotland, July 9-21, 2010 EARLY REGISTRATION DEADLINE: May 17 Program: The formal part of the workshop program will consist of invited talks by * Adam Chlipala http://adam.chlipala.net/ A Bottom-Up Approach to Safe Low-Level Programming * Gerwin Klein http://www.cse.unsw.edu.au/~kleing/ Large-scale proof and libraries in Isabelle * Ulf Norell http://www.cse.chalmers.se/~ulfn/ TBA * Don Sannella http://homepages.inf.ed.ac.uk/dts/ TBA * Andrzej Trybulec http://math.uwb.edu.pl/~trybulec/ TBA See http://kwarc.info/frabe/events/mlpa-10.html for details. Description: This is the second workshop on module systems and libraries for proof assistants, which succeeds MLPA-09 held during CADE-22. It aims to attract and bring together researchers and practitioners with background and experience in module systems from different logic based systems, such as theorem provers, proof assistants, and programming languages. It will provide a fertile venue for the exchange of ideas and experiences and has the potential to impact the way we organize proofs and programs in the future. Program Committee: * Stefan Berghofer, Institut f?r Informatik, Technische Universit?t M?nchen * Derek Dreyer, Max Planck Institute for Software Systems, Saarbr?cken * Georges Gonthier, Microsoft Research, Cambridge * Zhaohui Luo, Royal Holloway, University of London, * Till Mossakowski, German research center for artificial intelligence, Bremen, * Scott Owens, Computer Laboratory, University of Cambridge * Florian Rabe, Jacobs University Bremen (chair) * Carsten Sch?rmann, IT University of Copenhagen (chair) Organizers: Florian Rabe Carsten Schuermann f.rabe at jacobs-university.de carsten at itu.dk Jacobs University IT University of Copenhagen Bremen, Germany Copenhagen, Denmark From cbraga at ic.uff.br Wed Apr 28 14:36:52 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Wed, 28 Apr 2010 15:36:52 -0300 Subject: [TYPES/announce] LSFA 2010 - Call for papers Message-ID: <40BE4C00-CF93-4176-B5B3-567000CC7E05@ic.uff.br> [Apologies for multilple copies of this CFP.] --- LSFA 2010 - 5th Workshop on Logical and Semantic Frameworks, with Applications Call for Papers Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. In this fifth edition, the workshop will be on August 31st, jointly with ICTAC (http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil. Topics of interest to this forum include, but are not limited to: * Logical frameworks * Proof theory * Type theory * Automated deduction * Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA'10 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will be in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. The publication of LSFA proceedings is planned to be a volume of ENTCS (under consideration by ENTCS editorial board). Selected papers, will be published in a special volume by ISTE (http://www.iste.co.uk/) Program Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Luis Farinas del Cerro (Program co-chair, IRIT, France) * Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil) * Jonathan Seldin (Univ-Lethbridge , Canada) TBC * Maur?cio Ayala-Rinc?n (UnB, Brasil) * Christiano de Oliveira Braga (UFF, Brasil) * Mario Benevides (Coppe-UFRJ, Brasil) * Eduardo Bonelli ( UNLP, Argentina) * Marcelo Corr?a (IM-UFF, Brasil) * Clare Dixon (Liverpool, UK) * Gilles Dowek (Polytechnique-Paris, France) * William Farmer (Mcmaster, Canada) * Maribel Fern?ndez (King's College, UK) * Marcelo Finger (IME-USP, Brasil) * Fairouz Kamareddine (Heriot-Watt Univ, UK) * Delia Kesner (Paris-Jussieu, France) * Luis da Cunha Lamb (UFRGS, Brasil) * Joao Marcos (UFRN, Brasil) * Ana Teresa Martins (UFC, Brasil) * Martin Musicante (UFRN, Brasil) * Cl?udia Nalon (UnB, Brasil) * Luca Paolini (Universit? di Torino, Italy) * Elaine Pimentel (UFMG, Brasil) Important dates: * Submission 31th May 2010 * Author's notification 1st July * Camera-ready: 30th July * Workshop : 31 August Contributions should be written in English and submitted in the form of full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA2010 page at EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10) until the submission deadline by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. Please see the Instructions for Preparing Files for Preliminary Versions Instructions for styles and examples. Instructions and the Latex package used to format your submission can be found in http://www.entcs.org/prelim.html Organizing Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Martin Musicante (UFRN, Brasil) * Edward Hermann Haeusler (PUC-Rio, Brasil) * Cl?udia Nalon (UnB, Brasil) * Marcelo Corr?a (IM-UFF, Brasil) From A.M.Silva at cwi.nl Thu Apr 29 12:35:13 2010 From: A.M.Silva at cwi.nl (A.M.Silva@cwi.nl) Date: Thu, 29 Apr 2010 18:35:13 +0200 Subject: [TYPES/announce] ICE 2010: Call for short contributions and participation Message-ID: <20100429163513.GA9529@ludwig.sen.cwi.nl> [- Apologies for multiple copies -] *** Call for short contributions & participation *** 3rd Interaction and Concurrency Experience ICE 2010: Guaranteed Interactions Satellite workshop of DisCoTec 2010 10th of June 2010 Amsterdam, The Netherlands http://www.artist-embedded.org/artist/-ICE-10-.html === Highlights === - Invited talks by Tom A. Henzinger (IST, Austria) and Joost-Pieter Katoen (RWTH Aachen University, Germany) - Travel grants for young researchers === Important Dates === - Submission of short contributions: 10 May 2010 - Notification to authors: 13 May 2010 === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope is to include theoretical and applied aspects of interactions and the synchronization mechanisms used among actors of concurrent/distributed systems, but every experience will focus on a different specific topic which affects several areas of computer science. The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing safety, responsiveness, quality of service levels or satisfaction of analysis hypotheses. In this context, coordination can be viewed as imposing constraints on the interaction among the actors. Such constraints and guarantees of their satisfaction play an important role in the analysis of distributed systems. In order to provide such guarantees, a number of directions are being explored to develop appropriate models, methodologies and tools, like behavioural types, component-based model checking, assume-guarantee and ?by construction? techniques such as glue synthesis. Considering interaction as a first class entity is crucial for overcoming complexity issues of distributed systems, such as state space explosion. Topics of interest include, but shall not be limited to: - logic and types for interactions - concurrent models and semantics - techniques and tools for specification, analysis, verification of guaranteed interaction - programming primitives for interactions - languages, protocols and mechanisms for sound coordination - "by construction" guarantees for interaction - expressiveness results - formal contract languages - disciplined interactions inspired by emerging computational models (systems biology, quantum computing, etc.) === Selection Procedure For Short Contributions === The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. Selection of regular papers has been closed on April 30, after which we decided to reserve some additional slots for presentation of recent work in progress or visionary innovative ideas and approaches. === The Public Wiki === After the notification, the accepted papers will be published on a public forum, the rationale being to initiate public discussions that will trigger and stimulate the scientific debate of the workshop. We argue that this will drive the workshop discussions and let perspective participants to interact with each other well in advance with respect to the modus operandi of more traditional events. === Submission Guidelines === Short papers must report previously unpublished work although it is allowed that some extended versions are simultaneously submitted to other conferences / workshops with proceedings. Accepted short papers will be considered for inclusion in the ICE'10 post-proceedings either in form of extended abstracts or as full papers. ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Submissions of short papers must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2010) and should not exceed 4 pages with EPTCS style (http://style.eptcs.org/). Accepted short papers must be presented at the workshop by one of the authors. === Program Committee === - Paolo Baldan (University of Padova, Italy) - Ananda Basu (Verimag, France) - Karthik Bhargavan (INRIA, France) - Simon Bliudze (CEA LIST, France; co-chair) - Andrea Bracciali (University of Pisa, Italy) - Roberto Bruni (University of Pisa, Italy; co-chair) - Pierre-Malo Deni?lou (Imperial College London, UK) - Erik de Vink (Technische Universiteit Eindhoven, Netherlands) - Laurent Doyen (ENS Cachan, France) - Carlo Furia (ETH Zurich, Switzerland) - Fabio Gadducci (University of Pisa, Italy) - Julian Gutierrez (University of Edinburgh, UK) - Thomas Hildebrandt (IT University of Copenhagen, Denmark) - Daniel Hirschkoff (ENS Lyon, France) - Barbara Jobstmann (CNRS/Verimag, France) - Ivan Lanese (University of Bologna, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Hernan Melgratti (University of Buenos Aires, Argentina) - Madhavan Mukund (Chennai Mathematical Institute, India) - Dejan Nickovic (IST, Austria) - Sophie Quinton (Verimag, France) - Alexandra Silva (CWI, Netherlands) - Pawel Sobocinski (University of Southampton, UK) - Ana Sokolova (University of Salzburg, Austria) - Paola Spoletini (University of Insubria, Italy) - Emilio Tuosto (University of Leicester, UK) - Hugo Torres Vieira (New University of Lisbon, Portugal) === ICEcreamers === - Simon Bliudze (CEA LIST, France; co-chair) - Roberto Bruni (University of Pisa, Italy; co-chair) - Davide Grohmann (Universita' di Udine; website and discussion forum) - Alexandra Silva (CWI, Netherlands; local arrangements) === Contact === Please write to for any additional information you may need. === Previous editions === The previous two editions of ICE have been held in: ? Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn- chronous Interactions in Concurrent/Distributed Systems, co-located with ICALP?08 (http://ice08.dimi.uniud.it/). The post proceedings were published in ENTCS (vol.229-3). ? Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions, co-located with CONCUR?09 (http://ice09.dimi.uniud.it/). The post proceedings were published in EPTCS (vol.12) and a special issue of MSCS is now in preparation. === Sponsors === * CEA LIST (http://www-list.cea.fr) * ArtistDesign network of excellence (http://www.artist-embedded.org) * Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/) . From christian.retore at labri.fr Thu Apr 29 18:50:29 2010 From: christian.retore at labri.fr (retore) Date: Fri, 30 Apr 2010 00:50:29 +0200 Subject: [TYPES/announce] PhD offer on categorical logic (University of Bordeaux, INRIA Grant) Message-ID: The following topic is eligible for a PhD grant funded by INRIA (details and application online): Categorical interpretations of first order linear logic ? with application to ontological aspects of lexical semantics http://www.labri.fr/perso/retore/SUJETS/semantique_categorique_LL.html (supervised by Christian Retor? INRIA & LaBRI and Jean Gillibert IMB ? universit? de Bordeaux) This subject involves mathematical logic, theoretical computer science, category theory and topology, with some applications to the semantics of natural language. Please forward this announcement to every student that may be interested. Jean Gillibert http://www.math.u-bordeaux1.fr/~gilliber/ Christian Retor? http://www.labri.fr/perso/retore/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100429/89e5ad7a/attachment.htm From luigi.santocanale at lif.univ-mrs.fr Sat May 1 02:56:54 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Sat, 01 May 2010 08:56:54 +0200 Subject: [TYPES/announce] FICS 2010: 2nd Call for Contributions Message-ID: <4BDBD0B6.6080709@lif.univ-mrs.fr> [* Apologies for multiple copies *] 2nd Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * Panos Rondogiannis, University of Athens. * Dale Miller, INRIA and LIX. Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by June 13 2010. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From till at informatik.uni-bremen.de Sat May 1 04:52:57 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Sat, 01 May 2010 10:52:57 +0200 Subject: [TYPES/announce] CfP: 20th WADT - deadline extended to May, 10th Message-ID: [sorry if you receive this more than once] CALL FOR PAPERS DEADLINE FOR TWO-PAGE ABSTRACTS EXTENDED TO MAY, 10th WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany http://www.informatik.uni-bremen.de/WADT2010/ Aims and Scope: The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. Topics of interest: Typical, but not exclusive topics of interest are: - Foundations of algebraic specification - Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - Specification languages, methods, and environments - Semantics of conceptual modelling methods and techniques - Model-driven development - Graph transformations, term rewriting and proof systems - Integration of formal specification techniques - Formal testing and quality assurance, validation, and verification INVITED SPEAKERS Hans-Dieter Ehrich, Institut f\"ur Informationssysteme, Braunschweig Frantisek Plasil, Charles University, Prague Martin Wirsing, Ludwig-Maximilians-Universit\"at, M\"unchen IMPORTANT DATES Submission deadline for abstracts: May 10, 2010 Notification of acceptance: May 23, 2010 Final abstract due: June 13, 2010 Workshop: July 1-4, 2010 Workshop Format and Location: The workshop will take place over four days, Thursday to Sunday, at Schloss Etelsen, www.schloss-etelsen.de, a castle located near Bremen. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers. Submissions: The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of the submitted abstracts according to originality, significance, and general interest. The abstracts have to be submitted electronically according to the instructions published on the workshop web site. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). Sponsorship: The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, University of Bremen, and DFKI GmbH. The event is organized by the Computer Science Department of the University of Bremen and the DFKI Bremen group Safe and Secure Cognitive Systems. WADT Steering Committee: Michel Bidoit (France) Andrea Corradini (Italy) Jos\'e Fiadeiro (UK) Rolf Hennicker (Germany) Hans-J\"org Kreowski (Germany) Till Mossakowski (Germany) [chair] Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) PROCEEDINGS The abstracts accepted for presentation will be available at the workshop. Refereed LNCS proceedings are planned for full versions of submissions solicited after the workshop. CONTACT WADT 2010 Fachbereich 3 Mathematik und Informatik Enrique-Schmidt-Str. 5 D-28359 Bremen, Germany Phone: +49 421 218 64226 Fax: +49 421 218 98 64226 Email: wadt2010 at informatik.uni-bremen.de From gabriel at info.uaic.ro Sat May 1 11:53:20 2010 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Sat, 1 May 2010 18:53:20 +0300 (EEST) Subject: [TYPES/announce] MeCBIC 2010: 4th Workshop on Membrane Computing and Biologically Inspired Process Calculi Message-ID: Call for Papers MeCBIC 2010 4th Workshop on Membrane Computing and Biologically Inspired Process Calculi http://www.info.uaic.ro/~mecbic/mecbic2010/ Jena, Germany, 23-24 August 2010 Affiliated to CMC11, Conference on Membrane Computing http://cmc11.uni-jena.de/index.html ====================================================================== *** IMPORTANT DATES *** Title and Abstract: 7 June, 2010 Paper Submission: 12 June, 2010 Notification: 31 July, 2010 Pre-EPTCS version: 12 Aug., 2010 Biological membranes play a fundamental role in the complex reactions which take place in cells of living organisms. The importance of this role has been considered in two different types of formalisms recently introduced. Membrane systems were introduced as a class of distributed parallel computing devices inspired by the observation that any biological system is a complex hierarchical structure, with a flow of materials and information that underlies their functioning. The modeling and the analysis of biological systems has also attracted the interest of the process algebra research community. Thus the notions of membranes and compartments have been explicitly represented in a family of calculi, such as Ambients and Brane Calculi. A cross fertilization of the two research areas has recently started. A deeper investigation of the relations between these related formalisms is interesting, as it is important to understand the similarities and the differences. The main aim of the workshop is to bring together researchers working in membrane computing, in biologically inspired process calculi (ambients, brane calculi, etc.) and in other related fields to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. Original research papers (including significant work-in-progress) on the membrane systems or biologically inspired process calculi are sought. Papers on the relationship between membrane systems and biologically inspired process calculi are particularly welcome. Related formal approaches in which cell compartments play an important role are also within the scope of the workshop. Topics of interest include (but are not limited to): * Biologically inspired models and calculi; * Biologically inspired systems and their applications; * Analysis of properties of biologically inspired models and languages; * Theoretical links and comparison between different models/systems. *** SUBMISSION GUIDELINES *** Authors are invited to submit a PDF version of their papers (of about 15 pages) using the EPTCS style (http://www.eptcs.org/). Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=mecbic2010). We also encourage the submission of short papers, limited to 8 pages, presenting new tools or platforms related to the topics of MeCBIC 2010. *** DISSEMINATION *** The workshop proceedings will be available electronically, and then published in the Electronic Proceedings in Theoretical Computer Science. After the workshop, extended and additionally refereed papers will be published in a special issue of Theoretical Computer Science including selected papers of both MeCBIC 2009 and MeCBIC 2010. *** PROGRAM COMMITTEE *** * Joern Behre Friedrich Schiller University, Jena, DE * Luca Cardelli, Microsoft Research, Cambridge, UK * Matteo Cavaliere, CSIC-CNB, Madrid, Spain * Gabriel Ciobanu, ICS, Romanian Academy, Iasi, RO (co-chair) * Federica Ciocchetta, CoSBi, Trento, Italy * Flavio Corradini, University of Camerino, Italy * Erzsebet Csuhaj-Varju, CARI, Hungarian Academy, Budapest, HU * Erik de Vink, Technische Universiteit Eindhoven, NL * Marian Gheorghe, University of Sheffield, UK * Jean-Louis Giavitto, University of Evry, France * Thomas Hinze, Friedrich Schiller University, Jena, DE * Maciej Koutny, Newcastle University, UK (co-chair) * Paolo Milazzo, University of Pisa, Italy * Angelo Troina, University of Torino, Italy * Claudio Zandron, University of Milano-Bicocca, Italy * Gianluigi Zavattaro, University of Bologna, Italy From brunocdsoliveira at googlemail.com Sun May 2 05:06:32 2010 From: brunocdsoliveira at googlemail.com (Bruno Oliveira) Date: Sun, 2 May 2010 18:06:32 +0900 Subject: [TYPES/announce] WGP 2010 Second Call for Papers Message-ID: ====================================================================== CALL FOR PAPERS WGP 2010 6th ACM SIGPLAN Workshop on Generic Programming Baltimore, Maryland, US Sunday, September 26th, 2010 http://osl.iu.edu/wgp2010 Collocated with the International Conference on Functional Programming (ICFP 2010) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * polytypic programming, * programming with dependent types, * programming with type classes, * programming with (C++) concepts, * generic programming, * programming with modules, * meta-programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Bruno C. d. S. Oliveira, Seoul National University Co-Chair Marcin Zalewski, Indiana University Programme Committee ------------------- Alley Stoughton, Kansas State University Andrei Alexandrescu, Facebook Bruno C. d. S. Oliveira (Co-Chair), Seoul National University Doug Gregor, Apple Gilad Bracha, I am a Computational Theologist Emeritus Magne Haveraaen, Universitetet i Bergen Marcin Zalewski (Co-Chair), Indiana University Neil Mitchell, Standard Chartered Ralf L?mmel, University of Koblenz-Landau Shin-Cheng Mu, Academia Sinica Thorsten Altenkirch, University of Nottingham Ulf Norell, Chalmers University Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Sunday 2010-06-13 Notification of acceptance: Monday 2010-07-12 Final submission due: Tuesday 2010-07-27 Workshop: Sunday 2010-09-26 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP09 EasyChair instance by 13th of June 2010. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Baltimore, Maryland, US 2010 (affiliated with ICFP10) Earlier Workshops on Generic Programming have been held in * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J Gibbons, R Hinze, P Jansson, J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100502/3ed1be57/attachment.htm From phil at site.uottawa.ca Sun May 2 13:11:59 2010 From: phil at site.uottawa.ca (Phil Scott) Date: Sun, 2 May 2010 13:11:59 -0400 (EDT) Subject: [TYPES/announce] PCAs 2010: a LICS-FLoC 2010 workshop Message-ID: This is to announce: Partial Combinatory Algebras in Realizability and Computability (PCAs 2010) Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://www.mathstat.uottawa.ca/~phofstra/FLoC2010/workshop.html A workshop bringing together researchers working on all aspects of partial combinatory algebras (PCAs) in realizability and computability. Invited speakers: Andrej Bauer (Ljubljana) Inge Bethke (Amsterdam) John Longley (Edinburgh) Jaap van Oosten (Utrecht) Pino Rosolini (Genova) Thomas Streicher (Darmstadt) CALL FOR CONTRIBUTED TALKS There are (a limited number) of slots for contributed talks: if you would like to contribute a talk to this workshop please contact one of the organizers (Robin Cockett or Pieter Hofstra) with a title and a short abstract and we will try to accommodate you. It is intended to have a special issue of MSCS dedicated to the general theme of the workshop which will be open to contributions from the participants of the workshops and others with interest in this area. From moggi at disi.unige.it Mon May 3 10:58:50 2010 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Mon, 3 May 2010 16:58:50 +0200 (CEST) Subject: [TYPES/announce] ICTCS 2010 last CFP Message-ID: <20100503145850.BB1EE35DC5@mailstore.csita.unige.it> Last Call for Papers 12th Italian Conference on Theoretical Computer Science (ICTCS 2010) Camerino, Italy, September 15-17, 2010 http://www.cs.unicam.it/ictcs2010 ICTCS 2010 provides a forum for the exchange of ideas among researchers, and it aims to foster an environment, where junior researchers and PhD students can gain experience in presenting their work, broaden their views on the subject, and benefit from contact with more established researchers. Also researchers from outside Italy are welcome to submit papers and attend the Conference. The Scientific and Organizing Committee welcomes contributions in any area of Theoretical Computer Science. These contributions could describe - original works, that the authors may want to submit to a post-conference special issue; - original works submitted or accepted somewhere else, that the authors wish to publicize at ICTCS; - works in progress, on which the authors wish to get feedback at ICTCS. IMPORTANT DATES Submission Deadline: - May 20 (for entering title and text abstract) - May 27 (for adding pdf and attachments) Notification of Acceptance: June 20 Early registration deadline: July 30 Conference: September 15-17 SUBMISSIONS. Authors are invited to submit electronically an extended abstract (in pdf format), NOT EXCEEDING FOUR SINGLE spaced pages. The Scientific and Organizing Committee is considering the publication of a postconference special issue in the Journal Theoretical Informatics and Applications. For additional information, please refer to the conference web page. Further queries concerning submissions for presentation at ICTCS or to the special issue can be sent to ictcs2010 at easychair.org INVITED SPEAKERS Marco Bernardo (Univ. di Urbino) Stefano Crespi-Reghizzi (Poli. di Milano) Rossella Petreschi (Sapienza Univ. di Roma) ICTCS is hosted by Camerino University. Camerino is an historical town in the Center of Italy, known and respected since Roman times, which became particularly important in the middle-age. Camerino is located in hilly surroundings (Marche Region), between the spectacular Appennini mountains and the pleasant Adriatic coast. CO-LOCATED EVENT. The last meeting of PRIN national project PaCo: Performability-aware Computing http://www.sti.uniurb.it/paco/ is organised at Camerino, Italy on September 13-14, 2010. Ongoing work and final results of the research units will be presented by the involved researchers. SCIENTIFIC AND ORGANIZING COMMITTEE Marcella Anselmo (Univ. di Salerno) Tiziana Calamoneri (Sapienza Univ. di Roma) Flavio Corradini (Univ. di Camerino) Emanuela Merelli (Univ. di Camerino) Eugenio Moggi (Univ. di Genova) From bove at chalmers.se Mon May 3 13:10:47 2010 From: bove at chalmers.se (Ana Bove) Date: Mon, 3 May 2010 19:10:47 +0200 Subject: [TYPES/announce] PAR'10: Call for Participation Message-ID: <4BDF0397.7080501@chalmers.se> ======================================================================== Call for Participation PAR 2010 Workshop on Partiality And Recursion in Interactive Theorem Provers Edinburgh, UK, 15 July 2010 (satellite workshop of ITP'10) a mid-FLoC 2010 workshop ======================================================================== PAR'10 is a one-day workshop organised as a part of FLoC'10. It is a venue for researchers working on new approaches to cope with partial functions and terminating general recursion in (interactive) theorem provers. See for further details. Registration is now open via FLoC 2010 registration form Early registration is open until May 17th. The programme of the workshop will comprise: Invited Speakers: 1. Alexander Krauss (Technische Universitat Muenchen): Recursive Definitions of Monadic Functions. 2. Conor McBride (University of Strathclyde): Djinn, monotonic. Contributed Talks: 1. Andreas Abel: Integrating Sized and Dependent Types. 2. Nils Anders Danielsson: Beating the Productivity Checker Using Embedded Languages. 3. Issam Maamria and Michael Butler: Rewriting and Well-Definedness within a Proof System. 4. Claudio Sacerdoti Coen and Silvio Valentini: General Recursion and Formal Topology. 5. Aaron Stump, Vilhelm Sj?berg and Stephanie Weirich: Termination Casts: A Flexible Approach to Termination with General Recursion. Informal presentations: 1. Thorsten Altenkirch and Nils Anders Danielsson: Termination Checking Nested Inductive and Coinductive Types. 2. Gavin Mendel-Gleason and Geoff Hamilton. Inhabitation of (Co)-inductive Types using Transition Systems. 3. Tarmo Uustalu. Antifounded coinduction in type theory. See also the workshop program at At PAR'10, we envisage an open, friendly, and inspiring discussion of the latest trends and achievements in the area. Looking forward to seeing you in Edinburgh, -- PAR'10 organising committee From Alex.Simpson at ed.ac.uk Tue May 4 15:39:13 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 04 May 2010 20:39:13 +0100 Subject: [TYPES/announce] PSPL 2010: Programme, registration and student grants Message-ID: <20100504203913.ij2j424n34ks408c@www.staffmail.ed.ac.uk> Proof Systems for Program Logics (PSPL 2010) Saturday 10th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://homepages.inf.ed.ac.uk/als/PSPL2010/ REGISTRATION: Now open. (Early registration discounts apply until May 17th.) STUDENT GRANTS: Still available. Enquiries to pspl2010 at easychair.org PROGRAMME: Invited talks: * Recent developments in concurrent program logics Viktor Vafeiadis (University of Cambridge) * Proof Systems for Hybrid System Logics Andre Platzer (Carnegie Mellon University) Discussion session: * Challenge topics in PSPL Led by Peter O'Hearn and Alex Simpson Contributed talks: * A simple proof system for lock-free concurrency Luis Caires, Carla Ferreira and Antonio Ravara (Universidade Nova de Lisboa) * Tableau-like automata-based axiomatization for Propositional Linear Temporal Logic Nikolay Shilov (Ershov Institute of Informatics Systems, Novosibirsk) * Towards a Cut-free Sequent Calculus for Boolean BI Sungwoo Park and Jonghyun Park (Pohang University of Science and Technology) * A Developer-oriented Hoare Logic Holger Gast (University of Tuebingen) * A Proof System for Reasoning about Probabilistic Concurrent Processes Matteo Mio (University of Edinburgh) * A multi-modal dependent type theory for representing data accessibility in a network Giuseppe Primierio (Ghent University) -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From asperti at cs.unibo.it Wed May 5 03:31:18 2010 From: asperti at cs.unibo.it (Andrea Asperti) Date: Wed, 05 May 2010 09:31:18 +0200 Subject: [TYPES/announce] MSCS Special Issue - Mechanization of Mathematics (second call) Message-ID: <4BE11EC6.6020501@cs.unibo.it> Mathematical Structures in Computer Science Special Issue on Advances and Perspectives in the Mechanization of Mathematics Guest Editors: Andrea Asperti and Jeremy Avigad Call for contributions Recent advances in automated reasoning and interactive theorem proving have made it possible to formalize and mechanically check substantial mathematical theorems, such as the prime number theorem, the four color theorem, and the Jordan curve theorem. In particular, a number of interactive proof assistants have been developed to help users manage libraries of definitions and theorems, and fill in the inferential details of a mathematical argument. Automated methods are also often used to verify calculations that are too long and complex to check by hand. As mathematical proofs become more complicated and, increasingly, rely on extensive calculation, this gives rise to an exciting interaction between traditional methods and computational means of verifying mathematical claims. The present issue is devoted to recent advances and new perspectives in this field, including descriptions of formalizations, thoughtful reflection on the future of the discipline, novel insights, innovative research directions, and critical assessments of the current state of the art. Deadlines Deadline for submissions: June 28, 2010 Author's notification: September 27, 2010 Submissions: All papers should be written in pdf and submitted via the EasyChair system, accessible at the following address: https://www.easychair.org/login.cgi?conf=mscsadvancesandperspectivesint Authors are invited to write their papers following the mscs instructions available in the MSCS guide for contributors downloadable here: http://assets.cambridge.org/MSC/MSC_ifc.pdf. Extended versions of work previously published in conference proceedings are eligible for submission but authors should make it clear how their submission improves upon the conference publication; in those cases where Cambridge University Press is not the publisher of the original conference proceedings, authors should take care to avoid infringing that publisher's copyright. Authors who wish to discuss potential submissions are encouraged to contact the guest editors. Papers should not be longer than 35 pages; shorter papers are obviously welcome. ------------------------------------------------------------ All informations can be found at the following web page: http://www.cs.unibo.it/~asperti/mscs -- Andrea Asperti & Jeremy Avigad From Alex.Simpson at ed.ac.uk Wed May 5 07:59:33 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Wed, 05 May 2010 12:59:33 +0100 Subject: [TYPES/announce] SCTS (Edinburgh, 21st May): Programme and call for participation Message-ID: <20100505125933.8c3d959i6oc0ogc8@www.staffmail.ed.ac.uk> At the meeting announced below, a well-known type theorist promises to overturn an established mathematical definition. -- ******************************************************************** *** Scottish Category Theory Seminar *** Second Meeting *** Friday 21st May 2010, 2-5.30pm *** Informatics Forum, University of Edinburgh, Scotland *** http://homepages.inf.ed.ac.uk/als/SCT/sct100521.html ******************************************************************** We are pleased to announce the programme of the Second Scottish Category Theory Seminar. The meetings is open, and all are welcome to attend. * Invited talk: Antony Maciocia (University of Edinburgh) Triangulated Categories in Algebraic Geometry * Thorsten Altenkirch (University of Nottingham) Monads Need Not Be Endofunctors * Peter Kropholler (University of Glasgow) My Favourite Adjunctions * Invited talk: Dirk Pattinson (Imperial College London) Category-theoretic Proof Theory of Modal Logics For more information see webpage: http://homepages.inf.ed.ac.uk/als/SCT/sct100521.html -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From cesar.a.munoz at nasa.gov Wed May 5 12:05:38 2010 From: cesar.a.munoz at nasa.gov (Munoz, Cesar Augusto (LARC-D320)) Date: Wed, 5 May 2010 11:05:38 -0500 Subject: [TYPES/announce] IWS 2010: Call for Participation In-Reply-To: Message-ID: ------------------------------------------------------------- CALL FOR PARTICIPATION: IWS 2010 International Workshop on Strategies in Rewriting, Proving, and Programming Edinburgh, Scotland, July 9, 2010 http://iws2010.inria.fr iws2010 AT inria DOT fr Affiliated with FLoC (July 9-21, 2010) http://www.floc-conference.org EARLY REGISTRATION DEADLINE: May 17 ------------------------------------------------------------- Strategies are ubiquitous in programming languages, automated deduction and reasoning systems. In the two communities of Rewriting and Programming on one side, and of Deduction and Proof engines (Provers, Assistants, Solvers) on the other side, workshops have been launched to make progress towards a deeper understanding of the nature of strategies, their descriptions, their properties, and their usage, in all kinds of computing and reasoning systems. Since more recently, strategies are also playing an important role in rewrite-based programming languages, verification tools and techniques like SAT/SMT engines or termination provers. Moreover strategies have come to be viewed more generally as expressing complex designs for control in computing, modeling, proof search, program transformation, and access control. FLoC 2010 provides an excellent opportunity to foster exchanges between the communities of Rewriting and Programming on one side, and of Deduction and Proof engines on the other side. This workshop is a joint follow-up of two series of workshops, held since 1997: the Strategies workshops held by the CADE-IJCAR community and the Workshops on Reduction Strategies (WRS) held by the RTA-RDP community. INVITED TALKS Dan Dougherty, Worcester Polytechnic Institute: Game Strategies and Rule-Based Systems Assia Mahboubi, INRIA: Organizing and Using Algebraic Structures in Large Developments of Formalized Mathematics TECHNICAL PROGRAM Pascal Fradet, Jean-Louis Giavitto and Marnes Hoff: Refinement of Chemical Programs Using Strategies Alvaro Garcia, Pablo Nogueira and Emilio Jesus Gallego Arias: The Beta Cube Alex Gerdes, Bastiaan Heeren and Johan Jeuring: Properties of Exercise Strategies Bernhard Gramlich and Felix Schernhammer: Termination of Rewriting with - and Automated Synthesis of - Forbidden Patterns Ian Mackie: Closed Cut-Elimination in Linear Logic Olivier Namet and Maribel Fernandez: A Strategy Language for Graph Rewriting Systems Detlef Plump: Graph Programs Rene Thiemann, Jurgen Giesl, Peter Schneider-Kamp and Christian Sternagel: Loops under Strategies ... Continued PROGRAM COMMITTEE Maria Paola Bonacina, Universita degli Studi di Verona, Italy Jean-Christophe Filliatre, CNRS, France Bernhard Gramlich, Technische Universitaet Wien, Austria Salvador Lucas, Universidad Politecnica de Valencia, Spain Pierre-Etienne Moreau, INRIA-LORIA Nancy, France Natarajan Shankar, SRI International, United States Eelco Visser, Delft University of Technology, Netherlands Christoph Weidenbach, Max Planck Institute for Informatics, Germany ORGANIZERS and CHAIRS Helene Kirchner, INRIA, France Cesar Munoz, NASA, US REGISTRATION (Through FLoC 2010) http://www.floc-conference.org/registration.html From eabonelli at gmail.com Wed May 5 13:21:28 2010 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Wed, 5 May 2010 14:21:28 -0300 Subject: [TYPES/announce] HOR'2010 (Affiliated with RTA'2010) - Call for participation Message-ID: 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ DESCRIPTION HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. The following is a non-exhaustive list of topics for the workshop: * Applications: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools. * Foundations: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. * Frameworks: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. Implementation: explicit substitution, rewriting tools, compilation techniques. * Semantics: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED TALKS Closed nominal rewriting: properties and applications Maribel Fern?ndez (King's College London, UK) Computational interpretations of logic Silvia Ghilezan (University of Novi Sad, Serbia) CONTRIBUTED TALKS * Equivalence of algebraic lambda-calculi Alejandro D?az-caro, Simon Perdrix, Christine Tasson and Beno?t Valiron * Uncurrying for Innermost Termination and Derivational Complexity Harald Zankl, Nao Hirokawa and Aart Middeldorp * A Calculus of Coercions Proving the Strong Normalization of MLF Giulio Manzonetto and Paolo Tranquilli * A new formalism for higher-order rewriting Cynthia Kop * On the Implementation of Dynamic Patterns Thibaut Balabonski * Higher-order Rewriting for Executable Compiler Specifications Kristoffer Rose * Swapping: a natural bridge between named and indexed explicit substitution calculi Ariel Mendelzon, Alejandro R?os and Beta Ziliani * Standardisation for constructor based pattern calculi Delia Kesner, Carlos Lombardi and Alejandro R?os From venneri at dsi.unifi.it Thu May 6 04:19:42 2010 From: venneri at dsi.unifi.it (Betti Venneri) Date: Thu, 06 May 2010 10:19:42 +0200 Subject: [TYPES/announce] ITRS 2010: Call for Participation and Programme Message-ID: <4BE27B9E.2070300@dsi.unifi.it> ======================================================================== CALL FOR PARTICIPATION **ITRS 2010** Fifth Workshop on Intersection Types and Related Systems Edinburgh, UK, 9 July 2010 http://gdn.dsi.unifi.it/itrs/ affiliated with LICS 2010 pre-FLoC'10 workshop ======================================================================== ITRS 2010 is a venue for researchers working on both the theory and practical applications of systems based on intersection types and related approaches. You are invited to participate. REGISTRATION: use FLoC registration page http://www.floc-conference.org/registration.html EARLY REGISTRATION is open and lasts until May 17. WORKSHOP PROGRAMME: Invited Talks * Adriana Compagnoni (Stevens Inst. of Technology, New-Jersey) Church-style and Curry-style Subtyping * Simona Ronchi Della Rocca (Univ. degli Studi di Torino) A Logic Foundation for Intersection and Union Types Contributed Talks *Steffen van Bakel Sound and Complete Typing for Lambda-Mu *Joshua Dunfield Untangling Typechecking of Intersections and Unions *Elena Giachino On Semantic Subtyping and Safe Object-Oriented Sessions *Paola Giannini, Mariangiola Dezani-Ciancaglini and Elena Zucca Intersection types for unbind and rebind *Luca Padovani Session Types = Intersection Types + Union Types *Vilhelm Sj?berg and Aaron Stump Equality, Quasi-Implicit Products, and Large Eliminations For program schedule and more information: http://gdn.dsi.unifi.it/itrs/ -- Betti Venneri Dipartimento di Sistemi e Informatica Universita' di Firenze Viale Morgagni, 65 -50134 Firenze (Italy) http://www.dsi.unifi.it/~venneri From txa at Cs.Nott.AC.UK Thu May 6 08:28:56 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Thu, 6 May 2010 13:28:56 +0100 Subject: [TYPES/announce] DTP 2010: call for participation Message-ID: <8F80FEEA-880C-4013-A46B-BCF7C90B9306@Cs.Nott.AC.UK> (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- Call for Participation EARLY REGISTRATION ENDS 17 MAY 2010 Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Roll up! Roll up! Register early, register often! http://www.floc-conference.org/registration.html Attendance at DTP10 can be yours at a BARGAIN price if you register BEFORE 17 MAY 2010. The preliminary programme for DTP10 is here: http://sneezy.cs.nott.ac.uk/darcs/dtp10/programme.html Invited Talks: Ana Bove, Chalmers University, "10 Years of Partiality and General Recursion" Matthieu Sozeau, Harvard University, "Elaborations in Type Theory" Contributed Talks: Edwin Brady, "Practical, efficient programming with dependent types" James Caldwell, "Extracting Monadic Programs form Proofs", (joint work with Josef Pohl) Adam Chlipala, "Generating Pieces of Web Applications with Type-Level Programming" Nils Anders Danielsson, TBA Larry Diehl, "Unit & integration test composition via lemmas" Makoto Hamana, "Another Initial Algebra Semantics of Inductive Families for Programming" Hugo Herbelin, "A sequent calculus presentation of the Calculus of Inductive Constructions" (joint work with Jeffrey Sarnat, Vincent Siles) Karim Kariso, "Integrating Agda and Automated Theorem Proving Techniques" (joint work with Anton Setzer) Dan Licata, "Security-Typed Programming within Dependently Typed Programming" (joint work with Jamie Morgenstern) Ulf Norell, TBA Carsten Schuermann, "The HOL-Nuprl connection in Delphin", (joint work with Adam Poswolsky) Anton Setzer, "Coalgebras in dependent type theory" Antonis Stampoulis, "VeriML: Type-safe computation of logical terms inside a language with effects" Tarmo Uustalu, TBA Sean Wilson, "Supporting Dependently Typed Functional Programming with Proof Automation and Testing" If, by some chance, you are interested in talking at DTP10, please do get in touch. Space in the programme is now very tight, but we remain open to proposals. See you in Edinburgh in July! Thorsten and Conor From dg at cs.cmu.edu Thu May 6 14:35:14 2010 From: dg at cs.cmu.edu (Deepak Garg) Date: Thu, 06 May 2010 14:35:14 -0400 Subject: [TYPES/announce] PLAS 2010: Call for participation Message-ID: <4BE30BE2.7060203@cs.cmu.edu> *********************************************************************** Call for Participation ACM SIGPLAN Fifth Workshop on Programming Languages and Analysis for Security (PLAS 2010) http://software.imdea.org/events/plas2010/index.html June 10, 2010 Co-located with PLDI 2010, Toronto, Canada *********************************************************************** IMPORTANT INFORMATION Early registration deadline: May 10, 2010 Hotel reduced rate deadline: May 15, 2010 Register at the PLDI website: http://www.cs.stanford.edu/pldi10/ INVITED SPEAKERS * Ranjit Jhala (University of California, San Diego) * Nikhil Swamy (Microsoft Research) ABOUT PLAS PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. Areas of interest include: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques STUDENT TRAVEL GRANTS PLAS 2010 is pleased to offer a limited number of travel grants to student attendees thanks to our sponsors. For details, please visit the PLAS website. PRELIMINARY PROGRAM Efficient, Context-Sensitive Detection for Real-World Semantic Attacks Michael D Bond, Varun Srivastava, Kathryn Mckinley and Vitaly Shmatikov. Permissive Dynamic Information Flow Analysis Tom Austin and Cormac Flanagan. Attack Model for Verification of Interval Security Properties for Smart Card C Codes Pascal Berthom?, Karine Heydemann, Xavier Kauffman-Tourkestansky and Jean-Francois Lalande. A More Precise Security Type System for Dynamic Security Tests Gregory Malecha and Stephen Chong. Position Paper: The Case for JavaScript Transactions Mohan Dhawan, Chung-Chieh Shan and Vinod Ganapathy. Position Paper: Secure Information Flow Analysis for Hardware Design: Using the Right Abstraction for the Job Xun Li, Mohit Tiwari, Ben Hardekopf, Timothy Sherwood and Frederic T Chong. Short Paper: Marker Interfaces and Overlay Type Systems Adrian Mettler and David Wagner. Restricted Delegation and Revocation in Language-Based Security (Position Paper) Doaa Hassan, Mohammadreza Mousavi and Michel Reniers. PROGRAM COMMITTEE Anindya Banerjee (IMDEA Software Institute) (co-chair) Gilles Barthe (IMDEA Software Institute) Avik Chaudhuri (University of Maryland) Veronique Cortier (LORIA, CNRS) Brendan Eich (Mozilla Corporation) Ulfar Erlingsson (Microsoft Research and Reykjavik University) Deepak Garg (Carnegie Mellon University) (co-chair) Andrew D. Gordon (Microsoft Research) Joshua Guttman (Worcester Polytechnic Institute) Shriram Krishnamurthi (Brown University) Sergio Maffeis (Imperial College London) Todd Millstein (University of California, Los Angeles) John Mitchell (Stanford University) Marco Pistoia (IBM TJ Watson Research Center) Andrei Sabelfeld (Chalmers University) Zhendong Su (University of California, Davis) SPONSORS IBM Research IMDEA Software Institute Microsoft Research Mozilla Corporation From Yves.Bertot at sophia.inria.fr Thu May 6 16:40:59 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 06 May 2010 22:40:59 +0200 Subject: [TYPES/announce] Coq-Workshop: Call for informal presentations (updated information) Message-ID: <4BE3295B.9040300@sophia.inria.fr> Coq Workshop Second Call for informal presentations and demonstrations The Coq workshop will take place on July 9th, as part as the FLoC federated conference in Edinburgh, Scotland. The Coq workshop will bring together Coq users, developers and contributors. The workshop will be organized from submitted, informal presentations, invited talks and a plenary discussion on the evolution and design of Coq. Topics of presentations may include any of the following ones: * Experiments with type-theoretic proof assistants * Language or tactics features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools, platforms built on Coq * Plugins, libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Topics that have been experimented with in any flavor of type theory-based theorem proving and are relevant to the evolution of Coq may also be discussed during these informal presentations. Speakers wishing to present a demonstration should bring their own laptop computer or contact the program chair to arrange for a computer to host the demonstration. Descriptions of the proposed informal presentations should consist of abstracts of approximately 1000 words and be uploaded to the easychair system before May 10th. For further questions, please contact Yves Bertot. Yves.Bertot at sophia.inria.fr From sobocinski at gmail.com Fri May 7 12:20:06 2010 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Fri, 7 May 2010 17:20:06 +0100 Subject: [TYPES/announce] *SOS 2010* 2nd call for papers Message-ID: ********************************************************** SOS `10 - Structural Operational Semantics 2010 An Affiliated Workshop of CONCUR 2010 August 30, 2010, Paris, France http://www.ru.is/faculty/luca/SOS2010/ ********************************************************** 2nd CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair by Wednesday, 2nd June 2010. (If you do not have an Easychair account, you can create it by following the link). Papers should take the form of a pdf file in EPTCS format, whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speakers ---------------- MohammadReza Mousavi (Eindhoven, NL) Catuscia Palamidessi (INRIA Saclay and ?cole Polytechnique, FR) Program Committee ----------------- Luca Aceto (Reykjavik, IS, co-chair) Robert Amadio (Paris Diderot, FR) Wan Fokkink (Amsterdam, NL) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL and Cambridge, UK) Cosimo Laneve (Bologna, IT) Andrew Pitts (Cambridge, UK) Michel Reniers (Eindhoven, NL) Grigore Rosu (Urbana-Champaign IL, USA) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Important Dates --------------- Submission of abstract: Friday 28th May 2010 Submission: Wednesday 2nd June 2010 Notification: Monday, 5th July 2010 Final version: Friday 16th July 2010 Workshop: Monday 30th August 2010 From marino.miculan at uniud.it Fri May 7 13:22:32 2010 From: marino.miculan at uniud.it (Marino Miculan) Date: Fri, 7 May 2010 19:22:32 +0200 Subject: [TYPES/announce] LFMTP 2010 at FLoC: Call for participation Message-ID: <56060F80-3664-4507-A801-C2F5ECE0AE02@uniud.it> ----------------------------------------------------------------------------------------------------- CALL FOR Participation Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2010) Wednesday, July 14, 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lfmtp10.dimi.uniud.it/ ----------------------------------------------------------------------------------------------------- EARLY REGISTRATION until 17 MAY 2010 INVITED SPEAKERS: Frank Pfenning (Carnegie Mellon University) Chung-chieh Shan (Rutgers, The State University of New Jersey) CONTRIBUTED TALKS: A Monadic Formalization of ML5 Dan Licata and Robert Harper Pure Type Systems without Explicit Contexts Herman Geuvers, Robbert Krebbers, James McKinna and Freek Wiedijk Representing Isabelle in LF Florian Rabe Explicit substitutions for contextual type theory Andreas Abel and Brigitte Pientka Pattern Unification for the Lambda Calculus with Linear and Affine Types Anders Schack-Nielsen and Carsten Schuermann Closed nominal rewriting and efficiently computable nominal algebra equality Maribel Fernandez and Murdoch Gabbay Generating Bijections between HOAS and the Natural Numbers John Boyland See you in Edinburgh in July! Karl and Marino -- Marino Miculan - Dept Math Compu Sci, University of Udine miculan at dimi.uniud.it http://www.dimi.uniud.it/miculan/ From bpientka at cs.mcgill.ca Mon May 10 06:01:36 2010 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Mon, 10 May 2010 12:01:36 +0200 Subject: [TYPES/announce] Postdoc / PhD position in Computer Science, McGill University Message-ID: ================================================== POSTDOC / PHD POSITION IN COMPUTER SCIENCE School of Computer Science McGill University, Montreal, Canada ================================================= We have one 2-year postdoc position and one funded PhD position in the area of of logical frameworks, type theory, and programming languages. Applicants should have a background in at least one of the following areas: logic, type systems, logical frameworks, theorem proving and/or design and implementation of functional programming languages. McGill University is the top research university in Canada (tied with U. of Toronto, based Macleans's 2005 rankings) and is the only Canadian university to rank consistently among the top 25 universities in the world (most recently it was ranked 12th in Times Higher-QS ranking). McGill is an English language university located in the heart of Montreal, the second largest French-speaking city in the world. Montreal has a reputation for its cosmopolitan atmosphere, history, cultural and sport activities, and excellent restaurants. The city consistently ranks among the most livable cities in world, and the cost of living is among the lowest for cities of its size. For more information concerning the projects we are working on, please see Computation and Logic Group http://complogic.cs.mcgill.ca For more information for prospective students: http://www.cs.mcgill.ca/prospective-students/graduate/GeneralInfo If interested, please contact for more information Brigitte Pientka (bpientka at cs.mcgill.ca) together with a brief research statement and CV. From pmt6sbc at maths.leeds.ac.uk Mon May 10 06:25:28 2010 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 10 May 2010 11:25:28 +0100 (BST) Subject: [TYPES/announce] CiE 2010 - Call for Participation and Informal Presentations Message-ID: <201005101025.o4AAPS5q003983@amsta.leeds.ac.uk> *********************************************************************** Call for Participation and Informal Presentations *********************************************************************** CALL FOR INFORMAL PRESENTATIONS There is a remarkable difference in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-conference proceedings is not able to accommodate this form of scientific communication. Again continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and half a page) by the DEADLINE: MAY 15, 2010. Please submit your abstract electronically, via EasyChair You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission. Let us remind you that we are planning several post-conference publications, which will contain full articles of selected CiE 2010 presentations, including informal presentations. You can find these instructions at http://www.cie2010.uac.pt/contents/call_for_informal_presentations.html We also want to draw attention to the various funding opportunities still available. Please consult http://www.cie2010.uac.pt/contents/student_opportunities.html *********************************************************************** IMPORTANT DATES: Submission of informal presentations: MAY 15 Early registration deadline: MAY 28 Late registration deadline: JUNE 20 *********************************************************************** DETAILS OF PROGRAMME: TUTORIALS: Jeffrey Bub (Information, Computation and Physics), Bruno Codenotti (Computational Game Theory). INVITED SPEAKERS: Eric Allender, Jose L. Balcazar, Shafi Goldwasser, Denis Hirschfeldt, Seth Lloyd, Sara Negri, Toniann Pitassi, and Ronald de Wolf. SPECIAL SESSIONS: Biological Computing, organizers: Paola Bonizzoni, Krishna Narayanan Invited speakers: Natasha Jonoska, Giancarlo Mauri, Yasubumi Sakakibara, Stephane Vialette Computational Complexity, organizers: Luis Antunes, Alan Selman Invited speakers: Eric Allender, Christian Glasser, John Hitchcock, Rahul Santhanam Computability of the Physical, organizers: Cris Calude, Barry Cooper Invited speakers: Giuseppe Longo, Yuri Manin, Cris Moore, David Wolpert Proof Theory and Computation, organizers: Fernando Ferreira, Martin Hyland Invited speakers: Thorsten Altenkirch, Samuel Mimram, Paulo Oliva, Lutz Strassburger Reasoning and Computation from Leibniz to Boole, organizers: Benedikt Loewe, Guglielmo Tamburrini Invited speakers: Nimrod Bar-Am, Michele Friend, Olga Pombo, Sara Uckelman Web Algorithms and Computation, organizers: Thomas Erlebach, Martin Olsen Invited speakers: Hannah Bast, Debora Donato, Alex Hall, Jeannette Janssen SPECIAL TRIBUTE TO MARIAN POUR-EL: Ning Zhong. *********************************************************************** PROGRAMME COMMITTEE: Klaus Ambos-Spies (Heidelberg), Luis Antunes (Porto), Arnold Beckmann (Swansea), Paola Bonizzoni (Milano), Alessandra Carbone (Paris), Steve Cook (Toronto ON), Barry Cooper (Leeds), Erzsebet Csuhaj-Varju (Budapest), Fernando Ferreira (Lisbon, co-chair), Nicola Galesi (Rome), Luis Mendes Gomes (Ponta Delgada), Rosalie Iemhoff (Utrecht), Achim Jung (Birmingham), Michael Kaminski (Haifa), Jarkko Kari (Turku), Viv Kendon (Leeds), James Ladyman (Bristol), Kamal Lodaya (Chennai), Giuseppe Longo (Paris), Benedikt Loewe (Amsterdam), Elvira Mayordomo (Zaragoza, co-chair), Wolfgang Merkle (Heidelberg), Russell Miller (New York NY), Dag Normann (Oslo), Isabel Oitavem (Lisbon), Joao Rasga (Lisbon), Nicole Schweikardt (Frankfurt), Alan Selman (Buffalo NY), Peter van Emde Boas (Amsterdam), Albert Visser (Utrecht) http://www.cie2010.uac.pt/ __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From kremer at lsv.ens-cachan.fr Mon May 10 15:50:20 2010 From: kremer at lsv.ens-cachan.fr (Steve Kremer) Date: Mon, 10 May 2010 21:50:20 +0200 Subject: [TYPES/announce] SecReT 2010 Call for Participation Message-ID: <4BE8637C.8080306@lsv.ens-cachan.fr> *********************************************************************** Call for Participation 5th International Workshop on Security and Rewriting Techniques (SecReT 2010) http://users.dsic.upv.es/workshops/secret2010/ Valencia (Spain), June 18-20. *********************************************************************** IMPORTANT INFORMATION Early registration deadline: June 6, 2010 INVITED SPEAKERS - Bruno Blanchet (LIENS, France) - Ralf Kuesters (Univ. Trier, Germany) - Catherine Meadows (NRL, USA) - Micha?l Rusinowitch (INRIA, France) AIMS AND SCOPE We need to increase our confidence in security related applications. Formal verification is one of the most important methods of achieving this goal, and term rewriting has already played an important part. In particular, since the beginning of formal verification of security protocols, term rewriting has played a central role, both as a computation model and as a deduction strategy. Because of this, we believe that it can play an important role in solving other security-related formal verification problems as well. That is why it is important to bring together experts in term rewriting, constraint solving, equational reasoning on the one side and experts in security on the other side. This is precisely the aim of this workshop. A possible (non exhaustive) list of topics include application of rewriting or constraint solving to authentication, encryption, access control and authorization, protocol verification, specification and analysis of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. ACCEPTED PAPERS Automating security analysis: symbolic equivalence of constraint systems Vincent Cheval, Hubert Comon-Lundh and Stephanie Delaune Deducibility constraints Sergiu Bursuc, Hubert Comon-Lundh and Stephanie Delaune Semi-Automatic Synthesis of Security Policies by Invariant-Guided Abduction Cl?ment Hurlin and Helene Kirchner Efficient XOR Unification Zhiqiang Liu and Christopher Lynch Sequential Protocol Composition in Maude-NPA Santiago Escobar, Catherine Meadows, Jose Meseguer and Sonia Santiago Rule-based Specification and Analysis of Security Policies Tony Bourdier, Horatiu Cirstea, Mathieu Jaume and Helene Kirchner. Maude-NPA Tool Demo Santiago Escobar, Catherine Meadows and Jose Meseguer Automated Abstract Certification of Global Non-interference in Rewriting Logic Mauricio Alba-Castro, Mar?a Alpuente and Santiago Escobar Finitary Deduction Systems Yannick Chevalier and Mounira Kourjieh Geometric Logic and Strand Spaces Daniel Dougherty and Joshua Guttman Deciding trace equivalence for finite cryptographic process calculi Rohit Chadha, Stefan Ciobaca and Steve Kremer Abstractions for Verifying Key Management APIs Graham Steel PROGRAM COMMITTEE Yannick Chevalier (IRIT, Toulouse, France) Hubert Comon-Lundh (LSV, Cachan, France) Daniel Dougherty (WPI, Worcester, USA) Santiago Escobar (Univ. Polit?cnica Valencia, Spain) Steve Kremer (LSV, Cachan, France) - co-chair Christopher Lynch (Clarkson Univ., USA) Jos? Meseguer (Univ. Illinois, USA) Paliath Narendran (SUNY Albany, USA) - co-chair From Stephan.Merz at loria.fr Tue May 11 11:24:45 2010 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Tue, 11 May 2010 11:24:45 -0400 Subject: [TYPES/announce] iFM 2010: final CFP and deadline extension Message-ID: [New information: extended deadlines, invited speakers, satellite events] Apologies for multiple copies of this CFP ---------------------------------------------------------------------------------------------------- CALL FOR PAPERS 8th International Conference on Integrated Formal Methods (iFM 2010) October 11-14, 2010, Nancy, France http://ifm2010.loria.fr/ Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Integration of formal modeling and analysis methods - Integration of formal and semi-formal modeling and analysis methods - Integration of formal methods into software engineering practice - Semantics, Logics, Type systems - Verification, Model checking, Static analysis, Theorem proving - Refinement, Model transformations - Tools, Experience reports, Case studies Invited Speakers: - Christel Baier, TU Dresden - John Fitzgerald, Newcastle University - Rajeev Joshi, Laboratory for Reliable Software, JPL iFM 2010 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. All papers must be original, unpublished, and not submitted for publication elsewhere. Submission will be electronically as PDF or Postscript, using the Springer LNCS format. Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. The conference proceedings will be published by Springer Verlag in the LNCS series. Important Dates: - Abstract submission: May 21, 2010 (* extended *) - Full paper submission: May 28, 2010 (*extended *) - Notification: July 4, 2010 - Final version: July 18, 2010 Satellite events: - Workshop "Formal Methods for Web Data Trust and Security" (WTS 2010) http://acxml.gforge.inria.fr/WTS10 - Tutorial "Verification of C# programs using Spec# and Boogie 2" by Rosemary Monahan - Tutorial "The TLA+ Proof System" by Denis Cousineau and Stephan Merz Contact: ifm2010 at loria.fr From david.delahaye at cnam.fr Tue May 11 18:55:31 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Wed, 12 May 2010 00:55:31 +0200 (CEST) Subject: [TYPES/announce] Calculemus 2010: Deadline Extension for Emerging Trends Message-ID: <60899.87.231.38.95.1273618531.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ---------------------------------------------------------- CALCULEMUS 2010 - Deadline Extension for Emerging Trends ---------------------------------------------------------- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ *********************************** >>>> DEADLINE EXTENSION <<<< Submission deadline: May 19, 2010 *********************************** Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission ========== Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all emerging trends papers to a (light) peer review. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings =========== Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates =============== For extended abstracts on emerging trends: Submission deadline: May 19, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 6-7, 2010. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From gvidal at dsic.upv.es Wed May 12 03:47:46 2010 From: gvidal at dsic.upv.es (German Vidal) Date: Wed, 12 May 2010 09:47:46 +0200 Subject: [TYPES/announce] CICLOPS-WLPE 2010 at FLoC: Call for Participation Message-ID: <2C9ABE28-BCA5-4DAA-93F8-8C250A34BA00@dsic.upv.es> [Apologies for multiple copies of this announcement] ******************************************************************* Call For Participation CICLOPS-WLPE 2010 Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments Edinburgh, Scotland, U.K. July 15, 2010 http://users.dsic.upv.es/~ciclops-wlpe10/ Satellite event of the 26th International Conference on Logic Programming (ICLP 2010) http://www.floc-conference.org/ICLP-home.html ******************************************************************* IMPORTANT DEADLINES: * early registration deadline: 17 May 2010 * standard registration: 18 May 2010 - 30 June 2010 * late registration: after 30 June 2010 Registration, accomodation, and travel/visa information for all FLoC conferences and workshops is on the FLoC 2010 web pages: http://www.floc-conference.org/ INVITED TALKS: Programming with Boolean Satisfaction Michael Codish, Ben-Gurion University of the Negev (Israel) Solving Constraint Satisfaction Problems by a SAT Solver Naoyuki Tamura, Kobe University (Japan) ACCEPTED PAPERS: - Peter Biener, Fran?ois Degrave and Wim Vanhoof A Test Automation Framework for Mercury - Petra Hofstedt Realizing evaluation strategies by hierarchical graph rewriting - Nicos Angelopoulos and Paul Taylor An extensible web interface for databases and its application to storing biochemical data - Paulo Moura Meta-Predicate Semantics - Jan Wielemaker and V?tor Santos Costa Portability of Prolog programs: theory and case-studies - Dimitar Shterionov, Angelika Kimmig, Theofrastos Mantadelis and Gerda Janssens DNF Sampling for ProbLog Inference - Vasco Pedro and Salvador Abreu Distributed Work Stealing for Constraint Solving - Paulo Andr? and Salvador Abreu Casting the WAM as an EAM Workshop organizers: German Vidal DSIC, Universidad Politecnica de Valencia Camino de Vera S/N, 46022 Valencia, Spain http://www.dsic.upv.es/~gvidal/ Neng-Fa Zhou Department of Computer and Information Science, Brooklyn College The City University of New York 2900 Bedford Avenue, Brooklyn, NY 11210-2889 http://www.sci.brooklyn.cuny.edu/~zhou/ From mjas at imm.dtu.dk Wed May 12 10:47:51 2010 From: mjas at imm.dtu.dk (Michael Smith) Date: Wed, 12 May 2010 16:47:51 +0200 Subject: [TYPES/announce] MLQA 2010 - Models and Logics for Quantitative Analysis: Call for Posters and Participation Message-ID: Second Annual Meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA 2010) http://wiki.ercim.eu/wg/MLQA/index.php/July_2010:_MLQA_meeting_at_FLoC_2010%2C_Edinburgh July 9th, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference (FLoC 2010) Affiliated with Logic in Computer Science (LICS 2010) *** CALL FOR PARTICIPATION *** We invite all interested researchers and PhD students to participate at MLQA 2010. Registration is via the FLoC website: http://www.floc-conference.org/registration.html Note that the deadline for early registration is 17th May. *** CALL FOR POSTERS *** Important dates: ----------------------------------------------------- Abstract submission: June 18th, 2010 Submission deadline (strict): June 25th, 2010 Author notification: June 28th, 2010 Meeting: July 9th, 2010 ----------------------------------------------------- We invite posters under two categories: - Presentation of recent or on-going work relating to models, logics, tools, and/or applications with respect to discrete, stochastic and/or continuous systems and properties. - Overview of the recent research activities of a group, in relation to the themes of MLQA. We equally encourage submissions from both research leaders, and junior researchers and PhD students. Posters should be readable in size A3, and should be submitted in pdf format to mlqa at imm.dtu.dk. They will be printed in size A1, if the FLoC organisers permit. Notification of your intention to submit, along with a title and short description of the poster, should be sent by June 18th. We require that we receive the final poster no later than June 25th, in order for us to print it before the meeting. We will print and transport every accepted poster, although if a poster does not print as expected, we may require you to print it yourself. -- Flemming Nielson (acting chairman of MLQA) Michael Smith, Nataliya Skrupnyuk (poster session organisers) http://wiki.ercim.eu/wg/MLQA From Yves.Bertot at sophia.inria.fr Thu May 13 12:51:06 2010 From: Yves.Bertot at sophia.inria.fr (Yves Bertot) Date: Thu, 13 May 2010 18:51:06 +0200 Subject: [TYPES/announce] [Cfp] Coq Workshop, Edinburgh, July 9, Program and call for participation Message-ID: <4BEC2DFA.6090407@sophia.inria.fr> Dear Colleague, Please consider attending the Federated Logic Conference (FLoC) and especially the Coq Workshop (Coq-2) Edinburgh, July 9th, 2010 The early registration deadline is May 17th. http://www.floc-conference.org http://coq.inria.fr/coq-workshop/2010 The Coq workshop will bring together Coq users, developers and contributors. It will be organized from submitted and refereed presentations and more informal presentations. Please register and come participate in the discussions, even if you do not wish to submit any talks. The workshop organizers PROGRAM FOR THE COQ WORKSHOP ============================ Inductive Proof Automation for Coq by Sean Wilson, Jacques Fleuriot and Alan Smaill Heq: A Coq library for Heterogeneous Equality by Chung-Kil Hur Proof Trick: small Inversions by Jean-Fran?ois Monin Strengthening the inversion Tactic in Coq by anne mulhern Mixed induction-coinduction at work for Coq by Keiko Nakata and Tarmo Uustalu Certification of a chain for deductive program verification by Paolo Herms Invited talk (title to be announced later) by Hugo Herbelin Rewriting Modulo Associativity and Commutativity by Thomas Braibant and Damien Pous Developing the algebraic hierarchy with type classes in Coq by Bas Spitters, Eelis van der Weegen Experience of interfacing Coq+SSReflect and GAP by Vladimir Komendantsky, Alexander Konovalov and Steve Linton Root isolation for one-variable polynomials by Yves Bertot and Assia Mahboubi From nick at microsoft.com Fri May 14 11:09:06 2010 From: nick at microsoft.com (Nick Benton) Date: Fri, 14 May 2010 15:09:06 +0000 Subject: [TYPES/announce] LOLA 2010 Programme and call for participation Message-ID: <829B73AE2485A845AD2F3EEA8C98E238141C6584@TK5EX14MBXC136.redmond.corp.microsoft.com> ============================================================ *** CALL FOR PARTICIPATION *** LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ ============================================================ IMPORTANT DEADLINES: * early registration deadline: 17 May 2010 * standard registration: 18 May 2010 - 30 June 2010 * late registration: after 30 June 2010 Registration, accomodation, and travel/visa information for all FLoC conferences and workshops is on the FLoC 2010 web pages: http://www.floc-conference.org/ WORKSHOP PROGRAMME: INVITED TALKS: * G?rard Berry (INRIA, Coll?ge de France). What could be the right balance between abstract and fine-grain computational properties? * Dan Ghica (University of Birmingham). Geometry of Synthesis: Semantics-directed hardware compilation. * Alex Simpson (LFCS, University of Edinburgh). Linear types for continuations. CONTRIBUTED TALKS: * Magnus O. Myreen & Michael J. C. Gordon. Machine code: architecture-independent formal verification and proof-producing compilation. * Ugo Dal Lago On the Role of Interaction in Implicit Computational Complexity. * Nick Benton & Chung-Kil Hur. Step-Indexing: The Good, the Bad and the Ugly. * Guilhem Jaber & Nicolas Tabareau. Krivine realizability for compiler correctness. * Shin-ya Katsumata & Rasmus Mogelberg. Fullness of monadic translation by TT-lifting. * Rasmus Mogelberg & Sam Staton. Full abstraction in a metalanguage for state. * Antoine Madet & Roberto Amadio & Patrick Baillot. An Affine-Intuitionistic System of Types and Effects: Confluence and Termination. * Nathaniel Charlton & Bernhard Reus. A deeper understanding of the deep frame axiom. ALL THIS, PLUS: a thrilling panel discussion! DESCRIPTION OF THE WORKSHOP: It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants. PROGRAMME COMMITTEE: * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * Fran?ois Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) From Maribel.Fernandez at kcl.ac.uk Sun May 16 13:54:00 2010 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Sun, 16 May 2010 18:54:00 +0100 Subject: [TYPES/announce] UNIF 2010 at FLoC - 14 July 2010 - Call for participation Message-ID: <4BF03138.8040109@kcl.ac.uk> CALL FOR PARTICIPATION UNIF 2010 24th International Workshop on Unification 14 July 2010 Edinburgh, UK A FLoC workshop associated to RTA and IJCAR http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html ================================================================== This workshop promotes research and collaboration in the area of unification theory and related fields, including constraint solving and applications of unification to theorem proving and programming languages. Invited Speakers: Claude Kirchner, France Christian Urban, Germany Programme: ---------------------------------- Session 1 - 9.00-10.00 Claude Kirchner (Invited Speaker) Antipatterns: how to say what you don't want to match to 10.00-10.30 Coffee Break Session 2 - 10.30-11.00 Sunil Kothari and James Caldwell. A Machine Checked Model of Idempotent MGU Axioms For a List of Equational Constraints 11.00-11.30 Franz Baader and Barbara Morawska. SAT Encoding of Unification in EL 11.30-12.00 Deepak Kapur, Andrew Marshall and Paliath Narendran. Unification modulo a partial theory of exponentiation 12.00-12.30 Conrad Rau and Manfred Schmidt-Schauss. Towards Correctness of Program Transformations Through Unification and Critical Pair Computation 12.30-14.00 Lunch Session 3 - 14.00-15.00 Christian Urban (Invited Speaker). Nominal Unification - Hitting a Sweet Spot 15.00-15.30 Coffee Break Session 4 - 15.30-16.00 Christophe Calv?s. Nominal Theory as an Extension of First-Order Theory 16.00-16.30 Sergiu Bursuc and Cristian Prisacariu. Unification and matching in separable theories 16.30-17.00 Zhiqiang Liu and Christopher Lynch. Efficient XOR Unification 17.00-17.30 Paliath Narendran, Andrew Marshall and Bibhu Mahapatra. On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity ------------------------------- Programme Committee: Maribel Fern?ndez, UK (chair) Temur Kutsia, Austria Jordi Levy, Spain Christopher Lynch, US Cathy Meadows, US Gianfranco Rossi, Italy Laurent Vigneron, France For more information and registration details please see the workshop webpage: http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html -------------------------------------------------------------- From gerwin.klein at nicta.com.au Sun May 16 19:51:00 2010 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Sun, 16 May 2010 19:51:00 -0400 Subject: [TYPES/announce] 2nd CFP: SSV'10 @ USENIX OSDI 2010 Message-ID: The deadline is drawing closer: 2nd Call for Papers 5th International Workshop on Systems Software Verification (SSV'10) Real Software, Real Problems, Real Solutions October 6-7, Vancouver, Canada co-located with OSDI'10 http://usenix.org/events/ssv10/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum discusses software analysis and development techniques and tools; it will serves as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems level code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (at most 9 pages, 8.5" x 11", including figures, tables, and references, formatted in two columns, using 10 point type on 12 point (single-spaced) leading, with the text block being no more than 6.5" wide by 9" deep) to https://papers.usenix.org/hotcrp/ssv10/ by June 4th 2010 Samoan time. All papers will be subject to peer review under conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published online by USENIX. Submissions must be in pdf format and follow the USENIX style instructions above. Important dates 28.05.2010 Abstract Deadline 04.06.2010 Submission Deadline 20.07.2010 Notification of accepted papers 20.08.2010 Final version 06.10.2010 Workshop The workshop is organized as a 1.5-day workshop (Oct 6-7, 2010). Location The workshop will be held in Vancouver, Canada, co-located with OSDI'10. Program Chair Ralf Huuck (NICTA & UNSW, Australia) Gerwin Klein (NICTA & UNSW, Australia) Bastian Schlich (ABB Corporate Research, Germany) Program Committee Adam Chlipala (Harvard University, USA) Dino Distefano (Queen Mary University London, UK) Klaus Havelund (Jet Propulsion Laboratory, USA) Chris Hawblitzel (Microsoft Research, USA) Andy King (University of Kent, UK) Stefan Kowalewski (RWTH Aachen University, Germany) Kim Larsen (Aalborg University, Denmark) John Matthews (Galois Inc, USA) Thomas Noll (RWTH Aachen University, Germany) Wolfgang Paul (University of Saarbruecken, Germany) Jan Peleska (University of Bremen, Germany) John Regehr (University of Utah, USA) Wolfram Schulte (Microsoft Research, USA) Zhong Shao (Yale University, USA) Junfeng Yang (Columbia, USA) Kwangkeun Yi (Seoul National University, South Korea) We thank our sponsors NICTA and Microsoft Research for their support. From pangjun at gmail.com Mon May 17 05:23:44 2010 From: pangjun at gmail.com (Jun PANG) Date: Mon, 17 May 2010 11:23:44 +0200 Subject: [TYPES/announce] Call for participation: VTSA 2010 Summer School on Verification Technology, Systems & Applications Message-ID: **************************************************************** Summer School on Verification Technology, Systems & Applications http://www.mpi-inf.mpg.de/VTSA10/ Application Deadline: 07/23/2010 Notification until: 08/06/2010 Summer School: 09/06/2010 - 09/10/2010 **************************************************************** A summer school on verification technology, systems and applications will be organized by the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxemburg, in cooperation with the Max-Planck Institute f?r Informatik in Saarbr?cken and the INRIA research center in Nancy. The school will take place from September 6th to 10th 2010 in Luxembourg. The following speakers have accepted to give courses: Javier Esparza: Building a Software Model-Checker Wan Fokkink: Protocol Validation with mCRL Marta Kwiatkowska: Probabilistic Model Checking Markus M?ller-Olm: Fundamentals of Software Model Checking Wang Yi: Modeling and Analysis of Timed Systems Participation is free (except for travel and accommodation costs) and open to anybody holding at least a Bachelor degree (or equivalent) in computer science. The number of participants is limited. Please apply electronically by *July 23th, 2010* by sending - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your bachelor certificate (or equivalent or higher) to jun.pang at uni.lu. For details please see the Web page of the school. From s.a.herhut at herts.ac.uk Mon May 17 05:59:39 2010 From: s.a.herhut at herts.ac.uk (Stephan Herhut) Date: Mon, 17 May 2010 10:59:39 +0100 Subject: [TYPES/announce] PhD studentships in compiler and language design for high-performance, massively parallel systems Message-ID: We are pleased to announce the availability of funded PhD positions in the Compiler Technology and Computer Architecture group at the University of Hertfordshire. The positions comprise an open studentship and we expect prospective candidates to propose their own line of research within the group's wide area of interest. The University of Hertfordshire near London was one of the first academic institutions in the United Kingdom to offer a degree in computer science. Today, the university is the UK's leading business-facing university with strong industrial ties and an international outreach. The Compiler Technology and Computer Architecture group is part of the School of Computer Science and the Centre for Computer Science and Informatics Research. Our research is focused around the interface between software and computer architectures. We are the main contributors for the two programming languages Single Assignment C and S-Net, both of which cater for high-level specifications of concurrent programs. Single Assignment C is a functional array-programming language with a C like syntax and APL/MATLAB like programming model. The corresponding compiler suite has been in development for 15+ years. Today, it supports auto-parallelisation for a range of architectures, including legacy multi-cores and NVIDIA CUDA. Current research focuses on extending the reach of SAC to novel architectures like the University of Amsterdam's Microgrid and Intel's SCC. S-Net is a language for concurrency engineering. S-Net programs are algebraic formulae that describe the communication pattern of an algorithm on an abstract level. Using our compilation technology, we are able to generate concurrent and distributed implementations from an S-Net specification. Current research in S-Net focuses on adaptivity, real-time support and extending the platform reach. Across both languages, we are interested in the generalisation of parallel programming principles. As part of the Google summer of code, we contribute generalised high-level vector primitives to the GCC project. We work on abstractions for broad-ranged run-time systems supporting various forms of concurrency. This work applies modern operating systems aspects across various platforms including GPGPUs, FPGAs and embedded systems. Our work also embodies applications of recent advances in type theory to further enhance expressiveness and to boost run-time efficiency. Ongoing projects include work on a user-specifiable type-system for SAC and a redesign and extension of the S-Net type-system using qualified types and extensible record-types. Furthermore, we are interested in using partial evaluation and abstract interpretation techniques to solve problems that were usually addressed by type systems and SMT solvers. Adequate spoken and written English skills, as well as command of a functional and an imperative programming language are required. A good bachelor's degree is mandatory, a master's degree a plus. Our group is international and we cooperate widely. Good communication skills, an interest to present on international venues as well as the ability to play in a team are essential. Further details on the available PhD positions can be found at http://www.jobs.ac.uk/job/AAZ241/phd-studentships/ The deadline for applications is the end of May. However, shortlisting will start 19th of May. Details on the group can be found at the group's website http://ctca.feis.herts.ac.uk/ Previous and current projects include http://www.aether-ist.org self-adaptive computing http://www.apple-core.info multi-core architectures and programming models http://www.project-advance.eu dynamic adaptation and optimisation http://www.sac-home.org data-parallel array-programming language http://www.snet-home.org language for concurrency engineering Prospective applicants are encouraged to contact Sven-Bodo Scholz (S.Scholz at herts.ac.uk) to discuss potential research projects before applying. -- Stephan Herhut Centre for Computer Science and Informatics Research Science and Technology Research Institute University of Hertfordshire -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100517/434d3a53/attachment-0001.htm From sunj at comp.nus.edu.sg Tue May 18 07:09:56 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Tue, 18 May 2010 19:09:56 +0800 Subject: [TYPES/announce] Call for Participation - The Fourth IEEE International Conference on Secure Software Integration and Reliability Improvement (SSIRI'10) Message-ID: Call for Participation -------------------------- The Fourth IEEE International Conference on Secure Software Integration and Reliability Improvement (SSIRI) will be in Singapore during 9-11 June 2010. SSIRI'10 aims to continue the tradition of SSIRI to advance the understanding and expertise in the areas: Security, Reliability, Availability, and Safety of Software Systems, Fault Tolerance for Software Reliability Improvement, Modeling, Prediction, Simulation, Evaluation, Validation, Verification, Testing, Automated Tools and Industry Best Practices. This year's conference has a strong technical program. In addition to four keynote addresses by Jim Davies (Oxford U), Jim Woodcock (York U), Tim Grance (NIST) and Wei-Ngan Chin (NUS), it also includes a selection of rigorously refereed papers in the regular paper sessions, short paper sessions, fast abstracts, and doctoral programs. There are two co-located workshops, tutorials and a pre-conference course on model checking as well. Here are listed events: 26-27 May: Two days course on "Model Checking Safety and Security Systems" http://www.comp.nus.edu.sg/~pat/SSIRI2010/course/ 7-8 June: Tutorials Make Six Sigma Tools Work for You in Developing Superior Products (2 days course) -- Orange Belt Training by Dr. Samuel J. Keene, Fellow of IEEE and Six Sigma Senior Master Black Belt Master Practical Risk-Based Testing (one day course on 8 June) -- By Dr. Rajesh Subramanyan from Siemens http://www.comp.nus.edu.sg/~pat/SSIRI2010/tutorials.shtml Main Conference Program (including keynotes, regular/short papers, workshops etc): http://www.comp.nus.edu.sg/~PAT/SSIRI2010/SSIRIPreliminary-Program.pdf or http://paris.utdallas.edu/ssiri10/02-Preliminary-Program-H-2010-05-11.pdf Registration website: http://www.comp.nus.edu.sg/~pat/MoCSeRS2010/registration.shtml (Discount for ACM, IEEE and SCS members) Conference general information: http://paris.utdallas.edu/ssiri10/ Best Regards Jin-Song (SSIRI 2010 General Chair) ---------- Dr. DONG, Jin-Song Associate Professor, School of Computing National University of Singapore, ph: +65-65164353 fax: +65-67794580 http://www.comp.nus.edu.sg/~dongjs/ -- yours, Sun Jun -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100518/ae81a429/attachment.htm From svb at doc.ic.ac.uk Tue May 18 07:42:52 2010 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Tue, 18 May 2010 12:42:52 +0100 Subject: [TYPES/announce] Second Call for Papers CL&C'10 Message-ID: As usual, apologies for multiple copies and cross postings. 2nd Call for Papers International Workshop on Classical Logic and Computation (CL&C'10) http://www.doc.ic.ac.uk/~svb/CLaC10 21-22 August 2010 Brno, Czech Republic CL&C'10 is a joint workshop with PECP and a satellite of the federated conferences CSL and MFCS IMPORTANT DATES Deadline for abstract: June, 13, 2010 Deadline for submission: June, 27, 2010 Notification of acceptance: July, 17, 2008 Final version due: July, 27, 2010 Workshop date: August, 21-22, 2010 INTRODUCTION CL&C'10 is the third of a conference series on "Classical Logic and Computation". It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as part of CSL and MFCS, jointly with PECP (Program Extraction and Constructive Proofs): http://www.cs.swansea.ac.uk/~csmona/pecp.html Through these two workshops we wish to honour Prof. Helmut Schwichtenberg's many important contributions to both fields. CL&C is focused on the interplay between program extraction from classical proofs and computer science, while PECP will focus on recent developments in Applied Proof Theory and Constructive Mathematics. The two fields have a substantial common interest, namely the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic, - design of programming languages inspired by classical logic, - cut-elimination for classical systems, - proof representation and proof search for classical logic, - translations of classical to intuitionistic proofs, - constructive interpretation of non-constructive principles, - witness extraction from classical proofs, - constructive semantics for classical logic (e.g. game semantics), - case studies (for any of the previous points). SUBMISSION AND PUBLICATION, This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. All submitted papers will be reviewed to normal standards. The PC recognises two kinds of papers: it will distinguish between accepted (full) papers that contain unpublished results not submitted elsewhere, and presentations of (short) papers about work in progress. The accepted papers will appear in EPTCS. Post-proceedings of CL&C'06 and CL&C'08 were published as special issues of APAL, for which an open call for papers was sent. A special issue of a journal, with the post-proceedings of CL&C'10, is being considered. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at http://www.easychair.org/conferences/?conf=clac10 A participants' proceedings will be distributed at the workshop. INVITED KEYNOTE SPEAKERS (Jointly with PECP) * Helmut Schwichtenberg (Munich) * Michael Rathjen (Leeds) (further speakers to be announced) PROGRAMME COMMITTEE * Bernard Reus (Sussex) * Hugo Herbelin (Inria Paris) * Richard McKinley (Bern) * Stefano Berardi (Turin) - co-chair * Steffen van Bakel (Imperial College London) - co-chair * Stephane Lengrand (LIX Paris) * Ugo de'Liguoro (Turin) * Ulrich Berger (Swansea) - co-chair * Zhaohui Luo (Royal Holloway London) CONTACT u.berger at swansea.ac.uk From ldixon at inf.ed.ac.uk Tue May 18 11:30:21 2010 From: ldixon at inf.ed.ac.uk (Lucas Dixon) Date: Tue, 18 May 2010 16:30:21 +0100 Subject: [TYPES/announce] Automatheo 2010 at FLoC: Call for Participation and Registration Message-ID: <4BF2B28D.8090302@inf.ed.ac.uk> Call for PARTICIPATION and REGISTRATION AUTOMATHEO 2010 The 2010 Workshop on Automated Mathematical Theory Exploration http://dream.inf.ed.ac.uk/events/automatheo-2010/ 14-15 July 2010, Edinburgh, UK a FLoC 2010 affiliated workshop of IJCAR and ITP. Important Dates: Notification of accepted presentation: 2 June 2010 Early registration: 30 June 2010 Workshop: 14-15 July 2010 About the Automatheo workshop: Automated mathematical theory exploration is an exciting emerging research topic for mathematicians, developers of formalised mathematics, and those working on verified software. It concerns the theory and practice of software systems for developing new mathematical theories, including the invention of definitions, theorems, conjectures, problems, examples and algorithms. The workshop aims to highlight the research area and foster collaboration amongst those working in software verification, formalised mathematics, and mathematical research, as well as help provide a shared understanding of the theory and tools for automated discovery of mathematical theories. To facilitate dissemination of knowledge as well as interaction between researchers, the programme will start with talks and be followed by demos, tutorials, and discussion sessions. Participants will experiment with and use the various systems, pose challenge problems, and develop a clear understanding of the available technologies, concepts, and challenges. Invited Speakers: John Harrison and Dana S. Scott Registration: Registration is separate from the FLoC procedure. Please register for Automatheo online: http://dream.inf.ed.ac.uk/events/automatheo-2010/ Early registration is until June 30, 2010, and costs ?75 (?35 for students). Later registration costs: ?95 (?55 for students). Due to the size of the venue, the workshop will to be limitted to 35 participants. Programme Commitee: Jacques Calmet Jacques Carette Adrian Craciun Lucas Dixon (co-chair) Bogdan Grechuk Moa Johansson Temur Kutsia Roy McCasland (co-chair) Alison Pease Florina Piroi Alan Smaill (co-chair) David Stanovsky Cristian Urban Wolfgang Windsteiger Previous Workshops: Automatheo 2009, at the Johannes Kepler University Linz, Austria. http://www.risc.jku.at/about/conferences/automatheo09/ -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From sunj at comp.nus.edu.sg Tue May 18 19:23:15 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Wed, 19 May 2010 07:23:15 +0800 Subject: [TYPES/announce] Call for Paper: The 3rd International Symposium on Unifying Theories of Programming Message-ID: Apologies if you've received multiple copies. *************************************************************************************************** UTP 2010 The 3rd International Symposium on Unifying Theories of Programming co-located with the 12th International Conference on Formal Engineering Methods (ICFEM 2010) *** Call For Papers *** Shanghai, China 15-16 November, 2010 http://www.sei.ecnu.edu.cn/utp2010 http://www.easychair.org/conferences/?conf=utp10 **************************************************************************************************** Following on the success of UTP 2006 (County Durham, UK) and UTP 2008 (Dublin, Ireland), we are pleased to announce the UTP 2010 symposium, to be held in Shanghai, China in November 2010, co-located with ICFEM 2010, the 12th International Conference on Formal Engineering Methods. Based on the pioneering work on Unifying Theories of Programming by Tony Hoare, He Jifeng and others, the aims of the UTP Symposium series are to continue to reaffirm the significance of the ongoing UTP project, to encourage efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. Of particular interest is how unification may be used to meet the goals and difficulties to be encountered in the Grand Challenges of Computing, with particular reference to the UK's "GC6: Dependable Systems Evolution" and its international cousin the "Verified Software Initiative" and their shared goal of developing a Verified Software Repository. To this end the UTP 2010 symposium welcomes contributions on the above themes as well as others which can be related to them. Such additional themes include, but are not limited to, relational semantics, relational algebra, healthiness conditions, normal forms, linkage of theories, algebraic descriptions, incorporation of probabilistic programming, timed calculi and object-based descriptions, as well as alternative programming paradigms such as functional, logical, data-flow, and beyond. In all cases, the UTP approach should be compared and advantages/disadvantages discussed. Accepted papers will be published in the symposium proceedings by Springer as a volume of the Lecture Notes in Computer Sciences. It is also planned to have a special journal issue of Formal Aspects of Computing for revised/extended versions of selected best papers from the UTP 2010 symposium. Papers should be written in English not exceeding 20 pages in LNCS format (http://www.springer.de/comp/lncs/authors.html). Submission will be via the web-based easychair system. Important Dates --------------- Abstract submission deadline: 4th June, 2010 Full-paper submission deadline: 11th June, 2010 Author notification: 30th July, 2010 Final version due: 13th August, 2010 Symposium: 15-16th November, 2010 Program Committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Hugh Anderson, National University of Singapore, Singapore Phil Brooke, University of Teesside, UK Andrew Butterfield, Trinity College Dublin, Ireland Ana Cavalcanti, University of York, UK Yifeng Chen, Peking University, China Deepak D'Souza, IISC, India Steve Dunne, University of Teesside, UK Colin Fidge, Queensland University of Technology, Australia Jeremy Gibbons, University of Oxford, UK Lindsay Groves, Victoria University of Wellington, New Zealand Will Harwood, University of York, UK Ian Hayes, University of Queensland, Australia Arthur Hughes, Trinity College Dublin, Ireland Jeremy Jacob, University of York, UK Xiaoshan Li, University of Macao, Macao SAR, China Zhiming Liu, UNU/IIST, Macao SAR, China Annabelle McIver, Macquarie University, Australia David Naumann, Stevens Institute of Technology, USA Geguang Pu, East China Normal University, China Shengchao Qin (chair), Durham University, UK Zongyan Qiu, Peking University, China Bill Stoddart, University of Teesside, UK Jun Sun, National University of Singapore, Singapore Meng Sun, CWI, the Netherlands Naijun Zhan, Institute of Software, CAS, China Huibiao Zhu, East China Normal University, China -- yours, Sun Jun -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100518/f6ee2a90/attachment-0001.htm From bcpierce at cis.upenn.edu Tue May 18 21:26:54 2010 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Tue, 18 May 2010 21:26:54 -0400 Subject: [TYPES/announce] Call for abstracts: Workshop on Mechanizing Metatheory Message-ID: ACM SIGPLAN Workshop on Mechanizing Metatheory 25 September, 2010 Baltimore, Maryland (Co-located with ICFP'10) http://www.cis.upenn.edu/~bcpierce/wmm/ Submission deadline: 21 July, 2010 SPECIAL 5TH ANNIVERSARY PROGRAM 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. The goal of the WMM workshops is to bring researchers who are (or would like to be) using automated proof assistants for programming language metatheory together with developers of proof assistants with an interest in supporting research in programming languages. This WMM is an occasion to look back at five years of intensive effort on formalizing programming languages. The centerpiece of the event will be a series of invited talks in which major players in the area look both back and forward, offering their perspectives on what has been achieved and what challenges remain. There will also be a session of short contributed presentations by workshop participants, selected from submitted abstracts. Invited Speakers * Andrew Appel, Princeton University * Karl Crary, Carnegie Mellon University * Amy Felty, University of Ottawa * Christian Urban, TU Munich * Steve Zdancewic, University of Pennsylvania CALL FOR ABSTRACTS Important Dates * Submission deadline for abstracts: 21 July, 2010 * Author Notification: 15 August, 2010 * Workshop: Saturday, 25 September, 2010 Scope * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory * Novel formalization techniques * Investigation of formalization issues, especially with respect to variable binding * Examples of formalized programming language metatheory * Analysis and comparison of solutions to the POPLmark challenge * Proposals for new challenge problems that benchmark programming language work From jonathan.aldrich at cs.cmu.edu Wed May 19 06:19:53 2010 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Wed, 19 May 2010 06:19:53 -0400 Subject: [TYPES/announce] Extended deadline: SBLP 2010 Message-ID: <4BF3BB49.4090100@cs.cmu.edu> In response to several requests, the abstract submission deadline for SBLP has been extended to ** MAY 24, 2010 **, with the full paper deadline extended to May 31. SBLP welcomes papers on type systems, among other PL topics. ============================================================= CALL FOR PAPERS 14th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Salvador, Bahia, Brazil September 27-29, 2010 http://wiki.dcc.ufba.br/CBSOFT/SBLP2010 Abstract Submission: May 24, 2010 (new submission deadline) Paper Submission: May 31, 2010 (new submission deadline) ============================================================= The 14th Brazilian Symposium on Programming Languages, SBLP 2010, will be held in Salvador, Bahia, Brazil, on September 27-29, 2010. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. This year the symposium will be part of the 1st Brazilian Conference on Software: Theory and Practice, CBSoft 2010, http://wiki.dcc.ufba.br/CBSOFT, which will host three traditional, well-established symposia: * IV Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) * XIV Brazilian Symposium on Programming Languages (SBLP) * XXIV Brazilian Symposium on Software Engineering (SBES) SBLP 2010 invites authors to contribute with Technical Papers and Tutorial Proposals related (but not limited) to: * Programming language design and implementation * Formal semantics of programming languages * Theoretical foundations of programming languages * Design and implementation of programming language environments * Object-oriented programming languages * Functional programming * Aspect-oriented programming languages * Scripting languages * Domain-specific languages * Programming languages for mobile, web and network computing * New programming models * Program transformations * Program analysis and verification * Compilation and interpretation techniques Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Selected papers written in English should be invited for a journal publication. Best papers will be published as a special issue of the Elsevier Journal of Science of Computing Programming Papers should be presented in the language of submission. Detailed submission guidelines will be available at http://wiki.dcc.ufba.br/CBSOFT/PaperSubmission IMPORTANT DATES Paper abstract submission (15 lines): May 24, 2010 Full paper submission: May 31, 2010 Notification of acceptance: July 09, 2010 Final papers due: August 02, 2010 BEST PAPER AWARD Awards will be given for the best papers at the symposium. GENERAL CHAIR Rita Suzana Pitangueira Maciel, UFBA, Brazil PROGRAM CHAIR Ricardo Massa F. Lima, UFPE, Brazil Jonathan Aldrich, Carnegie Mellon University, USA PROGRAM COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alfio Martini, PUC-RS Alvaro Freitas Moreira, UFRGS Andre Rauber Du Bois, UFPEL Andr? Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Cristiano D. Vasconcellos, UDESC Edward Hermann Haeusler, PUC-Rio Fernando Castor Filho, UFPE Francisco Heron de Carvalho Junior, UFC Isabel Cafezeiro, UFF Jo?o Saraiva, Universidade do Minho Johan Jeuring, Utrecht Univ. Jose Guimaraes, UFSCAR Jose E. Labra Gayo, Univ. of Oviedo Jose Luiz Fiadeiro, Univ. of Leicester Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Luis Carlos Meneses, UPE Marcelo A. Maia, UFU Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Paulo Borba, UFPE Peter Mosses, Swansea University Renato Cerqueira, PUC-Rio Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Rodolfo Jardim de Azevedo, UNICAMP Sandro Rigo, UNICAMP Sergio Soares, UFPE Sergiu Dascalu, Univ. of Nevada Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Vladimir Di Iorio, UFV Vitor Santos Costa, UFRJ ORGANIZATION Brazilian Computer Society and Universidade Federal da Bahia From till at informatik.uni-bremen.de Fri May 21 08:30:52 2010 From: till at informatik.uni-bremen.de (Till Mossakowski) Date: Fri, 21 May 2010 14:30:52 +0200 Subject: [TYPES/announce] Call for Participation: 20th WADT, July 1-4, 2010 Message-ID: [sorry if you receive this more than once] CALL FOR PARTICIPATION WADT 2010 20th International Workshop on Algebraic Development Techniques July 1-4, 2010, Etelsen, Germany Program and registration at http://www.informatik.uni-bremen.de/WADT2010/ Contact: wadt2010 at informatik.uni-bremen.de Registration deadline: May 31st, 2010 From ott at mirix.org Fri May 21 08:56:24 2010 From: ott at mirix.org (Matthias-Christian Ott) Date: Fri, 21 May 2010 14:56:24 +0200 Subject: [TYPES/announce] Haskell in Leipzig (HaL5) Message-ID: <20100521125622.GB1865@qp> I would like to announce this year's Haskell in Leipzig meeting. The following text is intentionally written in German: HaL5 - Haskell in Leipzig, zum F?nften Das traditionsreiche HaL-Treffen bietet eine gute Mischung von Haskell-bezogenen Themen aus Forschung, Anwendung und Lehre mit vielen M?glichkeiten zu Diskussion und Unterhaltung bei der anschlie?enden Party. Der Workshop wird erg?nzt durch Hands-On und Tutorien f?r Haskell-Ein- und Umsteiger. Diesmal findet das Treffen im Leipziger Mediencampus statt. Themen: Leksah, HXT, Hawk, Adga, LambdaCamp, Sound-Synthese Weitere Information und Anmeldung: http://www.iba-cg.de/hal5.html Best wishes, Matthias-Christian Ott From pangjun at gmail.com Mon May 17 05:23:44 2010 From: pangjun at gmail.com (Jun PANG) Date: Mon, 17 May 2010 11:23:44 +0200 Subject: [TYPES/announce] (PN) Call for participation: VTSA 2010 Summer School on Verification Technology, Systems & Applications Message-ID: **************************************************************** Summer School on Verification Technology, Systems & Applications http://www.mpi-inf.mpg.de/VTSA10/ Application Deadline: 07/23/2010 Notification until: 08/06/2010 Summer School: 09/06/2010 - 09/10/2010 **************************************************************** A summer school on verification technology, systems and applications will be organized by the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxemburg, in cooperation with the Max-Planck Institute f?r Informatik in Saarbr?cken and the INRIA research center in Nancy. The school will take place from September 6th to 10th 2010 in Luxembourg. The following speakers have accepted to give courses: Javier Esparza: Building a Software Model-Checker Wan Fokkink: Protocol Validation with mCRL Marta Kwiatkowska: Probabilistic Model Checking Markus M?ller-Olm: Fundamentals of Software Model Checking Wang Yi: Modeling and Analysis of Timed Systems Participation is free (except for travel and accommodation costs) and open to anybody holding at least a Bachelor degree (or equivalent) in computer science. The number of participants is limited. Please apply electronically by *July 23th, 2010* by sending - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your bachelor certificate (or equivalent or higher) to jun.pang at uni.lu. For details please see the Web page of the school. ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ petrinet at informatik.uni-hamburg.de ]] From naumann at cs.stevens.edu Sat May 22 11:25:01 2010 From: naumann at cs.stevens.edu (David Naumann) Date: Sat, 22 May 2010 11:25:01 -0400 (EDT) Subject: [TYPES/announce] EXTENDED DEADLINE: VSTTE workshops on Theory and on Experiments & Tools Message-ID: ------ Apologies for multiple copies ------ VSTTE 2010: Workshops on Theories, Tools and Experiments Edinburgh, Scotland, 19th August 2010 (*** NEW SUBMISSION DEADLINE: May 28, 2010 *****) The Third International Conference on Verified Software: Theories, Tools, and Experiments (VSTTE) is part of the Verified Software Initiative (VSI), a fifteen-year, cooperative, international project directed at the scientific challenges of large-scale software verification. VSTTE will host two workshops: * VS-Theory focuses on theoretical foundations of software verification. Topics range from the difficult and essential study of soundness of delicate proof methods, to the discovery of new specification techniques and proof methods, to dramatic simplification or unification of existing methods, to as yet unknown breakthroughs. * VS-Tools & Experiments focuses on the development of verification tools and their experimental evaluation. Topics include interfaces between tools, tool integration platforms, and case studies. The workshops will provide a forum to present new, possibly unfinished work and will also give the opportunity to propose research challenges, which will help form a research agenda for the Verified Software Initiative. For further details, see the workshop web site: http://www.macs.hw.ac.uk/vstte10/Workshops.html Submissions Papers must be written in English using Springer LNCS style. The page limit is 10 pages for technical papers and 5 pages for proposals of verification challenges. The proceedings will be published as a technical report. Details on the submission process are available at http://www.macs.hw.ac.uk/vstte10/Workshops.html. Important Dates Submission: May 28, 2010 Notification: June 25, 2010 Final version: July 23, 2010 Workshops: August 19, 2010, 9am-1pm Chairs * VS-Theory is co-chaired by David Naumann, Stevens Institute of Technology, USA and Hongseok Yang, Queen Mary, University of London, UK * VS-Tools & Experiments is co-chaired by Tiziana Margaria, University of Potsdam, Germany and Rajeev Joshi, NASA/JPL Laboratory for Reliable Software, USA From sunj at comp.nus.edu.sg Sun May 23 19:37:48 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Mon, 24 May 2010 07:37:48 +0800 Subject: [TYPES/announce] CFP: ICFEM 2010, Shanghai Message-ID: *************************************************************** ICFEM 2010 12th International Conference on Formal Engineering Methods *** Call For Papers *** Nov 16-19, 2010 Shanghai, China http://www.sei.ecnu.edu.cn/icfem2010/ *************************************************************** ICFEM brings together those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical, tangible benefit. ICFEM 2010 will be organized by Software Engineering Institute, East China Normal University. Any inquiries can be sent to icfem2010 at sei.ecnu.edu.cn. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their support environments will also be considered: Formal model-based development and code generation Abstraction and refinement Formal specification and modelling Software verification Formal approaches to software testing Software model checking Formal methods for object and component systems Analysis and models for concurrency Formal methods for cloud computing Tool development and integration Software safety, security and reliability Experiments involving verified systems Applications of formal methods SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2010 submission page (http://www.sei.ecnu.edu.cn/icfem2010/), handled by the EasyChair conference system. All queries should be sent to the e-mail address icfem2010 at sei.ecnu.edu.cn. IMPORTANT DATES May 28, 2010: Abstract submission deadline June 4, 2010: Full-paper submission deadline July 30, 2010: Acceptance/rejection notification August 13, 2010: Final version due ORGANIZATION COMMITTEE Conference Chair: Jifeng He (East China Normal University, China) Program Co-Chairs: Jin Song Dong (National University of Singapore, Singapore) Huibiao Zhu (East China Normal University, China) PROGRAM COMMITTEE Yamine AIT AMEUR (LISI/ENSMA, France) Farhad Arbab (CWI and Leiden University, The Netherlands) Nazareno Aguirre (Universidad Nacional de R?o Cuarto, Argentina) Bernhard Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyushu University, Japan) Richard Banach (University of Manchester , UK) Jonathan Bowen (University of Westminster, UK) Karin Breitman (Pontifical Catholic University of Rio de Janeiro, Brazil) Michael Butler (University of Southampton, UK) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Wei-Ngan Chin (National University of Singapore, Singapore) Jim Davies (Oxford University, UK) Jin Song Dong ((National University of Singapore, Singapore, Co-Chair) Zhenghua Duan (Xidian University, China) Colin Fidge (Queensland University of Technology, Australia) John Fitzgerald (Newcastle University, UK) Joaquim Gabarro (Universitat Polit?cnica de Catalunya, Spain) Stefania Gnesi (Istituto di Scienza e Tecnologie dell?Informazione ?A. Faedo?, Italy) Mike Hinchey (University of Limerick, Ireland) Thierry Jeron (INRIA , France) Gerwin Klein (NICTA, Australia) Kim Larsen (Aalborg University, Denmark) Michael Leuschel (Heinrich-Heine Universit?t D?sseldorf, Germany) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau) Tiziana Margaria (University of Potsdam, Germany) Brendan Mahony (DSTO, Australia) Tom Maibaum (McMaster University, Canada) Dominique Mery (LORIA & Universit? Henri Poincar? Nancy 1, France) Huaikou Miao (Shanghai University, China) Flemming Nielson (Technical University of Denmark, Denmark) Jun PANG (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Durham University, UK) Zongyan Qiu (Peking University, China) Anders P. Ravn (Aalborg University, Denmark) Augusto Sampaio (Universidade Federal de Pernambuco, Brazil) Marjan Sirjani (Reykjavik University, Iceland) Graeme Smith (University of Queensland, Australia) Jing Sun (University of Auckland, New Zealand) Jun Sun (National University of Singapore, Singapore) Kenji Taguchi (National Institute of Informatics, Japan) Yih-Kuen Tsay (National Taiwan University, Taiwan) T.H. Tse (The University of Hong Kong, Hong Kong) Sergiy Vilkomir (East Carolina University, USA) Heike Wehrheim (University of Paderborn, Germany) Wang Yi (Uppsala University, Sweden) Hai Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Xu Wang (UNU/IIST, Macau) Jim Woodcock (University of York, UK) Jian Zhang (Chinese Academy of Sciences, China) Huibiao Zhu, China (East China Normal University, China, Co-Chair) STEERING COMMITTEE Keijiro Araki, Japan Jin Song Dong, Singapore Chris George, Canada Jifeng He, China Mike Hinchey, Ireland Shaoying Liu (Chair), Japan John McDermid, UK Tetsuo Tamai, Japan Jim Woodcock, UK -- yours, Sun Jun -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100523/8201c06c/attachment.htm From mtf at cs.rit.edu Sun May 23 21:22:55 2010 From: mtf at cs.rit.edu (Matthew Fluet) Date: Sun, 23 May 2010 21:22:55 -0400 (EDT) Subject: [TYPES/announce] Workshop on ML 2010 - Call for Content Message-ID: The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Content ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Invited Speaker ~~~~~~~~~~~~~~~ Luke Hoban (Microsoft) -- Bringing F# to Visual Studio 2010 Important Dates ~~~~~~~~~~~~~~~ Submission: 25 June, 2010 Notification: 9 August, 2010 Format ~~~~~~ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ~~~~~ We primarily seek research presentations on topics related to ML, including (but not limited to): * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials are intended to show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or application software built on or related to ML technology. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able provide a projector.) Submission Guidelines and Instructions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Email submissions to mtf AT cs.rit.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Program Chair ~~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander Lulea University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google From ueda at ueda.info.waseda.ac.jp Sun May 23 22:30:04 2010 From: ueda at ueda.info.waseda.ac.jp (Kazunori UEDA) Date: Mon, 24 May 2010 11:30:04 +0900 (JST) Subject: [TYPES/announce] APLAS 2010 Second Call For Papers Message-ID: <20100524.113004.74741302.ueda@ueda.info.waseda.ac.jp> SECOND CALL FOR PAPERS APLAS 2010 Eighth Asian Symposium on Programming Languages and Systems Shanghai, China November 28-December 1, 2010 http://basics.sjtu.edu.cn/conference/aplas2010/ BACKGROUND APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops held in Shanghai ('02), Daejeon ('01) and Singapore ('00). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, 4279, 4807, 5356, and 5904. The 2010 edition will be held at Shanghai Jiao Tong University, China. TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: * semantics, logics, foundational theory; * design of languages and foundational calculi; * type systems; * compilers, interpreters, abstract machines; * program derivation, analysis, transformation; * software security, safety, verification; * concurrency, constraints, domain-specific languages; * tools for programming, verification, implementation. APLAS 2010 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. SUBMISSION INFORMATION We solicit submissions in two categories: 1. REGULAR RESEARCH PAPERS, describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. 2. SYSTEM AND TOOL PRESENTATIONS, describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool presentations papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page at http://www.easychair.org/conferences/?conf=aplas2010. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. INVITED SPEAKERS Gerwin Klein National ICT Australia Dale Miller INRIA Saclay - Ile-de-France Mingsheng Ying Tsinghua University, China and University of Technology Sydney ZHOU Chaochen Chinese Academy of Sciences IMPORTANT DATES Abstract Deadline: Monday, June 7, 2010 Submission Deadline: Monday, June 14, 2010 (Samoa Time) Notification: August 16, 2010 Camera-Ready: September 3, 2010 Symposium: November 28-December 1, 2010 GENERAL CHAIR Yuxi Fu Shanghai Jiao Tong University, China PROGRAM CHAIR Kazunori Ueda Waseda University, Japan PROGRAM COMMITTEE Roberto Amadio Universite Paris Diderot, France Lennart Beringer Princeton University, USA Dino Distefano Queen Mary, University of London, UK Yuxi Fu Shanghai Jiao Tong University, China Joxan Jaffar National University of Singapore, Singapore Yukiyoshi Kameyama University of Tsukuba, Japan Gabriele Keller University of New South Wales, Australia Ralf Laemmel University of Koblenz-Landau, Germany Aditya V. Nori Microsoft Research India, India Sungwoo Park Pohang University of Science and Technology, Korea Sanjiva Prasad Indian Institute of Technology Delhi, India Christian Schulte Royal Institute of Technology, Sweden Eijiro Sumii Tohoku University, Japan Alwen Tiu Australian National University, Australia Yih-Kuen Tsay National Taiwan University, Taiwan Kazunori Ueda Waseda University, Japan Hongwei Xi Boston University, USA Jian Zhang Chinese Academy of Sciences, China LOCAL ARRANGEMENTS CHAIR Xiaoju Dong Shanghai Jiao Tong University, China POSTER SESSION CHAIR Guoqiang Li Shanghai Jiao Tong University, China From troina at di.unito.it Mon May 24 06:28:19 2010 From: troina at di.unito.it (Angelo Troina) Date: Mon, 24 May 2010 12:28:19 +0200 Subject: [TYPES/announce] CS2Bio'10 - Second Call for Papers (Invited Speakers Updated) In-Reply-To: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> References: <035E6D3B-9859-4754-9F63-A4D33AA9590C@di.unito.it> Message-ID: <4BFA54C3.1050300@di.unito.it> ====================================================================== Call for Participation CS2Bio'10 1st International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'10 10th of June 2010 Amsterdam, Netherlands http://cs2bio10.di.unito.it/ ====================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The scope of this workshop is to gather researchers in formal methods that are interested at the convergence between Computer Science with Biology and life sciences. In particular, we solicit contribution of original results that address on both theoretical (modelling, analysis, and validation techniques) and applied aspects of biological behaviour: from the representation of biological scenarios to the validation and testing of relevant biological properties and the related simulations and development tools. *** SCOPE *** The scope is to include theoretical and applied aspects of concurrent and distributed systems in the modelling, analysis, simulation and validation of biological properties. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning such complex interactions. We strongly encourage the submission of works carried on in collaboration between computer scientists and biologists. Topics of interest include, but shall not be limited to: Formal Biological Modelling: - Formal methods for the representation of biological systems (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); - Theoretical links and comparisons between different formal models for the modelling of biological processes; - Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi; - Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: - Prediction of biological behaviour from incomplete information; - Model Checking, Abstract Interpretation, Type Systems, etc. Tools and Simulations: - Modelling, analysis and simulation tools for systems biology; - Emergence of properties in complex biological systems; - Tools for parallel, distributed, and multi-resolution simulation methods; - Detailed biological case-studies. *** INVITED SPEAKERS *** - Luca Cardelli (Microsoft Research - Cambridge, UK) - J?r?me Feret (INRIA and ?cole Normale Sup?rieure - Paris, France) *** Workshop's Programme *** http://www.cs2bio10.di.unito.it/programme.html *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Mario Coppo - Ferruccio Damiani - Vincent Danos - Erik de Vink - Mariangiola Dezani - Fran?ois Fages - J?r?me Feret - Walter Fontana - Russ Harmer - Jane Hillston - Jean Krivine (Co-chair) - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - Angelo Troina (Co-chair) - Verena Wolf - Gianluigi Zavattaro From stephan at cs.tu-berlin.de Mon May 24 12:34:24 2010 From: stephan at cs.tu-berlin.de (Stephan Herrmann) Date: Mon, 24 May 2010 18:34:24 +0200 (CEST) Subject: [TYPES/announce] ECOOP 2010 in Maribor Message-ID: <201005241634.o4OGYOar002695@bolero.cs.tu-berlin.de> ---------- Forwarded Message ---------- AITO is sponsoring ECOOP 2010 in Maribor, Slovenia and will hereby encourage you to participate. Besides a 2-day workshop program and a full 3-day technical program, there will also be a "Summer School", which is a series of enlightening talks by prominent scientist, who will present new and exciting development in the field. The program and registration information is available at http://ecoop2010.uni-mb.si/ Sincerely, Eric Jul AITO President From hans at cs.aau.dk Tue May 25 06:44:12 2010 From: hans at cs.aau.dk (=?ISO-8859-1?Q?Hans_H=FCttel?=) Date: Tue, 25 May 2010 12:44:12 +0200 Subject: [TYPES/announce] Book announcement: Transitions and Trees - An Introduction to Structural Operational Semantics Message-ID: <9077A7D1-9213-4AA5-8A32-789D04951D79@cs.aau.dk> Dear all I would like to announce the publication this month of the following book, which may be of interest to you. best regards Hans -- Transitions and Trees An Introduction to Structural Operational Semantics Hans H?ttel Department of Computer Science Aalborg University Denmark Structural operational semantics is a simple, yet powerful mathematical theory for describing the behaviour of programs in an implementation-independent manner. This book provides a self-contained introduction to structural operational semantics, featuring semantic definitions using big-step and small-step semantics of many standard programming language constructs, including control structures, structured declarations and objects, parameter mechanisms and procedural abstraction, concurrency, nondeterminism and the features of functional programming languages. Along the way, the text introduces and applies the relevant proof techniques, including forms of induction and notions of semantic equivalence (including bisimilarity). Thoroughly class-tested, this book has evolved from lecture notes used by the author over a 10-year period at Aalborg University to teach undergraduate and graduate students. The result is a thorough introduction that makes the subject clear to students and computing professionals without sacrificing its rigour. No experience with any specific programming language is required. Contents -------- Part I. Background: 1. A question of semantics; 2. Mathematical preliminaries; Part II. First Examples: 3. The basic principles; 4. Basic imperative statements; Part III. Language Constructs: 5. Control structures; 6. Blocks and procedures (1); 7. Parameters; 8. Concurrent communicating processes; 9. Structured declarations; 10. Blocks and procedures (2); 11. Concurrent object-oriented languages; 12. Functional programming languages; Part IV. Related Topics: 13. Typed programming languages; 14. An introduction to denotational semantics; 15. Recursive definitions; Appendix A. A big-step semantics of Bip; Appendix B. Implementing semantic definitions in SML; -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100525/a3f74e73/attachment.htm From kutsia at risc.uni-linz.ac.at Tue May 25 12:02:07 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 25 May 2010 18:02:07 +0200 Subject: [TYPES/announce] LOPSTR/PPDP 2010 Call for Participation Message-ID: <4BFBF47F.8050100@risc.uni-linz.ac.at> [Apologize for multiple copies] ==================================================================== *** CALL FOR PARTICIPATION *** LOPSTR 2010 20th International Symposium on Logic-Based Program Synthesis and Transformation http://www.risc.jku.at/conferences/lopstr2010/ July 23-25, 2010 PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www.risc.jku.at/conferences/ppdp2010/ July 26-28, 2010 Hagenberg, Austria ==================================================================== IMPORTANT INFORMATION Early registration deadline (for both conferences): June 21, 2010 -------------------------------------------------------------------- LOPSTR 2010 INVITED SPEAKERS: - Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) - Olivier Danvy (University of Aarhus, Denmark) - Johann Schumann (RIACS/NASA Ames Research Center, USA) LOPSTR 2010 PROGRAM: http://www.risc.jku.at/conferences/lopstr2010/program.html -------------------------------------------------------------------- PPDP 2010 INVITED SPEAKERS: - Maria Paola Bonacina (University of Verona, Italy) - Sumit Gulwani (Microsoft Research) PPDP 2010 PROGRAM: http://www.risc.jku.at/conferences/ppdp2010/program.html -------------------------------------------------------------------- From urzy at mimuw.edu.pl Wed May 26 14:07:03 2010 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Wed, 26 May 2010 20:07:03 +0200 Subject: [TYPES/announce] Types Meeting 2010 Message-ID: <4bfd6347.QM/R0E28T/GgZWO6%urzy@mimuw.edu.pl> Types Meeting 2010 Warsaw, 13 - 16 October 2010 First Announcement The 17-th Workshop "Types for Proofs and Programs" will take place in Warsaw, Poland, from October 13 (Wednesday) to October 16 (Saturday). The Types Meeting is a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. Invited speakers: * Henk Barendregt; * Yves Bertot; * Pierre-Louis Curien; * Aarne Ranta. Important information concerning accomodation in Warsaw is already available from the conference web page: http://types10.mimuw.edu.pl Details concerning registration, fees, and how to submit a talk will soon be posted there as well. We are looking forward to your participation. The Organizing Committee types10 at mimuw.edu.pl From luigi.santocanale at lif.univ-mrs.fr Wed May 26 17:41:48 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Wed, 26 May 2010 23:41:48 +0200 Subject: [TYPES/announce] FICS 2010, last call for contributions Message-ID: <4BFD959C.1040902@lif.univ-mrs.fr> /* Apologies for multiple posting */ Last Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Important dates June 13 : paper submission deadline July 10 : author notification August 21-22 : workshop in Brno Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * Panos Rondogiannis, University of Athens. * Dale Miller, INRIA and LIX. Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by *June 13 2010*. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From kos at informatik.uni-marburg.de Fri May 28 04:28:48 2010 From: kos at informatik.uni-marburg.de (Klaus Ostermann) Date: Fri, 28 May 2010 10:28:48 +0200 Subject: [TYPES/announce] CFP: Modularity Constructs in Programming Languages (Special issue of TAOSD) Message-ID: Call for Papers ============ Special Issue of the Journal "Transactions on Aspect-Oriented Software Development" on Modularity Constructs in Programming Languages Motivation ======== The quest to improve the modularity of software systems has been the main motivation for many programming language constructs. Modularity is an important topic in all areas and communities of programming language design, albeit with slightly different interpretations of the term modularity. The purpose of this special issue is to collect a set of papers that open new perspectives in programming language modularity. Submissions ========== Papers may address any aspect of modularity constructs, including: * new directions in aspect-oriented modularity, alternatives to the pointcut-advice style * solutions to the so-called "expression problem" and related modularity problems * module constructs from functional programming, such as type classes or functors and datatype-generic and polytypic programming * novel interpretations of modularity, such as its relation to specification languages, knowledge representation or theorem proving, or the tension between information hiding and separation of concerns * module constructs from object-oriented programming, such as mixins, traits, or virtual classes * language constructs for generic programming * reflection and meta-object protocols * language constructs for variability management and feature-oriented programming * critiques of and reflections on existing modularity constructs Manuscripts should be formatted using the LNCS formatting guidelines, and should be submitted in PDF format. The paper can be submitted at the following URL: http://senldogo0039.springer-sbm.com/TAOSD/servlet/Conference Each submission will be reviewed by at least three reviewers. Guest Editors =========== Gary T. Leavens, Univ. of Central Florida, USA Klaus Ostermann, Univ. of Marburg, Germany Important dates =========== Submission deadline: August 2, 2010 First Round Review Notification: October 7, 2010 Re-Submission Revised Papers: December 31, 2010 Second Round Review Notifications: February 28, 2011 Submission of Camera-Ready Copy: March 30, 2011 Projected Publication Date of Special Issue: July 2011 News on the special issue will be announced at: http://www.informatik.uni-marburg.de/~kos/mcipl/ From s.p.luttik at tue.nl Fri May 28 09:04:58 2010 From: s.p.luttik at tue.nl (Bas Luttik) Date: Fri, 28 May 2010 15:04:58 +0200 Subject: [TYPES/announce] YR-CONCUR 2010 (Call for Papers) Message-ID: <1275051898.4482.7.camel@mobalap> [We apologize for multiple copies.] ================================================================ CALL FOR PAPERS: YR-CONCUR 2010 Young Researchers Workshop on Concurrency Theory September 4, 2010 Paris, France http://www.win.tue.nl/~luttik/YR-CONCUR10/ ================================================================= AIMS AND OBJECTIVES This workshop aims at providing a platform for PhD students, and young researchers who recently completed their doctoral studies, to exchange new results related to concurrency theory and receive feedback on their research. Focus is on informal discussions. Excellent master students working on concurrency theory are also encouraged to contribute. FORMAT YR-CONCUR 2010 is a satellite workshop of CONCUR 2010, and will be held on Saturday September 4, 2010. It is anticipated that many CONCUR participants will attend the YR-workshop (and vice versa). Presentations are based on a four page abstract (incl. references). The accepted abstracts will be made available at the workshop, but no formal proceedings are planned. It is thus also allowed (and encouraged) to send results that have been published at other conferences (although preferably not at CONCUR 2010 or any of its other satellite workshops). IMPORTANT DATES Deadline for 4-page abstracts: July 2, 2010 Notification of acceptance: July 19, 2010 Workshop: September 4, 2010. SUBMISSION: see instructions on the workshop's webpage. PROGRAM COMMITTEE Benedikt Bollig (ENS Cachan, France) Michele Boreale (Universita' di Firenze, Italy) Bas Luttik (TU Eindhoven and VU Amsterdam, The Netherlands, chair) Nir Piterman (Imperial College London, United Kingdom) Pawel Sobocinski (University of Southampton, United Kingdom) Jiri Srba (Aalborg University, Denmark) Frank Valencia (LIX, CNRS & Ecole Polytechnique, France) Verena Wolf (Saarland University, Germany) From sunj at comp.nus.edu.sg Fri May 28 20:47:57 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Sat, 29 May 2010 08:47:57 +0800 Subject: [TYPES/announce] Final Call for Paper: The 3rd International Symposium on Unifying Theories of Programming (UTP 2010 Shanghai) Message-ID: *************************************************************************************************** UTP 2010 The 3rd International Symposium on Unifying Theories of Programming co-located with the 12th International Conference on Formal Engineering Methods (ICFEM 2010) *** Call For Papers *** Shanghai, China 15-16 November, 2010 http://www.sei.ecnu.edu.cn/utp2010 http://www.easychair.org/conferences/?conf=utp10 **************************************************************************************************** Following on the success of UTP 2006 (County Durham, UK) and UTP 2008 (Dublin, Ireland), we are pleased to announce the UTP 2010 symposium, to be held in Shanghai, China in November 2010, co-located with ICFEM 2010, the 12th International Conference on Formal Engineering Methods. Based on the pioneering work on Unifying Theories of Programming by Tony Hoare, He Jifeng and others, the aims of the UTP Symposium series are to continue to reaffirm the significance of the ongoing UTP project, to encourage efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. Of particular interest is how unification may be used to meet the goals and difficulties to be encountered in the Grand Challenges of Computing, with particular reference to the UK's "GC6: Dependable Systems Evolution" and its international cousin the "Verified Software Initiative" and their shared goal of developing a Verified Software Repository. To this end the UTP 2010 symposium welcomes contributions on the above themes as well as others which can be related to them. Such additional themes include, but are not limited to, relational semantics, relational algebra, healthiness conditions, normal forms, linkage of theories, algebraic descriptions, incorporation of probabilistic programming, timed calculi and object-based descriptions, as well as alternative programming paradigms such as functional, logical, data-flow, and beyond. In all cases, the UTP approach should be compared and advantages/disadvantages discussed. Accepted papers will be published in the symposium proceedings by Springer as a volume of the Lecture Notes in Computer Sciences. It is also planned to have a special journal issue of Formal Aspects of Computing for revised/extended versions of selected best papers from the UTP 2010 symposium. Papers should be written in English not exceeding 20 pages in LNCS format (http://www.springer.de/comp/lncs/authors.html). Submission will be via the web-based easychair system. Important Dates --------------- Abstract submission deadline: 4th June, 2010 Full-paper submission deadline: 11th June, 2010 Author notification: 30th July, 2010 Final version due: 13th August, 2010 Symposium: 15-16th November, 2010 Invited Speakers ----------------- Invited Talks: Ana Cavalcanti (University of York, UK) Jifeng He (East China Normal University, China) Jeff Sanders (UNU/IIST, Macao) Invited Tutorial: Jim Woodcock (University of York, UK) Program Committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Hugh Anderson, National University of Singapore, Singapore Phil Brooke, University of Teesside, UK Andrew Butterfield, Trinity College Dublin, Ireland Ana Cavalcanti, University of York, UK Yifeng Chen, Peking University, China Deepak D'Souza, IISC, India Steve Dunne, University of Teesside, UK Colin Fidge, Queensland University of Technology, Australia Jeremy Gibbons, University of Oxford, UK Lindsay Groves, Victoria University of Wellington, New Zealand Will Harwood, University of York, UK Ian Hayes, University of Queensland, Australia Arthur Hughes, Trinity College Dublin, Ireland Jeremy Jacob, University of York, UK Xiaoshan Li, University of Macao, Macao SAR, China Zhiming Liu, UNU/IIST, Macao SAR, China Annabelle McIver, Macquarie University, Australia David Naumann, Stevens Institute of Technology, USA Geguang Pu, East China Normal University, China Shengchao Qin (chair), Durham University, UK Zongyan Qiu, Peking University, China Bill Stoddart, University of Teesside, UK Jun Sun, National University of Singapore, Singapore Meng Sun, CWI, the Netherlands Naijun Zhan, Institute of Software, CAS, China Huibiao Zhu, East China Normal University, China -- yours, Sun Jun From thomas.ehrhard at pps.jussieu.fr Mon May 31 11:23:05 2010 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Mon, 31 May 2010 17:23:05 +0200 Subject: [TYPES/announce] LC 2010 extended early registration deadline Message-ID: <4C03D459.4080805@pps.jussieu.fr> LOGIC COLLOQUIUM 2010 Paris, July 25th - 31st Universit? Paris Diderot We remind you that the Logic Colloquium 2010 will be held in Paris from July 25th to July 31st. The program, available at http://www.logic2010.org/ as well as the venue in Paris, have already attracted an unususal number of participants. We are pleased to inform you that the deadline for early resistration has been extended from May 31st to June 7th. People completing their registration (payment included) before June 7th will be asked for reduced registration fees: - 50 euros instead of 75 euros for students - 115 euros instead of 150 euros for others. We recall that the registration procedure is in two steps, as explained on http://logic2010.org/registration Please circulate the information to all people in your neighborhood who could be interested. Ren? Cori and Thomas Ehrhard co-chairs of the Organizing Committee From cbraga at ic.uff.br Mon May 31 12:18:07 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Mon, 31 May 2010 13:18:07 -0300 Subject: [TYPES/announce] Logical and Semantic Frameworks, with Applications (LSFA'10) - new deadline Message-ID: <2A0E01D4-0944-443F-ABAE-B6F2199E5EE3@ic.uff.br> [Apologies for multiple copies of this CFP.] LSFA 2010 - 5th Workshop on Logical and Semantic Frameworks, with Applications Call for Papers Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. In this fifth edition, the workshop will be in August the first, jointly with ICTAC (http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil. Topics of interest to this forum include, but are not limited to: * Logical frameworks * Proof theory * Type theory * Automated deduction * Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA'10 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. The publication of LSFA proceedings is planned to be a volume of ENTCS (under consideration by ENTCS editorial board). Selected papers, will be published in a special volume by ISTE (http://www.iste.co.uk/) Invited Speakers Natarajan Shankar (SRI International, USA) Ruy de Queiroz (CIN-UFPE, Brasil) Program Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Luis Farinas del Cerro (Program co-chair, IRIT, France) * Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil) * Jonathan Seldin (Univ-Lethbridge , Canada) TBC * Maur?cio Ayala-Rinc?n (UnB, Brasil) * Christiano de Oliveira Braga (UFF, Brasil) * Mario Benevides (Coppe-UFRJ, Brasil) * Eduardo Bonelli (UNQ, Argentina) * Marcelo Corr?a (IM-UFF, Brasil) * Clare Dixon (Liverpool, UK) * Gilles Dowek (Polytechnique-Paris, France) * William Farmer (Mcmaster, Canada) * Maribel Fern?ndez (King's College, UK) * Marcelo Finger (IME-USP, Brasil) * Fairouz Kamareddine (Heriot-Watt Univ, UK) * Delia Kesner (Paris-Jussieu, France) * Luis da Cunha Lamb (UFRGS, Brasil) * Joao Marcos (UFRN, Brasil) * Ana Teresa Martins (UFC, Brasil) * Martin Musicante (UFRN, Brasil) * Cl?udia Nalon (UnB, Brasil) * Luca Paolini (Universit? di Torino, Italy) * Elaine Pimentel (UFMG, Brasil) Important dates: * Submission 7th June 2010 (NEW) * Author's notification 8th July 2010 (NEW) * Camera-ready: 30th July 2010 * Workshop : 31st August 2010 Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA2010 page at EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10) until the submission deadline by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. Please see the Instructions for Preparing Files for Preliminary Versions Instructions for styles and examples. Instructions and the Latex package used to format your submission can be found in http://www.entcs.org/prelim.html Organizing Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Martin Musicante (UFRN, Brasil) * Edward Hermann Haeusler (PUC-Rio, Brasil) * Cl?udia Nalon (UnB, Brasil) * Marcelo Corr?a (IM-UFF, Brasil) From cbraga at ic.uff.br Mon May 31 12:40:48 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Mon, 31 May 2010 13:40:48 -0300 Subject: [TYPES/announce] CFP Formal Aspects of Component Software (FACS 2010) Message-ID: [Apologies for multiple copies of this CFP.] Formal Aspects of Component Software (FACS 2010) 2nd Call for Papers 7th International Workshop on Formal Aspects of Component Software October 14-16, 2010 Universidade do Minho Guimaraes, Portugal www.di.uminho.pt/facs2010/ Scope & Topics: The component-based software development approach has emerged as a promising paradigm to cope with an ever increasing complexity of present-day software solutions by bringing sound production and engineering principles into software engineering. However, many conceptual and technological issues remain in component-based software development theory and practice that pose challenging research questions. FACS 2010 is concerned with how formal methods can or should be used to make component-based software development succeed. Formal methods consist of mathematically-based techniques for the specification, development, and verification of software and hardware systems. They have shown their great utility for providing the formal foundations of component-based software and working out challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The objective of FACS 2010 is to bring together researchers and practitioners in the areas of component software and formal methods in order to promote a deeper understanding of the component-based software development paradigm and its applications. The workshop seeks to address all common aspects of component software and formal methods. FACS aims at developing a community-based understanding of relevant and emerging research problems through formal paper presentations and lively discussions. Possible topics include, but are not limited to: - formal models for software components and component interaction - design and verification methods for component software component - composition and deployment: models, calculi, languages - component testing, re-engineering and reuse - specification of extra-functional properties in component software - certification of components and software architectures - component software vs. object orientation, multi-agent systems, and aspect-oriented development - components for real-time, safety-critical, secure and/or embedded systems - standard models for software components (e.g. Fractal, GCM, etc.) - industrial or experience reports, and case studies in component software - partial behavior models for software components - update and reconfiguration of component architectures - component systems evolution and maintenance - formal methods and modeling languages for components - trust models for components - cyber-physical component-based systems - autonomic components and self-managed applications - formal and rigorous approaches to software adaptation and self- adaptive systems - formal aspects of Web services and business processes - component-based Web services and service-oriented architectures - QoS issues in Web services, multi-agent systems and component-based systems Context: FACS'10 is the 7th event in a series of workshops, founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The first FACS workshop was co-located with FM'03 (Pisa, Italy, September 2003). The following FACS workshops were organized as standalone events, respectively at UNU-IIST in Macau (October 2005), at Charles University in Prague (September 2006), at INRIA in Sophia-Antipolis (September 2007), and at University of Malaga in Spain (September 2008). FACS'09 was part of the Formal Methods Week in Eindhoven (October 2009). Publication: We solicit two categories of high-quality submissions on research results and/or experience: research papers (LNCS format, not exceeding 18 pages including bibliography and figures) describing a technical contribution in depth and doctoral abstracts (2 pages, LNCS format) concisely capturing PhD-work-in-progress, referring theme, context, research questions, envisaged contributions, and partial results. Submissions to the workshop should present original research which is unpublished and not submitted for publication elsewhere. Papers will be judged on the basis of originality, relevance, technical soundness and presentation quality. Submission of papers will be in electronic form via Easychair, accessible through the workshop website. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format. The post-proceedings of the workshop will be published as a volume in Springer's Lecture Notes in Computer Science. Authors of accepted papers should provide all the electronic files of the final version of their paper according to the instructions provided at the LNCS home page (www.springer.com/lncs). As in previous years, we plan to publish extended versions of selected papers in a special issue of Science of Computer Programming. Important dates: Research Paper abstract submission: July 2, 2010 Research Paper submission: July 9, 2010 Research Paper acceptance notification: August 22, 2010 Doctoral Track submission: September 12, 2010 Doctoral Track acceptance notification: September 20, 2010 Camera ready: September 25, 2010 Workshop: October 14-16, 2010 Program chairs: Markus Lumpe and Luis Barbosa Invited speakers: Sanjit Seshia, University of California, Berkeley (http://www.eecs.berkeley.edu/~sseshia/) Luis Caires, New University of Lisbon (http://www-ctp.di.fct.unl.pt/~lcaires/) Program committee: Farhad Arbab (CWI, The Netherlands) Marco Autili (L'Aquila University, Italy) Luis Barbosa (Universidade do Minho, Portugal) Andreas Bauer (Australian National University, Australia) Frank S. de Boer (CWI, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Carlos Canal (Universidad de Malaga, Spain) Rolf Hennicker (Ludwig-Maximilians-Universitaet Muenchen, Germany) Einar Broch Johnsen (Universitetet i Oslo, Norway) Zhiming Liu (IIST UNU, Macau, China) Ying Liu (IBM China Research, China) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Centre Sophia Antipolis, France) Sun Meng (CWI, The Netherlands) Corina Pasareanu (NASA Ames, USA) Patrizio Pelliccione (L'Aquila University, Italy) Frantisek Plasil (Charles University, Czech Republic) Anders Ravn (Aalborg University, Denmark) Nuno Rodrigues (IPCA, Portugal) Bernhard Schaetz (Technical University of Munich, Germany) Marjan Sirjani (University of Tehran, Iran) Volker Stolz (UNU-IIST, MACAU) Carolyn Talcott (SRI International, USA) Dang Van Hung (Vietnam National University, Vietnam) Naijun Zhan (IOS, China) Steering Committee: Zhiming Liu (IIST UNU, Macau, China, coordinator) Farhad Arbab (CWI, The Netherlands) Luis Barbosa (Universidade do Minho, Portugal) Carlos Canal (University of Malaga, Spain) Markus Lumpe (Swinburne University of Technology, Australia) Eric Madelaine (INRIA, Sophia-Antipolis, France) Corina Pasareanu (NASA Ames Research Center, USA) Sun Meng (CWI, the Netherlands) Bernhard Schaetz (Technical University of Munich, Germany) Contact: (web) www.di.uminho.pt/facs2010/ (email) facs10chairs at di.uminho.pt From sunj at comp.nus.edu.sg Mon May 31 21:29:40 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Tue, 1 Jun 2010 09:29:40 +0800 Subject: [TYPES/announce] Deadline Extended: ICFEM 2010, Shanghai Message-ID: *************************************************************** ICFEM 2010 12th International Conference on Formal Engineering Methods *** Call For Papers *** Nov 16-19, 2010 Shanghai, China http://www.sei.ecnu.edu.cn/icfem2010/ The deadlines for paper submission have been extended. Abstract Submission: 4 June, 2010 (New) Full-paper submission: 11 June, 2010 (New) *************************************************************** ICFEM brings together those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical, tangible benefit. ICFEM 2010 will be organized by Software Engineering Institute, East China Normal University. Any inquiries can be sent to icfem2010 at sei.ecnu.edu.cn. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their support environments will also be considered: Formal model-based development and code generation Abstraction and refinement Formal specification and modelling Software verification Formal approaches to software testing Software model checking Formal methods for object and component systems Analysis and models for concurrency Formal methods for cloud computing Tool development and integration Software safety, security and reliability Experiments involving verified systems Applications of formal methods SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2010 submission page (http://www.sei.ecnu.edu.cn/icfem2010/), handled by the EasyChair conference system. All queries should be sent to the e-mail address icfem2010 at sei.ecnu.edu.cn. IMPORTANT DATES June 4, 2010: Abstract submission deadline (New) June 11, 2010: Full-paper submission deadline (New) July 30, 2010: Acceptance/rejection notification August 13, 2010: Final version due ORGANIZATION COMMITTEE Conference Chair: Jifeng He (East China Normal University, China) Program Co-Chairs: Jin Song Dong (National University of Singapore, Singapore) Huibiao Zhu (East China Normal University, China) PROGRAM COMMITTEE Yamine AIT AMEUR (LISI/ENSMA, France) Farhad Arbab (CWI and Leiden University, The Netherlands) Nazareno Aguirre (Universidad Nacional de R?o Cuarto, Argentina) Bernhard Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyushu University, Japan) Richard Banach (University of Manchester , UK) Jonathan Bowen (University of Westminster, UK) Karin Breitman (Pontifical Catholic University of Rio de Janeiro, Brazil) Michael Butler (University of Southampton, UK) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Wei-Ngan Chin (National University of Singapore, Singapore) Jim Davies (Oxford University, UK) Jin Song Dong ((National University of Singapore, Singapore, Co-Chair) Zhenghua Duan (Xidian University, China) Colin Fidge (Queensland University of Technology, Australia) John Fitzgerald (Newcastle University, UK) Joaquim Gabarro (Universitat Polit?cnica de Catalunya, Spain) Stefania Gnesi (Istituto di Scienza e Tecnologie dell?Informazione ?A. Faedo?, Italy) Mike Hinchey (University of Limerick, Ireland) Thierry Jeron (INRIA , France) Gerwin Klein (NICTA, Australia) Kim Larsen (Aalborg University, Denmark) Michael Leuschel (Heinrich-Heine Universit?t D?sseldorf, Germany) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau) Tiziana Margaria (University of Potsdam, Germany) Brendan Mahony (DSTO, Australia) Tom Maibaum (McMaster University, Canada) Dominique Mery (LORIA & Universit? Henri Poincar? Nancy 1, France) Huaikou Miao (Shanghai University, China) Flemming Nielson (Technical University of Denmark, Denmark) Jun PANG (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Durham University, UK) Zongyan Qiu (Peking University, China) Anders P. Ravn (Aalborg University, Denmark) Augusto Sampaio (Universidade Federal de Pernambuco, Brazil) Marjan Sirjani (Reykjavik University, Iceland) Graeme Smith (University of Queensland, Australia) Jing Sun (University of Auckland, New Zealand) Jun Sun (National University of Singapore, Singapore) Kenji Taguchi (National Institute of Informatics, Japan) Yih-Kuen Tsay (National Taiwan University, Taiwan) T.H. Tse (The University of Hong Kong, Hong Kong) Sergiy Vilkomir (East Carolina University, USA) Heike Wehrheim (University of Paderborn, Germany) Wang Yi (Uppsala University, Sweden) Hai Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Xu Wang (UNU/IIST, Macau) Jim Woodcock (University of York, UK) Jian Zhang (Chinese Academy of Sciences, China) Huibiao Zhu, China (East China Normal University, China, Co-Chair) STEERING COMMITTEE Keijiro Araki, Japan Jin Song Dong, Singapore Chris George, Canada Jifeng He, China Mike Hinchey, Ireland Shaoying Liu (Chair), Japan John McDermid, UK Tetsuo Tamai, Japan Jim Woodcock, UK -- yours, Sun Jun From fmontesi at italianasoftware.com Tue Jun 1 12:39:51 2010 From: fmontesi at italianasoftware.com (Fabrizio Montesi) Date: Tue, 1 Jun 2010 18:39:51 +0200 Subject: [TYPES/announce] CFP: SAC 2011 track on Service Oriented Architectures and Programming (SOAP) Message-ID: SOAP Service Oriented Architectures and Programming http://www.cs.unibo.it/acmsac2011-soap For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary and international forum for applied computer scientists, computer engineers, and application developers to gather, interact and present their work. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University in TaiChung, Taiwan. Although when considered from a purely technological point of view Service-Oriented Programming (SOP) is not an enormous novelty, when it comes to paradigmatic considerations SOP is quickly changing our vision of the Web. Originally, the Web was mainly seen as a means of presenting the information to a wide spectrum of people, but SOP is now triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be searched by other services, retrieved and invoked, always abstracting from the actual implementation. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of Service Oriented Programming needs to be clarified on many aspects, both from the engineering and from the foundational point of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modeling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, ...) and the syntactic one (WS-BPEL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new different implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security, sustainability and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrated only on a few features of Service Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming Service Oriented Programming into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what Service Oriented Programming still needs in order to achieve its original goal, along with works proposing comparison among different models and technological solutions. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service Oriented Computing - Methodologies and tools for Service Oriented application design - Service Oriented Middlewares - Service Oriented Programming languages - Test methodologies for Service Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service Oriented Computing Important Dates (strict) August 24, 2010: Paper submissions October 12, 2010: Author notification November 2, 2010: Camera-Ready Copy March 21-25, 2011: Conference Submissions Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will blindly review submissions. Accepted papers will be published in the annual conference proceedings. Please visit the SAC 2011 Website for further information: http://www.acm.org/conferences/sac/sac2011/ PC Members Faycal Abouzaid, University of Montreal (Canada) Marco Aiello, University of Groningen (Netherlands) Roberto Bruni, University of Pisa (Italy) Chihung Chi, Tsinghua University (China) Rocco De Nicola, University of Florence (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Claudio Guidi, italianaSoftware s.r.l. (Italy) Tim Hallwyl, Sirius IT (Danmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Peep K?ngas, University of Tartu (Estonia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Cyprus (Cyprus) Jing Mei, IBM China Research Lab (China) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Di.Tech (Italy) Shih-Hsi Liu, California State University (USA) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Luca Padovani, Universit? di Torino (Italy) Andreas Roth, SAP (Germany) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Peter Wong, Fredhopper, Amsterdam (Netherlands) Track Chairs Ivan Lanese lanese @ cs.unibo.it Dipartimento di Scienze dell'Informazione, University of Bologna Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com italianaSoftware s.r.l., Italy From leavens at eecs.ucf.edu Tue Jun 1 17:30:56 2010 From: leavens at eecs.ucf.edu (Gary T. Leavens) Date: Tue, 1 Jun 2010 17:30:56 -0400 (EDT) Subject: [TYPES/announce] CFP: SPLASH doctoral symposium Message-ID: The SPLASH 2010 Doctoral Symposium provides students with useful guidance for completing their dissertation research and beginning their research careers. The Symposium will provide an interactive forum for doctoral students in one of two phases: - Apprentices, who are just beginning their research, are not ready to actually make a research proposal, but are interested in learning about structuring research and getting some research ideas; and, - Proposers, who have progressed far enough in their research to have a structured proposal, but will not be defending their dissertation in the next 12 months. Papers are Due June 25, 2010. For details on submissions see: http://tinyurl.com/2cm6u97 Each symposium Proposer will have a two-page short paper published in the SPLASH Companion. Proposers are strongly advised to have a poster at the SPLASH Poster session and to participate in the ACM Student Research Competition. Gary T. Leavens 439C Harris Center (Bldg. 116) School of EECS, University of Central Florida 4000 Central Florida Blvd., Orlando, FL 32816-2362 USA http://www.eecs.ucf.edu/~leavens phone: +1-407-823-4758 leavens at eecs.ucf.edu From jan.cederquist at ist.utl.pt Tue Jun 1 19:20:43 2010 From: jan.cederquist at ist.utl.pt (Jan Cederquist) Date: Tue, 01 Jun 2010 23:20:43 +0000 Subject: [TYPES/announce] Cfp: Software Verification and Testing at ACM SAC 2011 Message-ID: <4C0595CB.6030909@ist.utl.pt> Call for papers ============================================== 26th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 21 - 25, 2011, TaiChung, Taiwan http://www.acm.org/conferences/sac/sac2011/ Important dates * Aug 24th 2010: Submission deadline * Oct 12th 2010: Notification of acceptance/rejection * Nov 2nd 2010: Camera-ready versions due ACM Symposium on Applied Computing The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-five years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2011 is sponsored by SIGAPP and will be hosted by Tunghai University, TaiChung, Taiwan. Software Verification and Testing Track We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - correct by construction development - model-based testing - verification-based testing - symbolic execution - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/b/sac11-tp/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within five two-column pages (an extra three pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Publication of accepted articles requires the commitment of one of the authors to register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2011 proceedings. Program committee Wolfgang Ahrendt, Chalmers University of Technology, Sweden Yves Bertot, INRIA, Sophia Antipolis, France Laura Brandan-Briones, Universidad Nacional de C?rdoba, Argentina Jan Cederquist (track chair), Instituto Superior T?cnico, Portugal Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Dilian Gurov, Royal Institute of Technology, Sweden Joshua Guttman, Worcester Polytechnic Institute and The MITRE Corporation, USA Chris Hankin, Imperial College, UK Jay Ligatti, University of South Florida, USA MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Jun Pang, University of Luxembourg, Luxembourg Antonio Ravara, New University of Lisbon, Portugal Fausto Spoto, University of Verona, Italy From flaviomoura at unb.br Wed Jun 2 13:17:44 2010 From: flaviomoura at unb.br (flavio leonardo cavalcanti de moura) Date: Wed, 02 Jun 2010 14:17:44 -0300 Subject: [TYPES/announce] CFP LSFA 2010 (Extended Deadline 7th June) Message-ID: <20100602141744.145424fe0tu0s27s@webmail.unb.br> LSFA 2010 - 5th Workshop on Logical and Semantic Frameworks, with Applications Call for Papers Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. In this fifth edition, the workshop will be in August the first, jointly with ICTAC (http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil. Topics of interest to this forum include, but are not limited to: * Logical frameworks * Proof theory * Type theory * Automated deduction * Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA'10 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. The publication of LSFA proceedings is planned to be a volume of ENTCS (under consideration by ENTCS editorial board). Selected papers, will be published in a special volume by ISTE (http://www.iste.co.uk/) Invited Speakers Natarajan Shankar (SRI International, USA) Ruy de Queiroz (CIN-UFPE, Brasil) Freek Wiedijk (Radboud University Nijmegen, Netherlands) Program Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Luis Farinas del Cerro (Program co-chair, IRIT, France) * Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil) * Jonathan Seldin (Univ-Lethbridge , Canada) TBC * Maur?cio Ayala-Rinc?n (UnB, Brasil) * Christiano de Oliveira Braga (UFF, Brasil) * Mario Benevides (Coppe-UFRJ, Brasil) * Eduardo Bonelli ( UNLP, Argentina) * Marcelo Corr?a (IM-UFF, Brasil) * Clare Dixon (Liverpool, UK) * Gilles Dowek (Polytechnique-Paris, France) * William Farmer (Mcmaster, Canada) * Maribel Fern?ndez (King's College, UK) * Marcelo Finger (IME-USP, Brasil) * Fairouz Kamareddine (Heriot-Watt Univ, UK) * Delia Kesner (Paris-Jussieu, France) * Luis da Cunha Lamb (UFRGS, Brasil) * Joao Marcos (UFRN, Brasil) * Ana Teresa Martins (UFC, Brasil) * Martin Musicante (UFRN, Brasil) * Cl?udia Nalon (UnB, Brasil) * Luca Paolini (Universit? di Torino, Italy) * Elaine Pimentel (UFMG, Brasil) Important dates: * Submission 7th June 2010 (NEW) * Author's notification 8th July 2010 (NEW) * Camera-ready: 30th July * Workshop : 31st August Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA2010 page at EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10) until the submission deadline by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. Please see the Instructions for Preparing Files for Preliminary Versions Instructions for styles and examples. Instructions and the Latex package used to format your submission can be found in http://www.entcs.org/prelim.html Organizing Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Martin Musicante (UFRN, Brasil) * Edward Hermann Haeusler (PUC-Rio, Brasil) * Cl?udia Nalon (UnB, Brasil) * Marcelo Corr?a (IM-UFF, Brasil) From m.casadei at unibo.it Thu Jun 3 05:18:15 2010 From: m.casadei at unibo.it (Matteo Casadei) Date: Thu, 3 Jun 2010 11:18:15 +0200 Subject: [TYPES/announce] CfP: SAC 2011 Track on Coordination Models, Languages and Applications References: Message-ID: <0CDFC064-F9F4-4ADF-8559-AC60CB838BBB@unibo.it> CALL FOR PAPERS Coordination Models, Languages, and Applications (CM) Special Track at the 26th Symposium on Applied Computing (SAC 2011) TaiChung, Taiwan March 21 - 25, 2011 (http://sac2011.apice.unibo.it/) IMPORTANT DATES Aug. 24, 2010: Paper submissions Oct. 12, 2010: Author notification Nov. 2, 2010: Camera-Ready Copy For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. TRACK ON COORDINATION MODELS, LANGUAGES, AND APPLICATIONS Building on the success of the twelfth previous editions (1998-2010), a special track on coordination models, languages and applications will be held at SAC 2011. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications of coordination technologies - Industrial points of view: experiences, applications, open issues - Internet- and Web-based coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Coordination in Service-oriented architectures and Web Services - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - Modern Workflow Management Systems and Case-Handling - Coordination in Computer Supported Cooperative Work - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Coordination Middleware and Infrastructures - Coordination in GRID systems - Self-organization-based approaches to coordination such as those based on swarm and stigmergy - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint), programming or their extensions with coordination capabilities - Formal aspects (semantics, reasoning, verification) PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2011 proceedings and in the Digital Library. PAPER SUBMISSION AND FORMAT All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers should be no longer than 5 pages, and should be in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 3 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site:http://www.acm.org/conferences/sac/sac2011/. PC MEMBERS Farhad Arbab, CWI Amsterdam and Leiden University (Netherlands) Marcello Bonsangue, Leiden University (Netherlands) Rocco De Nicola, University of Firenze (Italy) Jose Fiadero, University of Leicester (Italy) Keith Harrison-Broninski, Role Modellers Ltd (UK) Kurt Lichtner, Sybase iAnywhere (Canada) Henry Muccini, University of l'Aquila (Italy) Andrea Omicini, University of Bologna (Italy) Manuel Oriol, University of York (UK) Razvan Popescu, Trinity College Dublin (Ireland) Antonio Porto, University of Porto (Portugal) Rosario Pugliese, University of Florence (Italy) Alessandro Ricci, University of Bologna (Italy) Davide Rossi, University of Bologna (Italy) Yasuyuki Tahara, National Institute of Informatics (Japan) Carolyn Talcott, SRI International (USA) Emilio Tuosto, University of Leicester (UK) Michael Ignaz Schumacher, University of Applied Sciences (Switzerland) Robert Tolksdorf, Freie Universitaet Berlin (Germany) Mirko Viroli, University of Bologna (Italy) George Wells, Rhodes University (South Africa) Herbert Wiklicky, Imperial College London (UK) Pawe? T. Wojciechowski, Pozna? University of Technology (Poland) TRACK CO-CHAIRS Matteo Casadei, Alma Mater Studiorum - Universita' di Bologna, Italy -- LA RICERCA C?? E SI VEDE: 5 per mille all'Universit? di Bologna - C.F.: 80007010376 http://www.unibo.it/Vademecum5permille.htm Questa informativa ? inserita in automatico dal sistema al fine esclusivo della realizzazione dei fini istituzionali dell?ente. From M.Roggenbach at swansea.ac.uk Thu Jun 3 06:26:43 2010 From: M.Roggenbach at swansea.ac.uk (Markus Roggenbach) Date: Thu, 3 Jun 2010 11:26:43 +0100 Subject: [TYPES/announce] MRes Studentship in Swansea Message-ID: <9C50DB7F-1849-44E8-B487-C41AFEBE17A2@swansea.ac.uk> MRes Studentship on Algebraic modelling of test data Swansea University invites applications for an industrial funded studentship for studying a Master of Research in Logic and Computation at the department of Computer Science, Swansea, see http://www.swan.ac.uk/compsci/mres/MResLogicComp.html The successful candidate will be awarded the home fee and a ?6,000 per annum bursary, to commence in September 2010. [Oversea students will have to cover the difference to the home fees themselves.] The studentship is dedicated to an industrial related research project under the supervision of Dr Roggenbach (http://cs.swan.ac.uk/~csmarkus/) in the Processes and Data Group (http://www.cs.swan.ac.uk/~csmarkus/ProcessesAndData/). The objectives of this project are - to provide a model of test data in the algebraic specification language CASL and - to utilise this model for decision table based testing. Besides data modelling in CASL, the project will involve automatic and interactive theorem proving. Required qualification is a Bachelor / Master (or equivalent) in Computer Science or Mathematics. For further information contact Markus Roggenbach (csmarkus at swan.ac.uk). -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100603/b320587e/attachment.htm From gerwin.klein at nicta.com.au Fri Jun 4 07:43:29 2010 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Fri, 4 Jun 2010 21:43:29 +1000 Subject: [TYPES/announce] Deadline extension: SSV'10 Message-ID: <20AAE83D-196C-4D03-9F9E-A199DA0FBCAA@nicta.com.au> After several requests, we have extended the submission deadline by one week until 11 Jun 2010 (23:59 Samoan time) and have re-opened abstract submission. DEADLINE EXTENSION 5th International Workshop on Systems Software Verification (SSV'10) Real Software, Real Problems, Real Solutions October 6-7, Vancouver, Canada co-located with OSDI'10 http://usenix.org/events/ssv10/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, static analysis techniques, as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex embedded systems software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum discusses software analysis and development techniques and tools; it will serves as a platform to discuss open problems and future challenges in dealing with existing and upcoming systems level code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (at most 9 pages, 8.5" x 11", including figures, tables, and references, formatted in two columns, using 10 point type on 12 point (single-spaced) leading, with the text block being no more than 6.5" wide by 9" deep) to https://papers.usenix.org/hotcrp/ssv10/ by June 4th 2010 Samoan time. All papers will be subject to peer review under conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published online by USENIX. Submissions must be in pdf format and follow the USENIX style instructions above. Important dates 11.06.2010 Submission Deadline [extended!] 20.07.2010 Notification of accepted papers 20.08.2010 Final version 06.10.2010 Workshop The workshop is organized as a 1.5-day workshop (Oct 6-7, 2010). Location The workshop will be held in Vancouver, Canada, co-located with OSDI'10. Program Chair Ralf Huuck (NICTA & UNSW, Australia) Gerwin Klein (NICTA & UNSW, Australia) Bastian Schlich (ABB Corporate Research, Germany) Program Committee Adam Chlipala (Harvard University, USA) Dino Distefano (Queen Mary University London, UK) Klaus Havelund (Jet Propulsion Laboratory, USA) Chris Hawblitzel (Microsoft Research, USA) Andy King (University of Kent, UK) Stefan Kowalewski (RWTH Aachen University, Germany) Kim Larsen (Aalborg University, Denmark) John Matthews (Galois Inc, USA) Thomas Noll (RWTH Aachen University, Germany) Wolfgang Paul (University of Saarbruecken, Germany) Jan Peleska (University of Bremen, Germany) John Regehr (University of Utah, USA) Wolfram Schulte (Microsoft Research, USA) Zhong Shao (Yale University, USA) Junfeng Yang (Columbia, USA) Kwangkeun Yi (Seoul National University, South Korea) We thank our sponsors NICTA and Microsoft Research for their support. From Jeremy.Gibbons at comlab.ox.ac.uk Fri Jun 4 09:40:42 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Fri, 4 Jun 2010 14:40:42 +0100 (BST) Subject: [TYPES/announce] Final Call for Papers: Haskell Symposium 2010 Message-ID: <201006041340.o54DegMT001276@merc3.comlab.ox.ac.uk> Haskell 2010 ACM SIGPLAN Haskell Symposium 2010 Baltimore MD, United States 30th September, 2010 FINAL CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2010/ The ACM SIGPLAN Haskell Symposium 2010 will be co-located with the 2010 International Conference on Functional Programming (ICFP), in Baltimore, Maryland. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, Practice, and Experience, using Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth, as well as general experience with Haskell in education and industry. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Before 2008, the Haskell Symposium was known as the Haskell Workshop. The name change reflects both the steady increase of influence of the Haskell Workshop on the wider community, as well as the increasing number of high quality submissions. The selection process is highly competitive. After eleven Haskell Workshops between 1995 and 2007, the first Haskell Symposium was held in Victoria in 2008, and the second in Edinburgh in 2009. Submission Details * Submission Deadline: Monday, 14th June 2010, 15:00 UTC * Author Notification: Monday, 12th July 2010 * Final Papers Due : Monday, 2nd August 2010 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 text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2010, the 2010 Haskell Symposium web page. * http://www.icfpconference.org/icfp2010, the ICFP 2010 web page. Programme Committee * Jeremy Gibbons, University of Oxford (chair) * James Cheney, University of Edinburgh * Duncan Coutts, Well-Typed LLP * Sharon Curtis, Oxford Brookes University * Fritz Henglein, Kobenhavns Universitet * Tom Schrijvers, Katholieke Universiteit Leuven * Chung-chieh Shan, Rutgers - The State University of New Jersey * Martin Sulzmann, Informatik Consulting Systems AG * Wouter Swierstra, Vector Fabrics * Peter Thiemann, Universitaet Freiburg * Andrew Tolmach, Portland State University * Malcolm Wallace, University of York From Alex.Simpson at ed.ac.uk Fri Jun 4 09:54:34 2010 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Fri, 04 Jun 2010 14:54:34 +0100 Subject: [TYPES/announce] Scott in Scotland: Tuesday 29th June, Edinburgh Message-ID: <20100604145434.2rk97zt6sk4ckgk0@www.staffmail.ed.ac.uk> Several of the talks at the meeting announced below are relevant to the types mailing list. --- Scott in Scotland 2-5pm Tuesday 29th June 2010 Informatics Forum, University of Edinburgh, UK http://homepages.inf.ed.ac.uk/als/ScottInScotland/index.html An afternoon of invited talks on semantics of programming languages associated with Dana Scott's visit to Scotland on a Scottish Informatics and Computer Science Alliance (SICSA) distinguished visiting fellowship. Jointly sponsored by the SICSA Modelling and Abstraction and Complex Systems Engineering themes. INVITED TALKS: * Gordon Plotkin (University of Edinburgh) A Logic for Algebraic Effects * Neil Ghani (University of Strathclyde) Initial Algebras and Induction Principles - Fibrationally * Murdoch James Gabbay (Heriot-Watt University) Kripke-style models in which logic and computation have equal standing * Dana Scott (Carnegie Mellon University, Emeritus) Semilattices, Domains, and Computability The meeting will be followed by a wine reception at the Informatics Forum. All are welcome to attend, though we politely request notification of attendance by Tuesday 22nd June for catering purposes. For more details, see: http://homepages.inf.ed.ac.uk/als/ScottInScotland/index.html -- Alex Simpson, LFCS, School of Informatics, Univ. of Edinburgh, UK Email: Alex.Simpson at ed.ac.uk Tel: +44 (0)131 650 5113 Web: http://homepages.inf.ed.ac.uk/als Fax: +44 (0)131 651 1426 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From vincent.rahli at gmail.com Fri Jun 4 17:09:09 2010 From: vincent.rahli at gmail.com (rahli vincent) Date: Fri, 4 Jun 2010 22:09:09 +0100 Subject: [TYPES/announce] Release of version 0.5 of the ULTRA type error slicer for SML Message-ID: We are happy to announce the release of the version 0.5 of our type error slicing software for the SML programming language. Major improvements over the previous release: * Handling of the SML 'open' feature. * Handling of the SML datatype replication feature. * Type error slices can now be displayed in a terminal window or in a web browser. * We supply Ubuntu and Fedora packages. Other less important improvement is: * We improved our minimisation algorithm. Even more changes are documented in the ChangeLog file. The aim of our type error slicer is to provide useful type error reports for pieces of code written in SML: * It identifies all of the program points that contribute to a type error, including the spot with the actual programming error that caused the type error. * It highlights these program points in the original, unchanged source code. * It avoids showing internal details of the operation of the type inference machinery. New Ubuntu (Debian based) and Fedora (Red-Hat based) packages of our type error slicer can be found at this URL: http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ We will also shortly release a plain archive of our type error slicer. At the time of the release of version 0.4, we forgot to update the web demo. We have now updated our web demo from version 0.3 to version 0.5. Known limitations: * We have not yet built the software for other operating systems than Linux. * The currently supported user interfaces are via a terminal window, GNU Emacs (or our web demo). We are currently developing a Vim interface. * Some type errors are not yet discovered (the user will need to rely on their usual type checker in these cases). Notable spots where the implementation is incomplete are functors (you can work around this by including signatures on functor applications), equality types. * Concerning fixity declarations, programs are parsed as though the declarations were not there, which gives wrong results. * We don't yet handle overloaded constants (for example 1 is always of type int). * The details of the SML basis library are incomplete (fortunately the user can add any additional details they are using). * The software does not currently scale well to very large programs (we are still improving this). It is currently suitable for small programs and use in teaching. * We do not report free identifiers anymore. * We have some known issues ';' that can lead to incorrect constraint generations and so to wrong type error messages. We are currently working on a new version of the slicer that will fix this issue. Best wishes, Vincent Rahli and Joe Wells -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100604/e92af22c/attachment.htm From gabriel at info.uaic.ro Mon Jun 7 06:30:54 2010 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Mon, 7 Jun 2010 13:30:54 +0300 (EEST) Subject: [TYPES/announce] 2nd CfP 4th MeCBIC, 23-24 August, Jena (Germany) Message-ID: [We apologize for multiple copies.] ================================================================ 2nd Call for Papers MeCBIC 2010 4th Workshop on Membrane Computing and Biologically Inspired Process Calculi http://www.info.uaic.ro/~mecbic/mecbic2010/ Jena, Germany, 23-24 August 2010 Affiliated to CMC11, Conference on Membrane Computing http://cmc11.uni-jena.de/index.html *** IMPORTANT DATES *** Title and Abstract: 18 June, 2010 Paper Submission: 25 June, 2010 (firm deadline) Notification: 31 July, 2010 EPTCS version: 12 Aug., 2010 ================================================================ Biological membranes play a fundamental role in the complex reactions which take place in cells of living organisms. The importance of this role has been considered in two different types of formalisms recently introduced. Membrane systems were introduced as a class of distributed parallel computing devices inspired by the observation that any biological system is a complex hierarchical structure, with a flow of materials and information that underlies their functioning. The modeling and the analysis of biological systems has also attracted the interest of the process algebra research community. Thus the notions of membranes and compartments have been explicitly represented in a family of calculi, such as Ambients and Brane Calculi. A cross fertilization of the two research areas has recently started. A deeper investigation of the relations between these related formalisms is interesting, as it is important to understand the similarities and the differences. The main aim of the workshop is to bring together researchers working in membrane computing, in biologically inspired process calculi (ambients, brane calculi, etc.) and in other related fields to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. Original research papers (including significant work-in-progress) on the membrane systems or biologically inspired process calculi are sought. Papers on the relationship between membrane systems and biologically inspired process calculi are particularly welcome. Related formal approaches in which cell compartments play an important role are also within the scope of the workshop. Topics of interest include (but are not limited to): * Biologically inspired models and calculi; * Biologically inspired systems and their applications; * Analysis of properties of biologically inspired models and languages; * Theoretical links and comparison between different models/systems. *** Invited Speaker: Andrew Phillips (Microsoft Research, Cambridge, UK) Stochastic Simulation of Process Calculi *** SUBMISSION GUIDELINES *** Authors are invited to submit a PDF version of their papers (of about 15 pages) using the EPTCS style (http://www.eptcs.org/). Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=mecbic2010). We also encourage the submission of short papers, limited to 8 pages, presenting new tools or platforms related to the topics of MeCBIC 2010. *** DISSEMINATION *** The workshop proceedings will be available electronically, and then published in the Electronic Proceedings in Theoretical Computer Science. After the workshop, extended and additionally refereed papers will be published in a special issue of Theoretical Computer Science including selected papers of both MeCBIC 2009 and MeCBIC 2010. *** PROGRAM COMMITTEE *** * Joern Behre, Friedrich Schiller University, Jena, DE * Luca Cardelli, Microsoft Research, Cambridge, UK * Matteo Cavaliere, CSIC-CNB, Madrid, Spain * Gabriel Ciobanu, ICS, Romanian Academy, Iasi, RO (co-chair) * Federica Ciocchetta, CoSBi, Trento, Italy * Flavio Corradini, University of Camerino, Italy * Erzsebet Csuhaj-Varju, CARI, Hungarian Academy, Budapest, HU * Erik de Vink, Technische Universiteit Eindhoven, NL * Marian Gheorghe, University of Sheffield, UK * Jean-Louis Giavitto, University of Evry, France * Thomas Hinze, Friedrich Schiller University, Jena, DE * Maciej Koutny, Newcastle University, UK (co-chair) * Paolo Milazzo, University of Pisa, Italy * Angelo Troina, University of Torino, Italy * Claudio Zandron, University of Milano-Bicocca, Italy * Gianluigi Zavattaro, University of Bologna, Italy ================================================================ From E.Ritter at cs.bham.ac.uk Tue Jun 8 15:50:28 2010 From: E.Ritter at cs.bham.ac.uk (E.Ritter@cs.bham.ac.uk) Date: Tue, 08 Jun 2010 20:50:28 +0100 Subject: [TYPES/announce] BLC 2010 Message-ID: British Logic Colloquium 2010, Birmingham, 2-4 September The annual meeting of The British Logic Colloquium will take place from 2-4 September 2010 in Birmingham. The aim of this meeting is to present current topics in all areas of logic. The following invited speakers have confirmed that they will give talks: Mirna Dzamonja (University of East Anglia), Jeffrey Ketland (University of Edinburgh), Alexander Kurz (University of Leicester), Luke Ong (University of Oxford), Ulrike Sattler (University of Manchester), Anton Setzer (University of Swansea), Colin Stirling (University of Edinburgh), Philip Welsh (University of Bristol) and Alex Wilkie (University of Manchester). Contributed talks of 30 min length are also solicited. A limited number of grants for UK-PhD-students is available. The deadline for proposing talks and early registration is 20 July. For further details see the webpage http://events.cs.bham.ac.uk/BLC2010. BLC 2010 is supported financially by the London Mathematical Society and by the British Logic Colloquium. Eike Ritter From mjas at imm.dtu.dk Wed Jun 9 04:50:55 2010 From: mjas at imm.dtu.dk (Michael Smith) Date: Wed, 9 Jun 2010 10:50:55 +0200 Subject: [TYPES/announce] FINAL CALL FOR POSTERS - MLQA 2010: Models and Logics for Quantitative Analysis Message-ID: Second Annual Meeting of the ERCIM Working Group on Models and Logics for Quantitative Analysis (MLQA 2010) http://wiki.ercim.eu/wg/MLQA/index.php/July_2010:_MLQA_meeting_at_FLoC_2010%2C_Edinburgh July 9th, 2010, Edinburgh, Scotland, UK Part of the Federated Logic Conference (FLoC 2010) Affiliated with Logic in Computer Science (LICS 2010) *** FINAL CALL FOR POSTERS *** Important dates: ----------------------------------------------------- Abstract submission: June 18th, 2010 Submission deadline (strict): June 25th, 2010 Author notification: June 28th, 2010 Meeting: July 9th, 2010 ----------------------------------------------------- We invite posters under two categories: - Presentation of recent or on-going work relating to models, logics, tools, and/or applications with respect to discrete, stochastic and/or continuous systems and properties. - Overview of the recent research activities of a group, in relation to the themes of MLQA. We equally encourage submissions from both research leaders, and junior researchers and PhD students. Posters should be readable in size A3, and should be submitted in pdf format to mlqa at imm.dtu.dk. They will be printed in size A1, if the FLoC organisers permit. Notification of your intention to submit, along with a title and short description of the poster, should be sent by June 18th. We require that we receive the final poster no later than June 25th, in order for us to print it before the meeting. We will print and transport every accepted poster, although if a poster does not print as expected, we may require you to print it yourself. *** CALL FOR PARTICIPATION *** If you have not yet registered for MLQA 2010, it is still possible to do so via the FLoC website. We invite all interested researchers and PhD students to participate. http://www.floc-conference.org/registration.html Note that regular registration is open until 30th June. -- Flemming Nielson (acting chairman of MLQA) Michael Smith, Nataliya Skrupnyuk (poster session organisers) http://wiki.ercim.eu/wg/MLQA From bruno.monsuez at ensta.fr Wed Jun 9 14:16:19 2010 From: bruno.monsuez at ensta.fr (Bruno Monsuez) Date: Wed, 9 Jun 2010 20:16:19 +0200 Subject: [TYPES/announce] VECoS' 2010 - Call for Participation Message-ID: <038501cb07ff$db7d54b0$9277fe10$@monsuez@ensta.fr> =========================================================================== We apologize if you receive multiple copies of this call for participation. =========================================================================== CALL FOR PARTICIPATION *** 4th International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS' 2010) July, 1-2, 2010, Paris, France http://www.vecos-world.org/ VECoS 2010 will be held at the Conservatoire National des Arts et M?tiers (CNAM), in the center of Paris and close to the Pantheon, Notre Dame cathedral and the ?le de la Cit?. The workshop is co-organized by CNAM and ENSTA with cooperation of MeFoSyLoMa Group ( http://www.mefosyloma.fr/), and is sponsored by Formal Methods Europe ( http://www.fmeurope.org/). *** Aims and scope The International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS) was created by an Euro-Maghrebian network of researchers in computer science. The first edition VECoS'07 took place in Algiers, VECoS'08 in Leeds 2-3 July 2008 and VECoS'09 in Rabat 2-3 July 2009. The aim of VECoS workshop is to bring together researchers and practitioners, in the areas of Verification, Control, Performance, Quality of service, Dependability evaluation and Assessment, to discuss the state of the art for solving the challenges facing us today in various modern computer and communication systems in which functional and extra functional properties are strongly interrelated. Thus, the main motivation for VECoS is to encourage the cross-fertilization between formal verification and evaluation approaches, methods and techniques especially those based on the specification formalisms for concurrent, distributed and soft/hard systems. Beyond its technical and scientific goals, another main purpose of VECoS is to promote collaboration between participants in research and education in the area of computer science and engineering. We welcome contributions describing original research, practical experience reports and tool descriptions/demonstrations in the areas of Verification, Control, and Performance, Quality of service, Dependability Evaluation. *** Topics of interest include, but are not limited to: - Model-checking - Equivalence checking - Abstraction techniques - Compositional verification - Parameterized verification - Control synthesis techniques - Probabilistic verification - Performance and robustness evaluation - Simulation techniques of discrete-event and hybrid systems - Dependability assessment techniques - QoS evaluation, planning and deployment *** Invited speakers Laurent Fribourg, LSV, CNRS & ENS de Cachan France Raymond Devillers, Universit? Libre de Bruxelles, Belgium Hans-Michael Hanisch, Martin Luther University of Halle-Wittenberg, Germany *** For more information see: http://www.vecos-world.org/ or http://vecos.ensta.fr/2010/index.html or contact PC co-chairs: Lo?c Correnson, LIST-CEA, France, loic.correnson at cea.fr Denis Poitrenaud, LIP6 UPMC Paris, France, denis.poitrenaud at lip6.fr =========================================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100609/4491a03b/attachment.htm From michaelw at cs.utwente.nl Wed Jun 9 17:07:36 2010 From: michaelw at cs.utwente.nl (Michael Weber) Date: Wed, 9 Jun 2010 23:07:36 +0200 Subject: [TYPES/announce] PDMC 2010 2nd Call for Papers Message-ID: 2nd Call for Papers - PDMC 2010 ======================================================================= 9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2010) joint with 2nd International Workshop on High Performance Computational Systems Biology (HiBi 2010) ======================================================================= September 30 - October 1, 2010, Twente, The Netherlands http://www.pdmc.cz/PDMC10/ Co-locating with the joint ICGT/SPIN conference, Sep 27 - Oct 2 ----------------------------------------------------------------------- NEWS: ----- * Invited Speaker: Youssef Hamadi IMPORTANT DATES: ---------------- * Abstract submission: June 14, 2010 * Paper submission: June 21, 2010 * Author notification: July 31, 2010 * Workshop: September 30 - October 1, 2010 AIM AND SCOPE: -------------- The aim of the PDMC workshop series is to cover all aspects related to the verification and analysis of very large and complex systems using methods and techniques that exploit state-of-the-art hardware architectures. As such, the workshop provides a working forum for presenting, sharing, and discussing recent achievements in the field of high-performance verification. Topics of interest include, but are not limited to: * multi-core model checking * distributed model checking * multi-threaded/distributed equivalence checking * distributed state space generation * slicing and distributing the state space * parallel/distributed satisfiability checking * parallel/distributed theorem proving * parallel/distributed constraint solving * parallel methods in probabilistic model checking * parallel methods in performance evaluation * I/O efficient algorithms for verification * GPU accelerated verification * (libraries for) distributed graph algorithms * tools and case studies * industrial applications SUBMISSIONS: ------------ We accept * regular papers (max. 8 pages in IEEE format) * tool papers (max. 2 pages in IEEE format) * work-in-progress presentations All submissions must be original and unpublished. Regular and tool papers accepted for the presentation at the workshop will appear in IEEE post-proceedings. High-quality and mature work-in-progress papers might be invited for the proceedings, depending on the presentation at the workshop. INVITED SPEAKER: ---------------- Youssef Hamadi (Microsoft Research Cambridge, UK) PROGRAMME CHAIRS: ----------------- Jiri Barnat (Masaryk University, Czech Republic) Michael Weber (University of Twente, Netherlands) PROGRAMME COMMITTEE: -------------------- Henri Bal (Free University Amsterdam, Netherlands) Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Lubos Brim (Masaryk University, Czech Republic) Gianfranco Ciardo (University of California at Riverside, USA) Stefan Edelkamp (TZI Bremen, Germany) Ganesh Gopalakrishnan (University of Utah, USA) Keijo Heljanko (Aalto University, Finland) Gerard Holzmann (NASA/JPL, USA) William Knottenbelt (Imperial College, UK) Radu Mateescu (INRIA, France) Jaco van de Pol (University of Twente, Netherlands) Wheeler Ruml (University of New Hampshire, USA) Anna Slobodova (Centaur Technology, USA) -- Michael Weber University of Twente, The Netherlands http://fmt.cs.utwente.nl/~michaelw/ From flaviomoura at unb.br Thu Jun 10 18:07:22 2010 From: flaviomoura at unb.br (flavio leonardo cavalcanti de moura) Date: Thu, 10 Jun 2010 19:07:22 -0300 Subject: [TYPES/announce] LSFA 2010 Deadline extension June 13th!! Message-ID: <20100610190722.16605w4s2b6pmkgq@webmail.unb.br> LSFA 2010 - 5th Workshop on Logical and Semantic Frameworks, with Applications Call for Papers Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. In this fifth edition, the workshop will be in August the first, jointly with ICTAC (http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil. Topics of interest to this forum include, but are not limited to: * Logical frameworks * Proof theory * Type theory * Automated deduction * Semantic frameworks * Specification languages and meta-languages * Formal semantics of languages and systems * Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA'10 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. The publication of LSFA proceedings is planned to be a volume of ENTCS (under consideration by ENTCS editorial board). Selected papers, will be published in a special volume by ISTE (http://www.iste.co.uk/) Invited Speakers Natarajan Shankar (SRI International, USA) Ruy de Queiroz (CIN-UFPE, Brasil) Freek Wiedijk (Radboud University Nijmegen, Netherlands) Program Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Luis Farinas del Cerro (Program co-chair, IRIT, France) * Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil) * Jonathan Seldin (Univ-Lethbridge , Canada) TBC * Maur?cio Ayala-Rinc?n (UnB, Brasil) * Christiano de Oliveira Braga (UFF, Brasil) * Mario Benevides (Coppe-UFRJ, Brasil) * Eduardo Bonelli ( UNQ, Argentina) * Marcelo Corr?a (IM-UFF, Brasil) * Clare Dixon (Liverpool, UK) * Gilles Dowek (Polytechnique-Paris, France) * William Farmer (Mcmaster, Canada) * Maribel Fern?ndez (King's College, UK) * Marcelo Finger (IME-USP, Brasil) * Fairouz Kamareddine (Heriot-Watt Univ, UK) * Delia Kesner (Paris-Jussieu, France) * Luis da Cunha Lamb (UFRGS, Brasil) * Joao Marcos (UFRN, Brasil) * Ana Teresa Martins (UFC, Brasil) * Martin Musicante (UFRN, Brasil) * Cl?udia Nalon (UnB, Brasil) * Luca Paolini (Universit? di Torino, Italy) * Elaine Pimentel (UFMG, Brasil) Important dates: * Submission 13th June 2010 (NEW) * Author's notification 8th July 2010 (NEW) * Camera-ready: 30th July * Workshop : 31st August Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA2010 page at EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10) until the submission deadline by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. Please see the Instructions for Preparing Files for Preliminary Versions Instructions for styles and examples. Instructions and the Latex package used to format your submission can be found in http://www.entcs.org/prelim.html Organizing Committee * Fl?vio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil) * Martin Musicante (UFRN, Brasil) * Edward Hermann Haeusler (PUC-Rio, Brasil) * Cl?udia Nalon (UnB, Brasil) * Marcelo Corr?a (IM-UFF, Brasil) From igarashi at kuis.kyoto-u.ac.jp Thu Jun 10 18:25:42 2010 From: igarashi at kuis.kyoto-u.ac.jp (Atsushi Igarashi) Date: Thu, 10 Jun 2010 18:25:42 -0400 Subject: [TYPES/announce] CFP: AOSD 2011: Perspectives on Modularity Message-ID: N.B. The CFP doesn't explicitly mention "types" but the "subtitle" of the next edition of AOSD is Perspectives on Modularity, which has a lot to do with types... --- Atsushi Igarashi Kyoto University ---- AOSD 2011: Perspectives on Modularity 10th International Conference on Aspect-Oriented Software Development http://aosd.net/2011 March 21st - 25th, 2011, Porto de Galinhas, Pernambuco, Brazil Supported by ACM SIGSOFT & SIGPLAN (pending) First Call for Research Papers ------------------------------------------------- Important Dates: First Round: Research Paper submission : Jul. 1, 2010, 23:59 (Samoan) Acceptance Notification : Sep. 6, 2010, 23:59 (Samoan) Second Round: Research Paper submission : Oct. 1, 2010, 23:59 (Samoan) Acceptance Notification : Dec. 10, 2010, 23:59 (Samoan) Camera-ready copy : Jan. 13, 2011, 23:59 (Samoan) -------------------------------------------------- Instructions for authors: http://www.aosd.net/2011/call_research.html Email contact address: research at aosd.net -------------------------------------------------- The International Conference on Aspect-Oriented Software Development (AOSD) is the premier conference on software modularity that goes beyond traditional abstraction boundaries. The past series of the conferences have been mainly investigating "the aspects" for 10 years and explored their clear benefits. Furthermore, they have revealed that advanced modularity is the core notion for building modern software systems and hence other new modularization paradigms and techniques are also getting spotlighted today. AOSD 2011 seeks to foster advanced modularization paradigms and techniques, which are not limited to aspects thus re-emphasizing the original intention to establish AOSD as a conference on advanced separation of concerns and software modularity for extensibility, flexibility, and adaptability. AOSD 2011 invites high quality papers reporting documented research results emerging from work on new notions of modularity in computer systems, software engineering, programming languages, and other areas. Here, the modularity is not only of code but also across lifecycle artifacts (e.g., from requirements to tests). A novelty of AOSD 2011 is that authors can submit their papers at either 1st or 2nd round. The two rounds are independent but the accepted papers are presented together at the conference. If the paper is submitted at the 1st round and the review result is "resubmit after revision", the authors can resubmit the revised paper at the 2nd round with a letter to the reviewers. Then the same reviewers will review the revised paper again. AOSD 2011 adopts this procedure for motivating the acceptance of potentially good papers (but that need adjustments) rather than rejecting them straight away. Submissions will be carried out electronically via CyberChair. All papers must be submitted in PDF format. Submissions must be no more than 12 pages (including bibliography and any appendices) in standard ACM SIG Proceedings format(http://www.acm.org/sigs/publications/proceedings-templates). More details can be found in http://www.aosd.net/2011/call_research.html Research areas and topics of interest include, but are not limited to, the following: Software engineering * Requirements engineering * Analysis and design modeling * Domain engineering * Software architectures * Evaluation and metrics * Modular Reasoning * Testing and verification * Interference and composition * Traceability * Software development methods * Process and methodology definition * Patterns Programming languages * Language design * Compilation and interpretation * Verification and static program analysis * Formal languages and calculi * Execution environments & dynamic weaving * Dynamic and scripting languages * Domain-specific languages Related paradigms * Context-orientation * Feature-orientation * Traits * Model-driven development * Generative programming * Software product lines * Meta-programming and reflection * Contracts and components * View-based development Tool support * Aspect mining * Evolution and reverse engineering * Crosscutting program views * Refactoring Applications * Distributed/concurrent systems * Middleware, services, and networking * Pervasive computing * Runtime verification * Performance improvement Program committee ----------------------------------------------- Sven Apel University of Passau, Germany Eric Bodden Technische Universit?t Darmstadt, Germany Walter Cazzola University of Milano, Italy Shigeru Chiba Tokyo Institute of Technology, Japan (Chair) Pascal Costanza Vrije Universiteit Brussel, Belgium Marcus Denker INRIA Lille, France Elisa Baniassad The Australian National University, Australia Erik Ernst Aarhus University, Denmark Jeff Gray University of Alabama, USA Robert Hirschfeld Hasso-Plattner-Institut, Germany Atsushi Igarashi Kyoto University, Japan Takashi Ishio Osaka University, Japan David H. Lorenz Open University of Israel, Israel Karl Lieberherr Northeastern University, USA Hidehiko Masuhara University of Tokyo, Japan Mira Mezini Technische Universit?t Darmstadt, Germany Ana Moreira Universidade Nova de Lisboa, Portugal Hridesh Rajan Iowa State University, USA Awais Rashid Lancaster University, UK Mario S?dholt ?cole des Mines de Nantes, France Eric Tanter Universidad de Chile, Chile Jianjun Zhao Shanghai Jiao Tong University, China From alain.girault at inria.fr Fri Jun 11 04:58:26 2010 From: alain.girault at inria.fr (Alain Girault) Date: Fri, 11 Jun 2010 10:58:26 +0200 Subject: [TYPES/announce] Postdoc position in Grenoble (CRI / INRIA) Message-ID: <4C11FAB2.4020404@inria.fr> Proposal for a Post-doctoral Position ===================================== Title ===== Analyses and scheduling for advanced dataflow programming Location ======== Grenoble (France): CRI and INRIA Grenoble (Pop Art Team). Supervisors =========== INRIA Grenoble: Pascal FRADET and Alain GIRAULT. ST Microelectronics Ottawa: Ali-Erdem OZCAN and Pierre PAULIN. Application =========== Please send your CV and recommendation letters to alain.girault at inria.fr and pascal.fradet at inria.fr. The postdoc funding is for 12 months. The net income is around 2100 ? per month and includes health insurance coverage. Abstract ======== In this project, we focus on dataflow models of computation to program applications for a new embedded many-core platform designed by ST Microelectronics, called P2012. The static dataflow model of computation (SDF) is widely used because it allows analysis (deadlock and boundedness) and scheduling. SDF has a clean semantics and leads to efficient implementations but it cannot express many dynamic features. In particular, it cannot express dynamic input/output rate modifications, nor dynamic topology modifications. For this reason, many variants of SDF have been proposed, among which we can cite BDF, CSDF, HDF, and PSDF. Our objective for this project is to propose a variant of SDF able to express dynamicity while remaining verifiable (for deadlock and buffer boundedness) and schedulable. For rate modifications, PSDF offers a good trade off between expressiveness and verifiability. For dynamic topology modifications, HDF offers also a good trade off. Therefore, a combination of PSDF and HDF looks like a promising candidate as a SDF variant for our project. This point has been validated by ST Microelectronics. The postdoc should participate with ST Microelectronics to the definition of such a variant. The verification and analysis of that variant should be studied. The two main properties to guarantee are the absence of deadlocks and the boundedness of communication buffers. Another important point will be the study of a distributed scheduling of the SDF-variant programs, so that programs can be efficiently executed on the many-cores platform. To this end, a particular attention will be devoted to the minimization of the communication costs, in accordance to the memory hierarchy of the P2012 platform. To summarize, the work will consist in three main tasks: - the participation to the definition of the SDF variant (a mix of PSDF and HDF) with ST Ottawa; - the verification and analysis of the chosen variant (deadlock detection and buffer size analysis); - the scheduling (generation of a centralized version and a distributed version). Required Skills =============== A PhD in formal methods, embedded systems, and/or real-time programming (e.g. analysis, semantics, verification, validation, code generation, ...). A knowledge of dataflow programming and/or scheduling would be a plus. Context ======= The context of this work is the ST Microelectronics Platform 2012 initiative (P2012). P2012 is a many-core platform that integrates multiple clusters of processors and HW accelerators with a hierarchical memory architecture and a NoC. The position is likely to involve travels between Grenoble (Inria) and Ottawa (ST Microelectronics). The CRI is the recently created Integration Research Centre, a joint laboratory between two universities (Grenoble-INP and UJF) and three French research institutes (CEA, CNRS, and INRIA). Its purpose is to build bridges between industry and research to cut down time-to-market for innovative products, particularly smart miniaturized solutions. The main goal of the POP ART team (http://pop-art.inrialpes.fr) is the safe design of real-time embedded systems. We explore that area according to several research directions: programming languages, models of computation, static analysis, formal verification, implementation, ... The research within POP ART concerns: - design (component and interaction models for real-time systems, heterogeneity); - programming (synchronous, domain specific and aspect-oriented languages); - verification and correctness by construction (controller synthesis, compositionally, ...); - code generation (scheduling, fault-tolerance, compilation, ...). -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From david.delahaye at cnam.fr Sat Jun 12 07:12:14 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Sat, 12 Jun 2010 13:12:14 +0200 (CEST) Subject: [TYPES/announce] CICM 2010 Call for Participation Message-ID: <59515.87.231.49.143.1276341134.squirrel@webmail.cnam.fr> Please apology for multiple copies We are pleased to announce CICM 2010 which will take place at Conservatoire National des Arts et M?tiers in Paris, France from July 5 to July 10, 2010. This continues the CICM series begun with the successful CICM 2008 in in Birmingham, England and CICM 2009 in Grand Bend, Ontario, Canada. Please visit: http://cicm2010.cnam.fr/ Conferences on Intelligent Computer Mathematics gather several conferences: - 10th International Conference on Articficial Intelligence and Symbolic Computation (AISC 2010) - 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning (Calculemus 2010) - 9th International Conference on Mathematical Knowledge Management (MKM 2010) Associated Workshops are: - 3rd Workshop on Compact Computer Algebra (CCA 2010) - 3rd Workshop, Towards a Digital Mathematics Library (DML 2010) - 4th Workshop on Programming Languages for Mechanized Mathematics (PLMMS 2010) - 23rd Workshop on OpenMath (OpenMath) - Mathematically Intelligent Proof Search (MIPS 2010) - 6th Workshop on Mathematical User-Interfaces (MathUI 2010) - Content Math Training Camp with Doctoral Programme (CMTC+DP) Further events include: - A ScienCe Eu project meeting - The EuDML European project kickoff meeting - A program for doctoral students - A special training camp on Content Markup for Mathematics - A day program in honour of Th?r?se Hardin Social Events - Conference reception with Wine & Cheese buffet at the "Caf? des Techniques" at the CNAM Museum. - Conference Banquet at restaurant le Grand Bleu, Port de l'Arsenal. The full list of events is at: http://cicm2010.cnam.fr/programme.html Looking forward to see you in Paris. Laurence Rideau, Renaud Rioboo From david.delahaye at cnam.fr Sat Jun 12 07:40:58 2010 From: david.delahaye at cnam.fr (david.delahaye@cnam.fr) Date: Sat, 12 Jun 2010 13:40:58 +0200 (CEST) Subject: [TYPES/announce] Calculemus 2010: Call for Participation Message-ID: <59673.87.231.49.143.1276342858.squirrel@webmail.cnam.fr> [Apologies for cross-postings.] ------------------------------------------ CALCULEMUS 2010 - Call for Participation ------------------------------------------ 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ ******************************************* >>>> Registration is now open! <<<< (via CICM registration) http://cicm2010.cnam.fr/registration.html Registration deadline: July 4, 2010 ******************************************* Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. Calculemus 2010 will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest ================== The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Accepted Papers =============== This year, 7 full papers have been accepted for presentation at the conference. These papers are the following: * Formal Proof of SCHUR Conjugate Function Franck Butelle, Florent Hivert, Micaela Mayero and Fr?d?ric Toumazet * Symbolic Domain Decomposition Jacques Carette, Alan Sexton, Volker Sorge and Stephen Watt * A Formal Quantifier Elimination for Algebraically Closed Fields Cyril Cohen and Assia Mahboubi * Computing in Coq with Infinite Algebraic Data Structures Cesar Dominguez and Julio Rubio * Formally Verified Conditions for Regularity of Interval Matrices Ioana Pasca * Reducing Expression Size using Rule-Based Integration Albert Rich and David Jeffrey * A Unified Formal Description of Arithmetic and Set Theoretical Data Types Paul Tarau In addition, there will be short presentations for extended abstracts on emerging trends, and possibly, sessions dedicated to demos. Invited Speakers ================ Andrea Asperti (University of Bologna, Italy) Jacques Carette (McMaster University, Canada) Proceedings =========== The proceedings of full papers of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. In addition to the formal proceedings published by Springer, we will provide links to online versions of the published papers from the conference website. Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates =============== The registration deadline is July 4, 2010. The Calculemus conference is on July 6-7, 2010. Programme Committee =================== Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia (RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge (University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger (RISC, Austria) From beffara at iml.univ-mrs.fr Sat Jun 12 09:30:32 2010 From: beffara at iml.univ-mrs.fr (Emmanuel Beffara) Date: Sat, 12 Jun 2010 15:30:32 +0200 Subject: [TYPES/announce] workshop on Curry Howard for Concurrency - 28-30 June, Lyon, France Message-ID: <1276349432.3622.4.camel@murphys> Dear all, The French ANR project CHoCo is organizing a small workshop on the topic of Curry-Howard for Concurrency, from Mon 28th to Wed 30th June, in Lyon. The programme consists in four invited speakers: - Kohei Honda (Queen Mary, London) - Andrzej Murawski (Oxford) - Julian Rathke (Southampton) - Pawe? Soboci?ski (Southampton) plus several talks by members of the project. All details, including a complete programme and practical information, will appear progressively on the web page of the event: http://choco.pps.jussieu.fr/event25/ If you want to attend the event, please send an email to chocoparty.2010 at gmail.com with your name, affiliation, email address, arrival and departure dates. A limited number of fundings is available to cover your travel and accomodation expenses. Please fill in the form below if you want to apply. We will let you know whether we can support all or part of your visit in Lyon. We will handle applications received before june the 18th, after that we cannot guarantee anything. ----------------------- Application form for a participant at the Choco meeting, Lyon, june 28-30, 2010. Name, surname: Position: Institution (University, lab, etc.): Email address: Arrival and departure dates: Means of transport (and, if possible, requested schedule): ----------------------- -- Emmanuel Beffara From luigi.santocanale at lif.univ-mrs.fr Mon Jun 14 12:07:45 2010 From: luigi.santocanale at lif.univ-mrs.fr (Luigi Santocanale) Date: Mon, 14 Jun 2010 18:07:45 +0200 Subject: [TYPES/announce] FICS 2010 : submission deadline extension (June 20) Message-ID: <4C1653D1.5000808@lif.univ-mrs.fr> /* Apologies for multiple posting */ Last Call for Papers (Extended Abstracts) 7th Workshop on Fixed Points in Computer Science, FICS 2010 Brno, Czech Republic, August 21-22 2010 a satellite workshop to MFCS & CSL 2010 http://www.lif.univ-mrs.fr/fics2010/ Important dates June 20 : paper submission deadline (extended) July 10 : author notification August 21-22 : workshop in Brno Background Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, databases. The aim of the workshop is to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. Previous workshops were held in Brno (1998, MFCS/CSL workshop), Paris (2000, LC workshop), Florence (2001, PLI workshop), Copenhagen (2002, LICS (FLoC) workshop), Warsaw (2003, ETAPS workshop), Coimbra (2009, CSL workshop). Topics include, but are not restricted to: * categorical, metric and ordered fixed point models * fixed points in algebra and coalgebra * fixed points in languages and automata * fixed points in programming language semantics * the mu-calculus and fixed points in modal logic * fixed points in process algebras and process calculi * fixed points in the lambda-calculus, functional programming and type theory * fixed points in relation to dataflow and circuits * fixed points in logic programming and theorem proving * finite model theory, descriptive complexity theory, fixed points in databases Invited speakers * Arnaud Carayol, Laboratoire d'informatique Gaspard-Monge. * Panos Rondogiannis, University of Athens. * Dale Miller, INRIA and LIX. Contributed talks Selection of contributed talks is based on extended abstracts/short papers of 3...6 pp formatted with easychair.cls. Submission is via EasyChair, by *June 13 2010*. The authors will be notified of acceptance/rejection by July 10 2010. Camera-ready versions of the accepted contributions will be published for distribution at the workshop as a technical report. Journal publication If the number and quality of submissions and accepted talks warrant this, EDP Sciences will publish a special issue of Theoretical Informatics and Applications. With one exception, the special issues of the previous FICS editions appeared in this journal. The special issue of FICS 2009 will also appear there. FICS Program Committee Thorsten Altenkirch (University of Nottingham) Giovanna d'Agostino (University of Udine) Peter Dybjer (Chalmers University of Technology) Zolt?n ?sik (University of Szeged) Anna Ing?lfsd?ttir (Reykjav?k University) Gerhard J?ger (University of Bern) Ralph Matthes (IRIT, Toulouse) Andrzej Murawski (University of Oxford) Damian Niwinski (Warsaw University) Luigi Santocanale (LIF, Marseille) Alex Simpson (University of Edinburgh) Jean-Marc Talbot (LIF, Marseille) Tarmo Uustalu (Institute of Cybernetics, Tallinn) Yde Venema (University of Amsterdam) Igor Walukiewicz (LaBRI, Bordeaux) Sponsors Laboratoire d'Informatique Fondamentale de Marseille Universit? de Provence -- Luigi Santocanale LIF/CMI Marseille T?l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 From quaglia at disi.unitn.it Mon Jun 14 12:09:13 2010 From: quaglia at disi.unitn.it (Paola Quaglia) Date: Mon, 14 Jun 2010 18:09:13 +0200 Subject: [TYPES/announce] CMSB 2010 - call for posters Message-ID: <201006141609.o5EG98gr029933@disi.unitn.it> _Apologies for multiple posting_ ================================================================ Call for posters CMSB 2010 (8th Conference on Computational Methods in Systems Biology) in cooperation with ACM September 29 - October 1, 2010 Trento, Italy http://www.cosbi.eu/cmsb2010/ ================================================================ The CMSB series solicits innovative research focussing on the dynamics and on the analysis of biological systems, networks, and data. The Conference brings together computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological systems. CMSB 2010 invites submissions of posters describing projects or on-going research on the themes of the conference. Topics of interest include, but are not limited to: original models or paradigms for modelling biological processes together with their application domains; frameworks and techniques for verifying, validating, analyzing, and simulating biological systems; inference from high-throughput experimental data; model integration from biological databases. To submit a poster, please send its abstract by email to the email address cmsb2010 at cosbi.eu, together with the title of the poster and the list of its authors. The abstract should be a pdf file, not exceeding 2 pages, and should describe the main topic of the poster. Posters will be presented at the conference during dedicated sessions. Authors of accepted posters will have to print their posters themselves (max size 70cm x 70cm). Abstracts of posters will be printed out by CoSBi, the conference organizer. IMPORTANT DATES: Poster submission: June 23, 2010 Notification of poster acceptance: July 07, 2010 Conference: September 29 - October 1, 2010 From swarat at cse.psu.edu Mon Jun 14 18:09:37 2010 From: swarat at cse.psu.edu (Swarat Chaudhuri) Date: Mon, 14 Jun 2010 18:09:37 -0400 Subject: [TYPES/announce] POPL 2011: Call for Papers Message-ID: ********************************************************************* * 38th ACM SIGPLAN-SIGACT Symposium * on * Principles of Programming Languages * * January 26-28, 2011 * Austin, Texas, USA. * * Call for Papers * * http://www.cse.psu.edu/popl/11 * ********************************************************************* Important dates: Abstract submission 9pm PST, July 8, 2010 (Thurs) Paper submission 9pm PST, July 15, 2010 (Thurs) Author response period September 15-16, 2010 (Wed-Thurs) Author notification October 8, 2010 (Fri) Camera ready November 9, 2010 (Tue) Conference January 26-28, 2011 Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and systems, with emphasis on how principles underpin practice. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Advice to Authors Submissions on a diversity of topics are sought, particularly ones that identify new research directions. POPL 2011 is not limited to topics discussed in previous symposia. Authors concerned about the appropriateness of a topic may communicate by electronic mail with the program chair prior to submission. Explaining a known idea in a new way may make as strong a contribution as inventing a new one. Continuing a tradition established in POPL 2008, we encourage the submission of pearls: elegant essays that illustrate an idea, for example by developing a short program. (Advice on writing pearls can be found in the ICFP 2008 Call for Papers.) However, there is no formal separation of categories and no need to explicitly label pearls as such: ALL papers, whether pearl or otherwise, will be judged on a combination of correctness, significance, novelty, clarity, and elegance. Each paper should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make their papers understandable to a broad audience. More advice on writing technical papers can be found on the SIGPLAN Author Information page. Submission Guidelines Authors should submit an abstract of at most 300 words and a full paper of no more than 12 pages (including bibliography and appendices). The submission deadline and length limitations are firm. Submissions that do not meet these guidelines may not be considered. Submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). Detailed formatting guidelines are available on the SIGPLAN Author Information page (http://www.sigplan.org/authorInformation.htm), along with a LaTeX class file and template. Papers must be submitted in PDF format and printable on US Letter size paper. Individuals for whom this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. The ACM copyright notice is not required of submissions, only of accepted papers. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. Categories and keywords need not be included in the submission. The URL for submission of abstracts and papers is http://www.cs.tau.ac.il/conferences/popl11/. Author Response Period Authors will have a 48-hour period to read and respond to the reviews of their papers before the PC meeting. Details of the response process will be announced by e-mail a few days beforehand. Student Attendees Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to POPL. Details on the PAC program and the application can be found at http://www.sigplan.org/PAC.htm. PAC also offers support for companion travel. Conference Chair: Thomas Ball Microsoft Research One Microsoft Way, Redmond, WA 98052, USA. tball at microsoft.com Program Chair: Mooly Sagiv Schreiber 317, School of Computer Science Tel-Aviv University, Tel-Aviv 69978, Israel msagiv at post.tau.ac.il Program Committee: Radhia Cousot (Ecole Normale Superieure) Oege de Moor (Oxford University Computing Laboratory) Derek Dreyer (MPI-SWS) Azadeh Farzan (University of Toronto) Kathleen Fisher (AT&T Laboratories) Matthew Fluet (Rochester Institute of Technology) Jeff Foster (University of Maryland) Stephen Freund (Williams College) Philippa Gardner (Imperial College, London) Dan Grossman (University of Washington) Sumit Gulwani (Microsoft Research) Tim Harris (Microsoft Research) Naoki Kobayashi (Tohoku University) Viktor Kuncak (EPFL) Ken McMillan (Cadence Research Laboratories) Anders Moeller (Aarhus University) Peter Muller (ETH Zurich) Aleks Nanevski (IMDEA Software) David Naumann (Stevens Institute of Technology) Prakash Panangaden (McGill University) G. Ramalingam (Microsoft Research) Jan Vitek (Purdue University) Eran Yahav (IBM Research) Hongseok Yang (Queen Mary, University of London) Steve Zdancewic (University of Pennsylvania) *************************************************************************** From sunj at comp.nus.edu.sg Tue Jun 15 03:16:26 2010 From: sunj at comp.nus.edu.sg (jun sun) Date: Tue, 15 Jun 2010 15:16:26 +0800 Subject: [TYPES/announce] UTP 2010 Shanghai - Deadline Extension Message-ID: *************************************************************************************************** UTP 2010 The 3rd International Symposium on Unifying Theories of Programming co-located with the 12th International Conference on Formal Engineering Methods (ICFEM 2010) *** Call For Papers *** Shanghai, China 15-16 November, 2010 http://www.sei.ecnu.edu.cn/utp2010 http://www.easychair.org/conferences/?conf=utp10 **************************************************************************************************** Following on the success of UTP 2006 (County Durham, UK) and UTP 2008 (Dublin, Ireland), we are pleased to announce the UTP 2010 symposium, to be held in Shanghai, China in November 2010, co-located with ICFEM 2010, the 12th International Conference on Formal Engineering Methods. Based on the pioneering work on Unifying Theories of Programming by Tony Hoare, He Jifeng and others, the aims of the UTP Symposium series are to continue to reaffirm the significance of the ongoing UTP project, to encourage efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering communities. Of particular interest is how unification may be used to meet the goals and difficulties to be encountered in the Grand Challenges of Computing, with particular reference to the UK's "GC6: Dependable Systems Evolution" and its international cousin the "Verified Software Initiative" and their shared goal of developing a Verified Software Repository. To this end the UTP 2010 symposium welcomes contributions on the above themes as well as others which can be related to them. Such additional themes include, but are not limited to, relational semantics, relational algebra, healthiness conditions, normal forms, linkage of theories, algebraic descriptions, incorporation of probabilistic programming, timed calculi and object-based descriptions, as well as alternative programming paradigms such as functional, logical, data-flow, and beyond. In all cases, the UTP approach should be compared and advantages/disadvantages discussed. Accepted papers will be published in the symposium proceedings by Springer as a volume of the Lecture Notes in Computer Sciences. It is also planned to have a special journal issue of Formal Aspects of Computing for revised/extended versions of selected best papers from the UTP 2010 symposium. Papers should be written in English not exceeding 20 pages in LNCS format (http://www.springer.de/comp/lncs/authors.html). Submission will be via the web-based easychair system. Important Dates --------------- Abstract submission deadline: 16 July, 2010 Full-paper submission deadline: 23 July, 2010 Author notification: 10 August, 2010 Final version due: 24 August, 2010 Symposium: 15-16 November, 2010 Invited Speakers ----------------- Invited Talks: Ana Cavalcanti (University of York, UK) Jifeng He (East China Normal University, China) Jeff Sanders (UNU/IIST, Macao) Invited Tutorial: Jim Woodcock (University of York, UK) Program Committee ----------------- Bernhard K. Aichernig, Graz University of Technology, Austria Hugh Anderson, National University of Singapore, Singapore Phil Brooke, University of Teesside, UK Andrew Butterfield, Trinity College Dublin, Ireland Ana Cavalcanti, University of York, UK Yifeng Chen, Peking University, China Deepak D'Souza, IISC, India Steve Dunne, University of Teesside, UK Colin Fidge, Queensland University of Technology, Australia Jeremy Gibbons, University of Oxford, UK Lindsay Groves, Victoria University of Wellington, New Zealand Will Harwood, University of York, UK Ian Hayes, University of Queensland, Australia Arthur Hughes, Trinity College Dublin, Ireland Jeremy Jacob, University of York, UK Xiaoshan Li, University of Macao, Macao SAR, China Zhiming Liu, UNU/IIST, Macao SAR, China Annabelle McIver, Macquarie University, Australia David Naumann, Stevens Institute of Technology, USA Geguang Pu, East China Normal University, China Shengchao Qin (chair), University of Teesside, UK Zongyan Qiu, Peking University, China Bill Stoddart, University of Teesside, UK Jun Sun, National University of Singapore, Singapore Meng Sun, CWI, the Netherlands Naijun Zhan, Institute of Software, CAS, China Huibiao Zhu, East China Normal University, China -- yours, Sun Jun From kutsia at risc.uni-linz.ac.at Tue Jun 15 06:49:09 2010 From: kutsia at risc.uni-linz.ac.at (Temur Kutsia) Date: Tue, 15 Jun 2010 12:49:09 +0200 Subject: [TYPES/announce] LOPSTR/PPDP 2010 Early Registration Deadline: June 21 Message-ID: <4C175AA5.80603@risc.uni-linz.ac.at> [Apologize for multiple copies] ==================================================================== *** CALL FOR PARTICIPATION *** LOPSTR 2010 20th International Symposium on Logic-Based Program Synthesis and Transformation http://www.risc.jku.at/conferences/lopstr2010/ July 23-25, 2010 PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www.risc.jku.at/conferences/ppdp2010/ July 26-28, 2010 Hagenberg, Austria ==================================================================== IMPORTANT INFORMATION Early registration deadline (for both conferences): June 21, 2010 -------------------------------------------------------------------- LOPSTR 2010 INVITED SPEAKERS: - Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) - Olivier Danvy (University of Aarhus, Denmark) - Johann Schumann (RIACS/NASA Ames Research Center, USA) LOPSTR 2010 PROGRAM: http://www.risc.jku.at/conferences/lopstr2010/program.html -------------------------------------------------------------------- PPDP 2010 INVITED SPEAKERS: - Maria Paola Bonacina (University of Verona, Italy) - Sumit Gulwani (Microsoft Research) PPDP 2010 PROGRAM: http://www.risc.jku.at/conferences/ppdp2010/program.html -------------------------------------------------------------------- From Jeremy.Gibbons at comlab.ox.ac.uk Thu Jun 17 11:53:20 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Thu, 17 Jun 2010 16:53:20 +0100 (BST) Subject: [TYPES/announce] Fully-funded PhD in programming languages at Oxford Message-ID: <201006171553.o5HFrK7f013449@merc3.comlab.ox.ac.uk> FULLY-FUNDED DOCTORAL STUDENTSHIP IN PROGRAMMING LANGUAGES AT OXFORD I have just obtained funding for a DPhil studentship at Oxford. The studentship is open in terms of topic; I would welcome applications for research in any of my areas of interest. These include: functional programming generic programming dependent types design patterns model-driven development For more information about topics, please visit my web page http://web.comlab.ox.ac.uk/people/Jeremy.Gibbons/ or discuss with me. The successful candidate will have a good bachelor's or master's degree in CS, and a strong background in the principles of programming languages. The funding covers stipend, fees (at the home/EU rate), equipment, and travel, and is for three and a half years from October 2010 (or as soon as possible after that). Please do contact me with any questions, and in any case before applying. Please also pass this note on to anyone who might be interested. Jeremy.Gibbons at comlab.ox.ac.uk, Deputy Director Oxford University Computing Laboratory, TEL: +44 1865 283508 Wolfson Building, Parks Road, FAX: +44 1865 283531 Oxford OX1 3QD, UK. URL: http://www.comlab.ox.ac.uk/oucl/people/jeremy.gibbons.html From ruy at cin.ufpe.br Fri Jun 18 08:16:33 2010 From: ruy at cin.ufpe.br (Ruy de Queiroz) Date: Fri, 18 Jun 2010 09:16:33 -0300 Subject: [TYPES/announce] CFP - WoLLIC 2011, May 18-21, Philadelphia Message-ID: *[please circulate; apologies for multiple copies]* * * *WoLLIC 2011 18th Workshop on Logic, Language, Information and Computation * *May 18th to 21st, 2011 * *University of Pennsylvania Philadelphia, USA* *Scientific Sponsorship* *Interest Group in Pure and Applied Logics (IGPL )* *The Association for Logic, Language and Information (FoLLI )* *Association for Symbolic Logic (ASL )* *European Association for Theoretical Computer Science (EATCS )* *Sociedade Brasileira de Computa??o (SBC )* *Sociedade Brasileira de L?gica (SBL )* *Organisation* *Department of Mathematics , University of Pennsylvania , USA Centro de Inform?tica , Universidade Federal de Pernambuco , Brazil * ------------------------------ Call for PapersWoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The eighteenth WoLLIC will be held at the University of Pennsylvania, Philadelphia, USA, from May 18th to 21st, 2011. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computa??o (SBC), and theSociedade Brasileira de L?gica (SBL). *Paper submission* Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2010 EasyChair website. (Please go to http://wollic.org/wollic2011/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by January 1, and the full paper by January 8 (firm date). Notifications are expected by February 21, and final papers for the proceedings will be due by March 1 (firm date). *Proceedings* The proceedings of WoLLIC 2011, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the *Logic Journal of the IGPL*, and selected contributions will be published as a special post-conference WoLLIC 2011 issue of an scientific journal (soon to be confirmed). *Invited Speakers* (tba) *Student Grants* ASL sponsorship of WoLLIC 2011 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2011). See http://www.aslonline.org/studenttravelawards.html for details. *Important Dates* January 1, 2011: Paper title and abstract deadline January 8, 2011: Full paper deadline (firm) February 21, 2011: Author notification March 1, 2011: Final version deadline (firm) *Programme Committee* Krzysztof Apt (Amsterdam) (tbc) Sergei Artemov (New York) Jeremy Avigad (Pittsburgh) Arnold Beckman (Swansea) Lev Beklemishev (Moscow) (CHAIR) Alessandro Berarducci (Pisa) Andreas Blass (Ann Arbor) (tbc) Sam Buss (San Diego) Achim Jung (Birmingham) Benedikt L?we (Amsterdam) Janos Makowsky (Haifa) Michael Moortgat (Utrecht) Andrew Odlyzko (Minneapolis) (tbc) Vincent van Oostrom (Utrecht) Prakash Panangaden (Montr?al) Rohit Parikh (New York) Fernando Pereira (Philadelphia) (tbc) Ruy de Queiroz (Recife) Alexander Shen (Marseilles and Moscow) Bas Spitters (Nijmegen) Helmut Veith (Wien) Yde Venema (Amsterdam) Scott Weinstein (Philadelphia) Frank Wolter (Liverpool) *Steering Committee* Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Hiroakira Ono, Ruy de Queiroz. *Organising Committee* Vivek Nigam (U Penn) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) Andre Scedrov (U Penn) (co-chair) *Further information* Contact one of the Co-Chairs of the Organising Committee. *Web page* http://wollic.org/wollic2011/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100618/bb59bf95/attachment-0001.htm From pangjun at gmail.com Mon Jun 21 03:35:27 2010 From: pangjun at gmail.com (Jun PANG) Date: Mon, 21 Jun 2010 09:35:27 +0200 Subject: [TYPES/announce] VTSA 2010 summer school: 2nd Call for participants Message-ID: **************************************************************** Summer School on Verification Technology, Systems & Applications http://www.mpi-inf.mpg.de/VTSA10/ Application Deadline: July 23, 2010 Notification until: August 06, 2010 Summer School: September 06-10, 2010 **************************************************************** A summer school on verification technology, systems and applications will be organized by the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxembourg, in cooperation with the Max-Planck Institute f?r Informatik in Saarbr?cken and the INRIA research center in Nancy. The school will take place from September 6th to 10th 2010 in Luxembourg. The following speakers have accepted to give courses: Javier Esparza: Building a Software Model-Checker Wan Fokkink: Protocol Validation with mCRL Marta Kwiatkowska: Probabilistic Model Checking Markus M?ller-Olm: Fundamentals of Software Model Checking Wang Yi: Modeling and Analysis of Timed Systems Participation is free (except for travel and accommodation costs) and open to anybody holding at least a Bachelor degree (or equivalent) in computer science. The number of participants is limited. Please apply electronically by *July 23th, 2010* by sending - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your bachelor certificate (or equivalent or higher) to jun.pang at uni.lu. For details please see the Web page of the school. From davide at disi.unige.it Tue Jun 22 17:51:37 2010 From: davide at disi.unige.it (Davide Ancona) Date: Tue, 22 Jun 2010 23:51:37 +0200 Subject: [TYPES/announce] OOPS track at SAC 2011: Call for Papers Message-ID: <4C213069.7050907@disi.unige.it> OOPS 2011 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS11 Special Track at the 26th ACM Symposium on Applied Computing, SAC 2011 http://www.acm.org/conferences/sac/sac2011 Tunghai University, TaiChung, Taiwan March 21 - 25, 2011 - Important Dates (deadlines are strict) August 24, 2010: Full Paper Submission October 12, 2010: Notification of paper acceptance/rejection November 2, 2010: Camera-ready copies of accepted papers - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Shigeru Chiba (chiba at is.titech.ac.jp) Tokyo Institue of Technology, Japan Atsushi Igarashi (igarashi at kuis.kyoto-u.ac.jp) Kyoto University, Japan Andy Kellens (akellens at vub.ac.be) Vrije Universiteit Brussel, Belgium - Program Committee * Wei Ngan Chin, National University of Singapore, Singapore * Erik Ernst, University of Aarhus, Denmark * Manuel F?hndrich, Microsoft Research, USA * Jacques Garrigue, Nagoya University, Japan * Robert Hirschfeld, HPI Potsdam, Germany * Jakko J?rvi, Texas A&M University, USA * Kiyokuni Kawachiya, IBM Tokyo Research Laboratory, Japan * Doug Lea, Suny Oswego, USA * Hidehiko Masuhara, University of Tokyo, Japan * Sean McDirmid, Microsoft Research Asia, Beijin * Oscar Nierstrasz, University of Bern, Switzerland * James Noble, Victoria University of Wellington, New Zealand * Manuel Oriol, University of York, UK * Renaud Pawlak, ISEP Research and Consulting for Computer Engineering, France * Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea * Jianjun Zhao, Shanghai Jiao Tong University, China - SAC 2011 For the past twenty-five years, the ACM Symposium on Applied Computing(SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University, TaiChung, Taiwan. - OOPS Track The object-oriented (OO) paradigm is extensively used to design and implement today's large scale software systems. However, existing OO languages and platforms need to evolve to better support features like interoperability, software reuse, dynamic software adaptation, efficiency on multicore hardware, security, and safety. The aim of OOPS is to foster the development of extensions to existing OO languages and platforms, as well as the design and implementation of new languages and platforms embracing and enhancing the object-oriented paradigm. Particularly of interest for OOPS are papers that provide a thorough analysis covering most of the following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Language design and implementation * Type systems, static analysis, formal methods * Integration with other paradigms * Aspects, components, and modularity * Reflection, meta-programming * Databases and persistence * Distributed, concurrent or parallel systems * Interoperability, versioning and software adaptation - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system at https://www.softconf.com/b/sac11-tp/. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding 5 pages each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by August 24, 2010. For more information please visit the SAC 2011 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at the conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, we are planning to organize a journal special issue hosting the extended versions of the best papers of the track. From gethin at dcs.gla.ac.uk Wed Jun 23 03:54:19 2010 From: gethin at dcs.gla.ac.uk (Gethin Norman) Date: Wed, 23 Jun 2010 08:54:19 +0100 Subject: [TYPES/announce] Special Issue of Quantitative Aspects of Programming Languages and Systems Message-ID: ---------------------------------------------------------------- Special Issue of THEORETICAL COMPUTER SCIENCE on Quantitative Aspects of Programming Languages and Systems http://qav.comlab.ox.ac.uk/qapl10 ---------------------------------------------------------------- ******************************** CALL FOR PAPERS ******************************** We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). Papers are welcome which are revised versions of the works submitted to and presented at the QAPL 2010 Workshop, Paphos, Cyprus, March 27-28. We will also welcome submissions of papers not presented at QAPL 2010, provided they fall into the scope of the call and contain a clear and novel contribution to the field. ---------------------------------------------------------------- SCOPE ---------------------------------------------------------------- Quantitative aspects of computation are important and sometimes essential in characterising the behaviour and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, risk and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. This special issue will be devoted to research papers which discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, contributions should focus on * the design of probabilistic and real-time languages and the definition of semantical models for such languages; * the discussion of methodologies for the analysis of probabilistic an timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g. worst-case memory/stack/cache requirements); * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis); * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues. * the investigation of computational models and paradigms involving quantitative aspects, such as those arising in quantum computation, systems biology, bioinformatics, etc. ---------------------------------------------------------------- TOPICS ---------------------------------------------------------------- Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. ---------------------------------------------------------------- SUBMISSIONS ---------------------------------------------------------------- Papers should be 20-25 pages long, including appendices, and should be formatted according to Elsevier's elsart document style used for articles in the Journal of Theoretical Computer Science (see the Guide for Authors at http://ees.elsevier.com/tcs/). Details on the submission procedure will be made available from the webpage http://qav.comlab.ox.ac.uk/qapl10/special_issue.html. ---------------------------------------------------------------- IMPORTANT DATES ---------------------------------------------------------------- * Paper submission: 15 November 2010 * Notification: 15 February 2011 ---------------------------------------------------------------- EDITORS ---------------------------------------------------------------- Alessandra Di Pierro University of Verona, Italy alessandra.dipierro at univr.it Gethin Norman University of Glasgow, UK gethin at dcs.gla.ac.uk ---------------------------------------------------------------- The University of Glasgow, charity number SC004401 From smarkstr at cs.ucla.edu Thu Jun 24 16:30:55 2010 From: smarkstr at cs.ucla.edu (Shane Markstrum) Date: Thu, 24 Jun 2010 16:30:55 -0400 Subject: [TYPES/announce] CfP 2nd Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU) @ SPLASH/Onward! Message-ID: Call for Papers PLATEAU 2010 Second Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU) in conjunction with SPLASH/Onward! 2010 October 17-21, 2010 (Reno, NV) http://ecs.victoria.ac.nz/Events/PLATEAU/WebHome SUBMISSION SITE http://www.easychair.org/conferences/?conf=plateau10 IMPORTANT DATES Submission Deadline August 13 Notification September 15 Registration October 15 Workshop October 18 SCOPE Programming languages exist to enable programmers to develop software effectively. But how efficiently programmers can write software depends on the usability of the languages and tools that they develop with. The aim of this workshop is to discuss methods, metrics and techniques for evaluating the usability of languages and language tools. The supposed benefits of such languages and tools cover a large space, including making programs easier to read, write, and maintain; allowing programmers to write more flexible and powerful programs; and restricting programs to make them more safe and secure. We plan to gather the intersection of researchers in the programming language, programming tool, and human-computer interaction communities to share their research and discuss the future of evaluation and usability of programming languages and tools. We are also interested in the input of other members of the programming research community working on related areas, such as aspects, refactoring, design patterns, program analysis, program comprehension, software visualization, end-user programming, and other programming language paradigms. Some particular areas of interest are: - empirical studies of programming languages - methodologies and philosophies behind language and tool evaluation - software design metrics and their relations to the underlying language - user studies of language features and software engineering tools - visual techniques for understanding programming languages - critical comparisons of programming paradigms, such as object-oriented vs. functional - tools to support evaluating programming languages SUBMISSIONS Participants are invited to submit a position paper describing their on going work. We will accept papers (from 4 to 6 pages) that describe work-in-progress or recently completed work based on the themes and goals of the workshop or related topics, report on experiences gained, question accepted wisdom, raise challenging open problems, or propose speculative new approaches. Longer submissions will be considered, but all submissions must be fewer than 10 pages. Submissions and final papers should be formatted using the ACM SIGPLAN 10 point format. Templates for Word and LaTeX are available at http://www.acm.org/sigs/sigplan/authorInformation.htm; this site also contains links to useful information on how to write effective submissions. Accepted submissions will be made available through this website and workshop participants are encouraged to have read the position papers before attending the workshop. Participants are also asked to prepare a presentation to support their position paper. ORGANIZERS Emerson Murphy-Hill - University of British Columbia, Canada Shane Markstrum - Bucknell University, USA Craig Anslow - Victoria University of Wellington, New Zealand PROGRAM COMMITTEE Andrew Black - Portland State University, USA Rob DeLine - Microsoft Research, USA Christine Halverson - IBM Research, USA Donna Malayeri - ?cole Polytechnique F?d?rale de Lausanne, Switzerland Shane Markstrum - Bucknell University, USA Rob Miller - MIT, USA Emerson Murphy-Hill - University of British Columbia, Canada James Noble - Victoria University of Wellington, New Zealand Vibha Sazawal - University of Maryland, College Park, USA Chris Scaffidi - Oregon State University, Corvallis, USA Jeff Stylos - Microsoft, USA Ewan Tempero - University of Auckland, New Zealand Christophe Treude - University of Victoria, Canada Ben Wiedermann - University of Texas, Austin, USA http://ecs.victoria.ac.nz/Events/PLATEAU/WebHome From mtf at cs.rit.edu Thu Jun 24 22:36:54 2010 From: mtf at cs.rit.edu (Matthew Fluet) Date: Thu, 24 Jun 2010 22:36:54 -0400 (EDT) Subject: [TYPES/announce] Workshop on ML 2010 - Extended Submission Deadline Message-ID: In response to requests, the submission deadline has been extended by one week until 2 July 2010. The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Content (Extended Deadline) ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Invited Speaker ~~~~~~~~~~~~~~~ Luke Hoban (Microsoft) -- Bringing F# to Visual Studio 2010 Important Dates ~~~~~~~~~~~~~~~ Submission: 2 July, 2010 (extended) Notification: 9 August, 2010 Format ~~~~~~ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ~~~~~ We primarily seek research presentations on topics related to ML, including (but not limited to): * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials are intended to show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or application software built on or related to ML technology. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able provide a projector.) Submission Guidelines and Instructions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Email submissions to mtf AT cs.rit.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Program Chair ~~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander Lulea University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google From Neil.Ghani at cis.strath.ac.uk Wed Jun 30 16:51:49 2010 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Wed, 30 Jun 2010 21:51:49 +0100 Subject: [TYPES/announce] Lecture Series by John Power Message-ID: <5E6B3042-BDB8-4F70-B7C6-891FF940C5EA@cis.strath.ac.uk> John Power will be giving a series of lectures hosted by the MSP group in Glasgow. Here is a brief description Title: Locally Finitely Presentable Categories and Lawvere Theories John Power will be giving a course of lectures on Locally Finitely Presentable Categories and Lawvere theories starting on July 26 2010; there will be 4 weekly sessions of lectures/ discussions, each session occupying one afternoon. The audience will include postgraduate students, research fellows and academic sta? from research groups around Scotland and even beyond. The exact content of the lectures will be tailored to the needs of those attending. Those interested in attending these lectures should contact Prof Neil Ghani (ng at cis.strath.ac.uk) for more details. All the best Neil -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100630/8e487e24/attachment.htm From sweirich at cis.upenn.edu Fri Jul 2 19:15:17 2010 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 2 Jul 2010 18:15:17 -0500 Subject: [TYPES/announce] TLDI 2011 Call For Papers Message-ID: <804A5D91-6848-4E24-BAED-DA3487BB9CB5@cis.upenn.edu> TLDI 2011 CALL FOR PAPERS The Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation Austin, Texas, USA Tuesday, January 25, 2011 (Co-located with POPL 2011) http://www.mpi-sws.org/~dreyer/tldi2011/ Submission Deadline: October 11, 2010 The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2011 is the sixth workshop in the series and will be co-located with POPL in Austin, Texas in January 2011. Submissions for TLDI 2011 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2011 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented or dynamic languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. Submission Guidelines: Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Monday, October 11, 2010. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template. Papers must be submitted electronically via the workshop website (http://www.mpi-sws.org/~dreyer/tldi2011/) in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Submissions should contain original research not published or submitted for publication elsewhere. Publication: As in previous years, accepted papers will be published by the ACM and appear in the ACM digital library. A printed proceedings will be available at the workshop. Important Dates: - Submission deadline: October 11, 2010 (Monday), 21:00 Samoa-Apia Time - Notification: November 8, 2010 (Monday) - Final versions due: November 22, 2010 (Monday) - Workshop: January 25, 2011 (Tuesday) General Chair: Stephanie Weirich University of Pennsylvania sweirich at cis dot upenn dot edu Program Chair: Derek Dreyer Max Planck Institute for Software Systems (MPI-SWS) dreyer at mpi-sws dot org Program Committee: Thorsten Altenkirch (University of Nottingham) Fritz Henglein (University of Copenhagen) Michael Hicks (University of Maryland, College Park) Limin Jia (Carnegie Mellon University) Mark Jones (Portland State University) Neel Krishnaswami (Microsoft Research, Cambridge) Paul-Andr? Melli?s (CNRS & Universit? Paris Diderot) Aleks Nanevski (IMDEA Software, Madrid) Benjamin Pierce (University of Pennsylvania) Tachio Terauchi (Tohoku University) Sam Tobin-Hochstadt (Northeastern University) Steering Committee: Amal Ahmed (Indiana University) Nick Benton (Microsoft Research, Cambridge) Derek Dreyer (MPI-SWS) Robert Harper (Carnegie Mellon University, chair) Andrew Kennedy (Microsoft Research, Cambridge) Francois Pottier (INRIA Rocquencourt) Zhong Shao (Yale University) Stephanie Weirich (University of Pennsylvania) From jeremy.siek at colorado.edu Fri Jul 2 20:09:04 2010 From: jeremy.siek at colorado.edu (Jeremy Siek) Date: Sat, 3 Jul 2010 01:09:04 +0100 Subject: [TYPES/announce] CfP: FOOL '10, Foundations of Object-Oriented Languages Message-ID: Call For Papers 2010 International Workshop on Foundations of Object-Oriented Languages (FOOL '10) Sponsored by ACM SIGPLAN Sunday, 17 October 2010 Reno, Nevada, USA A Workshop of SPLASH (OOPSLA) '10 http://ecee.colorado.edu/~siek/FOOL2010 Deadlines Title and Abstract: Monday, 2 August 2010 Submissions: Monday, 9 August 2010 Notifications: Monday, 30 August 2010 Final versions: Friday, 1 October 2010 Workshop Description The search for sound principles for object-oriented languages has given rise to much work during the past two decades, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. FOOL became FOOL/WOOD in 2006, joining forces with the Workshop on Object-Oriented Developments. FOOL has traditionally co-located with the POPL conference, but this year we are trying something new, co-locating with SPLASH/OOPSLA. FOOL'10 will be held in Reno, Nevada, USA on Sunday, 17 October 2010, during the workshop days at the beginning of SPLASH. Submissions for this event are invited in the general area of foundations of object-oriented languages and program analysis. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, database languages, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as an informal electronic proceedings. Historically, presentation at FOOL (or FOOL/WOOD) does not count as prior publication, and many of the results presented at FOOL have later been published at ECOOP, OOPSLA, POPL, and other conferences. Submission Instructions We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy (http://www.acm.org/sigs/sigplan/republicationpolicy.htm). Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page. Templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm . While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. More detailed submission instructions will be announced on the workshop web site at http://ecee.colorado.edu/~siek/FOOL2010. Program Chair Jeremy Siek (University of Colorado at Boulder) e-mail: jeremy.siek at colorado.edu Program Committee Davide Ancona (Universita' di Genova, Italy) Juan Chen (Microsoft Research, USA) Derek Dreyer (MPI-SWS, Germany) Atsushi Igarashi (Kyoto University, Japan) Donna Malayeri (EPFL, Switzerland) Nate Nystrom (University of Texas Arlington, USA) Frank Piessens (Katholieke Universiteit Leuven, Belgium) Chieri Saito (Kyoto University, Japan) Sam Tobin-Hochstadt (Northeastern, USA) Elena Zucca (Universita' di Genova, Italy) Steering Committee Jonathan Aldrich (Carnegie Mellon University, USA) [Chair] Viviana Bono (Universita` di Torino, Italy) Michele Bugliesi (Universita` Ca' Foscari, Italy) Kathleen Fisher (AT&T Labs, USA) Benjamin Pierce (University of Pennsylvania, USA) John Reppy (University of Chicago, USA) Christopher Stone (Harvey Mudd College, USA) Philip Wadler (University of Edinburgh, Scotland) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100702/9363fac8/attachment.htm From jan.cederquist at ist.utl.pt Sun Jul 4 14:52:36 2010 From: jan.cederquist at ist.utl.pt (Jan Cederquist) Date: Sun, 04 Jul 2010 18:52:36 +0000 Subject: [TYPES/announce] 2nd Cfp: Software Verification and Testing at ACM SAC 2011 Message-ID: <4C30D874.9000704@ist.utl.pt> Call for papers ============================================== 26th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 21 - 25, 2011, TaiChung, Taiwan http://web.ist.utl.pt/~jan.cederquist/sacsvt11/Main.html http://www.acm.org/conferences/sac/sac2011/ Important dates * Aug 24th 2010: Submission deadline * Oct 12th 2010: Notification of acceptance/rejection * Nov 2nd 2010: Camera-ready versions due ACM Symposium on Applied Computing The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-five years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2011 is sponsored by SIGAPP and will be hosted by Tunghai University, TaiChung, Taiwan. Software Verification and Testing Track We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - correct by construction development - model-based testing - verification-based testing - symbolic execution - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/b/sac11-tp/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Publication of accepted articles requires the commitment of one of the authors to register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2011 proceedings. Program committee Wolfgang Ahrendt, Chalmers University of Technology, Sweden Yves Bertot, INRIA, Sophia Antipolis, France Laura Brandan-Briones, Universidad Nacional de C?rdoba, Argentina Jan Cederquist (track chair), Instituto Superior T?cnico, Portugal Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Dilian Gurov, Royal Institute of Technology, Sweden Joshua Guttman, Worcester Polytechnic Institute and The MITRE Corporation, USA Chris Hankin, Imperial College, UK Jay Ligatti, University of South Florida, USA MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Catuscia Palamidessi, INRIA Saclay and LIX, France Jun Pang, University of Luxembourg, Luxembourg Antonio Ravara, New University of Lisbon, Portugal Fausto Spoto, University of Verona, Italy From m.casadei at unibo.it Mon Jul 5 05:56:19 2010 From: m.casadei at unibo.it (Matteo Casadei) Date: Mon, 5 Jul 2010 11:56:19 +0200 Subject: [TYPES/announce] [2nd CfP] SAC 2011 Track on Coordination Models, Languages and Applications References: <9E432C39-74B0-43BF-919C-C088BF3C26AD@unibo.it> Message-ID: <0EAEB9EA-406B-491E-872C-3F712BE3A88F@unibo.it> ------------------------------------------------------------------------------------------------ CALL FOR PAPERS Coordination Models, Languages, and Applications (CM) Special Track at the 26th Symposium on Applied Computing (SAC 2011) TaiChung, Taiwan March 21 - 25, 2011 (http://sac2011.apice.unibo.it/) IMPORTANT DATES Aug. 24, 2010: Paper submissions Oct. 12, 2010: Author notification Nov. 2, 2010: Camera-Ready Copy For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. TRACK ON COORDINATION MODELS, LANGUAGES, AND APPLICATIONS Building on the success of the twelfth previous editions (1998-2010), a special track on coordination models, languages and applications will be held at SAC 2011. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications of coordination technologies - Industrial points of view: experiences, applications, open issues - Internet- and Web-based coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Coordination in Service-oriented architectures and Web Services - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - Modern Workflow Management Systems and Case-Handling - Coordination in Computer Supported Cooperative Work - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Coordination Middleware and Infrastructures - Coordination in GRID systems - Self-organization-based approaches to coordination such as those based on swarm and stigmergy - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint), programming or their extensions with coordination capabilities - Formal aspects (semantics, reasoning, verification) PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2011 proceedings and in the Digital Library. PAPER SUBMISSION AND FORMAT All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers must be no longer than 6 pages and in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site:http://www.acm.org/conferences/sac/sac2011/. PC MEMBERS Farhad Arbab, CWI Amsterdam and Leiden University (Netherlands) Marcello Bonsangue, Leiden University (Netherlands) Rocco De Nicola, University of Firenze (Italy) Jose Fiadero, University of Leicester (Italy) Keith Harrison-Broninski, Role Modellers Ltd (UK) Kurt Lichtner, Sybase iAnywhere (Canada) Henry Muccini, University of l'Aquila (Italy) Andrea Omicini, University of Bologna (Italy) Manuel Oriol, University of York (UK) Razvan Popescu, Trinity College Dublin (Ireland) Antonio Porto, University of Porto (Portugal) Rosario Pugliese, University of Florence (Italy) Alessandro Ricci, University of Bologna (Italy) Davide Rossi, University of Bologna (Italy) Yasuyuki Tahara, National Institute of Informatics (Japan) Carolyn Talcott, SRI International (USA) Emilio Tuosto, University of Leicester (UK) Michael Ignaz Schumacher, University of Applied Sciences (Switzerland) Robert Tolksdorf, Freie Universitaet Berlin (Germany) Mirko Viroli, University of Bologna (Italy) George Wells, Rhodes University (South Africa) Herbert Wiklicky, Imperial College London (UK) Pawe? T. Wojciechowski, Pozna? University of Technology (Poland) TRACK CO-CHAIRS Matteo Casadei, Alma Mater Studiorum - Universita' di Bologna, Italy From raja at tifr.res.in Mon Jul 5 08:06:15 2010 From: raja at tifr.res.in (N. Raja) Date: Mon, 5 Jul 2010 17:36:15 +0530 Subject: [TYPES/announce] ICDCIT -- 2011, Bhubaneswar, India, Call for papers Message-ID: The role of types and proofs in several aspects of programming methodologies, formal methods, and software development, has always been important in the arena of distributed computing and Internet technologies. ------------------------------------------------------------------- CALL FOR PAPERS ICDCIT -- 2011 The Seventh International Conference on Distributed Computing and Internet Technology: http://www.icdcit.ac.in 09 - 12 February 2011, Bhubaneswar, India ------------------------------------------------------------------- IMPORTANT DATES Submission Deadline - 31 July 2010 Decision Notification - 01 October 2010 Final Submission - 01 November 2010 Conference Dates - 09--12 February 2011 CONTACT URL: http://www.icdcit.ac.in --------------------------------------------------------------------- INVITED SPEAKERS Jos Baeten, Eindhoven University of Technology, The Netherlands Yves Deswarte, LAAS-CNRS, France Kohei Honda, Queen Mary & Westfield College, UK Vaughan Pratt, Stanford University, USA --------------------------------------------------------------------- 1. INTRODUCTION --------------------------------------------------------------------- Established in 2004, the ICDCIT conference series has become a platform for Computer Science researchers from India and all over the world to exchange research results and ideas on the foundations and applications of Distributed Computing and Internet Technologies. Increasingly, such technologies enable individuals and organizations to jointly engage in the production, processing and dissemination of knowledge. The 7th International Conference on Distributed Computing and Internet Technologies (ICDCIT - 2011) will take place in Bhubaneswar during 9 - 12 February 2011. It will be co-organized by KIIT University, Bhubaneswar, India and Centre for Electronic Governance, UNU-IIST, Macao. Like the last six editions, the proceedings are expected to be published by Springer in the series of Lecture Notes in Computer Science. --------------------------------------------------------------------- 2. PAPER SUBMISSION --------------------------------------------------------------------- ICDCIT - 2011 invites submissions of research papers containing original contributions to the foundations and applications of Distributed Computing and Internet Technology. The papers must not be published or being considered for publication by any other conference or journal. All submitted papers will be reviewed by the Program Committee. In order to appear in the conference proceedings, accepted papers must be presented at the conference by one of the authors. Papers must be written in English and should not exceed 12 pages, prepared according to the LNCS style in LaTeX or Word and submitted electronically in PDF format through the conference submission portal at EasyChair. Submissions received after the due date, exceeding length limit, or not structured according to the provided templates may not be considered for review. The proceedings of the last six editions of the conference have been published by Springer in the Lecture Notes on Computer Science series. --------------------------------------------------------------------- 3. SCOPE --------------------------------------------------------------------- The list of topics addressed by ICDCIT includes, but is not limited to: DISTRIBUTED COMPUTING Distributed Algorithms Concurrency and Parallelism Performance Analysis Domain-Specific Architectures & languages Secure Computing and Communication Data and Service Grid Allocations and Computations Cloud and P2P Systems Location-Based Computing Formal Methods Bio Inspired Computing INTERNET TECHNOLOGIES Semantic Web Service Oriented Architecture Web Search & Mining Information Retrieval Multi-media Systems QoS Analysis Business Processing Monitoring and Service Delivery Bidding and Negotiation Reputation and Trust SOCIETAL APPLICATION IT Infrastructures Social Networking Co-operative Problem Solving Participatory Governance Environmental Resource Management Culture and Heritage Management Entertainment Systems Applications in Governance E-Health Applications E-Learning & Web 2.0 --------------------------------------------------------------------- 4. COMMITTEES --------------------------------------------------------------------- PATRONS Achyuta Samanta, KIIT, India ADVISORY COMMITTEE Maurice Herlihy, Brown University, USA G?rard Huet, INRIA, France Tomasz Janowski, UNU-IIST, Macao A.S.Kolaskar, KIIT, India David Peleg, WIS, Israel R.K. Shyamasundar, TIFR, India GENERAL CHAIRS H. Mohanty, University of Hyderabad, India Vivek Sarkar, Rice University, USA PROGRAM CO-CHAIRS Raja Natarajan, TIFR, India Adegboyega Ojo, UNU-IIST, Macao ORGANIZING CHAIR Animesh Tripathy, KIIT, India FINANCE CHAIR Samaresh Mishra, KIIT, India PUBLICITY CHAIR Prachet Bhuyan, KIIT, India PROGRAM COMMITTEE Purandar Bhaduri, IIT Guwahati, India Nikolaj Bjorner, Microsoft, USA Elizabeth Buchanan, Univ of Wisconsin-Milwaukee,U SA Antonio Cerone, UNU--IIST, Macao Venkatesh Choppella, IIIT Hyderabad, India Van Hung Dang, Vietnam National Univ, Vietnam Elsa Estevez, UNU--IIST, Macau Pablo Fillottrani, Universidad Nacional del Sur, Argentina Veena Goswami, KIIT, India Chittaranjan Hota, BITS Pilani, India Paul Humphreys, University of Virginia, USA Aditya Kanade, IISc, India Delia Kesner, Univ of Paris, France Paddy Krishnan, Bond Univ, Australia Lakshmanan Kuppusamy, VIT, India Sanjay Madria, Missouri Univ, USA Rupak Majumdar, MPI, Germany Tulika Mitra, NUS, Singapore Debajyoti Mukhopadhyay, CBS, India G.B.Mund, KIIT, India Brajendra Panda, Univ of Arkansas, USA N. Parimala, JNU, India Ankur Narang, IBM, India Rajdeep Niyogi, IIT Roorkee, India Manas Ranjan Patra, Berhampur University, India Dana Petcu, West Univ of Timisoara, Romania G. Michele, Pinna Univ of Cagliari, Italy P. Radha Krishna, Infosys, India Srini Ramaswamy, ABB Corporate Research, India Benoit Razet, TIFR, India Ashutosh Saxena, Infosys, India Manoj Saxena, Univ of Delhi, India Jaydip Sen, TCS, India Hardeep Singh, GNDU, India Arcot Sowmya, UNSW, Australia Manuel Serrano, INRIA, France Hideyuki Takahashi, Tohoku University, Japan Nobuko Yoshida, Imperial College London, UK ORGANIZERS KIIT University UNU-IIST Centre for Electronic Governance, Macao Submission Deadline -- 31 July 2010 CONTACT URL: http://www.icdcit.ac.in ------------------------------------------ From thomas.ehrhard at pps.jussieu.fr Tue Jul 6 06:16:04 2010 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Tue, 06 Jul 2010 12:16:04 +0200 Subject: [TYPES/announce] LC2010 registration deadline extension Message-ID: <4C330264.7020508@pps.jussieu.fr> LOGIC COLLOQUIUM 2010 Paris, July 25 - July 31 Registration Deadline Extension The preregistration and registration deadline for the Logic Colloquium 2010 http://www.logic2010.org has been extended. The new deadline is July 14th Looking forward to seeing you in Paris, The Organizing Committee of LC2010 From manuel.mazzara at newcastle.ac.uk Fri Jul 9 10:28:53 2010 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Fri, 9 Jul 2010 15:28:53 +0100 Subject: [TYPES/announce] Second CFP: SAC 2011 track on Service Oriented Architectures and Programming Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA3047D4825F12@EXSAN01.campus.ncl.ac.uk> SOAP Service Oriented Architectures and Programming http://www.cs.unibo.it/projects/acmsac2011-soap/ ACM SAC 2011 For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary and international forum for applied computer scientists, computer engineers, and application developers to gather, interact and present their work. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University in TaiChung, Taiwan. SOAP TRACK: CALL FOR PAPERS Although when considered from a purely technological point of view Service-Oriented Programming (SOP) is not an enormous novelty, when it comes to paradigmatic considerations SOP is quickly changing our vision of the Web. Originally, the Web was mainly seen as a means of presenting the information to a wide spectrum of people, but SOP is now triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be searched by other services, retrieved and invoked, always abstracting from the actual implementation. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of Service Oriented Programming needs to be clarified on many aspects, both from the engineering and from the foundational point of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modeling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, ...) and the syntactic one (WS-BPEL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new different implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security, sustainability and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrated only on a few features of Service Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming Service Oriented Programming into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what Service Oriented Programming still needs in order to achieve its original goal, along with works proposing comparison among different models and technological solutions. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service Oriented Computing - Methodologies and tools for Service Oriented application design - Service Oriented Middlewares - Service Oriented Programming languages - Test methodologies for Service Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service Oriented Computing IMPORTANT DATES (strict) August 24, 2010: Paper submissions October 12, 2010: Author notification November 2, 2010: Camera-Ready Copy March 21-25, 2011: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Submission of the same paper to multiple tracks is not allowed. Peer groups with expertise in the track focus area will blindly review submissions. Accepted papers will be published in the annual conference proceedings. Please visit the SAC 2011 Website for further information: http://www.acm.org/conferences/sac/sac2011/ PC MEMBERS Faycal Abouzaid, University of Montreal (Canada) Marco Aiello, University of Groningen (Netherlands) Roberto Bruni, University of Pisa (Italy) Chihung Chi, Tsinghua University (China) Rocco De Nicola, University of Florence (Italy) Nicola Dragoni, Technical University of Denmark (Denmark) Schahram Dustdar, Technical University of Vienna (Austria) Claudio Guidi, italianaSoftware s.r.l. (Italy) Tim Hallwyl, Sirius IT (Danmark) Koji Hasebe, University of Tsukuba (Japan) Nickolas Kavantzas, ORACLE (USA) Peep K?ngas, University of Tartu (Estonia) Francisco Martins, University of Lisbon (Portugal) Michele Mazzucco, University of Cyprus (Cyprus) Jing Mei, IBM China Research Lab (China) Hern?n Melgratti, University of Buenos Aires (Argentina) Nicola Mezzetti, Di.Tech (Italy) Shih-Hsi Liu, California State University (USA) K?vin Ottens, Klar?lvdalens Datakonsult AB (Sweden) Luca Padovani, Universit? di Torino (Italy) Andreas Roth, SAP (Germany) Maurice ter Beek, ISTI-CNR, Pisa (Italy) Peter Wong, Fredhopper, Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it Dipartimento di Scienze dell'Informazione, University of Bologna Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com italianaSoftware s.r.l., Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100709/d511cebf/attachment-0001.htm From rensink at cs.utwente.nl Thu Jul 15 08:36:20 2010 From: rensink at cs.utwente.nl (Arend Rensink) Date: Thu, 15 Jul 2010 14:36:20 +0200 Subject: [TYPES/announce] CfPart ICGT and SPIN, 27 Sep - 2 Oct 2010 at University of Twente, The Netherlands Message-ID: <4C3F00C4.3090207@cs.utwente.nl> ============================================================== *** Call for Participation *** ICGT 2010 Fifth International Conference on Graph Transformation 29 Sep - 1 Oct 2010 http://www.utwente.nl/icgt2010/ SPIN 2010 17th International SPIN Workshop on Model Checking of Software 27 Sep - 29 Sep 2010 http://www.utwente.nl/spin2010/ University of Twente, Enschede, The Netherlands ============================================================== PROGRAMME AND REGISTRATION Programme at: http://www.utwente.nl/icgt-spin/programme Registration: http://www.utwente.nl/icgt-spin/registration Early registration deadline: 1 September 2010 -------------------------------------------------------------- JOINT ICGT/SPIN INVITED SPEAKER: - Javier Esparza, University of Munich ICGT 2010 INVITED SPEAKERS: - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg SPIN 2010 INVITED SPEAKERS: - Alessandro Cimatti, FBK-IRST, Italy - Darren Cofer, Rockwell Collins, USA -------------------------------------------------------------- SATELLITE EVENTS: - PDMC: 9th International Workshop on Parallel and Distributed Methods in Verification - HiBi: 2nd International Workshop on High Performance Computational Systems Biology - GCM: 3rd Workshop on Graph Computation Models - GraBaTs: 4th International Workshop on Graph-Based Tools - PNGT: 4th Workshop on Petri Nets and Graph Transformations - WTNC: Workshop and Tutorial on Natural Computing - ICGT Doctoral Symposium -------------------------------------------------------------- From schmidt at cis.ksu.edu Thu Jul 15 11:23:18 2010 From: schmidt at cis.ksu.edu (Dave Schmidt) Date: Thu, 15 Jul 2010 10:23:18 -0500 Subject: [TYPES/announce] Call for Papers: VMCAI'11 Message-ID: <4C3F27E6.80409@cis.ksu.edu> ---------------------------------------------------------------------- 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 fp at cs.cmu.edu Sat Jul 17 11:06:32 2010 From: fp at cs.cmu.edu (Frank Pfenning) Date: Sat, 17 Jul 2010 16:06:32 +0100 Subject: [TYPES/announce] Postdoctoral Positions on Computational Logic Message-ID: Postdoctoral Positions on Computational Logic (further details at http://www.qatar.cmu.edu/iliano/clf-postdoc) The School of Computer Science at Carnegie Mellon University invites applications for two postdoctoral fellow positions in computational logic. One position will be based on the Pittsburgh campus of CMU and the other on its Qatar campus, with travel between the two. Both positions are part of a common project to develop recent work on language specification with substructural operational semantics into methodologies for designing and reasoning about programming and specification languages for distributed computation. The research will be conducted under the supervision of Prof. Iliano Cervesato and Prof. Frank Pfenning. The project runs from 1 September 2010 to 31 August 2013. Candidates are also encouraged to explore research ideas on top and beyond the project description. The positions provide significant opportunities for professional development. Applicants should have a strong background and interest in some combination of type theory, proof theory, concurrency, logical frameworks, and linear or substructural logics. To apply, send a cover letter, a CV and a list of references in PDF format to fp at cs.cmu.edu and iliano at cmu.edu. Additional material will be requested as needed. This posting will stay open until filled. Early expressions of interest are encouraged. Position in Qatar: In 2004, Carnegie Mellon University established a branch campus in Qatar with the goal of promoting the same high standards of research and education as its original Pittsburgh campus. CMU Qatar is located in Education City, an ultramodern 2,500 acre campus which currently hosts branches of six of the world's leading universities. The campus provides cutting research facilities in a dynamic and multidisciplinary environment. Carnegie Mellon Qatar is located in Qatar's capital, Doha, an up-and-coming modern city with easy access to the world. Qatar is a small country on the East coast of the Arabian peninsula. Its abundant reserves of natural gas have resulted in it having a GDP per capita among the highest in the world. It is cosmopolitan, vibrant, yet pleasant and safe. The position in Qatar offers a competitive salary, a foreign service premium, excellent international health care coverage, and allowances for housing, transportation, and travel. Benefits may vary with contract type. The position comes with support for conferences and equipment. Position in Pittsburgh: Carnegie Mellon's School of Computer Science is one of the world's premier institutions for computer science research and education. For the past 45 years, it has been at the forefront of innovation in all areas of computing. The position in Pittsburgh offers the standard benefits of a postdoctoral fellowship in the USA. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100717/60f25fae/attachment.htm From bcpierce at cis.upenn.edu Sun Jul 18 12:08:09 2010 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Sun, 18 Jul 2010 12:08:09 -0400 Subject: [TYPES/announce] Final call for abstracts: Workshop on Mechanizing Metatheory Message-ID: <56B052C1-4876-4E44-96D3-493332EE6ABF@cis.upenn.edu> ACM SIGPLAN Workshop on Mechanizing Metatheory 25 September, 2010 Baltimore, Maryland (Co-located with ICFP'10) http://www.cis.upenn.edu/~bcpierce/wmm/ Submission deadline: 21 July, 2010 SPECIAL 5TH ANNIVERSARY PROGRAM 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. The goal of the WMM workshops is to bring researchers who are (or would like to be) using automated proof assistants for programming language metatheory together with developers of proof assistants with an interest in supporting research in programming languages. This WMM is an occasion to look back at five years of intensive effort on formalizing programming languages. The centerpiece of the event will be a series of invited talks in which major players in the area look both back and forward, offering their perspectives on what has been achieved and what challenges remain. There will also be a session of contributed presentations by workshop participants, selected from submitted abstracts. Invited Speakers * Andrew Appel, Princeton University * Karl Crary, Carnegie Mellon University * Amy Felty, University of Ottawa * Christian Urban, TU Munich * Steve Zdancewic, University of Pennsylvania CALL FOR ABSTRACTS Important Dates * Submission deadline for abstracts: 21 July, 2010 * Author Notification: 15 August, 2010 * Workshop: Saturday, 25 September, 2010 Scope * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory * Novel formalization techniques * Investigation of formalization issues, especially with respect to variable binding * Examples of formalized programming language metatheory * Analysis and comparison of solutions to the POPLmark challenge * Proposals for new challenge problems that benchmark programming language work From freek at cs.ru.nl Mon Jul 19 09:35:58 2010 From: freek at cs.ru.nl (freek) Date: Mon, 19 Jul 2010 15:35:58 +0200 Subject: [TYPES/announce] PhD Position in Automated Reasoning Using Machine Learning (vacancy ?number 62.58.10) Message-ID: <20100719133558.GA29827@porthos.science.ru.nl> PhD student Computer Science (1,0 fte) ================================= Radboud University Nijmegen, Faculty of Science, Institute for Computing and Information Sciences (iCIS), Intelligent Systems Maximum Salary: EUR 2,612 gross/month Vacancy number: 62.58.10 Closing date: 30 September 2010 Job description ============ You will be working on the NWO project Learning2Reason, which aims to improve computer-assisted reasoning technology using a machine learning approach. To derive new knowledge from corpora of formally expressed knowledge such as mathematical theorems and proofs, one uses computer-assisted and automated reasoning methods. These symbolic (or deductive) approaches typically suffer from a fast-growing search space. Tailored machine learning approaches can help to control this search space, e.g., by estimating the usefulness of existing lemmas for proving a new result. Within the project, you will focus on the state-of-the-art in machine learning, especially kernel-based methods that are ideally suited to take into account the structure of formulas and proofs (given as graphs or trees). Your task as a PhD student will be to develop and further improve such machine learning techniques and apply and test these on existing formal libraries. Requirements =========== You should meet the following requirements: - A master's degree (or equivalent) in Computer Science, Mathematics or a related field, with a strong interest in machine learning and/or proof assistants; - Commitment and a cooperative attitude; - Excellent proficiency in written and spoken English. Organization ========== The Radboud University Nijmegen is one of the leading academic communities in the Netherlands. Renowned for its green campus, modern buildings, and state-of-the-art equipment, it has nine faculties and enrolls over 17.500 students in approximately 90 study programs. The university is situated in the oldest Dutch city, close to the German border, on the banks of the river Waal (a branch of the Rhine). The city has a rich history and one of the liveliest city centres in the Netherlands. The section Intelligent Systems of the Institute for Computing and Information Sciences (iCIS) at the Radboud University Nijmegen conducts research in both machine learning (subgroup headed by Prof.dr. Tom Heskes) and proof assistants (subgroup headed by Prof.dr. Herman Geuvers). The current project is right at the interplay between these subgroups and combines the strengths of both teams. iCIS in general and the section Intelligent Systems received excellent scores at the latest national research assessment. Website: http://www.ru.nl/is/ Conditions of employment ===================== Employment: 1,0 fte Maximum salary per month, based on a fulltime employment: ? 2,612 gross/month Starting at ? 2,042 per month, the salary will increase to ? 2,612 per month in the fourth year. PhD scale. Additional conditions of employment ============================== You will be appointed as a PhD student for a period of four years. Your performance will be evaluated after 18 months. If the evaluation is positive, the contract will be extended by 2.5 years. Additional Information ================== Prof.dr. Tom Heskes Prof.dr. Herman Geuvers Telephone: +31 24 36 52696 Telephone: +31 24 36 52603 E-mail: tomh at cs.ru.nl E-mail: herman at cs.ru.nl Application ========= You can apply for the job (mention the vacancy number 62.58.10) before 30 September 2010 by sending your application -preferably by email- to: RU Nijmegen, FNWI, P&O, mrs. D. Reinders P.O. Box 9010, 6500 GL Nijmegen, NL Telephone: +31 24 3652027 E-mail: pz at science.ru.nl From E.Ritter at cs.bham.ac.uk Tue Jul 20 17:10:25 2010 From: E.Ritter at cs.bham.ac.uk (E.Ritter@cs.bham.ac.uk) Date: Tue, 20 Jul 2010 22:10:25 +0100 Subject: [TYPES/announce] BLC 2010 2nd Call for Participation Message-ID: British Logic Colloquium 2010, Birmingham, 2-4 September The annual meeting of The British Logic Colloquium will take place from 2-4 September 2010 in Birmingham. The aim of this meeting is to present current topics in all areas of logic. The following invited speakers have confirmed that they will give talks: Mirna Dzamonja (University of East Anglia), Jeffrey Ketland (University of Edinburgh), Alexander Kurz (University of Leicester), Luke Ong (University of Oxford), Ulrike Sattler (University of Manchester), Anton Setzer (University of Swansea), Colin Stirling (University of Edinburgh), Philip Welsh (University of Bristol) and Alex Wilkie (University of Manchester). Contributed talks of 30 min length are also solicited. A limited number of grants for UK-PhD-students is available. The deadline for proposing talks and early registration is 27 July. For further details see the webpage http://events.cs.bham.ac.uk/BLC2010. BLC 2010 is supported financially by the London Mathematical Society and by the British Logic Colloquium. Eike Ritter From rjhala at cs.ucsd.edu Tue Jul 20 20:02:39 2010 From: rjhala at cs.ucsd.edu (Ranjit Jhala) Date: Tue, 20 Jul 2010 17:02:39 -0700 (PDT) Subject: [TYPES/announce] Call for Papers for ACM PLPV 2011 In-Reply-To: <925687958.220601279663612296.JavaMail.root@csemailbox.ucsd.edu> Message-ID: <1205425579.222911279670559760.JavaMail.root@csemailbox.ucsd.edu> Apologies for multiple postings. --------------------------------------------------------------------------- The Fifth ACM SIGPLAN Workshop on Programming Languages meets Program Verification --------------------------------------------------------------------------- http://cseweb.ucsd.edu/plpv11 --------------------------------------------------------------------------- 29th January, 2011 Austin, Texas Affiliated with POPL 2011 Overview -------- The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms, extended static checking systems like ESC/Java and Spec#, which incorporate contracts and static contract verifiers. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage cross-pollination between different communities, we seek a broad the scope for PLPV. In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc), target different kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc). Important Dates --------------- Submission 11th October, 2010 Notification 8th November, 2010 Final Version 15th November, 2010 Workshop 29th January, 2011 Program Committee ----------------- Andrew Gordon (Microsoft Research) Chris Hawblitzel (Microsoft Research) Ranjit Jhala (University of California, San Diego, co-chair) Viktor Kuncak (Ecole Polytechnique F?d?rale de Lausanne) John Matthews (Galois Inc.) James McKinna (Radboud University) Stefan Monnier (Universit? de Montr?al) Greg Morrisett (Harvard University) Christine Paulin-Mohring (Universit? Paris-Sud) Wouter Swierstra (Vector Fabrics, co-chair) Tachio Terauchi (Tohoku University) Submissions ----------- Submissions should fall into one of the following categories: (a) Research papers (12 pages) that describe new work on the above or related topics. Submissions in this category have an upper limit of 12 pages but shorter submissions are also encouraged. (b) Proposals for challenge problems (6 pages) which the author believes are useful benchmarks or important domains for language-based program verification techniques. Submissions in this category should be at most 6 pages in total length. Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. Publication ----------- Accepted papers will be published by the ACM and will appear in the ACM Digital library. The authors of selected papers will be invited to submit an extended version of their paper to a special issue of the Journal of Formalized Reasoning devoted to papers from PLPV 2011. Student Attendees ----------------- Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to PLPV. Details on the PAC program and the application can be found here. PAC also offers support for companion travel. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100720/0e72bb47/attachment.htm From jeremy.siek at colorado.edu Fri Jul 23 05:05:15 2010 From: jeremy.siek at colorado.edu (Jeremy Siek) Date: Fri, 23 Jul 2010 10:05:15 +0100 Subject: [TYPES/announce] PEPM'11 Call for Papers Message-ID: =============================================================== CALL FOR PAPERS ACM SIGPLAN 2011 Workshop on Partial Evaluation and Program Manipulation (PEPM'11) Austin, Texas, USA, January 24-25, 2011 (Affiliated with POPL'11) http://www.program-transformation.org/PEPM11 =============================================================== IMPORTANT DATES: * Paper submission: Fri, October 15, 2010, 23:59, Apia time * Author notification: Mon, November 8, 2010 * Camera-ready papers: Mon, November 22, 2010 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by October 10, 2010. SUBMISSION CATEGORIES: * Regular research papers (max. 10 pages in ACM Proceedings style) * Tool demonstration papers (max. 4 pages plus max. 6 pages appendix) TRAVEL SUPPORT: Students and other attendants in need can apply for a SIGPLAN PAC grant to help cover expenses. For details, see http://www.sigplan.org/PAC.htm. SCOPE: The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theories, tools, and applications of analysis and manipulation of programs. The 2011 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation in a continued effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, it covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, there is a separate category of tool demonstration papers. Topics of interest for PEPM'11 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, program inversion, program composition, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, type systems, automated testing and test case generation. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, deep embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. PROCEEDINGS: There will be formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'11. SUBMISSION GUIDELINES: Papers should be submitted electronically via the workshop web site. Regular research papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Authors using Latex to prepare their submissions should use the new improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template). PROGRAM CO-CHAIRS: * Siau-Cheng Khoo (National University of Singapore, Singapore) * Jeremy G. Siek (University of Colorado at Boulder, USA) PROGRAM COMMITTEE MEMBERS: * Jacques Carette (McMaster University, Canada) * Kung Chen (National Chengchi University, Taiwan) * Evelyne Contejean (CNRS, France) * Francisco Javier Lopez Fraguas (University of Madrid, Spain) * Ronald Garcia (Carnegie Mellon University, USA) * Jurriaan Hage (Utrecht University, The Netherlands) * Zhenjiang Hu (National Institute of Informatics, Japan) * Shan Shan Huang (Georgia Institute of Technology, USA) * Yukiyoshi Kameyama (University of Tsukuba, Japan) * Ralf Lammel (University of Koblenz-Landau, Germany) * Michael Leuschel (University of Southampton, UK) * Andrew Moss (University of Bristol, UK) * Maurizio Proietti (CNR, Italy) * Peter Sestoft (IT University of Copenhagen, Denmark) * Chung-chieh Shan (Rutgers, USA) * Scott Stoller (Stony Brook University, USA) * Peter Thiemann (Universitat Freiburg, Germany) * Simon Thompson (Kent University, UK) * German Vidal (Universidad Politecnica de Valencia, Spain) * Edwin Westbrook (Rice University, USA) -- ____________________________________ Jeremy Siek http://ecee.colorado.edu/~siek/ Assistant Professor Dept. of Electrical, Computer, and Energy Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100723/596c61e3/attachment-0001.htm From iliano at cmu.edu Sun Jul 25 01:29:56 2010 From: iliano at cmu.edu (Iliano Cervesato) Date: Sun, 25 Jul 2010 08:29:56 +0300 Subject: [TYPES/announce] Postdoctoral positions on logic-based ensemble programming Message-ID: <4C4BCBD4.609@cmu.edu> Postdoctoral Positions on Ensemble Programming (further details at http://www.qatar.cmu.edu/iliano/msr-postdoc) NOTE: these positions are in addition to two positions on computational logic advertised on July 17th -- http://www.qatar.cmu.edu/iliano/clf-postdoc/ The School of Computer Science at Carnegie Mellon University invites applications for two postdoctoral fellow positions on effective programming for large distributed ensembles. One position will be based on the Pittsburgh campus of CMU and the other on its Qatar campus, with travel between the two. Both positions are part of a common project to develop recent work on logic-based multiset rewriting and on programmable matter (Claytronics) into a usable and verifiable programming language for large distributed ensembles of agents. The research will be conducted under the supervision of Prof. Iliano Cervesato and Prof. Seth Goldstein. The project runs from 1 September 2010 to 31 August 2013. Candidates are also encouraged to explore research ideas on top and beyond the project description. The positions provide significant opportunities for professional development. Applicants should have a strong background and interest in some combination of logic programming, term rewriting, concurrency, distributed systems, compilation, proof theory and linear logics. To apply, send a cover letter, a CV and a list of references in PDF format to seth at cs.cmu.edu and iliano at cmu.edu. Additional material will be requested as needed. This posting will stay open until filled. Early expressions of interest are encouraged. Position in Qatar In 2004, Carnegie Mellon University established a branch campus in Qatar with the goal of promoting the same high standards of research and education as its original Pittsburgh campus. CMU Qatar is located in Education City, an ultramodern 2,500 acre campus which currently hosts branches of six of the world's leading universities. The campus provides cutting research facilities in a dynamic and multidisciplinary environment. Carnegie Mellon Qatar is located in Qatar's capital, Doha, an up-and-coming modern city with easy access to the world. Qatar is a small country on the East coast of the Arabian peninsula. Its abundant reserves of natural gas have resulted in it having a GDP per capita among the highest in the world. It is cosmopolitan, vibrant, yet pleasant and safe. Further resources: The position in Qatar offers a competitive salary, a foreign service premium, excellent international health care coverage, and allowances for housing, transportation, and travel. Benefits may vary with contract type. The position comes with support for conferences and equipment. Position in Pittsburgh Carnegie Mellon's School of Computer Science is one of the world's premier institutions for computer science research and education. For the past 45 years, it has been at the forefront of innovation in all areas of computing. The position in Pittsburgh offers the standard benefits of a postdoctoral fellowship in the USA. -- Iliano Cervesato www.qatar.cmu.edu/~iliano/ Associate Professor Carnegie Mellon University From davide at disi.unige.it Mon Jul 26 16:43:16 2010 From: davide at disi.unige.it (Davide Ancona) Date: Mon, 26 Jul 2010 22:43:16 +0200 Subject: [TYPES/announce] OOPS track at SAC 2011: 2nd Call for Papers Message-ID: <4C4DF364.9050205@disi.unige.it> Please notice the following change in the submission instructions: for camera-ready papers exceeding **6 pages** each additional page will be charged 80 USD. OOPS 2011 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS11 Special Track at the 26th ACM Symposium on Applied Computing, SAC 2011 http://www.acm.org/conferences/sac/sac2011 Tunghai University, TaiChung, Taiwan March 21 - 25, 2011 - Important Dates (deadlines are strict) August 24, 2010: Full Paper Submission October 12, 2010: Notification of paper acceptance/rejection November 2, 2010: Camera-ready copies of accepted papers - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Shigeru Chiba (chiba at is.titech.ac.jp) Tokyo Institue of Technology, Japan Atsushi Igarashi (igarashi at kuis.kyoto-u.ac.jp) Kyoto University, Japan Andy Kellens (akellens at vub.ac.be) Vrije Universiteit Brussel, Belgium - Program Committee * Wei Ngan Chin, National University of Singapore, Singapore * Erik Ernst, University of Aarhus, Denmark * Manuel F?hndrich, Microsoft Research, USA * Jacques Garrigue, Nagoya University, Japan * Robert Hirschfeld, HPI Potsdam, Germany * Jakko J?rvi, Texas A&M University, USA * Kiyokuni Kawachiya, IBM Tokyo Research Laboratory, Japan * Doug Lea, Suny Oswego, USA * Hidehiko Masuhara, University of Tokyo, Japan * Sean McDirmid, Microsoft Research Asia, Beijin * Oscar Nierstrasz, University of Bern, Switzerland * James Noble, Victoria University of Wellington, New Zealand * Manuel Oriol, University of York, UK * Renaud Pawlak, ISEP Research and Consulting for Computer Engineering, France * Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea * Jianjun Zhao, Shanghai Jiao Tong University, China - SAC 2011 For the past twenty-five years, the ACM Symposium on Applied Computing(SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University, TaiChung, Taiwan. - OOPS Track The object-oriented (OO) paradigm is extensively used to design and implement today's large scale software systems. However, existing OO languages and platforms need to evolve to better support features like interoperability, software reuse, dynamic software adaptation, efficiency on multicore hardware, security, and safety. The aim of OOPS is to foster the development of extensions to existing OO languages and platforms, as well as the design and implementation of new languages and platforms embracing and enhancing the object-oriented paradigm. Particularly of interest for OOPS are papers that provide a thorough analysis covering most of the following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Language design and implementation * Type systems, static analysis, formal methods * Integration with other paradigms * Aspects, components, and modularity * Reflection, meta-programming * Databases and persistence * Distributed, concurrent or parallel systems * Interoperability, versioning and software adaptation - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system at https://www.softconf.com/b/sac11-tp/. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding **6 pages** each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by August 24, 2010. For more information please visit the SAC 2011 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at the conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, we are planning to organize a journal special issue hosting the extended versions of the best papers of the track. From alain.girault at inria.fr Wed Jul 28 18:10:02 2010 From: alain.girault at inria.fr (Alain Girault) Date: Thu, 29 Jul 2010 00:10:02 +0200 Subject: [TYPES/announce] PhD grant in Grenoble (France) on advanced dataflow programming for embedded systems at INRIA and ST Microelectronics Message-ID: <4C50AABA.6060406@inria.fr> Proposal for a PhD position =========================== Title ===== Advanced dataflow programming for embedded systems: analyses for scheduling and power optimization. Location ======== Grenoble (France): INRIA Grenoble (Pop Art Team). Supervisors =========== INRIA Grenoble: Pascal FRADET and Alain GIRAULT. ST Microelectronics Ottawa: Ali-Erdem OZCAN and Pierre PAULIN. Application =========== The PhD grant is for 36 months. The gross income (i.e., before tax) is around 2.400 ? per month (29.000 ? per year) and includes health insurance. Please send your CV and recommendation letters to alain.girault at inria.fr and pascal.fradet at inria.fr. Abstract ======== In this project, we focus on dataflow models of computation to program applications for a new embedded many-core platform designed by ST Microelectronics, called P2012. The static dataflow model of computation (SDF) is widely used because it allows analysis (deadlock and boundedness) and scheduling. SDF has a clean semantics and leads to efficient implementations but it cannot express many dynamic features. In particular, it cannot express dynamic input/output rate modifications, nor dynamic topology modifications. With ST Microelectronics, we have been working on a variant of SDF able to express dynamicity while remaining verifiable (for deadlock and buffer boundedness) and schedulable. The goal of the PhD is to study analyses for this new dataflow model of computation. The purpose of these analyses is to generate distributed schedules for P2012, optimizing the power consumption and the execution time. Each computing core of P2012 is equipped with a hardware mechanism for DVFS (dynamic voltage and frequency scaling). Required Skills =============== A Master in computer science or computer engineering, with knowledge in formal methods, embedded systems, and/or real-time programming. A knowledge of dataflow programming, semantics, code generation, and/or distributed scheduling would be a plus. Context ======= The context of this work is the ST Microelectronics Platform 2012 initiative (P2012). P2012 is a many-core platform that integrates multiple clusters of processors and HW accelerators with a hierarchical memory architecture and a NoC. The position is likely to involve travels between Grenoble (INRIA) and Ottawa (ST Microelectronics). The main goal of the POP ART team (http://pop-art.inrialpes.fr) is the safe design of real-time embedded systems. We explore that area according to several research directions: programming languages, models of computation, static analysis, formal verification, implementation, ... The research within POP ART concerns: - design (component and interaction models for real-time systems, heterogeneity); - programming (synchronous, domain specific and aspect-oriented languages); - verification and correctness by construction (controller synthesis, compositionally, ...); - code generation (scheduling, fault-tolerance, compilation, ...). -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From icfp.publicity at googlemail.com Tue Aug 3 05:30:46 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Tue, 3 Aug 2010 11:30:46 +0200 Subject: [TYPES/announce] ICFP 2010: Call for participation Message-ID: ===================================================================== Call for Participation The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010) http://www.icfpconference.org/icfp2010/ Baltimore, Maryland September 25 ? October 2 ===================================================================== ICFP 2010 provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. * Program: http://www.icfpconference.org/icfp2010/program.html * Invited speakers: - Mike Gordon ML: Metalanguage or Object Language? - Matthias Felleisen TeachScheme!: A Checkpoint - Guy Blelloch Functional Parallel Algorithms Schedule including related events: * September 25: Workshop on Mechanizing Metatheory (WMM) Workshop on Mathematically Structured Functional Programming (MSFP) Workshop on High-Level Parallel Programming and Applications (HLPP) * September 26: Workshop on ML Workshop on Generic Programming (WGP) * September 27-29: ICFP 2010 * September 30: Haskell Symposium Erlang Workshop * October 1: Commercial Users of Functional Programming ? Day 1 (CUFP Tutorials) Haskell Implementors' Workshop * October 2: Commercial Users of Functional Programming ? Day 2 (CUFP Talks) Registration information: * Registration link: https://regmaster3.com/2010conf/ICFP10/register.php Local arrangements (including travel and accommodation): * http://www.icfpconference.org/icfp2010/local.html * Conference reservation/rate deadline: September 1st Conference organizers: * General Chair: Paul Hudak, Yale University * Program Chair: Stephanie Weirich, University of Pennsylvania * Local Arrangements Chair: Michael Hicks, University of Maryland * Workshop Co-Chairs: Derek Dreyer, Max Planck Institute for Software Systems Christopher Stone, Harvey Mudd College * Programming Contest Chair: Johannes Waldmann, Hochschule f?r Technik, Wirtschaft und Kultur, Leipzig * Video Chair: Scott Smith, Johns Hopkins University * Publicity Chair: Wouter Swierstra, Vector Fabrics ===================================================================== From vijay at saraswat.org Tue Aug 3 07:31:23 2010 From: vijay at saraswat.org (Vijay Saraswat) Date: Tue, 03 Aug 2010 07:31:23 -0400 Subject: [TYPES/announce] CFP for Workshop on Curricula and Concurrency and Parallelism at SPLASH (Oct 2010) Message-ID: <4C57FE0B.6020705@saraswat.org> Please consider submitting to this workshop. We had a very stimulating workshop last year at OOPSLA. http://www.cs.pomona.edu/~kim/CCP2010.html Best, Vijay 2010 Workshop on Curricula for Concurrency and Parallelism SPLASH 2010 Sunday, October 17, 2010 The concurrency era has exploded on us. Multicore systems are now everywhere -- in our laptops, desktops, graphic cards, video game consoles. Symmetric multi-processors and clusters dominate the server and high performance computing market and are the foundation for cloud computing. There is an urgent need to ensure that newly trained Computer Science graduates are well versed in the principles and practice of concurrent and parallel programming. Following a previous successful workshop on Multicore Programming Education at ASPLOS 2009, and at OOPSLA 2009, this workshop will address several fundamental questions: * What are the ``fundamental ideas'' of concurrency and parallelism that every Computer Science graduate should know? * Should concurrency and parallelism be taught ``top-down'' (via high-level abstractions such as operations on collections) or bottom up (with low-level tools such as threads and locks)? * Should sequential programming be taught as a ``special case'' of concurrent and parallel programming? * Should concurrency and parallelism issues be addressed in introductory computer science courses? * Should concurrency and parallelism topics be ``sprinkled'' in existing courses (e.g. in architecture, systems, programming languages, algorithms) -- if so which topics in those courses should be taken out to make room? Should these topics be taught in their own separate stream? This workshop aims to bring together practitioners and thinkers to address this topic. It will be organized around the presentation of position papers selected by the PC, and a panel discussion. Potential participants are invited to submit 2-page position papers addressing these topics, for consideration by the Program Committee. The paper should address the authors' experience and thoughts on this topic, and raise questions that they would like to see discussed at the workshop. In the case of educators we are also interested in understanding how your academic department is organizing as a whole to address these pedagogical issues. Potential participants are invited to submit 2-page position papers addressing these topics for consideration by the program committee. Please submit by e-mail to vijay at saraswat.org. Program Committee * Kim Bruce, Pomona College (co-chair) * Vijay Saraswat, IBM (co-chair) * Guy Blelloch, CMU * Daniel Ernst, University of Wisconsin, Eau Claire * Tim Mattson, Intel * Guy Steele, Oracle * /other members to be announced/ Important Dates: * Submission deadline for position papers: September 1, 2010 * Notification of decision: September 13, 2010 * Workshop Date: Sunday, October 17 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100803/b80b05de/attachment-0001.htm From vxc at Cs.Nott.AC.UK Tue Aug 3 08:42:29 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Tue, 03 Aug 2010 13:42:29 +0100 Subject: [TYPES/announce] MSFP call for participation Message-ID: <1280839349.1562.33.camel@hypatia> CALL FOR PARTICIPATION Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, Maryland, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. PROGRAMME 9:00 - 10:00 Invited talk: Amy Felty, "Hybrid: Reasoning with Higher-Order Abstract Syntax in Coq and Isabelle" 10:00 - 10:30 break 10:30 - 11:00 Chantal Keller and Thorsten Altenkirch, "Normalization by hereditary substitutions" 11:00 - 11:30 Paul Tarau, "Hereditarily finite representations of natural numbers and self delimiting codes" 11:30 - 12:30 Tutorial: Adam Chlipala, "Foundational Program Verification in Coq with Automated Proofs" 12:30 - 2:00 lunch break 2:00 - 3:00 Invited talk: Mart?n Escard?, "What Tic-Tac-Toe, the Tychonoff Theorem, and the Double-Negation Shift have in common" 3:00 - 3:30 break 3:30 - 4:00 Kazuyuki Asada, "Arrows are Strong Monads" 4:00 - 4:30 Adam Gundry, Conor McBride and James McKinna, "Type inference in context" 4:30 - 5:00 break 5:00 - 6:00 Tutorial: Peter Morris, "Epigram Prime: A Demonstration" Workshop homepage: http://cs.ioc.ee/msfp/msfp2010/ Registration link: https://regmaster3.com/2010conf/ICFP10/register.php Local arrangements: http://www.icfpconference.org/icfp2010/local.html From pschust at mathematik.uni-muenchen.de Fri Aug 6 05:58:12 2010 From: pschust at mathematik.uni-muenchen.de (Peter Schuster) Date: Fri, 6 Aug 2010 11:58:12 +0200 (CEST) Subject: [TYPES/announce] MAP 2010: Mathematics, Algorithms, Proofs, Logrono (Spain), 8-12 Nov 2010 Message-ID: MATHEMATICS, ALGORITHMS, PROOFS (MAP 2010) Formal Proofs and Real Geometry: logical, algebraic and numerical aspects Logro?o (La Rioja, Spain) 8-12th November 2010 http://www.unirioja.es/dptos/dmc/MAP2010/ Inscription is now open! Invited tutorials: - Michel Coste (O-minimal structures) - Assia Mahboubi (Cylindrical Algebraic Decomposition in Coq) Invited talks: - Basu Saugata - Graham Ellis Scientific Committee: - Thierry Coquand - Marie Fran?oise Roy - Henri Lombardi - Julio Rubio Organizers: - Luis Espa?ol - Julio Rubio +++++++++++++++++++++++++++++++++++++++++++++++++ Julio Rubio Departamento de Matematicas y Computacion Universidad de La Rioja Edificio Vives Calle Luis de Ulloa s/n E-26004 Logro?o, La Rioja (Spain) Tef. (+34)941299448 Fax (+34)941299460 email: julio.rubio at unirioja.es https://esus.unirioja.es/psycotrip/ +++++++++++++++++++++++++++++++++++++++++++++++++ From katoen at cs.rwth-aachen.de Fri Aug 6 09:51:48 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 06 Aug 2010 15:51:48 +0200 Subject: [TYPES/announce] ETAPS 2011: First Call for Papers Message-ID: <4C5C1374.80007@cs.rwth-aachen.de> [We apologize for multiple copies.] ================================================================ FIRST CALL FOR PAPERS: ETAPS 2011 European Joint Conferences on Theory And Practice of Software March 26 - April 3, 2011 Saarbruecken, Germany http://www.etaps.org ================================================================ -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2011 is already the fourteenth event in the series. -- INVITED SPEAKERS -- * Ross Anderson (Cambridge, UK) * Andrew Appel (Princeton, USA) * Gerard J. Holzmann (NASA) * Martin Odersky (EPFL, Switzerland) * Marta Kwiatkowska (Oxford, UK) * Prakash Panangaden (McGill, Canada) * Andreas Podelski (Freiburg, Germany) -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction - ESOP: European Symposium on Programming - FASE: Fundamental Approaches to Software Engineering - FOSSACS: Foundations of Software Science and Computation Structures - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- IMPORTANT DATES -- * 1 October 2010: Submission deadline for abstracts (strict) * 8 October 2010: Submission deadline for full papers (strict) * 10 December 2010: Notification of acceptance * 3 January 2011: Camera-ready versions due -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Papers should be submitted electronically in PDF (preferably) or PS (using Type 1 fonts). The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of the Springer-Verlag Lecture Notes in Computer Science series. Final papers will be in the format specified by Springer-Verlag at the URL: http://www.springer.de/comp/lncs/authors.html It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Research Papers Different ETAPS conferences will have different page limits. Specifically, FASE, FOSSACS and TACAS will have a page limit of 15 pages, whereas CC and ESOP will have a page limit of 20 pages. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices, and papers must be understandable without them. Tool Demonstration Papers Submissions should consist of two parts: * The first part, at most four pages, should describe the tool presented Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool (this part will be included in the proceedings). * * The second part, at most six pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) Please note that FOSSACS does not accept tool demonstration papers. -- SATELLITE EVENTS -- 18 satellite workshops will take place before or after ETAPS 2011. -- SAARBRUECKEN -- Saarbr?cken is the capital of the Saarland, the smallest German federal state. Saarbr?cken has approximately 190,000 inhabitants and hence is of pleasant size. Picturesque attractions and places of historic interest are scattered around the city, and offer the perfect destination for a hike or a daytrip. The cultural palette attracts visitors from far and wide. Saarbr?cken is located very close to the French border, and half way on the high-speed railway connecting Paris and Frankfurt. Both are in less than two hours distance. -- FURTHER INFORMATION AND ENQUIRIES -- For further information, do not hesitate to contact the following addresses. * GENERAL INFORMATION e-mail: etaps2011 at cs.uni-saarland.de Holger Hermanns ETAPS 2011 Organising Committee Chair * General Chair: Reinhard Wilhelm * Workshop Chair: Bernd Finkbeiner * Organising Committee: Bernd Finkbeiner, Holger Hermanns (Chair), Reinhard Wilhelm, Stefanie Haupert-Betz, Christa Sch?fer * Web site: Hern?n Bar? Graf From Stephan.Merz at loria.fr Fri Aug 6 12:31:55 2010 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Fri, 6 Aug 2010 18:31:55 +0200 Subject: [TYPES/announce] CFPart : iFM 2010 Message-ID: <66D15BC8-574B-47F2-9E69-8BCA79940295@loria.fr> CALL FOR PARTICIPATION 8th International Conference on Integrated Formal Methods (iFM 2010) October 11-14, 2010, Nancy, France Early registration deadline: September 15, 2010 http://ifm2010.loria.fr/ Applying formal methods may involve the modeling of different aspects of a system that are expressed through different paradigms. Correspondingly, different analysis techniques will be used to examine differently modeled system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. Areas of interest include but are not limited to: - Integration of formal modeling and analysis methods - Integration of formal and semi-formal modeling and analysis methods - Integration of formal methods into software engineering practice - Semantics, Logics, Type systems - Verification, Model checking, Static analysis, Theorem proving - Refinement, Model transformations - Tools, Experience reports, Case studies Invited Speakers: - Christel Baier, TU Dresden - John Fitzgerald, Newcastle University - Rajeev Joshi, Laboratory for Reliable Software, JPL Satellite events (October 11): - Workshop on Formal Methods for Web Data Trust and Security - Tutorial: Verification of C# programs using Spec# and Boogie 2 (R. Monahan) - Tutorial: The TLA+ Proof System (D. Cousineau, S. Merz) Contact: ifm2010 at loria.fr From m.casadei at unibo.it Tue Aug 10 09:29:06 2010 From: m.casadei at unibo.it (Matteo Casadei) Date: Tue, 10 Aug 2010 15:29:06 +0200 Subject: [TYPES/announce] [Last CfP] SAC 2011 Track on Coordination Models, Languages and Applications References: <3E1638A3-C0A8-49E9-A58F-BA0234ED521A@unibo.it> Message-ID: Apologies if you receive multiple copies of this CfP. ------------------------------------------------------------------------------------------------ CALL FOR PAPERS Coordination Models, Languages, and Applications (CM) Special Track at the 26th Symposium on Applied Computing (SAC 2011) TaiChung, Taiwan March 21 - 25, 2011 (http://sac2011.apice.unibo.it/) IMPORTANT DATES Aug. 24, 2010: Paper submissions Oct. 12, 2010: Author notification Nov. 2, 2010: Camera-Ready Copy For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. TRACK ON COORDINATION MODELS, LANGUAGES, AND APPLICATIONS Building on the success of the twelfth previous editions (1998-2010), a special track on coordination models, languages and applications will be held at SAC 2011. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications of coordination technologies - Industrial points of view: experiences, applications, open issues - Internet- and Web-based coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Coordination in Service-oriented architectures and Web Services - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - Modern Workflow Management Systems and Case-Handling - Coordination in Computer Supported Cooperative Work - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Coordination Middleware and Infrastructures - Coordination in GRID systems - Self-organization-based approaches to coordination such as those based on swarm and stigmergy - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint), programming or their extensions with coordination capabilities - Formal aspects (semantics, reasoning, verification) PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2011 proceedings and in the Digital Library. PAPER SUBMISSION AND FORMAT All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers must be no longer than 6 pages and in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site:http://www.acm.org/conferences/sac/sac2011/. PC MEMBERS Farhad Arbab, CWI Amsterdam and Leiden University (Netherlands) Marcello Bonsangue, Leiden University (Netherlands) Rocco De Nicola, University of Firenze (Italy) Jose Fiadero, University of Leicester (Italy) Keith Harrison-Broninski, Role Modellers Ltd (UK) Kurt Lichtner, Sybase iAnywhere (Canada) Henry Muccini, University of l'Aquila (Italy) Andrea Omicini, University of Bologna (Italy) Manuel Oriol, University of York (UK) Razvan Popescu, Trinity College Dublin (Ireland) Antonio Porto, University of Porto (Portugal) Rosario Pugliese, University of Florence (Italy) Alessandro Ricci, University of Bologna (Italy) Davide Rossi, University of Bologna (Italy) Yasuyuki Tahara, National Institute of Informatics (Japan) Carolyn Talcott, SRI International (USA) Emilio Tuosto, University of Leicester (UK) Michael Ignaz Schumacher, University of Applied Sciences (Switzerland) Robert Tolksdorf, Freie Universitaet Berlin (Germany) Mirko Viroli, University of Bologna (Italy) George Wells, Rhodes University (South Africa) Herbert Wiklicky, Imperial College London (UK) Pawe? T. Wojciechowski, Pozna? University of Technology (Poland) TRACK CO-CHAIRS Matteo Casadei, Alma Mater Studiorum - Universita' di Bologna, Italy ============ Dott. Ing. Matteo Casadei, Ph.D. Alma Mater Studiorum, Universita' di Bologna DEIS Via Venezia 52, 47521 Cesena (FC) - Italy ***************** phone: +39 0547 339210 fax: +39 0547 339208 email: m.casadei at unibo.it macasadei at deis.unibo.it http://apice.unibo.it/xwiki/bin/view/MatteoCasadei/ ============================================== "Coping with things is not awkward because we don't dare to deal with them. It's because we don't dare that they are complex. (Seneca)" ============================================== From mtf at cs.rit.edu Tue Aug 10 09:41:18 2010 From: mtf at cs.rit.edu (Matthew Fluet) Date: Tue, 10 Aug 2010 09:41:18 -0400 (EDT) Subject: [TYPES/announce] Workshop on ML 2010 - Call for Participation Message-ID: The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Participation ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Invited Speaker ~~~~~~~~~~~~~~ Luke Hoban (Microsoft) -- Bringing F# to Visual Studio 2010 Program ~~~~~~ 9:00 Invited Talk Visual F#: Bringing F# to Visual Studio 2010 Luke Hoban (Microsoft Research) 10:00 Break 10:30 Probabilistic programming using first-class stores and first-class continuations Oleg Kiselyov (FNMOC); Chung-chieh Shan (Rutgers University) 10:55 Effective progamming in ML Daan Leijen (Microsoft Research); Ross Tate (University of California, San Diego) 11:20 Discussion 11:30 First-class modules and composable signatures in Objective Caml 3.12 Alain Frisch (LexiFi); Jacques Garrigue (Nagoya University Graduate School of Mathematics) 11:55 First-class modules: hidden power and tantalizing promises Jeremy Yallop (Applicative Ltd); Oleg Kiselyov (FNMOC) 12:20 Discussion 12:30 Lunch break 14:00 Deriving a Typed Implementation for Coroutines in ML Konrad Anton (Universitat Freiburg); Peter Thiemann (Universitat Freiburg) 14:25 The Design Rationale for Multi-MLton Suresh Jagannathan (Purdue University); Armand Navabi (Purdue University); KC Sivaramakrishnan (Purdue University); Lukasz Ziarek (Purdue University) 14:50 Discussion 15:00 Mirage: high-performance ML kernels in the cloud Anil Madhavapeddy (University of Cambridge); Thomas Gazagnaire (INRIA Sophia Antipolis) 15:25 Hosting a Standard ML compiler in a Web Browser: Status Report Martin Elsman 15:50 Discussion 16:00 Break 16:30 A simple and effective method for assigning blame for type errors David MacQueen (University of Chicago) 16:55 The MetaOCaml files: Status report and research proposal Oleg Kiselyov (FNMOC); Chung-chieh Shan (Rutgers University) 17:20 Discussion 17:30 Closing Registration and Local Arrangements ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * https://regmaster3.com/2010conf/ICFP10/register.php * http://www.icfpconference.org/icfp2010/local.html Program Chair ~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander Lulea University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google From bcpierce at cis.upenn.edu Tue Aug 10 23:22:58 2010 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Tue, 10 Aug 2010 23:22:58 -0400 Subject: [TYPES/announce] Call for participation: Workshop on Mechanizing Metatheory Message-ID: ACM SIGPLAN Workshop on Mechanizing Metatheory 25 September, 2010 Baltimore, Maryland (Co-located with ICFP'10) http://www.cis.upenn.edu/~bcpierce/wmm/ SPECIAL 5TH ANNIVERSARY PROGRAM 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. The goal of the WMM workshops is to bring researchers who are (or would like to be) using automated proof assistants for programming language metatheory together with developers of proof assistants with an interest in supporting research in programming languages. This WMM is an occasion to look back at five years of intensive effort on formalizing programming languages. The centerpiece of the event will be a series of invited talks in which major players in the area look both back and forward, offering their perspectives on what has been achieved and what challenges remain. A session of contributed talks rounds out the day. INVITED TALKS Andrew Appel (Princeton University) Modular Foundational Verification of the Software Toolchain Steve Zdancewic (University of Pennsylvania) Living with Locally Nameless Christian Urban (TU Munich) Nominal Isabelle: The Last 5 Years and the Next 5 Years Karl Crary (Carnegie Mellon University) Mechanization of Full-Scale Languages Amy Felty (University of Ottawa) Reasoning with Higher-Order Abstract Syntax in Hybrid and Related Systems CONTRIBUTED TALKS Yukiyoshi Kameyama (University of Tsukuba), Oleg Kiselyov (FNMOC), Chung-chieh Shan (Rutgers University) Mechanizing multilevel metatheory with control effects James Cheney (University of Edinburgh) Mechanized metatheory: ready for prime time? Benoit Montagu (INRIA) Experience report: Mechanizing Core F-zip using the locally nameless approach Scott Owens and Peter Sewell (University of Cambridge), Stephanie Weirich (University of Pennsylvania), Francesco Zappa Nardelli (INRIA) Ott Or Nott REGISTRATION AND LOCAL ARRANGEMENTS * https://regmaster3.com/2010conf/ICFP10/register.php * http://www.icfpconference.org/icfp2010/local.html WORKSHOP ORGANIZATION PROGRAM COMMITTEE Elsa Gunter, University of Illinois Tobias Nipkow, TU Munich Frank Pfenning, Carnegie Mellon Benjamin Pierce, University of Pennsylvania (chair) STEERING COMMITTEE Karl Crary, Carnegie Mellon University Michael Norrish, National ICT Australia Stephanie Weirich, University of Pennsylvania Christian Urban, TU Munich From brunocdsoliveira at googlemail.com Wed Aug 11 22:11:23 2010 From: brunocdsoliveira at googlemail.com (Bruno Oliveira) Date: Thu, 12 Aug 2010 11:11:23 +0900 Subject: [TYPES/announce] Open Research Professor positions Message-ID: Dear colleagues, School of Computer Science and Engineering, Seoul National University invites applications for a post-doctoral research professor position. ------------------------------------------------------------------------------- RESEARCH PROFESSOR POSITIONS Center For Research On Software Analysis For Error-Free Computing http://rosaec.snu.ac.kr SCHOOL OF COMPUTER SCIENCE & ENGINEERING SEOUL NATIONAL UNIVERSITY ------------------------------------------------------------------------------- The Center for Research on Software Analysis for Error-free Computing at Seoul National University (http://www.useoul.edu) invites applications for * a post-doctoral research professor position * the position can be transfered in 3 years (depending on research achievements) to regular tenure-track faculty position. We are looking for a candidate with research focus on - static analysis - software verification & testing - programming language theory & systems The successful applicant is expected to lead top-quality research. The ROSAEC center offers several opportunities for collaboration with a group of highly-motivated, internationally competitive graduate and undergraduate students as well as other post-docs and research professors. In particular, the ROSAEC center has a number of master students doing applied research for their master projects, which provides the successful applicant with an opportunity for proposing and supervising projects for those students. Interested candidates should email any inquiry or the application materials to: Dr. Bruno C. d. S. Oliveira Email: bruno at ropas.snu.ac.kr Home: http://ropas.snu.ac.kr/~bruno/ or Prof. Kwangkeun Yi Email: kwang at ropas.snu.ac.kr Home: http://ropas.snu.ac.kr/~kwang Application materials: a resume, a personal research plan, and the names of three or more references. Review of completed applications will begin immediately. The position remains open until filled. - Annual salary ranges from KRW 40M to 60M (approximately USD 35K to 52K at current exchange rates) and comes with generous taxation rates. Salary is determined based on the candidates research records and potentials. - On-campus university housing (studio or 2-bedroom apartment) provided. --------------------- Background - The center: Center for Research on Software Analysis for Error-free Computing (ROSAEC Center) has been established in September 2008 by by Korea Science and Engineering Foundation. The center consists of around 10 professors in static analysis, programming languages, software engineering, HCI, data base, and machine learning. The goal of the center is to research on domain-specific static analysis and verification technologies. - The university: Seoul National University is Korea's leading university. It has always out-performed other Korean universities, and is the preferred destination of top Korean high school students. It ranks with the leading universities in the Asia-Pacific region, particularly in research performance. - Location: The university is situated in Seoul, surrounded by rugged mountains, yet with a short ten-minute bus-ride to bustling shopping areas, where you may join the highly efficient Seoul metro system, and explore the great metropolis. Seoul is centrally located in the north east Asia: two-hour flight from Seoul reaches to Beijing(to the west) and Tokyo(to the east). - Seoul and Korea: Seoul is a modern, very well organized city, with an excellent public transportation system and it mixes up the best of the oriental and western cultures. Some knowledge of Korean is recommended for daily live but it is certainly not a necessity. Most young people will know some basic English and the city has English language signs and indications everywhere. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100811/03ac0940/attachment.htm From James.Worrell at comlab.ox.ac.uk Fri Aug 13 05:01:18 2010 From: James.Worrell at comlab.ox.ac.uk (James Worrell) Date: Fri, 13 Aug 2010 10:01:18 +0100 (BST) Subject: [TYPES/announce] GAMES 2010: Call for Participation Message-ID: ================================================================ GAMES 2010 Annual Workshop of the ESF Networking Programme on Games for Design and Verification September 19 - 23, 2010 St Anne's College, Oxford, UK http://www.comlab.ox.ac.uk/games2010 CALL FOR PARTICIPATION ================================================================ The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems. GAMES is the annual workshop of the Network. This year's GAMES workshop will be held at St. Anne's College Oxford. More information about the games workshop can be found at http://www.comlab.ox.ac.uk/games2010. SCOPE: The scope of the workshop includes the mathematical and algorithmic analysis of finite and infinite games, the interplay of games with automata theory and logic, and applications of games, automata, and logic to the design and verification of computing systems. PROGRAMME: As in previous years, GAMES 2010 will be an informal workshop, without proceedings. Its programme consists of six invited tutorials, contributed talks (30 min) and short presentations (15 min). Contributed talks and short presentations will be selected by the programme committee on the basis of submitted abstracts. GAMES 2010 will also feature an open problem session, which will consist of very short (10 min) descriptions of interesting open problems about games. INVITED TUTORIALS: - Roderick Bloem (TU Graz, Austria) - Thomas Colcombet (Liafa, Paris 7, France) - Fedor Fomin (Bergen, Norway) - Paul Goldberg (Liverpool, UK) - Tristan Tomala (HEC, Paris, France) - Wieslaw Zielonka (Liafa, Paris 7, France) SUPPORT: There are a limited number of student support packages aimed at students who cannot cover their own expenses. Those receiving such a package will have their accommodation for the nights of September 19th-September 22nd pre-paid and will receive a contribution toward travel costs. To apply please send an email to games2010 at comlab.ox.ac.uk stating your affiliation, the name of your supervisor and your thesis topic. Also we ask that you arrange for your supervisor to send a brief email to the same address to indicate support for your application. Since numbers are limited we encourage participants to apply as early as possible. REGISTRATION: Registration is now open. Please see http://www.comlab.ox.ac.uk/games2010/ for registration information. LOCATION: The workshop will be held in the Mary Ogilvie Lecture Theatre at St Anne's College, Oxford UK. See http://www.st-annes.ox.ac.uk/ for information about the venue. PROGRAMME COMMITTEE: - Dietmar Berwanger (ENS Cachan) - Mikokaj Bojanczyk (Warsaw) - Patricia Bouyer (ENS Cachan) - Erich Graedel (Aachen) - Stephan Kreutzer (Oxford) - Jean-Francois Raskin (Brussels) - Helmut Veith (TU Vienna) - James Worrell (Oxford) From vincent.rahli at gmail.com Thu Aug 19 10:05:08 2010 From: vincent.rahli at gmail.com (rahli vincent) Date: Thu, 19 Aug 2010 15:05:08 +0100 Subject: [TYPES/announce] ULTRA type error slicer for SML: version 0.6 and TECHNICAL REPORT Message-ID: We are happy to announce the release of two things: * Technical report HW-MACS-TR-0079 "A constraint system for a SML type error slicer" which explains how our type error slicing software works. * The new version 0.6 of our type error slicing software for the SML programming language. The abstract of the technical report is: Existing compilers for many languages have confusing type error messages. Type error slicing (TES) helps the programmer by isolating the part of a program contributing to a type error, but unfortunately TES was initially done for a tiny toy language. Extending TES to a full programming language is extremely challenging, and for SML we needed a number of innovations and generalisations. Some issues would be faced for any language, and some are SML-specific but representative of the complexity of language-specific issues likely to be faced for other languages. We solve both kinds of issues and present a simple, general constraint system for providing type error slices for ill-typed programs. Our constraint system elegantly and efficiently handles features like the intricate "open" SML feature. We show how the simple clarity of type error slices can demystify language features known to confuse users. We also provide in an appendix a case study on how to use TES to help modifying user data types, and extend the core language presented in the main body of this report to handle more of the implementation of our system. These extensions allow handling local declarations, type declarations and some uses of signatures. Regarding the software, major improvements over the previous release include: * The slicer is 10 to 100 times faster in many cases, and can reasonably be used on programs containing 10 thousand lines of code. * We support some uses of functors (that is, we report some type errors involving functors). * We report more kinds of errors and the error messages have been improved. * We provide a source archive (that is, a .tar.gz file which you unpack and run ?./configure; make; make install? in the unpacked directory). Other less important improvement is: * The slicer now quickly sends non-minimal error slices to the user interface and then sends a minimal replacement error slice after doing more time-consuming work. * We partially support fixity declarations in that we parse and type check programs using them correctly. Highlighting of infix declarations and identifiers in error slices is not yet correct. Even more changes are documented in the ChangeLog file. The aim of our type error slicer is to provide useful type error reports for pieces of code written in SML: * It identifies all of the program points that contribute to a type error, including the spot with the actual programming error that caused the type error. * It highlights these program points in the original, unchanged source code. * It avoids showing internal details of the operation of the type inference machinery. A new source archive and new Ubuntu (Debian based) and Fedora (Red-Hat based) packages of our type error slicer can be found at this URL: http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ The technical report can be found at this URL: http://www.macs.hw.ac.uk:8080/techreps/view_record.jsp?id=0079 Known limitations: * We have not yet built the software for other operating systems than Linux. * The currently supported user interfaces are via a terminal window, GNU Emacs (or our web demo). We are currently developing a Vim interface. * Some type errors are not yet discovered (the user will need to rely on their usual type checker in these cases). Notable spots where the implementation is incomplete are equality types and sharing constraints. * The details of the SML basis library are incomplete (fortunately the user can add any additional details they are using). Best wishes, Vincent Rahli and Joe Wells -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100819/d10faf41/attachment.htm From jan.cederquist at ist.utl.pt Thu Aug 19 12:26:30 2010 From: jan.cederquist at ist.utl.pt (Jan Cederquist) Date: Thu, 19 Aug 2010 16:26:30 +0000 Subject: [TYPES/announce] Software Verification and Testing at ACM SAC 2011: Deadline extended Message-ID: <4C6D5B36.1060101@ist.utl.pt> Deadline for paper submission to the Software Verification and Testing Track ACM SAC 2011 has been extended: Paper submission (new date): August 31, 2010 Call for papers ============================================== 26th Annual ACM Symposium on Applied Computing Software Verification and Testing Track March 21 - 25, 2011, TaiChung, Taiwan http://web.ist.utl.pt/~jan.cederquist/sacsvt11/Main.html http://www.acm.org/conferences/sac/sac2011/ Important dates * Aug 31st 2010: Submission deadline (extended) * Oct 12th 2010: Notification of acceptance/rejection * Nov 2nd 2010: Camera-ready versions due ACM Symposium on Applied Computing The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-five years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2011 is sponsored by SIGAPP and will be hosted by Tunghai University, TaiChung, Taiwan. Software Verification and Testing Track We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - tools and techniques for verification of large scale software systems - real world applications and case studies applying software verification - static and run-time analysis - abstract interpretation - model checking - theorem proving - correct by construction development - model-based testing - verification-based testing - symbolic execution - analysis methods for dependable systems - software certification and proof carrying code Submissions guidelines Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: https://www.softconf.com/b/sac11-tp/. Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Publication of accepted articles requires the commitment of one of the authors to register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2011 proceedings. Program committee Wolfgang Ahrendt, Chalmers University of Technology, Sweden Yves Bertot, INRIA, Sophia Antipolis, France Laura Brandan-Briones, Universidad Nacional de C?rdoba, Argentina Jan Cederquist (track chair), Instituto Superior T?cnico, Portugal Amy Felty, University of Ottawa, Canada Wan Fokkink, Vrije Universiteit Amsterdam, The Netherlands Dilian Gurov, Royal Institute of Technology, Sweden Joshua Guttman, Worcester Polytechnic Institute and The MITRE Corporation, USA Chris Hankin, Imperial College, UK Jay Ligatti, University of South Florida, USA MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Catuscia Palamidessi, INRIA Saclay and LIX, France Jun Pang, University of Luxembourg, Luxembourg Antonio Ravara, New University of Lisbon, Portugal Fausto Spoto, University of Verona, Italy From manuel.mazzara at newcastle.ac.uk Thu Aug 19 15:27:40 2010 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Thu, 19 Aug 2010 20:27:40 +0100 Subject: [TYPES/announce] [DEADLINE EXTENSION] SAC 2011 track on Service Oriented Architectures and Programming Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA3047D4825FE8@EXSAN01.campus.ncl.ac.uk> SOAP Service Oriented Architectures and Programming http://www.cs.unibo.it/projects/acmsac2011-soap/ ACM SAC 2011 For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary and international forum for applied computer scientists, computer engineers, and application developers to gather, interact and present their work. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University in TaiChung, Taiwan. SOAP TRACK: CALL FOR PAPERS Although when considered from a purely technological point of view Service-Oriented Programming (SOP) is not an enormous novelty, when it comes to paradigmatic considerations SOP is quickly changing our vision of the Web. Originally, the Web was mainly seen as a means of presenting the information to a wide spectrum of people, but SOP is now triggering a radical shift to a vision of the Web as a computational fabric where loosely coupled services interact publishing their interfaces inside dedicated repositories, where they can be searched by other services, retrieved and invoked, always abstracting from the actual implementation. In the context of this modern paradigm we have to cope with an old challenge, like in the early days of Object-Oriented Programming when, until key features like encapsulation, inheritance, and polymorphism, and proper design methodologies were defined, consistency in the programming model definition was not achieved. The complex scenario of Service Oriented Programming needs to be clarified on many aspects, both from the engineering and from the foundational point of view. >From the engineering point of view, there are open issues at many levels. Among others, at the system design level, both traditional approaches based on UML and approaches taking inspiration from business process modeling, e.g. BPMN, are used. At the composition level, although WS-BPEL is a de-facto industrial standard, other approaches are appearing, and both the orchestration and choreography views have their supporters. At the description and discovery level there are two separate communities pushing respectively the semantic approach (ontologies, ...) and the syntactic one (WS-BPEL, ...). In particular, the role of discovery engines and protocols is not clear. In this respect we still lack adopted standards: UDDI looked to be a good candidate, but it is no longer pushed by the main corporations, and its wide adoption seems difficult. Furthermore, a new different implementation platform, the so-called REST services, is emerging and competing with classic Web Services. Finally, features like Quality of Service, security, sustainability and dependability need to be taken seriously into account, and this investigation should lead to standard proposals. >From the foundational point of view, formalists have discussed widely in the last years, and many attempts to use formal methods for specification and verification in this setting have been made. Session correlation, service types, contract theories and communication patterns are only a few examples of the aspects that have been investigated. Moreover, several formal models based upon automata, Petri nets and algebraic approaches have been developed. However most of these approaches concentrated only on a few features of Service Oriented Systems in isolation, and a comprehensive approach is still far from being achieved. The Service Oriented Architectures and Programming track aims at bringing together researchers and practitioners having the common objective of transforming Service Oriented Programming into a mature discipline with both solid scientific foundations and mature software engineering development methodologies supported by dedicated tools. In particular, we will encourage works and discussions about what Service Oriented Programming still needs in order to achieve its original goal, along with works proposing comparison among different models and technological solutions. Major topics of interest will include: - Formal methods for specification of Web Services - Notations and models for Service Oriented Computing - Methodologies and tools for Service Oriented application design - Service Oriented Middlewares - Service Oriented Programming languages - Test methodologies for Service Oriented applications - Analysis techniques and tools - Service systems performance analysis - Industrial deployment of tools and methodologies - Standards for Service Oriented Programming - Service application case studies - Dependability and Web Services - Quality of Service - Security issues in Service Oriented Computing - Comparisons between different approaches to Services - Exception handling in composition languages - Trust and Web Services - Sustainability and Web Services, Green Computing - Adaptable Web Services - Software Product Lines for Services - Artificial Intelligence Techniques for Service Oriented Computing IMPORTANT DATES (please note the deadline extension for paper submission) - August 31, 2010: Paper submissions *EXTENDED* - October 12, 2010: Author notification - November 2, 2010: Camera-Ready Copy - March 21-25, 2011: Conference SUBMISSIONS Authors are invited to submit original unpublished papers. Peer groups with expertise in the track focus area will double-blindly review submissions. Accepted papers will be published in the annual conference proceedings. Prospective papers should be submitted to the track using the provided automated submission system. Papers NOT presented at conference will NOT be included in the ACM digital library. Authors are allowed up to 8 pages, but with more than 6 pages in the final camera ready, there will be a charge of 80USD per extra page. Submission of the same paper to multiple tracks is not allowed. The conference is running a double-blind review process. The submitted manuscript should not include any information which could reveal the authors' identity. The title section of the submitted manuscript should not contain any author names, email addresses, or affiliation status. If the submitted manuscript do include any author names on the title page, the submission will be automatically rejected. In the body of the submission, there should be no direct references to previous work of the authors. That is, phrases such as "this contribution generalizes our results for XYZ" should be avoided. Also, authors' own previous work should not be disproportionately cited. In other words, the submission should be as anonymous as possible. We need your cooperation in our effort to maintain a fair, double-blind reviewing process - and to consider all submissions equally. Please visit the SAC 2011 Website for further information: http://www.acm.org/conferences/sac/sac2011/ PC MEMBERS * Faycal Abouzaid, University of Montreal (Canada) * Marco Aiello, University of Groningen (Netherlands) * Roberto Bruni, University of Pisa (Italy) * Chihung Chi, Tsinghua University (China) * Rocco De Nicola, University of Florence (Italy) * Nicola Dragoni, Technical University of Denmark (Denmark) * Schahram Dustdar, Technical University of Vienna (Austria) * Claudio Guidi, italianaSoftware s.r.l. (Italy) * Tim Hallwyl, Sirius IT (Danmark) * Koji Hasebe, University of Tsukuba (Japan) * Nickolas Kavantzas, ORACLE (USA) * Peep Kungas, University of Tartu (Estonia) * Francisco Martins, University of Lisbon (Portugal) * Michele Mazzucco, University of Tartu (Estonia) * Jing Mei, IBM China Research Lab (China) * Hernan Melgratti, University of Buenos Aires (Argentina) * Nicola Mezzetti, Di.Tech (Italy) * Shih-Hsi Liu, California State University (USA) * Kevin Ottens, Klaralvdalens Datakonsult AB (Sweden) * Luca Padovani, University of Torino (Italy) * Andreas Roth, SAP (Germany) * Maurice ter Beek, ISTI-CNR, Pisa (Italy) * Peter Wong, Fredhopper, Amsterdam (Netherlands) TRACK CHAIRS Ivan Lanese lanese @ cs.unibo.it FOCUS Team, Dipartimento di Scienze dell'Informazione, University of Bologna/INRIA, Italy Manuel Mazzara manuel.mazzara @ newcastle.ac.uk School of Computing Science, Newcastle university, UK Fabrizio Montesi fmontesi @ italianasoftware.com italianaSoftware s.r.l., Italy From m.casadei at unibo.it Mon Aug 23 03:55:27 2010 From: m.casadei at unibo.it (Matteo Casadei) Date: Mon, 23 Aug 2010 09:55:27 +0200 Subject: [TYPES/announce] [Deadline Extension] SAC 2011 Track on Coordination Models, Languages and Applications References: <51DFB501-9213-4FE0-9D5B-568A1A4F8098@unibo.it> Message-ID: *** Apologies if you receive multiple copies of this CfP *** Deadline for paper submission to the Special Track on Coordination Models, Languages and Applications (CM) at SAC 2011 has been extended: Paper submission (new date): August 31, 2010 ------------------------------------------------------------------------------------------------ CALL FOR PAPERS Coordination Models, Languages, and Applications (CM) Special Track at the 26th Symposium on Applied Computing (SAC 2011) TaiChung, Taiwan March 21 - 25, 2011 (http://sac2011.apice.unibo.it/) IMPORTANT DATES Aug. 31, 2010: Paper submissions (NEW) Oct. 12, 2010: Author notification Nov. 2, 2010: Camera-Ready Copy For the past twenty-five years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. TRACK ON COORDINATION MODELS, LANGUAGES, AND APPLICATIONS Building on the success of the twelfth previous editions (1998-2010), a special track on coordination models, languages and applications will be held at SAC 2011. Over the last decade, we have witnessed the emergence of models, formalisms and mechanisms to describe concurrent and distributed computations and systems based on the concept of coordination. The purpose of a coordination model is to enable the integration of a number of, possibly heterogeneous, components (processes, objects, agents) in such a way that the resulting ensemble can execute as a whole, forming a software system with desired characteristics and functionalities which possibly takes advantage of parallel and distributed systems. The coordination paradigm is closely related to other contemporary software engineering approaches such as multi-agent systems, service-oriented architectures, component-based systems and related middleware platforms. Furthermore, the concept of coordination exists in many other Computer Science areas such as workflow systems, cooperative information systems, distributed artificial intelligence, and internet technologies. After more than a decade of research, the coordination paradigm is gaining increased momentum in state-of-the-art engineering paradigms such as multi-agent systems and service-oriented architectures: in the first case, coordination abstractions are perceived as essential to design and support the working activities of agent societies; in the latter case, service coordination, orchestration, and choreography are going to be essential aspects of the next generations of systems based on Web services. The Special Track on Coordination Models, Languages and Applications takes a deliberately broad view of what constitutes coordination. Accordingly, major topics of interest this year will include: - Novel models, languages, programming and implementation techniques - Applications of coordination technologies - Industrial points of view: experiences, applications, open issues - Internet- and Web-based coordinated systems - Coordination of multi-agent systems, including mobile agents, intelligent agents, and agent-based simulations - Coordination in Service-oriented architectures and Web Services - Languages for service description and composition - Models, frameworks and tools for Group Decision Making - Modern Workflow Management Systems and Case-Handling - Coordination in Computer Supported Cooperative Work - Software architectures and software engineering techniques - Configuration and Architecture Description Languages - Coordination Middleware and Infrastructures - Coordination in GRID systems - Self-organization-based approaches to coordination such as those based on swarm and stigmergy - Coordination technologies, systems and infrastructures - Relationship with other computational models such as object oriented, declarative (functional, logic, constraint), programming or their extensions with coordination capabilities - Formal aspects (semantics, reasoning, verification) PROCEEDINGS Papers accepted for the Special Track on Coordination Models, Languages and Applications will be published by ACM both in the SAC 2011 proceedings and in the Digital Library. PAPER SUBMISSION AND FORMAT All papers should represent original and previously unpublished works that currently are not under review in any conference or journal. The author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. This is to facilitate blind review. Only the title should be shown at the first page without the author's information. Submitted papers must be no longer than 6 pages and in the ACM two-column page format (doc template, pdf template, latex template). It will be possible to have up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages maximum). Submission is entirely automated via the STAR Submission System, which is available from the main SAC Web Site:http://www.acm.org/conferences/sac/sac2011/. PC MEMBERS Farhad Arbab, CWI Amsterdam and Leiden University (Netherlands) Marcello Bonsangue, Leiden University (Netherlands) Rocco De Nicola, University of Firenze (Italy) Jose Fiadero, University of Leicester (Italy) Keith Harrison-Broninski, Role Modellers Ltd (UK) Kurt Lichtner, Sybase iAnywhere (Canada) Henry Muccini, University of l'Aquila (Italy) Andrea Omicini, University of Bologna (Italy) Manuel Oriol, University of York (UK) Razvan Popescu, Trinity College Dublin (Ireland) Antonio Porto, University of Porto (Portugal) Rosario Pugliese, University of Florence (Italy) Alessandro Ricci, University of Bologna (Italy) Davide Rossi, University of Bologna (Italy) Yasuyuki Tahara, National Institute of Informatics (Japan) Carolyn Talcott, SRI International (USA) Emilio Tuosto, University of Leicester (UK) Michael Ignaz Schumacher, University of Applied Sciences (Switzerland) Robert Tolksdorf, Freie Universitaet Berlin (Germany) Mirko Viroli, University of Bologna (Italy) George Wells, Rhodes University (South Africa) Herbert Wiklicky, Imperial College London (UK) Pawe? T. Wojciechowski, Pozna? University of Technology (Poland) TRACK CO-CHAIRS Matteo Casadei, Alma Mater Studiorum - Universita' di Bologna, Italy ============ Dott. Ing. Matteo Casadei, Ph.D. Alma Mater Studiorum, Universita' di Bologna DEIS Via Venezia 52, 47521 Cesena (FC) - Italy ***************** phone: +39 0547 339210 fax: +39 0547 339208 email: m.casadei at unibo.it macasadei at deis.unibo.it http://apice.unibo.it/xwiki/bin/view/MatteoCasadei/ ============================================== "Coping with things is not awkward because we don't dare to deal with them. It's because we don't dare that they are complex. (Seneca)" ============================================== From icfp.publicity at googlemail.com Mon Aug 23 04:31:41 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Mon, 23 Aug 2010 10:31:41 +0200 Subject: [TYPES/announce] ICFP '10: Final call for participation Message-ID: ===================================================================== Final Call for Participation The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP 2010) http://www.icfpconference.org/icfp2010/ Baltimore, Maryland September 25 ? October 2 ===================================================================== ICFP 2010 provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. ** Not that the early registration deadline and discount hotel rates expire next week. ** * Program: http://www.icfpconference.org/icfp2010/program.html * Invited speakers: - Mike Gordon ML: Metalanguage or Object Language? - Matthias Felleisen TeachScheme!: A Checkpoint - Guy Blelloch Functional Parallel Algorithms Schedule including related events: * September 25: Workshop on Mechanizing Metatheory (WMM) Workshop on Mathematically Structured Functional Programming (MSFP) Workshop on High-Level Parallel Programming and Applications (HLPP) * September 26: Workshop on ML Workshop on Generic Programming (WGP) * September 27-29: ICFP 2010 * September 30: Haskell Symposium Erlang Workshop * October 1: Commercial Users of Functional Programming ? Day 1 (CUFP Tutorials) Haskell Implementors' Workshop * October 2: Commercial Users of Functional Programming ? Day 2 (CUFP Talks) This year there will also be a special series of Birds-of-a-Feather sessions associated with CUFP. More information can be found at: http://cufp.org/bofs-2010 Registration information: * Registration link: https://regmaster3.com/2010conf/ICFP10/register.php Local arrangements (including travel and accommodation): * http://www.icfpconference.org/icfp2010/local.html * Conference reservation/rate deadline: September 1st Conference organizers: * General Chair: Paul Hudak, Yale University * Program Chair: Stephanie Weirich, University of Pennsylvania * Local Arrangements Chair: Michael Hicks, University of Maryland * Workshop Co-Chairs: Derek Dreyer, Max Planck Institute for Software Systems Christopher Stone, Harvey Mudd College * Programming Contest Chair: Johannes Waldmann, Hochschule f?r Technik, Wirtschaft und Kultur, Leipzig * Video Chair: Scott Smith, Johns Hopkins University * Publicity Chair: Wouter Swierstra, Vector Fabrics ===================================================================== From davide at disi.unige.it Mon Aug 23 12:16:46 2010 From: davide at disi.unige.it (Davide Ancona) Date: Mon, 23 Aug 2010 18:16:46 +0200 Subject: [TYPES/announce] OOPS track at SAC 2011: Deadline Extension Message-ID: <4C729EEE.6040904@disi.unige.it> Please take note that the deadline extension has been extended to AUGUST 31, 2010. OOPS 2011 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS11 Special Track at the 26th ACM Symposium on Applied Computing, SAC 2011 http://www.acm.org/conferences/sac/sac2011 Tunghai University, TaiChung, Taiwan March 21 - 25, 2011 - Important Dates (deadlines are strict) August 31, 2010: Full Paper Submission ** EXTENDED ** October 12, 2010: Notification of paper acceptance/rejection November 2, 2010: Camera-ready copies of accepted papers - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Shigeru Chiba (chiba at is.titech.ac.jp) Tokyo Institue of Technology, Japan Atsushi Igarashi (igarashi at kuis.kyoto-u.ac.jp) Kyoto University, Japan Andy Kellens (akellens at vub.ac.be) Vrije Universiteit Brussel, Belgium - Program Committee * Wei Ngan Chin, National University of Singapore, Singapore * Erik Ernst, University of Aarhus, Denmark * Manuel F?hndrich, Microsoft Research, USA * Jacques Garrigue, Nagoya University, Japan * Robert Hirschfeld, HPI Potsdam, Germany * Jakko J?rvi, Texas A&M University, USA * Kiyokuni Kawachiya, IBM Tokyo Research Laboratory, Japan * Doug Lea, Suny Oswego, USA * Hidehiko Masuhara, University of Tokyo, Japan * Sean McDirmid, Microsoft Research Asia, Beijin * Oscar Nierstrasz, University of Bern, Switzerland * James Noble, Victoria University of Wellington, New Zealand * Manuel Oriol, University of York, UK * Renaud Pawlak, ISEP Research and Consulting for Computer Engineering, France * Sukyoung Ryu, Korea Advanced Institute of Science and Technology, Korea * Jianjun Zhao, Shanghai Jiao Tong University, China - SAC 2011 For the past twenty-five years, the ACM Symposium on Applied Computing(SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2011 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by Tunghai University, TaiChung, Taiwan. - OOPS Track The object-oriented (OO) paradigm is extensively used to design and implement today's large scale software systems. However, existing OO languages and platforms need to evolve to better support features like interoperability, software reuse, dynamic software adaptation, efficiency on multicore hardware, security, and safety. The aim of OOPS is to foster the development of extensions to existing OO languages and platforms, as well as the design and implementation of new languages and platforms embracing and enhancing the object-oriented paradigm. Particularly of interest for OOPS are papers that provide a thorough analysis covering most of the following aspects: theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Language design and implementation * Type systems, static analysis, formal methods * Integration with other paradigms * Aspects, components, and modularity * Reflection, meta-programming * Databases and persistence * Distributed, concurrent or parallel systems * Interoperability, versioning and software adaptation - Submission Instructions Prospective papers should be submitted in pdf format using the provided automated submission system at https://www.softconf.com/b/sac11-tp/. All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The format of the paper must adhere to the sig-alternate style. The paper must not exceed 8 pages according to the above style; please note that this is the same page limit as for the final version. However, for camera-ready papers exceeding **6 pages** each additional page will be charged 80 USD. Papers that fail to comply with length limitations risk rejection. All papers must be submitted by August 24, 2010. For more information please visit the SAC 2011 Website. - Proceedings Accepted papers will be published by ACM in the annual conference proceedings. Accepted posters will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for papers and posters to be included in the conference proceedings and CD. Papers and posters NOT presented at the conference will NOT be included in the ACM digital library. Student registration is only intended to encourage student attendance and does not cover inclusion of papers/posters in the conference proceedings. Finally, following the tradition of the past OOPS editions, we are planning to organize a journal special issue hosting the extended versions of the best papers of the track. From bcpierce at cis.upenn.edu Tue Aug 24 09:44:29 2010 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Tue, 24 Aug 2010 09:44:29 -0400 Subject: [TYPES/announce] Postdoc opportunities at UPenn, Harvard, and Northeastern Message-ID: <9AF0E326-9BF2-4DB5-9F79-AE9D90E0F64C@cis.upenn.edu> Applications are invited for postdoc positions in the areas of programming languages, formal verification, operating systems, and hardware design at the University of Pennsylvania, Harvard University, and Northeastern University. The hosting project, SAFE (Semantically Aware Foundation Environment), is part of CRASH, a larger DARPA-funded effort to design new computer systems that are highly resistant to cyber-attack, can adapt after a successful attack in order to continue rendering useful services, can learn from previous attacks how to guard against and cope with future attacks, and can repair themselves after attacks have succeeded. It offers a rare opportunity to rethink the hardware / OS / software stack from a completely clean slate, with no legacy constraints whatsoever. Specifically, we aim to build a suite of modern operating system services that embodies and supports fundamental security principles?including separation of privilege, least privilege, and mutual suspicion?down to its very bones, without compromising performance. Achieving this goal demands an integrated effort focusing on (1) processor architectures, (2) operating systems, (3) formal methods, and (4) programming languages and compilers -- coupled with a co-design methodology in which all critical system layers are designed together, with a ruthless insistence on simplicity, security, and verifiability at every level. The ideal candidate will have a Ph.D. in Computer Science, a combination of strong theoretical and practical interests, and expertise in two or more of the following areas: programming languages, security, formal verification, operating systems, and hardware design. The position is for one year in the first instance, with possible renewal up to four years. Starting date is negotiable. Applications from women and members of other under-represented groups are particularly welcome. To apply, please send a CV, research statement, and the names of three people who can be asked for letters of reference to Benjamin Pierce (bcpierce at cis.upenn.edu). Inquiries can be directed to any of the PIs: Andre Dehon (Penn) Greg Morrisett (Harvard) Benjamin Pierce (Penn) Olin Shivers (Northeastern) Jonathan Smith (Penn) From luca.aceto at gmail.com Tue Aug 24 10:04:57 2010 From: luca.aceto at gmail.com (Luca Aceto) Date: Tue, 24 Aug 2010 14:04:57 +0000 Subject: [TYPES/announce] One year of Electronic Proceedings in Theoretical Computer Science (EPTCS) Message-ID: *** We encourage members of the TYPES community to consider EPTCS as a publication outlet for the proceedings of their workshops *** Electronic Proceedings in Theoretical Computer Science Electronic Proceedings in Theoretical Computer Science (EPTCS) was launched by Rob van Glabbeek in 2009, as an initiative to have proceedings of all worthy workshops in Theoretical Computer Science freely available on-line. The papers in the proceedings are simply entries in the CoRR repository, http://arxiv.org/corr. DOI numbers are assigned to EPTCS publications, and they are indexed in CrossRef and in the Directory of Open Access Journals. There is no charge for authors or workshops/conferences. The idea caught on like wildfire, and since EPTCS was launched 30 proceedings were published, and 22 more have been accepted for publication, see http://forthcoming.eptcs.org. Perhaps one of the reasons is that the procedure for submitting a proposal is very simple, see http://apply.eptcs.org/ and our response time to a proposal is very fast, usually less than 10 days. Additionally, thanks to efficient workflow, proceedings usually appear within 10 days after all the constituents have been delivered. We find that it is very important to properly record workshop proceedings in one, easily searchable place. Also, we want to contribute in this way to the growing acceptance of the view that all scientific publications should be freely available on-line. We hope that researchers working in Theoretical Computer Science will follow the example of the many others in accord with the originators of this idea. Please see http://published.eptcs.org/ for the list of published workshops. The editors, Rob van Glabbeek (NICTA, Sydney, Australia) Editor in Chief Luca Aceto (Reykjavik University) Rajeev Alur (University of Pennsylvania) Krzysztof R. Apt (CWI and University of Amsterdam) Lars Arge (Aarhus University) Ran Canetti (Tel Aviv University) Luca Cardelli (Microsoft Research) Rocco De Nicola (Universita di Firenze) Jose Luiz Fiadeiro (University of Leicester) Wan Fokkink (Vrije Universiteit Amsterdam) Lane A. Hemaspaandra (University of Rochester) Matthew Hennessy (Trinity College Dublin) Bartek Klin (Warsaw University, University of Cambridge) Evangelos Kranakis (Carleton University) Shay Kutten (Technion) Nancy Lynch (Massachusetts Institute of Technology) Aart Middeldorp (University of Innsbruck) Benjamin Pierce (University of Pennsylvania) Gordon Plotkin (University of Edinburgh) Vladimiro Sassone (University of Southampton) Robert H. Sloan (University of Illinois at Chicago) Wolfgang Thomas (RWTH Aachen University) Irek Ulidowski (University of Leicester) Dorothea Wagner (Universitaet Karlsruhe (TH)) Martin Wirsing (LMU Munich) Moti Yung (Google Inc. and Columbia University) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20100824/f9b5d756/attachment-0001.htm From yminsky at janestreet.com Wed Aug 25 23:05:30 2010 From: yminsky at janestreet.com (yminsky) Date: Wed, 25 Aug 2010 23:05:30 -0400 Subject: [TYPES/announce] CUFP 2010 Call for Participation Message-ID: <7f3766ede671866f0c3a31a02420e256@janestreet.com> Commercial Users of Functional Programming Workshop (CUFP) 2010 Call for Participation Sponsored by SIGPLAN Co-located with ICFP 2010 _________________________________________________________ 1 - 2 October 2010 Baltimore (MD), USA http://cufp.org/conference/schedule/2010 Reservation will be available through ICFP's website: http://www.icfpconference.org/icfp2010 _________________________________________________________ Functional programming languages have been a hot topic of academic research for over 35 years, and have seen an ever larger practical impact in settings ranging from tech startups to financial firms to biomedical research labs. At the same time, a vigorous community of practically-minding functional programmers has come into existence. CUFP is designed to serve this community. The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. CUFP 2010 will feature three hour Functional Programming tutorials given by language experts on the first day and Experience and Technical Talks on day two. Attendees may attend either or both days. Talks Program, October 2nd 2010 Luke Hoban (Microsoft) Keynote: F#: Embracing Functional Programming in "Visual Studio 2010" Sally A Browning (Galois Inc) Cryptol, a DSL for Cryptographic Algorithms Marius Eriksen (Twitter) Scaling Scala at Twitter Michael Fogus (Science Applications International Corporation) Na?vet? vs. Experience - or, How We Thought We Could Use Scala and Clojure, and How We Actually Did It Neal Glew & Leaf Petersen (Intel) Functional Language Compiler Experiences at Intel Warren Harris (Metaweb) Functional Programming at Freebase Warren A. Hunt, Jr. (U. of Texas) Eating One?s Own Dog Food Rusty Klophaus (Basho Technologies) Riak Core: Building Distributed Applications Without Shared State Howard Mansell (Credit Suisse) Eden: An F#/WPF frameworok for building GUI tools Erik Meijer (Microsoft) Reactive Extensions (Rx): Curing Your Asynchronous Programming Blues Tutorial Program, October 1st 2010 Morning: Clojure (Aaron Bedra) Building robust servers with Erlang (Martin Logan) High Performance Haskell (Johan Tibell) Afternoon: F# 2.0 - A day at the beach (Rick Minerich) Implementing web sites with Scala and Lift (David Pollak) Camlp4 and Template Haskell (Nicolas Pouillard, Jake Donham) There will be no published proceedings, as the meeting is intended to be more a discussion forum than a technical interchange. For more information, for more information, including presentation abstracts and the most recent schedule information, visit http://cufp.org See you there! From Jeremy.Gibbons at comlab.ox.ac.uk Thu Aug 26 17:12:21 2010 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Thu, 26 Aug 2010 22:12:21 +0100 (BST) Subject: [TYPES/announce] Haskell 2010 Call for Participation Message-ID: <201008262112.o7QLCLW3012180@merc3.comlab.ox.ac.uk> Haskell 2010 ACM SIGPLAN Haskell Symposium 2010 Baltimore MD, United States 30th September, 2010 CALL FOR PARTICIPATION http://www.haskell.org/haskell-symposium/2010/ The ACM SIGPLAN Haskell Symposium 2010 will take place on Thursday 30th September, co-located with the 2010 International Conference on Functional Programming (ICFP), in Baltimore, Maryland. The early registration deadline is 30th August. Accepted Papers "A generic deriving mechanism for Haskell", José Pedro Magalhães, Atze Dijkstra, Johan Jeuring and Andres Löh. "Hoopl: A Modular, Reusable Library for Dataflow Analysis and Transformation", Norman Ramsey, João Dias and Simon Peyton Jones. "A Systematic Derivation of the STG Machine Verified in Coq", Maciej Pirog and Dariusz Biernacki. "Species and Functors and Types, Oh My!", Brent Yorgey. "Experience Report: Using Hackage to Inform Language Design", J. Garrett Morris. "Concurrent Orchestration in Haskell", John Launchbury and Trevor Elliott. "Scalable Event Handling for GHC", Bryan O'Sullivan and Johan Tibell. "Seq no more: Better Strategies for Parallel Haskell", Simon Marlow, Patrick Maier, Hans-Wolfgang Loidl, Mustafa Aswad and Phil Trinder. "The performance of Haskell containers package", Milan Straka. "Nikola: Embedding Compiled GPU Functions in Haskell", Geoffrey Mainland and Greg Morrisett. "An LLVM Backend For GHC", David Terei and Manuel Chakravarty. "Supercompilation by Evaluation", Max Bolingbroke and Simon Peyton Jones. "Exchanging Sources Between Clean and Haskell - A Double-Edged Front End for the Clean Compiler", John van Groningen, Thomas van Noort, Peter Achten, Pieter Koopman and Rinus Plasmeijer. "Invertible syntax descriptions: Unifying parsing and pretty printing", Tillmann Rendel and Klaus Ostermann. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2010, the 2010 Haskell Symposium web page. * http://www.icfpconference.org/icfp2010, the ICFP 2010 web page. * https://regmaster3.com/2010conf/ICFP10/register.php the ICFP (including Haskell Symposium) registration page. Programme Committee * Jeremy Gibbons, University of Oxford (chair) * James Cheney, University of Edinburgh * Duncan Coutts, Well-Typed LLP * Sharon Curtis, Oxford Brookes University * Fritz Henglein, Kobenhavns Universitet * Tom Schrijvers, Katholieke Universiteit Leuven * Chung-chieh Shan, Rutgers - The State University of New Jersey * Martin Sulzmann, Informatik Consulting Systems AG * Wouter Swierstra, Vector Fabrics * Peter Thiemann, Universitaet Freiburg * Andrew Tolmach, Portland State University * Malcolm Wallace, Standard Chartered Bank From vxc at Cs.Nott.AC.UK Fri Aug 27 04:32:09 2010 From: vxc at Cs.Nott.AC.UK (Venanzio Capretta) Date: Fri, 27 Aug 2010 09:32:09 +0100 Subject: [TYPES/announce] MSFP - early registration: 30 August Message-ID: <1282897929.1642.9.camel@hypatia> Early registration for MSFP closes on 30 August. To register, please use the ICFP registration page: https://regmaster3.com/2010conf/ICFP10/register.php Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, Maryland, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. PROGRAM 9:00 - 10:00 Invited talk: Amy Felty, "Hybrid: Reasoning with Higher-Order Abstract Syntax in Coq and Isabelle" 10:00 - 10:30 break 10:30 - 11:00 Chantal Keller and Thorsten Altenkirch, "Normalization by hereditary substitutions" 11:00 - 11:30 Paul Tarau, "Hereditarily finite representations of natural numbers and self delimiting codes" 11:30 - 12:30 Tutorial: Adam Chlipala, "Foundational Program Verification in Coq with Automated Proofs" 12:30 - 2:00 lunch break 2:00 - 3:00 Invited talk: Mart?n Escard?, "What Tic-Tac-Toe, the Tychonoff Theorem, and the Double-Negation Shift have in common" 3:00 - 3:30 break 3:30 - 4:00 Kazuyuki Asada, "Arrows are Strong Monads" 4:00 - 4:30 Adam Gundry, Conor McBride and James McKinna, "Type inference in context" 4:30 - 5:00 break 5:00 - 6:00 Tutorial: Peter Morris, "Epigram Prime: A Demonstration" Workshop homepage: http://cs.ioc.ee/msfp/msfp2010/ Registration link: https://regmaster3.com/2010conf/ICFP10/register.php Local arrangements: http://www.icfpconference.org/icfp2010/local.html From Bob.Coecke at comlab.ox.ac.uk Tue Aug 31 06:48:14 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Tue, 31 Aug 2010 11:48:14 +0100 (BST) Subject: [TYPES/announce] Categories, Logic and Foundations of Physics (CLP) Message-ID: ============================================================================== 7th Workshop on Categories, Logic and Physics -- CLP7 Birmingham -- 21st September 2010 2st Announcement http://categorieslogicphysics.wikidot.com/ ============================================================================== Categories, Logic and Physics is a workshop series bringing together researchers from the three fields to interact and collaborate, migrate results and cross fertilise. The 7th Workshop on "Categories, Logic and Physics" will be held on Tuesday September 21st, 2010 at the University of Birmingham. As always this is a one day event, there are no conference fees. A particular focus of this meeting will be topological aspects, but, as usual, other topics are covered either. DATE AND LOCATION: -- Tuesday 21st of September 2010 -- The University of Birmingham, School of Computer Science -- Room SPX-LT1 -- This Lecture Theater 1 is in the `Sports and Exercise Science' building Y14, about 5min walk from Computer Science (building Y9), see: http://www.about.bham.ac.uk/maps/pdfs/edgbaston-map-yellow-09.pdf REGISTRATION: If you plan to attend the workshop, please send an email as soon as possible to the local organizers: and/or so that we can make local arrangements. This is important for arranging for smooth lunch, so letting us know really helps you. TRAVEL INFORMATION: Birmingham is easily reached by train or plane (Birmingham International Airport). The train transfer from the airport to the University is approximately 45 minutes. For train travel, you should ask for the station "University" when purchasing tickets. Most routes include a change at Birmingham New Street to the line with destination Longridge or Redditch. ACCOMMODATION: The workshop is intended to be a one day event and most participants will not need to stay overnight. If you need help with an accommodation feel free to contact the local organizers. SCHEDULE: (Titles and abstracts see below) --------------------------------- 10:30-11:00 Welcome Coffee/Tea --------------------------------- 11:00-12:00 Martin Escado Maybe locales are made out of points after all 12:00-13:00 Christopher J. Mulvey Constructive Aspects of Gelfand Duality --------------------------------- 13:00-14:00 Lunch Break --------------------------------- 14:00-15:00 Ronnie Brown What is and what should be `higher dimensional group theory'? 15:00-16:00 Catherine Meusburger Higher categories and observables for generalised Turaev-Viro models --------------------------------- 16:00-16:30 Coffee/Tea Break --------------------------------- 16:30-17:30 Simon Willerton Two 2-traces (Tentative) 17:30-18:30 Cecilia Flori Topos Formulation of history Quantum Theory --------------------------------- 19:00- Pub Session --------------------------------- We are glad to see you in September, local organizers Steve Vickers + Bertfried Fauser workshop coordinators Bob Coecke + Andreas Doering ============================================================================== Titles and Abstracts, in alphabetical order ============================================================================== [Ronnie Brown, Bangor] Title: What is and what should be `higher dimensional group theory'? Abstract: The presentation will show, including some knot demos, some of the problems and intuitions which have led to this question, and how certain cubical algebraic structures with partial operations whose domains are given by geometric conditions have been found quite natural for expressing modes of higher dimensional subdivision and composition which are related to long term concerns in algebraic topology. [Martin Escado, Birmingham] Title. Maybe locales are made out of points after all. Abstract: Like topology in analysis, locale theory is about open sets, continuous functions, compact spaces, approximation and limit processes, and things like that. Both topology and locale theory start with opens. In topology, an open is made out of points, but in locale theory, a point is made out of opens. The localic view makes physical and computational sense: points are infinitely small (and carry an infinite amount of information), and hence are not directly observable, but each point is uniquely characterized by its (infinite) collection of observable properties. The opens are the observables, and locale theory takes the notion of observation as primitive, and all other notions, including that of point, as derived. (Moreover, some perfectly good spaces in locale theory have a rich supply of opens without allowing any point at all, but this is not what I will emphasize in my talk). Although the match of (physical or computational) reality with locale theory is arguably better than with topology, locale theory may be more mathematically demanding, or at least is certainly unfamiliar to most of us. In this talk I'll discuss how one can think of locales as if they were made out of points, like the spaces of classical analysis and geometry, trying to make them more familiar, manageable, and intuitive, without loss of rigour, so that we can reason and work with them efficiently. [Cecilia Flori, Perimeter] Title: Topos Formulation of history Quantum Theory Abstract: In this talk I will describe a topos formulation of consistent histories obtained using the topos reformulation of standard quantum mechanics put forward by Doering and Isham. Such a reformulation leads to a novel type of logic with which to represent propositions. In the first part of the talk I will introduce the topos reformulation of quantum mechanics. I will then explain how such a reformulation can be extended so as to include temporally-ordered collection of propositions as opposed to single time propositions. Finally I will show how such an extension will lead to the possibility of assigning truth values to temporal propositions. [Catherine Meusburger, Hamburg] Title: Higher categories and observables for generalised Turaev-Viro models Abstract: Generalised Turaev-Viro models that are formulated in terms of spherical categories play an important role in three-dimensional quantum gravity, where they are interpreted as discrete path integrals or state sum models of quantised three-manifolds. We discuss the role and interpretation of these models in quantum gravity and comment on the problem of defining observables for these models. We show how this problem can be addressed by using higher categories and discuss the mathematical properties and the physical interpretation of the resulting observables. The talk is based on joint work with John W. Barrett. [Christopher J. Mulvey, University of Sussex] Title: Constructive Aspects of Gelfand Duality Abstract: One of the important foundational aspects of recent approaches to developing quantum theories of space and time has been the existence of a constructive theory of Gelfand duality for commutative C*-algebras. In this talk, we shall outline the way in which this theory was developed, examine its application to the context of quantum physics, and consider its extension to the non-commutative case. [Simon Willerton, Sheffield] Title: Two 2-traces (Tentative) Abstract: Over recent years, in several areas of mathematics the notion of 'categorified trace' or '2-trace' has arisen. For instance, in higher representation theory where groups act on linear categories there is the notion of a '2-character'; in Khovanov knot homology the Hochschild homology is viewed as a categorical trace. It transpires that there are actually two orthogonal, and sometimes dual, notions of 2-trace in common usage and I will explain how they arise and give various examples from various areas of mathematics. ============================================================================== -- % PD Dr Bertfried Fauser %? ? ?? Research Fellow, School of Computer Science, Univ. of Birmingham %? ? ?? Honorary Associate, University of Tasmania %? ? ?? Privat Docent: University of Konstanz, Physics Dept % contact |->? ? URL : http://www.cs.bham.ac.uk/~fauserb/ %? ? ? ? ? ? ? Phone :? +44-121-41-42795 From urzy at mimuw.edu.pl Wed Sep 1 09:59:38 2010 From: urzy at mimuw.edu.pl (Pawel Urzyczyn) Date: Wed, 01 Sep 2010 15:59:38 +0200 Subject: [TYPES/announce] Types'10 - Call for Participation Message-ID: <4c7e5c4a.frkghDo2sjrmIqv4%urzy@mimuw.edu.pl> Call for Participation Types Meeting 2010 Warsaw, 13 -- 16 October 2010 http://types10.mimuw.edu.pl This is a reminder that the early registration deadline for Types'10 is Monday, September 13 Note also that your talk should be submitted no later than September 20. Do not hesitate to contact types10 at mimuw.edu.pl if you have any questions. See you in Warsaw at Types 2010! The Organizing Committee types10 at mimuw.edu.pl From Christophe.Fouquere at lipn.univ-paris13.fr Thu Sep 2 01:58:40 2010 From: Christophe.Fouquere at lipn.univ-paris13.fr (Christophe Fouquere) Date: Thu, 02 Sep 2010 07:58:40 +0200 Subject: [TYPES/announce] Full Professor Position Announcement Message-ID: <4C7F3D10.1060908@lipn.univ-paris13.fr> A full professor position is available at LIPN, Universit? de Paris 13, from November 15, 2010. The LIPN lab is a joint CNRS-University research unit at Universit? de Paris 13 (http://www-lipn.univ-paris13.fr). It develops research in fundamental computer science and information management. The laboratory is structured into five teams, which gathers approximately 130 persons, 65 of which are permanent researchers from the university or CNRS (either full-time researchers or professors). The recruited person is expected to do his/her research in one of the teams. The teaching assignments are in computer science or mathematics for computer science. To apply for this position, it is necessary to - speak french fluently, and - either have been accepted on the eligibility campaign (liste de qualification, see http://www.education.gouv.fr/personnel/enseignant_superieur/enseignant_chercheur/default.htm) - or have an equivalent position. The application process itself starts in September 2010. For further details please look at http://www-lipn.univ-paris13.fr/~fouquere/Postes/index.html or contact : C. Fouquer?, Director of LIPN christophe.fouquere at lipn.univ-paris13.fr -- Christophe Fouquer? directeur du LIPN UMR 7030 CNRS Universit? Paris 13, 99 av JB Cl?ment 93430 Villetaneuse, phone : +33 1 49 40 35 79 From Peter.Sewell at cl.cam.ac.uk Thu Sep 2 06:55:56 2010 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Thu, 02 Sep 2010 11:55:56 +0100 Subject: [TYPES/announce] Post-Doc and PhD positions - Semantics of Real-World Computer Systems Message-ID: [Please bring these to the attention of any suitably qualified candidates - thanks, Peter] ********************************************************************* Research Associate University of Cambridge - Faculty of Computer Science & Technology Salary: £27,319 - £35,646 pa Limit of tenure: Up to 2 years We are seeking a Post-Doctoral Research Associate to join a lively group working on the semantics of real-world computer systems, with a focus on the relaxed-memory concurrency they exhibit. Current projects include work on the memory models of multiprocessors (x86, Power, ARM) and of programming languages (C++0X/C1X, Java), verified compilation of concurrent programming languages to multiprocessors, the semantic theory of relaxed-memory concurrency, and the development of tool support for semantics. You should have a keen interest in applying rigorous semantic techniques to real-world systems, with a strong background in one or more of the following: * Programming Language Semantics * Automated Proof Assistants * Relaxed Memory Models * Program Verification The position is funded by the EPRSC grant EP/H005633, http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=EP/H005633/1, led by Peter Sewell (http://www.cl.cam.ac.uk/~pes20/), to whom enquiries should be addressed. Applications should include: * a Curriculum Vitae * a brief statement of the particular contribution you would make to the project * a completed form CHRIS6: http://www.admin.cam.ac.uk/offices/hr/forms/chris6/ * the names and contact details (postal and e-mail addresses) of two or three referees. Start date: as soon as possible after 4th October 2010 Complete applications should be sent by post to: Personnel-Admin, University of Cambridge, Computer Laboratory, 15 JJ Thomson Avenue, Cambridge CB3 0FD, United Kingdom, or by e-mail to personnel-admin at cl.cam.ac.uk. Quote Reference: NR07133, Closing Date: 4 October 2010 The University values diversity and is committed to equality of opportunity. ********************************************************************* PhD Studentships University of Cambridge - Faculty of Computer Science & Technology We are seeking two PhD students to join a lively group working on the semantics of real-world computer systems, with a focus on the relaxed-memory concurrency they exhibit. Current projects include work on the memory models of multiprocessors (x86, Power, ARM) and of programming languages (C++0X/C1X, Java), verified compilation of concurrent programming languages to multiprocessors, the semantic theory of relaxed-memory concurrency, and the development of tool support for semantics. You should have a keen interest in applying mathematically rigorous semantic techniques to real-world systems, ideally with experience in one or more of the following: * Programming Language Semantics * Automated Proof Assistants * Relaxed Memory Models * Program Verification Informal enquiries should be addressed to Peter Sewell (http://www.cl.cam.ac.uk/~pes20/), including a Curriculum Vitae and a brief statement of your background and interests. The positions are funded by the EPRSC grant EP/H005633, http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=EP/H005633/1. For UK/EU students this covers a stipend and fees. For October 2011 entry, applications should ideally be received by December 1 2010 (applications for earlier start dates may also be considered). Non-UK/EU students will require additional funding for the higher level of fees. Exceptional non-EU candidates may be considered for nomination to the Gates Cambridge Trust and Cambridge International Scholarship competitions. The application deadline (for October 2011 entry) for these is October 15 2010 for US applicants and December 1 for non-US applicants (note that applications must be complete by these deadlines, including transcripts, references, degree certificates, and research proposal). More information on the formal application process is here: http://www.cl.cam.ac.uk/admissions/phd/. Quote Reference: NR07135. The University values diversity and is committed to equality of opportunity. ********************************************************************* From Adrian.Rutle at hib.no Thu Sep 2 08:21:03 2010 From: Adrian.Rutle at hib.no (Adrian Rutle) Date: Thu, 2 Sep 2010 14:21:03 +0200 Subject: [TYPES/announce] New PhD position in MDE at Bergen University College Message-ID: <4C7F96AF.4090005@hib.no> There is currently a PhD position available at the Department of Computer Science, Bergen University College, Norway. The position is in computer science/informatics within the field of model-driven development (MDE), both foundation and application. Application deadline is October 01, 2010. More information and application form available at http://hib.easycruit.com/vacancy/446281/41311 This position will be associated with the Diagram Predicate Framework (DPF) project http://dpf.hib.no/ Please contact Associate Professor Yngve Lamo at yngve.lamo at hib.no for more information. Best regards, -- Adrian Rutle Research Fellow Department of Computer Engineering, Bergen University College, Norway http://home.hib.no/ansatte/aru/ From mwh at cs.umd.edu Thu Sep 2 21:01:44 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Thu, 2 Sep 2010 21:01:44 -0400 Subject: [TYPES/announce] Call for papers: HotSWUp III Message-ID: <8BFA1A4D-E684-4C67-AB4C-052EB9F3FC22@cs.umd.edu> [Types play a central role in many topics involved in software upgrades; e.g., types can be used to describe evolving database schemas or system data representations, and dependent types can characterize relationships between old an new versions. If you have ideas, we'd love to hear about them! ---Mike] CALL FOR PAPERS HotSWUp 2011: Third ACM Workshop on Hot Topics in Software Upgrades (co-located with ICDE 2011) Hannover, Germany April 16, 2011 http://www.hotswup.org Submission deadline: 15 November 2011 OBJECTIVES Actively-used software systems are upgraded regularly to incorporate bug fixes and security patches or to keep up with the evolving requirements. Whether upgrades are applied offline or online, they significantly impact the system's performance and reliability. Recently-introduced commercial products aim to address various aspects of this problem; however, recent studies and a large body of anecdotal evidence suggest that upgrades remain failure-prone, tedious, and expensive. The goal of the HotSWUp Workshop is to identify cutting-edge research for supporting software system upgrades that are flexible, efficient, robust, and easy to specify and apply. Many diverse research areas are concerned with building large, evolving, highly-available systems. As such, HotSWUp seeks contributions from all these areas, ranging from databases to distributed systems, and from programming languages to software engineering, and separately reflected in conferences such as SIGMOD, ICDE, SOSP, OSDI, OOPSLA, PLDI, ICSE, and FSE. By seeking contributions from both academic researchers and industry practitioners, HotSWUp aims to combine novel ideas with experience from upgrading real systems. The present workshop aims to build on the successes of HotSWUp'08 and HotSWUp'09 where the paper presentations and lively discussions attracted a diverse audience of researchers. The topics of interest include, but are not limited to: - Upgrading Information Systems under Schema Evolution. - Programming language / operating system / database support for software upgrades. - Improving the reliability of upgrades (e.g., support for upgrade validation and for rollback after failures). - Support for system or data restructuring (e.g., evolving APIs, changes to database schemas). - Identifying dependencies between components and guaranteeing safe interactions among mixed versions. - Coordinating and disseminating upgrades in large-scale distributed systems. - Software upgrades and the Cloud Computing Infrastructure. - Tools for preparing, testing, and applying software upgrades. - Human factors in software upgrades (e.g., usability of upgrading tools, common operator mistakes). SUBMISSION GUIDELINES We are interested in papers that address practical as well as theoretical aspects of software upgrades from large scale to embedded applications. Particularly welcome this year are submissions concerning software upgrade issues in database systems. Preferably, submissions should fall into one of the following categories: - Suggest how a successful approach can be applied in a different context (e.g., static dependency analysis applied to distributed-system upgrades). - Refute an old assumption about software upgrades (e.g., by presenting negative results). - Describe a new problem or propose a novel solution to an old problem. - Present empirical evidence related to the practical implementation of software upgrades. Papers must not exceed 5 pages, in IEEE camera-ready format (templates at http://www.ieee.org/web/publications/pubservices/confpub/AuthorTools/conferenceTemplates.html) . Papers must be submitted electronically at http://www.hotswup.org. IMPORTANT DATES Submission deadline 15 November 2010 Acceptance notification 15 December 2010 Camera-ready deadline 3 January 2011 Workshop date 16 April 2011 PROGRAM COMMITTEE Rida Bazzi, Arizona State University, USA (co-organizer) Carlo Aldo Curino, Massachusetts Institute of Technology, USA Fabien Dagnat, Telecom Bretagne, France Johann Eder, University of Vienna, Austria Michael Hicks, University of Maryland, College park, USA (co-organizer) Manuel Oriol, University of York, UK George Papastefanatos, National Technical University of Athens, Greece Paolo Papotti, Universit? Roma Tre, Italy Jason Nieh, Columbia University, USA Xin Qi, Facebook, USA Mark Segal, Laboratory for Telecommunications Sciences, USA Liuba Shrira, Brandeis University, USA Carlo Zaniolo, University of California, Los Angeles, USA (co-organizer) MORE INFORMATION Visit the workshop's homepage at: http://www.hotswup.org From atze at cs.uu.nl Mon Sep 6 09:25:44 2010 From: atze at cs.uu.nl (Atze Dijkstra) Date: Mon, 6 Sep 2010 15:25:44 +0200 Subject: [TYPES/announce] PhD position at the Software Technology group at Utrecht University Message-ID: There is currently a PhD position available at he Software Technology group, Department of Information and Computing Sciences, Utrecht University, Netherlands. The ST group focusses its research on programming methodologies, compiler construction, and program analysis. In this area the research will take place, in particular the topic is semi-automatic incrementalization of programs narrowed down to our Utrecht Haskell Compiler (UHC), using our Attribute Grammar system (UUAG). For more details and application see http://www.academictransfer.com/employer/UU/vacancy/6114/lang/en/ The application deadline is October 5, 2010. Please contact Prof. Dr. S.D. Swierstra at doaitse at cs.uu.nl for more information. The project is funded by a research grant from the Netherlands 'Organization for Scientific Research? (NWO). Best regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze . /--| \ Fax : +31-30-2513971 .... | Email: atze at cs.uu.nl ............ / |___\ From cbraga at ic.uff.br Mon Sep 6 10:10:48 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Mon, 6 Sep 2010 11:10:48 -0300 Subject: [TYPES/announce] FACS 2010 - Doctoral Symposium: Call for Contributions Message-ID: Please accept our apologies if you receive multiple copies of this Call for Participation. ************************************************************************* Formal Aspects of Component Software (FACS 2010) 7th International Workshop on Formal Aspects of Component Software October 14-16, 2010 Centro Cultural Vila Flor --- Guimaraes, Portugal Doctoral Symposium: Call for Contributions www.di.uminho.pt/facs2010/ FACS'10 is the 7th event in a series of workshops, founded by the International Institute for Software Technology of the United Nations University (UNU-IIST) in order to promote a deeper understanding of the component-based paradigm and working out challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification. The objective of FACS 2010 Doctoral Track is to give the opportunity to PhD students and young researchers to share their work-in-progress and innovative ideas in a supportive yet questioning setting. Students will be able to discuss their goals, methods, and results at an early stage in their research, receiving useful feedback from established researchers and the other student attendees. To submit to FACS 2010 Doctoral Track please prepare an extended abstract of your talk (2 pages, Springer LNCS format) concisely referring your thesis theme, context, research questions, envisaged contributions, and partial results. Submission is made via EasyChair from FACS website (www.di.uminho.pt/facs2010/) Important dates: Doctoral Track submission: September 12, 2010 Doctoral Track acceptance notification: September 20, 2010 -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: FACS10DS.TXT URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From sweirich at cis.upenn.edu Tue Sep 7 08:40:33 2010 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Tue, 7 Sep 2010 08:40:33 -0400 Subject: [TYPES/announce] TLDI 2011: 2nd Call For Papers Message-ID: <9499AC92-FD10-4B11-93FF-293560ECFAA3@cis.upenn.edu> TLDI 2011 2nd CALL FOR PAPERS The Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation Austin, Texas, USA Tuesday, January 25, 2011 (Co-located with POPL 2011) http://www.mpi-sws.org/~dreyer/tldi2011/ Submission Deadline: October 11, 2010 The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2011 is the sixth workshop in the series and will be co-located with POPL in Austin, Texas in January 2011. Submissions for TLDI 2011 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2011 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented or dynamic languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. Submission Guidelines: Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Monday, October 11, 2010. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template. Papers must be submitted electronically via the workshop website (http://www.mpi-sws.org/~dreyer/tldi2011/) in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Submissions should contain original research not published or submitted for publication elsewhere. Publication: As in previous years, accepted papers will be published by the ACM and appear in the ACM digital library. A printed proceedings will be available at the workshop. Important Dates: - Submission deadline: October 11, 2010 (Monday), 21:00 Samoa-Apia Time - Notification: November 8, 2010 (Monday) - Final versions due: November 22, 2010 (Monday) - Workshop: January 25, 2011 (Tuesday) General Chair: Stephanie Weirich University of Pennsylvania sweirich at cis dot upenn dot edu Program Chair: Derek Dreyer Max Planck Institute for Software Systems (MPI-SWS) dreyer at mpi-sws dot org Program Committee: Thorsten Altenkirch (University of Nottingham) Fritz Henglein (University of Copenhagen) Michael Hicks (University of Maryland, College Park) Limin Jia (Carnegie Mellon University) Mark Jones (Portland State University) Neel Krishnaswami (Microsoft Research, Cambridge) Paul-Andr? Melli?s (CNRS & Universit? Paris Diderot) Aleks Nanevski (IMDEA Software, Madrid) Benjamin Pierce (University of Pennsylvania) Tachio Terauchi (Tohoku University) Sam Tobin-Hochstadt (Northeastern University) Steering Committee: Amal Ahmed (Indiana University) Nick Benton (Microsoft Research, Cambridge) Derek Dreyer (MPI-SWS) Robert Harper (Carnegie Mellon University, chair) Andrew Kennedy (Microsoft Research, Cambridge) Francois Pottier (INRIA Rocquencourt) Zhong Shao (Yale University) Stephanie Weirich (University of Pennsylvania) From wasowski at itu.dk Wed Sep 8 05:10:39 2010 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Wed, 08 Sep 2010 11:10:39 +0200 Subject: [TYPES/announce] Searching for MT-LAB Phd students Message-ID: <4C87530F.9060104@itu.dk> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 PhD Position within the MT-LAB project MT-LAB is A cooperative research center of The Technical University of Denmark, Aalborg University and the IT University of Copenhagen focusing on exploring and developing methods for modeling and analysis of advanced software systems. We seek applicants for the following PhD project within the research centre: STOCHASTIC MODELS FOR OPEN SYSTEMS This PhD scholarship is for you if you would like to study quantitative game models and specifications for components (quantitative interface theories, modal transition system like models, reliability models, compositional reasoning, analysis and synthesis algorithms, behavioral type systems). You have background in concurrency theory and/or Markov models and/or model checking/verification. You are a computer scientist, or a mathematician interested in computation, algorithms, etc. The enrollment is at the ITU in Copenhagen, within the MT-LAB research centre, in collaboration with CISS at AAU and LBT group at DTU. You will be affiliated with Programming languages, Logics and Semantics group (PLS), which traditionally attracts PhD students specializing in theoretical computer science or mathematics. In Denmark PhD positions are open for applicants who hold an MSc degree (or are about to obtain one), or have completed at least one year of an MSc degree. Application deadline: October 6th (strict!) More information: http://www.itu.dk/phd http://itu.dk/Om-IT-Universitetet/stillinger.aspx contact: Andrzej Wa sowski - -- Andrzej W?sowski, PhD, http://www.itu.dk/~wasowski/ Associate prof., head of MSc Programme on Software Development IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark office 4C12, phone +45 7218 5086, fax +45 7218 5001 -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.16 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQGcBAEBAgAGBQJMh1MPAAoJEKbbkSq7tE5u1osL/2q59CATrAFrE3k6uPqG3o/Z 9+RwVGZ+0XHJpNdRtXpbEkmyFgoU1fYpr6yFs1RjwineEMzI1Wc9/eea1wVInfxb To/Uy7z6bCJqJ+VL4cxhdEqQS9rZj6aOBnd43b9UGrTHMxOwVzwfcU7TbY6shTjr FmC2ZHJCDWPAIzU7Qoa8T6pUxx6Q3lSFYYeQURKutKztjT4/605kOiMSNApzNZ1H OhSoUbu2mbFxnQBm4EikHKrsK6/boqyF8g1/fDL2GalnhsLnya2G+ANzmHOUezjE VZ0scJf2uXVsNbCljgGo0U+P7KeYmRn0ZVxLfiC/gM32NlOlXpgt5JXtrdyNdWH1 r0CngXhonXCmkjmR8FWewlHSg6pmutyw8/X3hhVG234EiJZs2l8bzl1m7Sk0x7PV PaIEAWp4+mZ76GaUsRtMp8TTJy8gjWuzHZkvinzaJYEe/EVZfLxdSrIIeSpbkZw7 EE7sJuVdjj3PiCY+pygol2nF8ZiM/jhzWn9h++OxYg== =Iio4 -----END PGP SIGNATURE----- -------------- next part -------------- A non-text attachment was scrubbed... Name: mt-lab-phd-scholarship.pdf Type: application/octet-stream Size: 61561 bytes Desc: not available URL: From sweirich at cis.upenn.edu Thu Sep 9 15:55:31 2010 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Thu, 9 Sep 2010 15:55:31 -0400 Subject: [TYPES/announce] Post Doctoral Position in Formal Methods at Cornell University References: Message-ID: Begin forwarded message: > From: Bob Constable > Date: September 9, 2010 3:13:23 PM EDT > > Post Doctoral Position in Formal Methods at Cornell University > > A one year extend-able position in formal methods is open at Cornell University starting October 1, 2010. The formal methods group is seeking a recent doctoral graduate interested in joining a team of five Cornell investigators working on the verification of a "clean slate" operating system as part of a broad DARPA project on the design of secure single host systems which can respond to attacks by modifying their behavior "on the fly." Our team expects to be working with other DARPA funded groups designing and verifying such a system. > > We seek PhDs with experience in formal methods and with a strong interest in conducting formal proofs with one or two major interactive theorem provers. Experience with Coq or HOL or similar provers is desirable, and applicants with knowledge of methods for reasoning about programs and protocols are preferred. > > We seek applications immediately and will respond in a timely manner to inquiries sent to rc at cornell.edu. From lo at comlab.ox.ac.uk Sat Sep 11 02:54:34 2010 From: lo at comlab.ox.ac.uk (Luke Ong) Date: Sat, 11 Sep 2010 07:54:34 +0100 Subject: [TYPES/announce] Call for Paper: TLCA'11, 1-3 June 2011, Novi Sad Message-ID: CALL FOR PAPER TLCA 2011, 1-3 June 2011, Novi Sad http://www.rdp2011.uns.ac.rs/tlca/index.html The 10th Conference on Typed Lambda Calculi and Applications (TLCA 2011) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: * Proof-theory: formal reasoning based on type theory, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: game semantics, realisability, categorical and other models * Types: dependent types, polymorphism, intersection types and related approaches (union types, refinement / liquid types, behavioural types), type inference, types in program analysis and verification * Programming: foundational aspects of functional and object-oriented programming, flow analysis of higher-type computation, program equivalence (step-indexed, bisimulation and related methods) Important Dates 26 January 2011: Submission of titles and short abstracts 2 February 2011, 23:00 Greenwich Mean Time: Strict deadline for submission of 15-page full papers 23 March 2011: Notification of acceptance 3 April 2011: Camera-ready paper versions due (The above dates are tentative, to be confirmed as soon as possible.) Programme Committee Chair * Luke Ong (Oxford, GB) Programme Committee * Thorsten Altenkirch (University of Nottingham) * Stefano Berardi (University of Torino) * Adriana Compagnoni (Stevens Institute of Technology, New Jersey) * Giles Dowek (Ecole Polytechnique, Paris) * Silvia Ghilezan (University of Novi Sad) * Hugo Herbelin (INRIA, Paris) * Atsushi Igarashi (Kyoto University) * Ranjit Jhala (UC San Diego) * Ralph Matthes (CNRS, IRIT) * Ugo dal Lago (University of Bologna) * Luke Ong (University of Oxford) (PC Chair) * Rick Statman (Carnegie Mellon University) * Tachio Terauchi (Tohoku University) * Nobuko Yoshida (Imperial College, London) From rjhala at cs.ucsd.edu Mon Sep 13 14:06:34 2010 From: rjhala at cs.ucsd.edu (Ranjit Jhala) Date: Mon, 13 Sep 2010 11:06:34 -0700 (PDT) Subject: [TYPES/announce] Second Call for Papers for ACM PLPV 2011 In-Reply-To: <1205425579.222911279670559760.JavaMail.root@csemailbox.ucsd.edu> Message-ID: <1997553258.50311284401194345.JavaMail.root@csemailbox.ucsd.edu> Apologies for multiple postings. --------------------------------------------------------------------------- The Fifth ACM SIGPLAN Workshop on Programming Languages meets Program Verification --------------------------------------------------------------------------- http://cseweb.ucsd.edu/plpv11 --------------------------------------------------------------------------- 29th January, 2011 Austin, Texas Affiliated with POPL 2011 Overview -------- The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms, extended static checking systems like ESC/Java and Spec#, which incorporate contracts and static contract verifiers. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage cross-pollination between different communities, we seek a broad the scope for PLPV. In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc), target different kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc). Important Dates --------------- Submission 11th October, 2010 Notification 8th November, 2010 Final Version 15th November, 2010 Workshop 29th January, 2011 Program Committee ----------------- Andrew Gordon (Microsoft Research) Chris Hawblitzel (Microsoft Research) Ranjit Jhala (University of California, San Diego, co-chair) Viktor Kuncak (Ecole Polytechnique F?d?rale de Lausanne) John Matthews (Galois Inc.) James McKinna (Radboud University) Stefan Monnier (Universit? de Montr?al) Greg Morrisett (Harvard University) Christine Paulin-Mohring (Universit? Paris-Sud) Wouter Swierstra (Vector Fabrics, co-chair) Tachio Terauchi (Tohoku University) Submissions ----------- Submissions should fall into one of the following categories: (a) Research papers (12 pages) that describe new work on the above or related topics. Submissions in this category have an upper limit of 12 pages but shorter submissions are also encouraged. (b) Proposals for challenge problems (6 pages) which the author believes are useful benchmarks or important domains for language-based program verification techniques. Submissions in this category should be at most 6 pages in total length. Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. Publication ----------- Accepted papers will be published by the ACM and will appear in the ACM Digital library. The authors of selected papers will be invited to submit an extended version of their paper to a special issue of the Journal of Formalized Reasoning devoted to papers from PLPV 2011. Student Attendees ----------------- Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to PLPV. Details on the PAC program and the application can be found here. PAC also offers support for companion travel. -------------- next part -------------- An HTML attachment was scrubbed... URL: From roberto at dicosmo.org Tue Sep 14 08:21:30 2010 From: roberto at dicosmo.org (Roberto Di Cosmo) Date: Tue, 14 Sep 2010 14:21:30 +0200 Subject: [TYPES/announce] Assistant Professor position at University Paris Diderot Message-ID: <20100914122130.GA6277@traveler> ====================================================== Assistant professor (Maitre de Conferences) position University Paris 7 Denis Diderot Laboratory PPS (www.pps.jussieu.fr) Web: https://www.pps.jussieu.fr/annonces/2010-mdc ====================================================== A Maitre de Conference permanent position (~ Assistant Professor) will be opened during the next academic year within the Laboratory PPS located at University Paris Diderot (see: http://www.pps.jussieu.fr). Since the recruitment procedure in France involves several preliminary steps, that need to be accomplished before the position actually becomes available, this message is sent largely in advance, to allow all potential interested candidates to start the process in time (see at the end of the message for more details). Please notice that this position involves teaching, in French and proficiency in this language is necessary at the time the position is taken (September 2011). You can find more information on what is a 'Maitre de Conference', including an approximate salary scale, on a french page on Wikipedia http://fr.wikipedia.org/wiki/Ma%C3%AEtre_de_conf%C3%A9rences_%28France%29 Important dates --------------- Beginning of the preliminary process (qualification): September 14, 2010 Expected date of publication of the position: Februrary 2011 Expected date for sending the complete application: end of March 2011 Expected date of the interview of candidates May 2011 Start of the position September 2011 Research area of the position ----------------------------- We are looking for strong junior-level candidates who will be able to contribute to the ongoing effort made in the PPS lagoratory to study the foundations of programming. The researcher to be recruited is expected to contribute to the current research activities of the PPS laboratory on various challenges arising from programming in the large: complex software systems based on heterogeneous, possibly distributed components with short development lifecycles; theory and applications of formal methods to large codes or code bases, possibly leading to the development of tools for improving the quality of software systems. Potential candidates are encouraged to peruse the laboratory web site (http://www.pps.jussieu.fr), as well as the websites of some of the research projects hosted there, like Mancoosi (http://www.mancoosi.org), CerCo (http://cerco.cs.unibo.it/), CDuce (http://www.cduce.org/) and Ocsigen (http://ocsigen.org/). In PPS, the candidate will find a unique blend of computer scientists, with strong formal basis rooted in mathematics, and a passion for programming and applications: this is why, while the position description may seem more oriented towards applications, strong candidates in theoretical computer science are very welcome and should not hesitate in contacting us. Application procedure --------------------- The procedure works in two stages in France: in the first stage, every candidate applies to a national committee that assesses the overall level of the candidate's profile and delivers a 'qualification', which is valid for 4 years. First stage: Qualification -------------------------- The qualification procedure is specific to France, and is done by the CNU (Comite National des Universites), which is divided into sections, one for each discipline. The web page of the Computer Science section is http://cnu27.lri.fr/ and contains extremely useful information: all interested candidates should read the 'Qualification' section there, but here follows a short summary of the important dates. The first step of qualification is performed at the following web site: https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/candidats.html you can register, and fill in the required forms here: https://galaxie.enseignementsup-recherche.gouv.fr/antares/can/index.jsp This first step must be completed very soon, before the 28th of October. The interested candidates should not be afraid to contact us early in case of difficulty with the qualification procedure. A few weeks after the application has been registered on the web site, the names of two reviewers are notified on November 16th on the ANTARES web site: https://galaxie.enseignementsup-recherche.gouv.fr/antares/can/index.jsp The candidate should then immediately send his full application to the two reviewers, and no later than the 17th of December 2010. Second stage: Application ------------------------- Once the 'qualification' is obtained, the candidate should send his full application to the University Paris Diderot, with a resume, a research project and referee letters. All necessary information about that step will appear on the web site https://www.pps.jussieu.fr/annonces/2010-mdc later on. Contact information ------------------- The interested candidates may contact us by email at candidats at sympa.mancoosi.univ-paris-diderot.fr -- --Roberto Di Cosmo ------------------------------------------------------------------ Professeur En delegation a l'INRIA PPS E-mail: roberto at dicosmo.org Universite Paris Diderot WWW : http://www.dicosmo.org Case 7014 Tel : ++33-(0)1-57 27 92 20 5, Rue Thomas Mann F-75205 Paris Cedex 13 Identica: http://identic.ca/rdicosmo FRANCE. Twitter: http://twitter.com/rdicosmo ------------------------------------------------------------------ Attachments: MIME accepted Word deprecated, http://www.rfc1149.net/documents/whynotword ------------------------------------------------------------------ From zambon at cs.utwente.nl Tue Sep 14 09:19:45 2010 From: zambon at cs.utwente.nl (Eduardo Zambon) Date: Tue, 14 Sep 2010 15:19:45 +0200 Subject: [TYPES/announce] Final CfPart ICGT and SPIN, 27 Sep - 2 Oct 2010 at University of Twente, The Netherlands Message-ID: <4C8F7671.7010707@cs.utwente.nl> ============================================================== *** Call for Participation *** ICGT 2010 Fifth International Conference on Graph Transformation 29 Sep - 1 Oct 2010 http://www.utwente.nl/icgt2010/ SPIN 2010 17th International SPIN Workshop on Model Checking of Software 27 Sep - 29 Sep 2010 http://www.utwente.nl/spin2010/ University of Twente, Enschede, The Netherlands ============================================================== PROGRAMME AND REGISTRATION Programme at: http://www.utwente.nl/icgt-spin/programme Registration: http://www.utwente.nl/icgt-spin/registration -------------------------------------------------------------- JOINT ICGT/SPIN INVITED SPEAKER: - Javier Esparza, University of Munich ICGT 2010 INVITED SPEAKERS: - Krzysztof Czarnecki, University of Waterloo - Christoph Brandt, University of Luxembourg SPIN 2010 INVITED SPEAKERS: - Alessandro Cimatti, FBK-IRST, Italy - Darren Cofer, Rockwell Collins, USA -------------------------------------------------------------- SATELLITE EVENTS: - PDMC: 9th International Workshop on Parallel and Distributed Methods in Verification - HiBi: 2nd International Workshop on High Performance Computational Systems Biology - GCM: 3rd Workshop on Graph Computation Models - GraBaTs: 4th International Workshop on Graph-Based Tools - PNGT: 4th Workshop on Petri Nets and Graph Transformations - WTNC: Workshop and Tutorial on Natural Computing - ICGT Doctoral Symposium -------------------------------------------------------------- From Jean-Yves.Marion at loria.fr Thu Sep 16 15:39:39 2010 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Thu, 16 Sep 2010 21:39:39 +0200 Subject: [TYPES/announce] Call for papers : DICE 2011 Message-ID: <02B6086F-8053-43C3-9B33-45561F1B51A0@loria.fr> ------------------------------------------------------------------------------ ------- Call for papers --------- ---------------------------------------------------------------------------------- Second International Workshop on Developments in Implicit Computational complExity (DICE 2011) http://dice11.loria.fr/ April, 2nd-3rd, Saarbr?cken, Germany as part of ETAPS 2011 ----------------------------------------------------------------------------------- SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity- bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 2010 at ETAPS. Before that, several meetings on this topic had already been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) , and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html) . INVITED SPEAKERS: TBA IMPORTANT DATES: * Paper submission: December 15th, 2010 * Notification date: January 27th, 2011 * Final version due: February 8th, 2011 * Workshop: April 2nd-3rd, 2011 SUBMISSION PROCEDURE: There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be sumbitted electronically, as pdf files, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. We plan to publish post-proceedings. PROGRAMME COMMITTEE: Amir Ben-Amram (Academic College of Tel-Aviv) Patrick Baillot (ENS Lyon, CNRS) Jean-Yves Marion (Universit? de Lorraine) (Chair) Simone Martini (Universit? di Bologna) Damiano Mazza (Universit? Paris 13) Georg Moser (Universit?t Innsbruck) Ricardo Pe?a (Universidad de Madrid) Luca Roversi (Universit? di Torino) Jim Royer (Syracuse University) STEERING COMMITTEE: Patrick Baillot (ENS Lyon, CNRS) (Chair) Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) Jean-Yves Marion (Universit? de Lorraine) Simona Ronchi Della Rocca (Universit? di Torino) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: Jean-Yves.Marion at loria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From carsten at itu.dk Fri Sep 17 02:20:17 2010 From: carsten at itu.dk (Carsten Schuermann) Date: Fri, 17 Sep 2010 08:20:17 +0200 Subject: [TYPES/announce] PhD Scholarships at the IT University of Copenhagen Message-ID: <3F81D6FB-63E8-4665-9DAE-C38BF385CFA8@itu.dk> Dear all, a number of Ph.D. positions are available at the IT University of Copenhagen. We are looking for candidates interested in the areas of Automated reasoning, categorical logic, type theory, coordination languages, electronic voting, logical frameworks, models for concurrency, distributed and mobile computation, programming languages semantics, modular program verification, proof assistants, programming languages, static analysis of programming and modelling languages, workflow languages. Please see http://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=73066&DepartmentId=5236&MediaId=5 for the official announcement and for information on how to apply. Application deadline is October 6, 2010. Potential applicants are welcome to contact me or any of the other faculty members in the PLS group (www.itu.dk/research/pls) for more information. Best wishes, Carsten Schuermann -------------- next part -------------- An HTML attachment was scrubbed... URL: From wcook at cs.utexas.edu Fri Sep 17 09:29:27 2010 From: wcook at cs.utexas.edu (William Cook) Date: Fri, 17 Sep 2010 08:29:27 -0500 Subject: [TYPES/announce] SPLASH/OOPSLA 2010 Call for Participation (Early registration until Sept 22) Message-ID: <4C936D37.4000100@cs.utexas.edu> SPLASH 2010 Systems, Programming, Languages, and Applications: Software for Humanity http://www.splashcon.org Call for Participation October 16 to 20 John Ascuaga's Nugget Hotel Reno/Tahoe Nevada, USA **** Early registration deadline September 22, 2010 **** SPLASH invites you to participate in defining the future of software development. SPLASH is pleased to host these events: * OOPSLA research papers * Onward! Conference - http://onward-conference.org * International Lisp Conference (ILC) - http://www.international-lisp-conference.org/2010 * Dynamic Languages Symposium (DLS) - http://www.dynamic-languages-symposium.org/dls-10 * Pattern Languages of Programming (PLoP) - http://www.hillside.net/plop/2010 * Tutorials, Panels, Workshops, Practitioner Reports and more SPLASH is sponsored by ACM SIGPLAN and SIGSOFT with support from CISCO, IBM Research, Google, InformIT.com and Wiley. Details of the program and accommodation at the Nugget are available at http://www.splashcon.org == Invited Talk Highlights (for all conferences) == ? The Case for Evolvable Software - Stephanie Forrest, University of New Mexico in Albuquerque, USA ? Art, Science, and Fear - Benjamin C. Pierce, University of Pennsylvania, USA ? Searching Without Objectives - Kenneth Stanley, University of Central Florida, USA ? F#: Taking Succinct, Efficient, Typed Functional Programming into the Mainstream - Don Syme, Microsoft Research, UK ? Building a Mind for Life - Lawrence Hunter, University of Colorado School of Medicine ? The impending ordinariness of teaching concurrent programming - Doug Lea, SUNY Oswego ? AllegroGraph and the Linked Open Data Cloud - Jans Aasman, CEO, Franz Inc. USA ? Smalltalk Virtual Machines to JavaScript Engines: Perspectives on Mainstreaming Dynamic Languages - Allen Wirfs-Brock, Microsoft ? Gambit Scheme: Inside Out - Marc Feeley, l'Universit? de Montr?al ? Lisp for Breakthrough Products - Lowell Hawkinson, President, Expressive Database (and GENSYM Founder) == Panel Highlights == ? Manifesto: a New Educational Programming Language - Kim B. Bruce, James Noble, Andrew Black, Jens Palsberg ? Onward! Panel - Software in a Sustainable World - Aki Namioka, Abhisheck Agrawal, Kirk Cameron, Ron Gremban ? Objects and Stateful Programming - Life after Mutlti-Core? - Brian Foote, Brian Goetz, Ralph Johnson, Dave Thomas ? The Object-Oriented Trivia Show - TOOTS - Jeff Gray, Jules White == Tutorials == ? An Architecturally-Evident Coding Style: Making Your Design Visible in Your Code - George Fairbanks ? Better Planning Via Tasking as a Team - Chris O'Connor ? Bridging Software Languages and Ontology Technologies - Fernando Silva Parreiras, Christian Wende, Edward Thomas, Tobias Walter ? Introduction to Model Driven Development with Examples using Eclipse Frameworks - Bruce Trask & Angel Roman ? iPhone Application Development - Javier Gonzalez-Sanchez & Maria Elena Chavez-Echeagaray ? Language Extension and Composition with Language Workbenches - Markus Voelter, Eelco Visser ? Pattern-Oriented Software Architectures - Patterns and Frameworks for Concurrent and Networked Software - Douglas Schmidt ? Refactoring for Parallelism - Danny Dig ? Rulemakers and Toolmakers: Adaptive Object Models as as Agile Division of Labor - Joseph Yoder, Rebecca Wirfs-Brock ? Stop the Software Architecture Erosion: controlling and building better software systems - Bernhard Merkle ? Weaving Web Applications with WebDSL - Danny M. Groenewegen, Eelco Visser & Zef Hemel ? Skills for Agile Designers: Seeing, Shaping, and Discussing Design Ideas - Rebecca Wirfs-Brock ? Xtext - Implement your Language Faster than the Quick and Dirty way - Moritz Eysholdt & Heiko Behrens ? XUnit Test Patterns and Smells; Improving the ROI of Test Code - Gerard Meszaros == OOPSLA == Selected Papers I ? Efficient Modular Glass Box Software Model Checking ? An Experiment About Static and Dynamic Type Systems ? A Simple Inductive Synthesis Methodology and its Applications Software Engineering ? A Domain-Specific Approach to Architecturing Error Handling in Pervasive Computing ? G-Finder: Routing programming questions closer to the experts ? Agility in Context Language Design, Compilation, and Optimization ? Lime: a Java-Compatible and Synthesizable Language for Heterogeneous Architectures ? From OO to FPGA: Fitting Round Objects into Square Hardware? ? An Input-Centric Paradigm for Program Dynamic Optimizations Defect Detection ? Composable Specifications for Structured Shared-Memory Communication ? Do I Use the Wrong Definition? ? Scalable and Systematic Detection of Buggy Inconsistencies in Source Code Runtime Systems ? A Study of Java's non-Java Memory ? Hera-JVM: A Runtime System for Heterogeneous Multi-Core Architectures ? Cross-Language, Type-Safe, and Transparent Object Sharing For Co-Located Managed Runtimes Monitoring ? Instrumentation and Sampling Strategies for Cooperative Concurrency Bug Isolation ? What Can the GC Compute Efficiently? ? Monitor Optimization via Stutter-equivalent Loop Transformation Software Structure ? Specifying and Implementing Refactorings ? A Graph-based Approach to API Usage Adaptation ? Component Adaptation and Assembly Using Interface Relations Selected Papers II ? Type Classes as Objects and Implicits ? Supporting Dynamic, Third-Party Code Customizations in JavaScript Using Aspects ? Dynamic Parallelization of Recursive Code Heap Analysis ? Symbolic Heap Abstraction with Demand-Driven Axiomatization of Memory Invariants ? A Dynamic Evaluation of the Precision of Static Heap Abstractions ? Parallel Inclusion-based Points-to Analysis Metaprogramming ? The Spoofax Language Workbench: Rules for Declarative Specification of Languages and IDEs ? MetaFJig - A Meta-circular Composition Language for Java-like Classes ? Modular Logic Metaprogramming Modularity ? Reasoning about Multiple Related Abstractions with MultiStar ? Homogeneous Family Sharing ? Mostly modular compilation of crosscutting concerns by contextual predicate dispatch Higher-Order, Continuations, Futures ? Random testing for higher-order, stateful programs ? The Two-State Solution: Native and Serializable Continuations Accord ? Back to the Futures: Incremental Parallelization of Existing Sequential Runtime Systems Sharing ? Ownership and Immutability in Generic Java ? Tribal Ownership ? A Time-Aware Type System For Data-Race Protection and Guaranteed Initialization Concurrent Programming ? Automatic Atomic Region Identification in Shared Memory SPMD Programs ? Task Types for Pervasive Atomicity ? Concurrent Programming with Revisions and Isolation Types Tools and Performance ? SPUR: A Trace-Based JIT Compiler for CIL ? Refactoring References for Library Migration ? Performance Analysis of Idle Programs Practitioner Reports ? Agile ? Letters From The Edge Of An Agile Transition ? Software Evolution in Agile Development : A Case Study Large Systems ? Object-oriented Software Considerations in Airborne Systems and Equipment Certification ? Application Frameworks: How They Become Your Enemy? ? Stop the Software Architecture Erosion: controlling and building better software systems Modeling ? Migrating a Large Modeling Environment from UML/XML to GMF/Xtext ? Model-Driven Software Development (MDSD) on the iPhone ? Textual Modeling Tools: Overview and Comparison of Language Workbenches == Onward! == Onward! Essays ? Better Science Through Art - Richard Gabriel & Kevin Sullivan ? Rubber Ducks, Nightmares, and Unsaturated Predicates: Proto-Scientific Schemata are Good for Agile - Jenny Quillien & Dave West ? Pure and Declarative Syntax Definition: Paradise Lost and Regained - Lennart C. L. Kats, Eelco Visser & Guido Wachsmuth ? Faith, Hope, and Love - A criticism of current practice in programming language research - Stefan Hanenberg ? The Tower of Babel Did Not Fail - Paul Adamczyk & Munawar Hafiz Onward! Long Papers ? Registration-Based Language Abstractions ? Pinocchio: Bringing Reflection to Life with First-Class Interpreters ? Concurrency by Modularity: Design Patterns, a Case in Point ? Understanding Reduced Resource Computing ? Programming With Time ? Language Virtualization for Heterogeneous Parallel Computing ? Flexible Modeling Tools for Pre-Requirements Analysis: Conceptual Architecture and Research Challenges ? To Upgrade or Not to Upgrade: Impact of Online Upgrades across Multiple Administrative Domains ? Managing Ambiguity in Programming by Finding Unambiguous Examples Onward! Short Papers ? now happens-before later --- Static Schedule Analysis of Fine-grained Parallelism with Explicit Happens-before Relationships ? Collaborative Model Merging ? A Recommender for Conflict Resolution Support in Optimistic Model Versioning ? Emergent Feature Modularization ? Sonifying Performance Data to Facilitate Tuning of Complex Systems ? Inferring Arbitrary Distributions for Data and Computation ? Ficticious: MicroLanguages for Interactive Fiction ? Harnessing Emergence for Manycore Programming: Early Experience Integrating Ensembles, Adverbs, and Object-based Inheritance Onward! Films ? Physics as Freedom - Seung Chan Lim, Rhode Island School of Design, USA ? Pinocchio: A Virtual Symphony Orchestra Game - Ruth Demmel, Technische Universitat M?nchen, Germany ? Gource: Visualizing Software Version Control History - Andrew Caudwell, Catalyst IT Ltd, New Zealand == Educators' and Trainers' Symposium == Keynote ? The impending ordinariness of teaching concurrent programming - Doug Lea, SUNY Oswego, United States Activity: Students' Cooperation in Teamwork: Binding the Individual and the Team Interests Panel: Manifesto: a New Educational Programming Language Papers ? Mutation Analysis vs. Code Coverage in Automated Assessment of Students' Testing Skills ? Compiler Construction With a Dash of Concurrency and an Embedded Twist ? Teaching and Training Developer-Testing Techniques and Tool Support ? Learning Cuda: Lab Exercises and Experiences ? A Web-Based Repository of Software Testing Tools to Support Pedagogy ? Understanding Abstraction: Means of Leveling the Playing Field in CS1? ? Learning OOP with Dynamic Languages: Adding Concrete Strategies to a PHP Strategy Design Pattern == Workshops == ? Foundations of Object-Oriented Languages (FOOL'10) ? Architecture in an Agile World ? Concurrency for the Application Programmer ? Curricula in Concurrency and Parallelism ? Experimental Evaluation of Software and Systems in Computer Science (EVALUATE 2010) ? KOPLE ? Knowledge-Oriented Product Line Engineering ? Ontology-Driven Software Engineering ? Onward! Workshop: Evaluation and Usability of Programming Languages and Tools (PLATEAU) ? Parallel/High-Performance Object-Oriented Scientific Computing ? Programming Support Innovations for Emerging Distributed Applications ? SPLASH 2010 Workshop on Flexible Modeling Tools ? The 10th Workshop on Domain-Specific Modeling ? The 2nd Workshop on Human Aspects of Software Engineering (HAoSE2010) ? Virtual Machines and Intermediate Languages ? CloudCamp From paolini at di.unito.it Sun Sep 19 11:53:19 2010 From: paolini at di.unito.it (Luca Paolini) Date: Sun, 19 Sep 2010 17:53:19 +0200 Subject: [TYPES/announce] RDP 2011 -- Call For Workshop Proposals Message-ID: <1284911600.6902.2.camel@nbpaolini2.dipinfo.di.unito.it> Federated Conference on Rewriting, Deduction, and Programming RDP 2011 29/5/2011 - 3/6/2011, Novi Sad, Serbia Call For Workshop Proposals RDP 2011 is a federated event comprising two major conferences: - The 22nd International Conference on Rewriting Techniques and Applications (RTA'09) - The 10th International Conference on Typed Lambda Calculi and Applications (TLCA'09). Previous RDPs were held in 2003 in Valencia (Spain), 2004 in Aachen (Germany), 2005 in Nara (Japan), 2007 in Paris (France) and 2009 in Brasilia (Brasil). RDP has a tradition of federating every two years RTA and TLCA, and of hosting related workshops. We solicit proposals for satellite workshops of RDP 2011 that are related in topics to one or both of the RDP conferences. Workshops should have a length of 1 or 2 days (possibilities for longer workshops should be discussed with the organizers). It is tradition at RDP that attendance to workshops is open to participants of parallel events, similar to the way FLoC workshops are run. There will be one day (Sunday, May 29, 2011) reserved for workshops, however, it will also be possible to run workshops on the other days in parallel to one of the main conferences. RDP will provide the possibility to print workshop proceedings, details of the procedure will be posted later by the local organizing committee. RDP will not be able to reimburse invited workshop speakers for travel or living expenses, though it may be possible to waive part of the registration fees for invited speakers. The priority of RDP will be to keep registration fees for the conferences and workshops low. Please submit your workshop proposal by email to rdp2011-workshop at uns.ac.rs Proposals should be written in plain text. The proposal should cover the following topics: 1. Name of workshop 2. A statement of the topics and goals of the workshop 3. Names and addresses of the organizers 4. Pointers to descriptions of previous editions of the workshop, if any 5. A description of the submission selection process 6. Plans for the publication of proceedings (informal proceedings distributed to participants, electronic journal, proceedings with separate selection process, ...) 7. Plans for invited speakers or special sessions (round-table discussion, tutorials, ...) 8. Expected length of the workshop 9. Expected number of attendees 10. Any special needs (for system demonstrations ...) The Workshop Selection Committee consists of Luke Ong (TLCA 2011 program chair) Manfred Schmidt-Schauss (RTA 2011 program chair) Silvia Ghilezan (RDP 2011 general chair). ------------------------------------------------------- |November 19, 2010 | deadline for proposals | ------------------------------------------------------- |November 30, 2010 | notification of acceptance| -------------------------------------------------------- Prospective workshop organizers are welcome to contact the workshop selection committee in advance before sending in a formal submission and to discuss any questions. RDP'09 http://rdp09.cic.unb.br/ RDP'07 http://www.lsv.ens-cachan.fr/rdp07/index.html RDP'05 http://www.kurims.kyoto-u.ac.jp/rdp05/ RDP'03 http://www.dsic.upv.es/~rdp03/ RTA http://rewriting.loria.fr/rta/ TLCA http://www.mimuw.edu.pl/tlca/ From coquand at chalmers.se Mon Sep 20 06:10:52 2010 From: coquand at chalmers.se (Thierry Coquand) Date: Mon, 20 Sep 2010 12:10:52 +0200 Subject: [TYPES/announce] Post Doctoral Position in Formalization of Mathematics Message-ID: <15320487-3468-484D-8344-7A1CD1C6A0D8@chalmers.se> We seek PhDs with a strong interest in functional programming, type theory and formal representation of proofs in type theory. This position is within a Strep Open, 7th framework, which involves, as other sites,INRIA, INRIA-microsoft, Nijmegen and La Roja, see http://wiki.portal.chalmers.se/cse/pmwiki.php/ForMath/ForMath One main part of this work will be to explore the feasibility of representing simple mathematical algorithms (in linear algebra and algebraic topology) using the ssreflect extension of type theory developed in the Mathematical Components project. For more information, see http://ledig-anstallning.adm.gu.se/detail.php?lt_id=6465 -------------- next part -------------- An HTML attachment was scrubbed... URL: From Klaus.Havelund at jpl.nasa.gov Wed Sep 22 16:11:49 2010 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (316D)) Date: Wed, 22 Sep 2010 13:11:49 -0700 Subject: [TYPES/announce] [fm-announcements] RV 2010 - Second Call for Participation Message-ID: SECOND CALL FOR PARTICIPATION RV 2010 : 1st International Conference on Runtime Verification November 1-4, 2010, St. Julians, Malta http://www.rv2010.org ** Early registration deadline: September 30, 2010 ** The 2010 Runtime Verification conference is a forum for researchers and industrial practitioners for presenting theories and tools for monitoring and analyzing system (software and hardware) executions, as well as forum for presenting applications of such tools to practical problems. The field of runtime verification is often referred to under different other names, including dynamic analysis, runtime analysis, and runtime monitoring, to mention a few. Runtime verification can be applied during the development of a system for the purpose of program understanding, debugging, and testing, or it can be applied as part of a running system, for example for security or safety monitoring, and can furthermore be part of a fault protection framework. RV 2010 is conducted over 4 days. The first day offers 6 tutorials in parallel sessions. The remaining three days offer 6 invited talks, and presentation of 27 regular papers, short papers and tool demonstrations. INVITED SPEAKERS: - Mike Barnett "Code Contracts for .NET: Runtime Verification and So Much More" - Rance Cleaveland "Automatic Requirement Extraction from Test Cases" - Matthew Dwyer "Optimizing Runtime Monitors : Combining Static and Dynamic Techniques" - Martin Odersky "Contracts in Scala" - Wim De Pauw "Visualizing Complex IT Systems" - R. Sekar "Runtime Analysis and Instrumentation for Securing Software" TUTORIALS: - Cyrille Valentin Artho "Run-time Verification of Networked Software" - Eric Bodden and Patrick Lam "Clara: Partially Evaluating Runtime Monitors at Compile Time" - Ylies Falcone "You should Better Enforce than Verify" - Sylvain Halle and Roger Villemaire "Runtime Verification for the Web" - Axel Legay "Statistical Model Checking: Present and Future" - Patrick Meredith and Grigore Rosu "Runtime Verification with the RV System" VENUE: The conference takes place in St. Julians on Malta, and is hosted by the University of Malta. Malta lies at almost the exact geographical heart of the Mediterranean Sea. With Sicily some 95 kms to the North, Tripoli 350 kms to the South and Tunis 320 kms to the West, Malta is virtually at the crossroads between continents. Malta's pre-history dates back to 5000 B.C. The official languages of Malta are Maltese and English, so getting by with English is not a problem. Italian is also widely spoken. The accommodation and conference venue is the 5 star Le Meridien Hotel, located on the ground of a 19th century Villa in St Julians, overlooking Balluta Bay. The climate is typically Mediterranean. The average temperature in November is 20C (70F) during the day and around 14C (60F) at night. REGISTRATION: The registration is open at: http://www.um.edu.mt/events/rv2010/registration - Early registration fee, before or on 30 September: 380 Euros - Late registration fee, after 30 September: 450 Euros STUDENTS: RV 2010 is supporting a limited number of registrations for students at 190 Euros. Students can apply by sending an email to Gordon Pace (gordon.pace at um.edu.mt) with evidence of student status. ORGANIZATION: General Chairs: - Howard Barringer, University of Manchester, UK - Klaus Havelund, NASA/Jet Propulsion Laboratory, USA - Insup Lee, University of Pennsylvania, USA Program Chairs: - Grigore Rosu, University of Illinois, Urbana-Champaign, USA - Oleg Sokolsky, University of Pennsylvania, USA Local Organization Chair: - Gordon Pace, University of Malta, Malta Tutorials Chair: - Bernd Finkbeiner, Saarland University, Germany Tool Demonstrations Chair: - Nikolai Tillmann, Microsoft Research, USA Publicity Chair: - Ylies Falcone, INRIA Rennes, France SPONSORS: RV 2010 is sponsored by: - The International Federation for Computational Logic - The ARTIST Network of Excellence on Embedded Systems Design - Microsoft Research - University of Illinois We look forward to welcoming you at the 1st International Conference on Runtime Verification. -------------- next part -------------- An HTML attachment was scrubbed... URL: From gethin at dcs.gla.ac.uk Thu Sep 23 11:42:34 2010 From: gethin at dcs.gla.ac.uk (Gethin Norman) Date: Thu, 23 Sep 2010 16:42:34 +0100 Subject: [TYPES/announce] QAPL 2011 First Call For Papers Message-ID: <25CFAF38-2143-42FF-9DBD-5A6C4A8E7896@dcs.gla.ac.uk> [Apologies for multiple copies] *************************************************************************** FIRST CALL FOR PAPERS Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011) Affiliated with ETAPS 2011 April 1-2, 2011, Saarbrucken, Germany http://www.dcs.gla.ac.uk/qapl11/ *************************************************************************** SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Prakash Panangaden (McGill, Canada) * to be confirmed SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits two types of submissions - regular papers and presentations: 1. Regular paper submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 15 pages, possibly followed by a clearly marked appendix which will be removed for the proceedings and contains technical material for the reviewers. 2. Presentation reports concern recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl11 The workshop PC will review all regular paper submissions select appropriate ones for acceptance, based on their relevance, merit, originality, and technical content. Presentation reports will receive a lightweight review to establish their relevance for the workshop. The authors of the accepted submissions of both type are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Publication of a selection of the papers in a special issue of a journal is under consideration. For regular papers: Submission (regular paper): December 17, 2010 Notification: January 21, 2011 Final version (ETAPS proceedings): February 4, 2011 Final version (EPTCS proceedings): TBA For presentation reports: Submission: January 24, 2011 Notification: January 26, 2011 ORGANIZATION: PC Chairs: * Mieke Massink, CNR-ISTI, Pisa, Italy * Gethin Norman, University of Glasgow, UK Program Committee (to be completed): * Alessandro Aldini, University of Urbino, Italy * Christel Baier, University of Dresden, Germany * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, IRISA/INRIA Rennes, France * Patricia Bouyer, Oxford University, UK * Jeremy Bradley, Imperial College London, UK * Tomas Brazdil, Masaryk University, Czech Republic * Frank van Breugel, York University, Canada * Antonio Cerone, UNU-IIST, Macao * Kostas Chatzikokolakis, University of Eindohoven, NL * Josee Desharnais, University of Laval, Canada * Alessandra Di Pierro, University of Verona, Italy * Marcus Groesser, Technical University Dresden, Germany * Mieke Massink, CNR-ISTI, Pisa, Italy * Paulo Mateus, Technical University of Lisbon, Portugal * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Oxford, UK * Jeremy Sproston, University of Torino, Italy * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, Saarland University, Germany The University of Glasgow, charity number SC004401 From christian.retore at labri.fr Thu Sep 23 17:12:21 2010 From: christian.retore at labri.fr (retore) Date: Thu, 23 Sep 2010 23:12:21 +0200 Subject: [TYPES/announce] "logic, categories, semantics" Bordeaux November 12-13 Message-ID: <0C1DB5B2-7A4E-4E0C-BC71-B6E020CFDE8D@labri.fr> We are glad to announce the workshop "logic, categories, semantics" to be held in Bordeaux on November 12-13 http://www.labri.fr/perso/retore/LCS/index.html Speakers: Michele Abrusci (Universit? di Roma tre) Nicholas Asher (CNRS, IRIT, Toulouse) Pierre Cartier (IHES, Orsay) Dion Coumans / Mai Gehrke (Radbout Universiteit Nijmegen) Jean-Yves Girard (CNRS, IML, Marseille) Fran?ois Lamarche (INRIA, LORIA, Nancy) Paul-Andr? Melli?s (CNRS, PPS, Paris) Michael Moortgat (Universiteit Utrecht) Carl Pollard (Ohio State University, Columbus) Anne Preller (LIRMM, Universit? de Montpellier) Thomas Streicher (Technische Universit?t Darmstadt) Steve Vickers (University of Birmingham) Topic of the workshop The relationship between logic and category theory goes back to the seventies, with the important connection between intuitionistic logic, sheaves and topoi (1) but it extended into other directions, in particular the proof as morphisms semantics (2), and we also include the study of proof normalisation (3). Ideally, the workshop will consider the three levels of foundations , according to the terminology of Jean-Yves Girard, as well as their mutual relationships. These structures provide models of computation but also models of meaning organisation des lexemes, phrases, sentences, discourses and dialogues: we do not exclude the first application, but we shall privilege the linguistic application which is quite new, although Joachim Lambek suggested to do so more than twenty years ago. -- Jean Gillibert, Christian Retor? http://www.labri.fr/perso/retore/LCS/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From Bob.Coecke at comlab.ox.ac.uk Fri Sep 24 11:49:50 2010 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Fri, 24 Sep 2010 16:49:50 +0100 (BST) Subject: [TYPES/announce] Postdoc in category theory/quantum foundations in Oxford/Singapore Message-ID: One of the two positions announced below is for research at the intersection of (see further particulars): a. Computer science logic including category theory In particular, the use of high-level structures for the describtion of physical processes, monoidal categories and their graphical languages, as well as categories as a foundation. b. Fundamentals of quantum physics including non-locality This may include the structure of quantum-classical interaction, the interaction of quantum and space-time structure, and structures for novel QIP-architectures such as MBQC. ---------------------- ADVERT: Two postdocs in Quantum Nanoscience Theory: Fundamental physics and high-level structures. The two postdoctoral researchers in the theory of quantum information and technologies will be appointed to work jointly in Singapore and in Oxford, UK. The researchers will be employed by the Centre for Quantum Technologies (CQT) in Singapore, but will spend up to 10 months each year working in the University of Oxford. The appointments are for 3 years, and form part of a larger initiative on quantum nanoscience. The annual salary is up to $86,000 Singapore dollars (approx. $63,800) plus housing benefits. Each individual will be supervised by two of the following researchers: Simon Benjamin, Bob Coecke, Dieter Jaksch, Vlatko Vedral. The posts are available immediately and will be advertised until they are filled. It is hoped that the appointees will be in post on or before the 4th Jan 2011. For more information including further particulars and selection criteria please email Irene Tan . Further particulars: http://www.quantumlah.org/openings/QuantumNanoscienceFurtherParticulars.pdf Selection criteria: http://www.quantumlah.org/openings/QuantumNanoscienceSelectionCriteria.pdf ---------------------- From tobias.wrigstad at it.uu.se Mon Sep 27 10:35:22 2010 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Mon, 27 Sep 2010 16:35:22 +0200 Subject: [TYPES/announce] STOP'11 Call for Papers Message-ID: Call for Papers Script to Program Evolution (STOP) at POPL 2011 Jan 29th, 2011, Austin, TX Recent years have seen increased use of scripting languages in large applications. Scripting languages optimize development time, especially early in the software life cycle, over safety and robustness. As the understanding of the system reaches a critical point and requirements stabilize, scripting languages become less appealing. Compromises made to optimize development time make it harder to reason about program correctness, harder to do semantic-preserving refactorings, and harder to optimize execution speed. Lack of type information makes code harder to navigate and to use correctly. In the worst cases, this situation leads to a costly and potentially error-prone rewrite of a program in a compiled language, losing the flexibility of scripting languages for future extension. Recently, pluggable type systems and annotation systems have been proposed. Such systems add compile-time checkable annotations without changing a program's run-time semantics which facilitates early error checking and program analysis. It is believed that untyped scripts can be retrofitted to work with such systems. Furthermore, integration of typed and untyped code, for example, through use of gradual typing, allows scripts to evolve into safer programs more suitable for program analysis and compile-time optimizations. With few exceptions, practical reports are yet to be found. The STOP workshop focuses on the evolution of scripts, largely untyped code, into safer programs, with more rigid structure and more constrained behavior through the use of gradual/hybrid/pluggable typing, optional contract checking, extensible languages, refactoring tools, and the like. The goal is to further the understanding and use of such systems in practice, and connect practice and theory. To this end, we encourage not only submissions presenting original research results, but also papers that attempt to establish links between different approaches and/or papers that include survey material, experience reports and tool demonstrations. Original research results should be clearly described, and their usefulness to practitioners outlined. Paper selection will be based on the quality of the submitted material, including surveys. Important Dates --------------- Submission: Nov 1st, 2010 Notification: Dec 15th, 2010 Final Version: Jan 15, 2011 Workshop: Jan 29, 2011 Programme Committee ------------------- Amal Ahmed, Indiana Robby Findler, Northwestern (chair) Fritz Henglein, DIKU Gavin Bierman, Microsoft Gilad Bracha, Cloud Programming Model Jeff Foster, Maryland Peter Thiemann, Freiburg Sam Tobin-Hochstadt, Northeastern Organizers ---------- Jan Vitek, Purdue Tobias Wrigstad, Uppsala Steering Committee ------------------ Matthias Felleisen, Northeastern Cormac Flanagan, UC Santa Cruz Nate Nystrom, UTA Jan Vitek, Purdue Philip Wadler, Edinburg Tobias Wrigstad, Uppsala Selection Process ----------------- Both full papers (up to 12 pages LNCS) and position papers (1-2 pages LNCS) are welcome. All submissions will be reviewed by the program committee. The accepted papers, after rework by the authors, will be published in the Workshop Proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Questions may be directed to Tobias Wrigstad (tobias.wrigstad@ it.uu.se) and Robby Findler (robby at eecs.northwestern.edu). From Klaus.Havelund at jpl.nasa.gov Mon Sep 27 19:11:29 2010 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (316D)) Date: Mon, 27 Sep 2010 16:11:29 -0700 Subject: [TYPES/announce] [fm-announcements] NFM 2011 : Second Call for Papers Message-ID: SECOND CALL FOR PAPERS NFM 2011 Third NASA Formal Methods Symposium Pasadena, California, USA April 18 - 20, 2011 http://lars-lab.jpl.nasa.gov/nfm2011 ** NEW: invited speakers and tutorials ** IMPORTANT DATES Submission deadline : December 19, 2010 Notification of acceptance/rejection : January 21, 2011 Final version due : February 18, 2011 Conference : April 18-20, 2011 THEME The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, government and industry, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. The focus of the symposium is on formal methods, and aims to foster collaboration between NASA researchers and engineers and the wider aerospace and academic formal methods communities. The symposium will be comprised of a mixture of invited talks by leading researchers and practitioners, presentation of accepted papers, and panels. TOPICS OF INTEREST * Theorem proving * Model checking * Real-time, hybrid, stochastic systems * SAT and SMT solvers * Symbolic execution * Abstraction * Compositional verification * Program refinement * Static analysis * Dynamic analysis * Automated testing * Model-based testing * Model-based development * Fault protection * Security and intrusion detection * Application experiences * Modeling and specification formalisms * Requirements specification and analysis INVITED SPEAKERS ** NEW ** Rustan Leino Microsoft Research, USA "From Retrospective Verification to Forward-Looking Development" Oege de Moor University of Oxford, UK "Do Coding Standards Improve Software Quality?" Andreas Zeller Saarland University, Germany "Specifications for Free" TUTORIALS ** NEW ** Bart Jacobs Katholieke Universiteit Leuven, Belgium "VeriFast: a Powerful, Sound, Predictable, Fast Verifier for C and Java" Michal Moskal Microsoft Research, USA "Verification of Functional Correctness of Concurrent C Programs with VCC" HISTORY NFM 2011 is the third edition of the NASA Formal Methods Symposium, organized by NASA on a yearly basis. The first in 2009 and was organized at NASA Ames Research Center, Moffett Field, California. The second in 2010 was organized at NASA head quarters, Washington D.C. The symposium originated from the earlier Langley Formal Methods Workshop series. PAPER SUBMISSION There are two categories of submissions: * Regular paper: up to 15 pages, describing fully developed work and complete results. Papers can present theory, software engineering aspects, or case studies. * Tool papers: up to 6 pages, describing an operational tool. The authors of accepted tool papers will give demonstrations of their tools in tool demo sessions. Tool papers should explain enhancements that have been done compared to previously published work. A tool paper does not need to present the theory behind the tool but can focus more on its features, and how it is used, with screen shots and examples. All papers should be in English and describe original work that has not been published or submitted elsewhere. Submissions will be fully reviewed and the symposium proceedings will appear as a volume in Lecture Notes of Computer Science. Papers must use the LNCS style, and be in pdf format. COSTS There will be no registration fee charged to participants. PROGRAMME CHAIRS Mihaela Bobaru, NASA/Jet Propulsion Laboratory Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Rajeev Joshi, NASA/Jet Propulsion Laboratory PROGRAMME COMMITTEE Rajeev Alur, University of Pennsylvania, USA Tom Ball, Microsoft Research, USA Howard Barringer, University of Manchester, UK Saddek Bensalem, Verimag Laboratory, France Nikolaj Bjoerner, Microsoft Research, USA Eric Bodden, Technical University Darmstadt, Germany Marsha Chechik, University of Toronto, Canada Rance Cleaveland, University of Maryland, USA Dennis Dams, Bell Labs/Alcatel-Lucent, Belgium Ewen Denney, NASA Ames Research Center, USA Matt Dwyer, University of Nebraska, USA Cormac Flanagan, UC Santa Cruz, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Patrice Godefroid, Microsoft Research, USA Alex Groce, Oregon State University, USA Radu Grosu, Stony Brook, USA John Hatcliff, Kansas State University, USA Mats Heimdahl, University of Minnesota, USA Mike Hinchey, Lero - the Irish SW. Eng. Research Centre, Ireland Sarfraz Khurshid, University of Texas at Austin, USA Orna Kupferman, Jerusalem Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Rupak Majumdar, Max Planck Institute, Germany Kenneth McMillan, Cadence Berkeley Labs, USA Cesar Munoz, NASA Langley, USA Madan Musuvathi, Microsoft Research, USA Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Shaz Qadeer, Microsoft Research, USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Nicolas Rouquette, NASA/Jet Propulsion Laboratory, USA Kristin Rozier, NASA Ames Research Center, USA John Rushby, SRI International, USA Wolfram Schulte, Microsoft Research, USA Koushik Sen, Berkeley University, USA Sanjit Seshia, Berkeley University, USA Natarajan Shankar, SRI International, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Ben Di Vito, NASA Langley, USA Mike Whalen, University of Minnesota, USA STEERING COMMITTEE Ewen Denney, NASA Ames Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin Y. Rozier, NASA Ames Research Center Ben Di Vito, NASA Langley -------------- next part -------------- An HTML attachment was scrubbed... URL: From cbj at it.uts.edu.au Tue Sep 28 05:50:00 2010 From: cbj at it.uts.edu.au (Barry Jay) Date: Tue, 28 Sep 2010 19:50:00 +1000 Subject: [TYPES/announce] A Combinatory Account of Internal Structure Message-ID: <4CA1BA48.9010603@it.uts.edu.au> A draft of the paper "A Combinatory Account of Internal Structure" is available at http://www-staff.it.uts.edu.au/~cbj/Publications/factorisation.pdf This work may be of interest to the many readers of this list that are interested in foundational issues. It has been accepted for publication by J Symbolic Logic. The paper exposes some of the limitations of SK-combinatory logic (and so, by implication of lambda-calculus) by developing new combinatory calculi which cannot be represented in SK-calculus. The work has been controversial since each person has their own notion of representation. For us, this is not merely an encoding of one calculus within another, but refers to the ability to represent a symbolic function by a combinator. The simplest of these new calculi has two operators, S and F which satisfy the rules SMNX --> MX(NX) FOMN --> M if O is S or F F(PQ)MN --> NPQ if PQ is a factorable form where the factorable forms are those combinators of the form S,SM,SMN,F,FM,FMN. These turn out to be the partially applied operators, which ensures confluence. SF-calculus is able to represent static pattern matching, in the sense of pattern calculus. All comments welcome. Barry Jay Thomas Given-Wilson From bcpierce at cis.upenn.edu Tue Sep 28 22:54:29 2010 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Tue, 28 Sep 2010 22:54:29 -0400 Subject: [TYPES/announce] CRASH/SAFE postdoc opportunities at Penn, Harvard, and Northeastern Message-ID: [A more detailed version of the announcement I posted a few weeks ago. --BCP] Applications are invited for postdoc positions in the areas of programming languages, operating systems, verification, and hardware design at the University of Pennsylvania, Harvard University, and Northeastern University. The hosting project, called SAFE (Semantically Aware Foundation Environment), is part of CRASH, a larger DARPA-funded effort to design new computer systems that are highly resistant to cyber-attack, can adapt after a successful attack in order to continue rendering useful services, learn from previous attacks how to guard against and cope with future attacks, and can repair themselves after attacks have succeeded. It offers a rare opportunity to rethink the hardware/OS/software stack from a completely clean slate, with no legacy constraints whatsoever. Specifically, the SAFE project aims to build a suite of modern operating system services that embodies and supports fundamental security principles?including separation of privilege, least privilege, and mutual suspicion?down to its very bones, without compromising performance. Achieving this goal demands a co-design methodology in which all critical system layers are designed together, with a ruthless insistence on simplicity, security, and verifiability at every level -- an integrated effort focusing on (1) processor architectures, (2) operating systems, (3) formal methods, and (4) programming languages and compilers. The ideal candidate will have a Ph.D. in Computer Science, a combination of strong theoretical and practical interests, and expertise in two or more of the following areas: programming languages, security, formal verification, operating systems, and hardware design. Applications from women and other under-represented groups are particularly welcome. Further details: - We expect to offer five positions in the first year -- three at Penn, one at Harvard, and one at Northeastern -- with varying duties, salary, and desired expertise. - Positions are for one year in the first instance, with possible renewal up to four years. - Review of applications is ongoing and will and continue until positions are filled. - Starting date is negotiable, but we'd ideally like to have people in place within a few months. Background reading: SAFE white paper: http://www.cis.upenn.edu/~bcpierce/papers/SAFEwhitepaper.pdf CRASH BAA: https://www.fbo.gov/utils/view?id=82f6068978da5339752c89d2f65d89ca To apply, please send a CV, research statement, and the names of three people who can be asked for letters of reference to Benjamin Pierce (bcpierce at cis.upenn.edu). Inquiries can be directed to any of the PIs: Andre Dehon (Penn) Greg Morrisett (Harvard) Benjamin Pierce (Penn) Olin Shivers (Northeastern) Jonathan Smith (Penn) From gethin at dcs.gla.ac.uk Thu Sep 30 07:01:32 2010 From: gethin at dcs.gla.ac.uk (Gethin Norman) Date: Thu, 30 Sep 2010 12:01:32 +0100 Subject: [TYPES/announce] Special Issue of Quantitative Aspects of Programming Languages and Systems Message-ID: <22EAC22E-5005-4F2D-AA3A-03829AE7C734@gla.ac.uk> ------------------------------------------------------------------------------------- Special Issue of THEORETICAL COMPUTER SCIENCE on Quantitative Aspects of Programming Languages and Systems http://qav.comlab.ox.ac.uk/qapl10/special_issue.html -------------------------------------------------------------------------------------- ******************************** SECOND CALL FOR PAPERS ******************************** We invite the submission of papers on Quantitative Aspects of Programming Languages and Systems for publication in a special issue of the Journal of Theoretical Computer Science (TCS). Papers are welcome which are revised versions of the works submitted to and presented at the QAPL 2010 Workshop, Paphos, Cyprus, March 27-28. We will also welcome submissions of papers not presented at QAPL 2010, provided they fall into the scope of the call and contain a clear and novel contribution to the field. ---------------------------------------------------------------- SCOPE ---------------------------------------------------------------- Quantitative aspects of computation are important and sometimes essential in characterising the behaviour and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, risk and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. This special issue will be devoted to research papers which discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, contributions should focus on * the design of probabilistic and real-time languages and the definition of semantical models for such languages; * the discussion of methodologies for the analysis of probabilistic an timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g. worst-case memory/stack/cache requirements); * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis); * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues. * the investigation of computational models and paradigms involving quantitative aspects, such as those arising in quantum computation, systems biology, bioinformatics, etc. ---------------------------------------------------------------- TOPICS ---------------------------------------------------------------- Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. ---------------------------------------------------------------- SUBMISSIONS ---------------------------------------------------------------- Papers should be 20-25 pages long, including appendices, and should be formatted according to Elsevier's elsart document style used for articles in the Journal of Theoretical Computer Science (see the Guide for Authors at http://ees.elsevier.com/tcs/). Details on the submission procedure will be made available from the webpage http://qav.comlab.ox.ac.uk/qapl10/special_issue.html. ---------------------------------------------------------------- IMPORTANT DATES ---------------------------------------------------------------- * Paper submission: 15 November 2010 * Notification: 15 February 2011 ---------------------------------------------------------------- EDITORS ---------------------------------------------------------------- Alessandra Di Pierro University of Verona, Italy alessandra.dipierro at univr.it Gethin Norman University of Glasgow, UK gethin.norman at gla.ac.uk ---------------------------------------------------------------- The University of Glasgow, charity number SC004401 From jeremy.siek at colorado.edu Thu Sep 30 23:58:56 2010 From: jeremy.siek at colorado.edu (Jeremy Siek) Date: Thu, 30 Sep 2010 21:58:56 -0600 Subject: [TYPES/announce] FOOL 2010 Call for Participation Message-ID: CALL FOR PARTICIPATION 2010 International Workshop on Foundations of Object-Oriented Languages (FOOL '10) Sponsored by ACM SIGPLAN Sunday, 17 October 2010 Reno, Nevada, USA Preceding SPLASH and OOPSLA'10 http://ecee.colorado.edu/~siek/FOOL2010/ The search for sound principles for object-oriented languages has led to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. The FOOL workshops bring together researchers to share new ideas and results in these areas. The next workshop, FOOL '10 will be held in Reno, Nevada, USA on Sunday, 17 October 2010, preceding SPLASH and OOPSLA. The program includes two invited speakers and six contributed talks. To register for the workshop, use the standard SPLASH registration form, available through: https://regmaster3.com/2010conf/SPLASH10/register.php FOOL is an informal workshop, so there will not be printed proceedings. All papers will be available online before the workshop, so you may print any papers you wish to have on hand. -------------------------------------------------------------------------- INVITED SPEAKERS: Daan Leijen Concurrent Revisions: a novel approach to concurrency with deterministic semantics Robby Findler Semantics Engineering: more than just Theorem Proving TECHNICAL PROGRAM: DeepFJig - Modular composition of nested classes Andrea Corradi, Marco Servetto, and Elena Zucca A Calculus of Layer Decomposition Tetsuo Kamina and Tetsuo Tamai Mojojojo --- More Ownership for Multiple Owners Paley Li, Nicholas Cameron and James Noble Interoperability in a Scripted World: Putting Inheritance & Prototypes Together Kathryn E. Gray Type Inference for Scripting languages with Implicit Extension Tian Zhao Adding Pattern Matching to Existing Object-Oriented Languages Sukyoung Ryu, Changhee Park and Guy L. Steele Jr. -------------------------------------------------------------------------- Program Chair Jeremy Siek (University of Colorado at Boulder) e-mail: jeremy.s... at colorado.edu Program Committee * Davide Ancona (Universita' di Genova, Italy) * Juan Chen (Microsoft Research, USA) * Derek Dreyer (MPI-SWS, Germany) * Atsushi Igarashi (Kyoto University, Japan) * Donna Malayeri (EPFL, Switzerland) * Nate Nystrom (University of Texas Arlington, USA) * Frank Piessens (Katholieke Universiteit Leuven, Belgium) * Chieri Saito (Kyoto University, Japan) * Sam Tobin-Hochstadt (Northeastern, USA) * Elena Zucca (Universita' di Genova, Italy) -------------------------------------------------------------------------- Steering Committee * Viviana Bono (Universita` di Torino) * Kathleen Fisher (AT&T Labs) * Atsushi Igarashi (Kyoto University) * Benjamin Pierce (University of Pennsylvania) * John Reppy (University of Chicago) * Christopher Stone (Harvey Mudd College) [Chair] * Philip Wadler (University of Edinburgh) -------------------------------------------------------------------------- -- ____________________________________ Jeremy Siek http://ecee.colorado.edu/~siek/ Assistant Professor Dept. of Electrical, Computer, and Energy Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: From heinz.koeppl at epfl.ch Fri Oct 1 03:12:48 2010 From: heinz.koeppl at epfl.ch (Koeppl Heinz) Date: Fri, 1 Oct 2010 07:12:48 +0000 Subject: [TYPES/announce] PhD position in Computational Systems Biology, ETH Zurich Message-ID: The group of Heinz Koeppl at the Swiss Federal Institute of Technology Zurich (ETHZ) has two vacant PhD positions. We are looking for candidates with a strong mathematical background - graduates from applied math, computer science, physics and engineering. Topics are new algorithms for model reduction and parameter estimation of biochemical reaction networks (Markov chain aggregation, probabilistic bisimulation, stochastic hybrid systems, moment closures, Bayesian estimation and model selection). People having additional wetlab experience are particularly encouraged to apply. This is a 100% position for 3.5 years. The theoretical work of the two theses will be complemented with collaboration with biochemists from the University of Lausanne and from ETH Zurich -- with the particular case studies of Notch/p53 signaling in keratinocytes and HOG/mating MAPK cascades crosstalk in budding yeast, respectively. Contact: Prof. Heinz Koeppl, Email koeppl at ethz.ch From katoen at cs.rwth-aachen.de Sun Oct 3 14:42:17 2010 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Sun, 03 Oct 2010 20:42:17 +0200 Subject: [TYPES/announce] ETAPS 2011 Call for Papers Message-ID: <4CA8CE89.6050909@cs.rwth-aachen.de> [We apologize for multiple copies.] ================================================================ CALL FOR PAPERS: ETAPS 2011 European Joint Conferences on Theory And Practice of Software March 26 - April 3, 2011 Saarbruecken, Germany http://www.etaps.org ================================================================ -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual confe- rences, accompanied by satellite workshops and other events. ETAPS 2011 is already the fourteenth event in the series. -- INVITED SPEAKERS -- * Ross Anderson (Cambridge, UK) * Andrew Appel (Princeton, USA) * Gerard J. Holzmann (NASA) * Martin Odersky (EPFL, Switzerland) * Marta Kwiatkowska (Oxford, UK) * Prakash Panangaden (McGill, Canada) * Andreas Podelski (Freiburg, Germany) -- MAIN CONFERENCES -- - CC: International Conference on Compiler Construction - ESOP: European Symposium on Programming - FASE: Fundamental Approaches to Software Engineering - FOSSACS: Foundations of Software Science and Computation Structures - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- IMPORTANT DATES -- * 1 October 2010: Submission deadline for abstracts (strict) * 8 October 2010: Submission deadline for full papers (strict) * 10 December 2010: Notification of acceptance * 3 January 2011: Camera-ready versions due -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Papers should be submitted electronically in PDF (preferably) or PS (using Type 1 fonts). The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of the Springer-Verlag Lecture Notes in Computer Science series. Final papers will be in the format specified by Springer-Verlag at the URL: http://www.springer.de/comp/lncs/authors.html . It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Research Papers Different ETAPS conferences will have different page limits. Specifically, FASE, FOSSACS and TACAS will have a page limit of 15 pages, whereas CC and ESOP will have a page limit of 20 pages. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices, and papers must be understandable without them. Tool Demonstration Papers Submissions should consist of two parts: * The first part, at most four pages, should describe the tool presented Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool (this part will be included in the proceedings). * * The second part, at most six pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) Please note that FOSSACS does not accept tool demonstration papers. -- SATELLITE EVENTS -- 18 satellite workshops will take place before or after ETAPS 2011. -- SAARBRUECKEN -- Saarbruecken is the capital of the Saarland, the smallest German federal state. Saarbr?cken has approximately 190,000 inhabitants and hence is of pleasant size. Picturesque attractions and places of historic interest are scattered around the city, and offer the perfect destination for a hike or a daytrip. The cultural palette attracts visitors from far and wide. Saarbruecken is located very close to the French border, and half way on the high-speed railway connecting Paris and Frankfurt. Both are in less than two hours distance. -- FURTHER INFORMATION AND ENQUIRIES -- For further information, do not hesitate to contact the following addresses. * GENERAL INFORMATION e-mail: etaps2011 at cs.uni-saarland.de Holger Hermanns ETAPS 2011 Organising Committee Chair * General Chair: Reinhard Wilhelm * Workshop Chair: Bernd Finkbeiner * Organising Committee: Bernd Finkbeiner, Holger Hermanns (Chair), Reinhard Wilhelm, Stefanie Haupert-Betz, Christa Sch?fer * Web site: Hern?n Bar? Graf From sweirich at cis.upenn.edu Mon Oct 4 09:26:31 2010 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Mon, 4 Oct 2010 09:26:31 -0400 Subject: [TYPES/announce] TLDI 2011: Final CALL FOR PAPERS Message-ID: <5E148299-E8BC-4BC0-8920-B4EB05522EC5@cis.upenn.edu> TLDI 2011 FINAL CALL FOR PAPERS The Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation Austin, Texas, USA Tuesday, January 25, 2011 (Co-located with POPL 2011) http://www.mpi-sws.org/~dreyer/tldi2011/ Submission Deadline: October 11, 2010 The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2011 is the sixth workshop in the series and will be co-located with POPL in Austin, Texas in January 2011. Submissions for TLDI 2011 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2011 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented or dynamic languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. Submission Guidelines: Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Monday, October 11, 2010. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template. Papers must be submitted electronically via the workshop website (http://www.mpi-sws.org/~dreyer/tldi2011/) in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Submissions should contain original research not published or submitted for publication elsewhere. Publication: As in previous years, accepted papers will be published by the ACM and appear in the ACM digital library. A printed proceedings will be available at the workshop. Important Dates: - Submission deadline: October 11, 2010 (Monday), 21:00 Samoa-Apia Time - Notification: November 8, 2010 (Monday) - Final versions due: November 22, 2010 (Monday) - Workshop: January 25, 2011 (Tuesday) General Chair: Stephanie Weirich University of Pennsylvania sweirich at cis dot upenn dot edu Program Chair: Derek Dreyer Max Planck Institute for Software Systems (MPI-SWS) dreyer at mpi-sws dot org Program Committee: Thorsten Altenkirch (University of Nottingham) Fritz Henglein (University of Copenhagen) Michael Hicks (University of Maryland, College Park) Limin Jia (Carnegie Mellon University) Mark Jones (Portland State University) Neel Krishnaswami (Microsoft Research, Cambridge) Paul-Andr? Melli?s (CNRS & Universit? Paris Diderot) Aleks Nanevski (IMDEA Software, Madrid) Benjamin Pierce (University of Pennsylvania) Tachio Terauchi (Tohoku University) Sam Tobin-Hochstadt (Northeastern University) Steering Committee: Amal Ahmed (Indiana University) Nick Benton (Microsoft Research, Cambridge) Derek Dreyer (MPI-SWS) Robert Harper (Carnegie Mellon University, chair) Andrew Kennedy (Microsoft Research, Cambridge) Francois Pottier (INRIA Rocquencourt) Zhong Shao (Yale University) Stephanie Weirich (University of Pennsylvania) From vladimir at ias.edu Tue Oct 5 13:12:47 2010 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Tue, 5 Oct 2010 13:12:47 -0400 Subject: [TYPES/announce] Type theory at IAS In-Reply-To: <22EAC22E-5005-4F2D-AA3A-03829AE7C734@gla.ac.uk> References: <22EAC22E-5005-4F2D-AA3A-03829AE7C734@gla.ac.uk> Message-ID: <740370FD-490F-4D3C-9FB8-74B9C96F24F2@ias.edu> Dear all, starting next academic year (2011/2012) I plan to have the School of Mathematics of the Institute for Advanced Study to host a small number of people working in type theory and related areas. I am especially but not exclusively interested in the development of type-theoretic foundations of mathematics, connections to homotopy theory, various generalizations of inductive types and classification of type theories by proof-theoretic strength. In the academic year 2012/2013 the institute will host a special programs on type-theoretic foundations of mathematics and quite a few positions in the related fields will be available. In the coming, 2011/2012 academic year no special activities related to type theory are planned and applications in the related areas will be considered as a part of the general application process. For the basic info see https://www.math.ias.edu/ and in particular https://www.math.ias.edu/administration/how-to-apply . A description of the 2012/2013 program will be on the web site in a few weeks. When applying, please state "type theory" as the general area of interests to make it easier for me to identify all the relevant applications. With any questions e-mail me at vladimir at ias.edu . Vladimir. From kai at iam.unibe.ch Thu Oct 7 06:23:46 2010 From: kai at iam.unibe.ch (=?ISO-8859-1?Q?Kai_Br=FCnnler?=) Date: Thu, 7 Oct 2010 12:23:46 +0200 Subject: [TYPES/announce] Tableaux 2011 First Call for Papers Message-ID: First Call for Papers, Call for Tutorials, and Call for Workshop Proposals TABLEAUX 2011 International Conference TABLEAUX 2011 Automated Reasoning with Analytic Tableaux and Related Methods Bern, Switzerland 4 July - 8 July 2011 http://www.tableaux11.unibe.ch/ IMPORTANT DATES Workshop & Tutorial submission: Monday, 10 Jan 2011 Workshop & Tutorial notification: Monday, 24 Jan 2011 Abstract and Title submission: Monday, 24 Jan 2011 Paper Submission: Monday, 31 Jan 2011 Notification: Monday, 28 Mar 2011 Final Versions: Monday, 25 Apr 2011 Workshops: Monday, 4 July 2011 Conference: Tuesday, 5 July - Friday, 8 July 2011 GENERAL INFORMATION This conference is the 20th in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods. In July 2011, the conference will be held in Bern, Switzerland. The conference proceedings will be published in the Springer LNAI series as in the previous editions of the conference. See http://www.tableaux11.unibe.ch/ for more information on TABLEAUX 2011, and http://i12www.ira.uka.de/TABLEAUX for information about the TABLEAUX conference series. TOPICS Tableau methods are a convenient formalism for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference brings together researchers interested in all aspects - theoretical foundations, implementation techniques, systems development and applications - of the mechanization of reasoning with tableaux and related methods. Topics of interest include (but are not restricted to): * analytic tableaux for various logics (theory and applications) * related techniques and concepts, e.g., model checking and BDDs * related methods (model elimination, sequent calculi, connection method, ...) * new calculi and methods for theorem proving in classical and non-classical logics (modal, description, intuitionistic, linear, temporal, many-valued...) * systems, tools, implementations and applications. As in previous years, TABLEAUX 2011 puts a special emphasis on applications. Papers describing applications of tableaux and related methods in areas such as hardware and software verification, semantic technologies, knowledge engineering, etc. are particularly invited. One or more tutorials will be part of the conference program. SUBMISSIONS The conference will include contributed papers, tutorials, system descriptions, position papers and invited lectures. Submissions are invited in four categories: A Research papers (reporting original theoretical and/or experimental research, up to 15 pages) B System descriptions (up to 5 pages) C Short papers reporting work in progress (up to 5 pages) D Tutorials in all areas of analytic tableaux and related methods from academic research to applications (proposals up to 5 pages) Submissions in categories A and B will be reviewed by peers, typically members of the program committee. They must be unpublished and not submitted for publication elsewhere. For category B submissions a working implementation must exist and be available to the referees. Accepted papers in these categories will be published in the conference proceedings. Submissions in category C will be reviewed by members of the program committee and a collection of the accepted papers in this category will be published as a Technical Report of the University of Bern. Tutorial submissions (Category D) may be at introductory, intermediate, or advanced levels. Novel topics and topics of broad interest are preferred. The submission should include the title, the author, the topic of the tutorial, its level, its relevance to conference topics, and a description of the interest and the scientific contents of the proposed tutorial. Tutorial proposals will be reviewed by members of the program committee. Note that the deadline for tutorial proposals is Monday, 10. Jan 2011. Authors of accepted papers are expected to present their work at the conference. CALL FOR WORKSHOP PROPOSALS TABLEAUX 2011 launches a Call for Workshop Proposal on specialised subjects in the range of the conference topics. We can accept up to three proposals. The proposals are reviewed by members of the PC committee. The purpose of a workshop is to offer an opportunity of presenting novel ideas, ongoing research, and to discuss the state of the art of an area in a less formal but more focused way than the conference itself. It is also a good opportunity for young researchers to present their own work and to obtain feedback. The format of a workshop is left to the the organizers, but it is expected to contain significant time for discussion. The intended schedule is for one-day workshops. To submit a workshop proposal, please send a description of one or two pages to the PC chairs by Monday, 10. Jan 2011. INVITED SPEAKERS We are pleased to announce that the following speakers have agreed to give invited talks at TABLEAUX 2011: * Maria Paola Bonacina, University of Verona, Italy * Ulrich Furbach, University of Koblenz-Landau, Germany * Kazushige Terui, Kyoto University, Japan PROGRAM COMMITTEE PC Chairs * Kai Br?nnler, University of Bern, Switzerland * George Metcalfe, University of Bern, Switzerland PC Members * Arnon Avron, Tel Aviv University, Israel * Peter Baumgartner, NICTA, Canberra, Australia * Bernhard Beckert, Karlsruhe Institute of Technology, Germany * Torben Bra?ner, Roskilde University, Denmark * Agata Ciabattoni, TU Wien, Austria * Marta Cialdea, University of Rome 3, Italy * Roy Dyckhoff, University of St Andrews, Scotland * Martin Giese, University of Oslo, Norway * Valentin Goranko, Technical University of Denmark * Rajeev Gor?, The Australian National University, Canberra, Australia * Reiner H?hnle, Chalmers University, G?teborg, Sweden * Ullrich Hustadt, University of Liverpool, UK * Martin Lange, University of Kassel, Germany * Dale Miller, INRIA, Saclay, France * Neil V. Murray, University at Albany - SUNY, USA * Nicola Olivetti, Paul Cezanne University, Marseille, France * Jens Otten, University of Potsdam, Germany * Dirk Pattinson, Imperial College London, UK * Andr? Platzer, Carnegie Mellon University, USA * Renate Schmidt, University of Manchester, UK * Viorica Sofronie-Stokkermans, MPI, Saarbr?cken, Germany * Ulrich Ultes-Nitsche, Fribourg University, Switzerland * Luca Vigan?, University of Verona, Italy * Arild Waaler, University of Oslo, Norway ORGANIZING COMMITTEE Conference Chairs: * Kai Br?nnler, University of Bern, Switzerland * George Metcalfe, University of Bern, Switzerland Local Organizers: * Samuel Bucheli * Lukas Gerber * Roman Kuznets * Richard McKinley * Nia Stephens From conor at strictlypositive.org Thu Oct 7 10:42:00 2010 From: conor at strictlypositive.org (Conor McBride) Date: Thu, 7 Oct 2010 15:42:00 +0100 Subject: [TYPES/announce] CFP MSCS Issue: Dependently Typed Programming Message-ID: <6B1BE83E-53CB-461A-8164-C11779004049@strictlypositive.org> (s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)- >(p:P s)* OPEN CALL FOR PAPERS for a Special Issue of MATHEMATICAL STRUCTURES in COMPUTER SCIENCE in association with the workshop DEPENDENTLY TYPED PROGRAMMING 2010 editors: Thorsten Altenkirch (Nottingham), Conor McBride (Strathclyde) 2011 timeline: submission Jan 31; notification May 31; final version June 30 (s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)- >(p:P s)* Thorsten Altenkirch and Conor McBride are delighted to invite contributions to a Special Issue of the journal Mathematical Structures in Computer Science (Cambridge University Press), in association with the Workshop on Dependently Typed Programming, which we organised on 9 and 10 July 2010 in Edinburgh, as part of FLoC, associated with LiCS. The workshop had a packed programme of exciting developments, reflecting the strength of work on this topic at this time. More recent workshops and conferences have exhibited a significant contribution from researchers in this area. We are grateful to Editor-in-Chief Giuseppe Longo and to Editor Eugenio Moggi for the opportunity to reflect these welcome developments in the pages of MSCS, and we encourage researchers to consider submitting a paper. submission deadline: January 31 2011 notification: May 31 2011 final versions due: June 30 2011 We invite full journal articles concerning Dependently Typed Programming or related topics, from authors at work in this area. Submissions are particularly welcome from but not limited to contributors to the workshop, and the same journal-standard peer review process will apply in any case. Please feel free to address any enquiries about scope and suitability to the guest editors, Thorsten Altenkirch (University of Nottingham) and Conor McBride (University of Strathclyde). Submissions should usually not exceed 35 pages. Authors should adhere to the guidelines issued by Cambridge University Press for MSCS contributors: http://assets.cambridge.org/MSC/MSC_ifc.pdf. These include directions to the relevant LaTeX resources. We very much look forward to hearing from you. Thorsten and Conor From txa at Cs.Nott.AC.UK Thu Oct 7 15:48:50 2010 From: txa at Cs.Nott.AC.UK (Thorsten Altenkirch) Date: Thu, 7 Oct 2010 20:48:50 +0100 Subject: [TYPES/announce] PhD place at the FP lab, Nottingham Message-ID: PhD place available A PhD position in the Functional Programming Laboratory (FP Lab) at the University of Nottingham starting January 2011 is available. The studentship is for 3 years, it covers the university fees for EU nationals and a contains a standard mainatainance grant. The starting date is not negotiable. Work at the FP lab (http://fp.cs.nott.ac.uk/) covers functional programming, its applications and theory including dependently typed programming, constructive type theory and applications of category theory. The FP lab currently comprises 4 academic staff, 2 research assistants, and 9 PhD students and provides a thriving research environment through regular meetings, seminars and visitors. Due to a cancellation there is one PhD studentship available at the Functional Programming Laboratory (http://fp.cs.nott.ac.uk/) on short notice, that is the candidate would be required to start by January 2011. The studentship covers all fees and a standard maintainance grant for 3 years. The project is on foundations of Intuitionistic Type Theory, in particular addressig the question wether equality of types can be isomorphism or a related notion. Such a "Higher Dimensional Type Thoery" would make it easy to reason about matehmatical concepts upto isomorphism. This is inspired by a proposal by Vladimir Voedowsky [1] and which is also related to recent results by Garner & van den Berg [2] and Lumsdaine [3] on the weak omega groupoid model of Type Theory. Our goal is to develop a syntactic theory, which is computationally well behaved, which which supports higher dimensional Identity Types (i.e. uniqueness of identity proofs doesn't hold) and which supports extensional reasoning about functions. We may be able to accomodate strong candidates with different project ideas in related areas (Type Theory, Dependently Typed Programming, Categorical Logic). If in doubt please contact me. Please let me know before 5 November 2010, wether you are interested, and tell me about yourself and your background. If possible include a CV. Please forward this information to students who may be interested in it. Don't hesitate to contact me, if you are interested. Cheers, Thorsten Altenkirch Reader in Computer Science University of Nottingham [1] @article{voevodsky-equivalence, title={{The equivalence axiom and univalent models of type theory}}, author={Voevodsky, V.}, journal={Talk at CMU} } [2] @conference{van2006types, title={{Types are weak $\omega$-groupoids}}, author={van den Berg, B. and Garner, R.}, booktitle={Workshop on ?Identity Types?Topological and Categorical Structure?, Uppsala University}, year={2006}, organization={Citeseer} } [3] @article{lumsdaine2009weak, title={{Weak $\omega$-categories from intensional type theory}}, author={Lumsdaine, P.}, journal={Typed Lambda Calculi and Applications}, pages={172--187}, year={2009}, publisher={Springer} } From carlos.martin at urv.cat Sun Oct 10 08:53:31 2010 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Sun, 10 Oct 2010 14:53:31 +0200 Subject: [TYPES/announce] SSFLA 2011 Message-ID: 2011 INTERNATIONAL SPRING SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS (SSFLA 2011) (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain, April 18-22, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/ssfla2011/ ****************************************** ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. All courses will be made compatible in terms of schedule. COURSES AND PROFESSORS: Franz Baader (Dresden), Automata and Logic [advanced, 4 hours] Thomas B?ck (Leiden), Natural Computing [introductory, 10 hours] Markus Holzer (Giessen), Computational Complexity [introductory, 14 hours] Claude Kirchner (Bordeaux), Rewriting and Deduction Modulo [introductory, 6 hours] Thierry Lecroq (Rouen), Text Searching and Indexing [introductory, 10 hours] Rupak Majumdar (Kaiserslautern), Software Model Checking [introductory, 10 hours] Risto Miikkulainen (Austin), Natural Language Processing with Subsymbolic Neural Networks [introductory, 6 hours] Bernhard Steffen (Dortmund), Automata Learning from Theory to Application [introductory/advanced, 18 hours] Wolfgang Thomas (Aachen), omega-Automata and Infinite Games [introductory/advanced, 6 hours] Sheng Yu (London ON), Finite Automata and Regular Languages [introductory/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/ssfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until November 30, 2010), - 15 euros (for payments after November 30, 2010). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSFLA 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. To check the eligibility for early registration, what counts is the date when the payment is received (not the date when the registration form was filled in). People registering on site at the beginning of the School must pay in cash. ACCOMMODATION: Information about accommodation will be provided through the website of the School in January 2011. CERTIFICATES: Students will be delivered a diploma stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: October 8, 2010 Starting of the registration: October 11, 2010 Early registration deadline: November 30, 2010 Starting of the School: April 18, 2011 End of the School: April 22, 2011 QUESTIONS AND FURTHER INFORMATION: Carlos Martin-Vide: carlos.martin at urv.cat WEBSITE: http://grammars.grlmc.com/ssfla2011/ POSTAL ADDRESS: SSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From marzia.buscemi at imtlucca.it Mon Oct 11 05:18:09 2010 From: marzia.buscemi at imtlucca.it (Marzia Buscemi) Date: Mon, 11 Oct 2010 11:18:09 +0200 Subject: [TYPES/announce] 17 openings at IMT Lucca (Italy) Message-ID: <6ff7ce7ca956be01c62d9b103ccae37a@imtlucca.it> [Applications from researchers and students interested in topics related to logics, type-theory, and semantics are encouraged] ======================= (Apologies for multiple posting) The institute for advanced studies IMT Lucca (Italy) announces new openings in computer science and engineering: 12 PhD positions, deadline December 17 5 assistant professor positions, deadline November 15 IMT (http://www.imtlucca.it/) is a research institute located in Lucca (Italy). It aims at pushing the frontiers of knowledge and at contributing to the formation of international professional elites for business and institutions. Ph.D. programs are taught exclusively in English. The PhD Program in Computer Science and Engineering (coordinated by Ugo Montanari) aims at preparing researchers and professionals with broad training in the foundations of informatics as well as in applications to a variety of cutting-edge systems and disciplines. Within IMT there is a research area on Computer Science and Applications that currently includes senior visiting professors (Rocco De Nicola, Luciano Lenzini, Ugo Montanari) and a number of young assistant professors. Many scientists from Italy and abroad visit for advanced seminars and research collaborations. The research area is closely connected with the doctoral program. Below additional information is provided, full details can be obtained from http://www.imtlucca.it/ We hope that you may consider applying for and/or signaling these opportunities to colleagues and collaborators. Also, if you are interested in short visit please inform on of us. ======= DETAILS ON THE ADVERTISED POSITIONS ======= 5 Assistant Professor Positions Research topics: * Global Computing * Networking Systems Engineering * Computer Science Applications to Cultural Heritage Sites * Complex Data and Image Analysis * Industrial Energy Efficiency The remuneration package is competitive at an international level and includes generous research funds. The duration of the contract is of 3 years, renewable for additional 3 years. Specific terms of appointment are negotiated individually. Deadline for application is Nov 15, 2010. Short visits in Lucca are possible, and welcomed. http://www.imtlucca.it/faculty/positions/junior_faculty_recruitment_program.php 12 PhD Positions in Computer Science and Engineering Research topics: architectures and languages for global and grid computing, web systems and services, in particular for business applications, embedded systems, web data mining, wired and wireless networks, mobile systems. 6 scholarships (about ? 13.638 EUR gross yearly) plus accommodation and full board. 6 positions to be funded with internal projects or third-party scholarships all those come with a research budget of 3.000 EUR and free meals (lunch and dinner). Program Board: Marco Ajmone Marsan, Paolo Ciancarini, Rocco De Nicola, Carlo Ghezzi, Luciano Lenzini, Ugo Montanari (coordinator), Antonio Prete. Deadline for application is December 17, 2010. http://www.imtlucca.it/phd_programs/call_for_applications/index.php -- Marzia Buscemi, PhD IMT Lucca Istitute for Advanced Studies Piazza San Ponziano 6, I-55100 Lucca Ph.: +39 0583 4326723 Fax: +39 0583 4326565 E-mail: m.buscemi at imtlucca.it From carlos.martin at urv.cat Tue Oct 12 10:20:57 2010 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Tue, 12 Oct 2010 16:20:57 +0200 Subject: [TYPES/announce] LATA 2011: first call for papers Message-ID: ********************************************************************* 1st Call for Papers 5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011) Tarragona, Spain, May 30 ? June 3, 2011 http://grammars.grlmc.com/LATA2011/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - neural networks - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - term rewriting - transducers - trees, tree languages and tree machines - weighted machines STRUCTURE: LATA 2011 will consist of: - 3 invited talks - 2 invited tutorials - refereed contributions - open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants) INVITED SPEAKERS: To be announced PROGRAMME COMMITTEE: Andrew Adamatzky (Bristol) Cyril Allauzen (Mountain View) Amihood Amir (Ramat-Gan) Franz Baader (Dresden) Marie-Pierre B?al (Marne-la-Vall?e) Philip Bille (Lyngby) Mikl?s B?na (Gainesville) Symeon Bozapalidis (Thessaloniki) Vasco Brattka (Cape Town) Maxime Crochemore (London) James Currie (Winnipeg) J?rgen Dassow (Magdeburg) Cunsheng Ding (Hong Kong) Rodney Downey (Wellington) Manfred Droste (Leipzig) Enrico Formenti (Nice) Amy Glen (Perth) Serge Haddad (Cachan) Shunsuke Inenaga (Fukuoka, co-chair) Jesper Jansson (Tokyo) Jarkko Kari (Turku) Marek Karpinski (Bonn) Maciej Koutny (Newcastle) Gregory Kucherov (Lille) Markus Lohrey (Leipzig) Benedikt L?we (Amsterdam) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n-Vide (Brussels, co-chair) Giancarlo Mauri (Milano) Alexander Meduna (Brno) Kenichi Morita (Hiroshima) Sven Naumann (Trier) Gonzalo Navarro (Santiago, CL) Mark-Jan Nederhof (St Andrews) Joachim Niehren (Lille) Joakim Nivre (Uppsala) Kemal Oflazer (Doha) Alexander Okhotin (Turku) Witold Pedrycz (Edmonton) Dominique Perrin (Marne-la-Vall?e) Giovanni Pighizzini (Milano) Alberto Policriti (Udine) Lech Polkowski (Warsaw) Helmut Prodinger (Stellenbosch) Mathieu Raffinot (Paris) Philippe Schnoebelen (Cachan) Ayumi Shinohara (Sendai) Jamie Simpson (Perth) Magnus Steinby (Turku) James Storer (Boston) Jens Stoye (Bielefeld) Andrzej Tarlecki (Warsaw) Richard Thomas (Leicester) Gy?rgy Vaszil (Budapest) Heiko Vogler (Dresden) Pascal Weil (Bordeaux) Damien Woods (Pasadena) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Shunsuke Inenaga (Fukuoka, co-chair) Carlos Mart?n-Vide (Brussels, co-chair) Bianca Truthe (Magdeburg) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2011 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing refereed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On-site registration fees: 580 Euro On-site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide ? LATA 2011). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference?s account. On-site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: January 3, 2011 Notification of paper acceptance or rejection: February 14, 2011 Early registration: February 28, 2011 Final version of the paper for the LNCS proceedings: February 28, 2011 Late registration: May 16, 2011 Starting of the conference: May 30, 2011 Submission to the post-conference special issue: August 30, 2011 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From Neil.Ghani at cis.strath.ac.uk Wed Oct 13 14:01:07 2010 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Wed, 13 Oct 2010 19:01:07 +0100 Subject: [TYPES/announce] Third Scottish Category Theory Seminar Message-ID: <53B04070-B3FC-4508-9883-625398CF1240@cis.strath.ac.uk> ******************************************************************** *** Scottish Category Theory Seminar *** Third Meeting *** Thursday 2nd December 2010, 2-5.30pm *** University of Strathclyde, Scotland *** http://personal.cis.strath.ac.uk/~ng/SCT/sct021210.html ******************************************************************** We are pleased to announce the Third Scottish Category Theory Seminar. The meeting is open, and all are welcome to attend. We have three invited speakers as follows: * Ieke Moerdijk (Universiteit Utrecht) * Bas Spitters (University of Nijmegen * Marcelo Fiore (University of Cambridge This meeting will receive financial support from the Edinburgh Mathematical Society. More details can be found at http://personal.cis.strath.ac.uk/~ng/SCT/sct021210.html If you would like more information about the meeting and wish to attend, please email scotcats at cis.strath.ac.uk Scottish Category Theory Seminar organisers: Neil Ghani Tom Leinster Alex Simpson -------------- next part -------------- An HTML attachment was scrubbed... URL: From svb at doc.ic.ac.uk Thu Oct 14 07:17:39 2010 From: svb at doc.ic.ac.uk (Steffen van Bakel) Date: Thu, 14 Oct 2010 12:17:39 +0100 Subject: [TYPES/announce] CfP: Special Issue APAL on "Classical Logic and Computation" Message-ID: ANNALS OF PURE AND APPLIED LOGIC THIRD SPECIAL ISSUE ON CLASSICAL LOGIC AND COMPUTATION ************************************************************************ CALL FOR PAPERS =============== Contributions on the topic of Classical Logic and Computation are invited for a special issue of Annals of Pure and Applied Logic. On August 22, 2010, the third workshop on "Classical Logic and Computation" took place in Brno - Czech Republic, as a satellite meeting of MFCS/CSL 2010. The workshop covered a broad range of work aiming to explore computational aspects of classical logic and mathematics. The special issue is first of all set up for extended versions of papers presented at the workshop, but the call is open to all researchers. TOPICS Topics of interest for contributions to the journal issue include, but are not limited to: - logic and type theory, - programming language design, - verification, - witness extraction from classical proofs, - game semantic of classical logic, SUBMISSIONS Submissions must be original work which has not been previously published in a journal and is not being considered for publication elsewhere. If related material has appeared in a refereed conference proceedings, the manuscript submitted should be substantially more complete or otherwise different. The title page must include: full title, authors' full names and affiliations, and the address to which correspondence and proofs should be sent. Where possible, e-mail address and telephone number should be included. This should be followed by an abstract of approximately 300 words and five keywords for indexing. IMPORTANT All source files of the final versions of the accepted papers must respect the format of APAL. In order to make a submission, please follow the instructions at http://www.elsevier.com/wps/find/journaldescription.cws_home/505603/authorinstructions Please upload a .pdf file to the following easychair link http://www.easychair.org/conferences/?conf=apalclac10 Deadline for the submission of a title page indicating the intent to submit: January 15, 2011 Deadline for paper submission: February 15, 2011 Guest editors: Steffen van Bakel, Imperial College London, UK Stefano Berardi, Universita` di Torino, Italy Ulrich Berger, Swansea University, UK Contact: s.vanbakel at imperial.ac.uk From murdoch.gabbay at gmail.com Thu Oct 14 09:02:57 2010 From: murdoch.gabbay at gmail.com (murdoch gabbay) Date: Thu, 14 Oct 2010 14:02:57 +0100 Subject: [TYPES/announce] Foundations of nominal techniques Message-ID: I'd like to announce the availability of a survey and research article "Foundations of nominal techniques: logic and semantics of variables in abstract syntax" providing an overview of the applications of nominal sets semantics to syntax-with-binding. This is due to appear in the Bulletin of Symbolic Logic. However, I am told that it may be some months before the article appears on paper. Until then it is available online here: http://gabbay.org.uk/papers.html#fountl Murdoch Gabbay From htv at fct.unl.pt Tue Oct 19 10:25:18 2010 From: htv at fct.unl.pt (Hugo Torres Vieira) Date: Tue, 19 Oct 2010 15:25:18 +0100 Subject: [TYPES/announce] Article on (Conversation) Types for Multiparty Distributed Services Message-ID: Dear all, We would like to announce the availability of our Theoretical Computer Science paper on types for dynamical multiparty interactions in service- oriented computing, selected for the ESOP 2009 special issue: Conversation Types Lu?s Caires and Hugo Torres Vieira Abstract: We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able to uniformly describe both the internal and the interface behavior of systems, referred respectively as choreographies and contracts in web- services terminology. The notion of conversation builds on the fundamental concept of session, but generalizes it along directions up to now unexplored; in particular, conversation types discipline interactions in conversations while accounting for dynamical join and leave of an unanticipated number of participants. We prove that well-typed systems never violate the prescribed conversation constraints. We also present techniques to ensure progress of systems involving several interleaved conversations, a previously open problem. Although our theory of conversation types is developed for the Conversation Calculus, we show that it is applicable as well to more fundamental models, namely the pi- Calculus extended with labeled communication. Preprint: http://www-ctp.di.fct.unl.pt/~htv/pub/conversations.pdf DOI: http://dx.doi.org/10.1016/j.tcs.2010.09.010 Best regards, Hugo Torres Vieira and Lu?s Caires -------------- next part -------------- An HTML attachment was scrubbed... URL: From mjb at ecs.soton.ac.uk Wed Oct 20 12:23:11 2010 From: mjb at ecs.soton.ac.uk (Michael J Butler) Date: Wed, 20 Oct 2010 16:23:11 +0000 Subject: [TYPES/announce] Lecturer in Automated Verification, University of Southampton References: Message-ID: Lecturer in Automated Verification University of Southampton - School of Electronics and Computer Science http://www.jobs.soton.ac.uk/soton/jobboard/JobDetails.aspx?__ID=*638C9CD43034EAA6 ?34,607 - ?43,840 per annum Applications are invited for a Lecturer to join the School of Electronics and Computer Science in the Faculty of Physical and Applied Sciences (within the Dependable Systems and Software Engineering (DSSE) Research Group). The School is the largest of its kind in the UK and in the last Research Assessment Exercise (in 2008) Computer Science was ranked joint second in the UK for the quality of its research, with 85 per cent of its research work receiving either the top 4* rating (defined as 'world leading') or the 3* rating ('internationally excellent'). DSSE particularly seeks applicants with expertise in the application or development of automated formal verification technology such as automated theorem proving or model checking. Relevant applications include the broad areas of model verification, program verification and hardware verification. The new appointment will have the opportunity to collaborate with other researchers in DSSE and the School, helping us to address the many challenges in verification such as the need for increased scalability, the need to understand how the technology can be incorporated into existing design processes and the need to understand how it can be applied to modern computing paradigms such as multi-core architectures and pervasive systems. Applicants should have a PhD in a relevant area, a good publication record, and the enthusiasm and drive to carry out research and teaching, in an exciting, highly professional, multidisciplinary environment. Information about the School can be found at http://www.ecs.soton.ac.uk/ and on the DSSE website at http://www.dsse.ecs.soton.ac.uk/. Informal enquiries may be made to Professor Michael Butler (http://users.ecs.soton.ac.uk/mjb/). The closing date for applications is 19 November 2010 at 12.00 noon. From shao at cs.yale.edu Thu Oct 21 09:46:00 2010 From: shao at cs.yale.edu (Zhong Shao) Date: Thu, 21 Oct 2010 09:46:00 -0400 Subject: [TYPES/announce] PostDoc and PhD Positions at Yale University Message-ID: <201010211346.o9LDk0vQ009039@lux.cs.yale.edu> The Department of Computer Science at Yale University is seeking applicants for PostDoc and PhD positions in the broad area of certified software. The successful applicants will be expected to participate in a rigorous research program on topics such as programming languages, formal semantics, certified operating systems, program verification, proof assistants and automation, concurrency and coordination, language-based security, and certifying compilers. The programming languages and operating systems group, led jointly by Professors Zhong Shao and Bryan Ford at Yale, is embarking on a multi-year effort to develop a new certified OS kernel that generalizes and unifies traditional OS abstractions in microkernels and hypervisors. The new effort advocates a modular certification framework for OS kernel components, which mirrors and enhances the modularity of the kernel itself. Using this framework, it aims to create not just a "one-off" lump of verified kernel code, but a statically and dynamically extensible kernel that can be incrementally built and extended with individual certified modules, each of which will provably preserve the kernel's overall safety and security properties. Important research questions include but are not limited to: what OS kernel structures can offer the best support for extensibility, security, and resilience? what program logics and semantic models can best capture these abstractions? what are the right programming languages and environments for developing such certified kernel? and how to build new automation facilities to make certified software really scale? Successful applicants should have a combination of creativity, self-motivation, and strong interests on applying programming language theory or formal methods to solve practical problems. Applicants for PostDoc positions must have a Ph.D. in Computer Science or a closely related field. The term of a PostDoc position is one year with an option to renew for up to four years. Starting date is negotiable (a preference will be given to those who can start by Spring 2011). Interested applicants for PostDoc positions should email a CV, research statement, and the names of three references with their email addresses and phone numbers to Zhong Shao (Email: zhong.shao at yale.edu). PhD positions (with full guaranteed financial support) are also available. Applicants interested in pursuing PhD studies can email either PI but should still submit their applications directly to the Yale Graduate School of Arts and Sciences (the deadline for Fall 2011 admission is January 2nd, 2011). More information regarding this research effort can be found in a white paper available at or at the two PIs' research web sites and . Inquiries can be directed to any PI. Professors Zhong Shao and Bryan Ford Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520-8285, USA Phone: +1 (203) 432 6828 and +1 (203) 432 1055 Email: zhong.shao at yale.edu and bryan.ford at yale.edu From ueda at ueda.info.waseda.ac.jp Thu Oct 21 11:34:42 2010 From: ueda at ueda.info.waseda.ac.jp (Kazunori UEDA) Date: Fri, 22 Oct 2010 00:34:42 +0900 (JST) Subject: [TYPES/announce] APLAS 2010 Call For Participation Message-ID: <20101022.003442.112606191.ueda@ueda.info.waseda.ac.jp> APLAS 2010 Call For Participation Eighth Asian Symposium on Programming Languages and Systems Shanghai, China, November 28-December 1, 2010 http://basics.sjtu.edu.cn/conference/aplas2010/ APLAS is a premiere forum for the discussion of programming languages, based in Asia and serving the worldwide research community. The past APLAS symposia were successfully held in Seoul ('09), Bangalore, Singapore, Sydney, Tsukuba, Taipei, and Beijing, after three well- attended workshops held in Shanghai, Daejeon, and Singapore ('00). APLAS 2010 will be held in Shanghai with the sponsorship of the Asian Association for Foundation of Software (AAFS) and Shanghai Jiao Tong University. The proceedings will be published in Springer's LNCS 6461. The symposium programme will offer two tutorials, four invited talks and 25 research papers or system and tool presentations, and 14 posters. The full programme is available at http://basics.sjtu.edu.cn/conference/aplas2010/program.htm . TUTORIALS - Yuxin Deng (Shanghai Jiao Tong Univ.) - Aquinas Hobor (National Univ. of Singapore) and Robert Dockins (Princeton Univ.) INVITED SPEAKERS - Gerwin Klein (National ICT Australia) - Dale Miller (INRIA Saclay - Ile-de-France) - Mingsheng Ying (Tsinghua Univ. and Univ. of Technology Sydney) - ZHOU Chaochen (Chinese Academy of Sciences) VENUE APLAS 2010 will be held at Hengshan Hotel located in the heart of Shanghai's Central Business District: Hengshan Hotel 534 Hengshan Road, Shanghai, 200030, China. REGISTRATION Registration fees and deadlines are detailed below. The fees cover the proceedings, welcome reception on Nov. 28, banquet on Nov. 30, dinner on Nov. 29, and lunch + 2 coffee breaks on each day. Deadline Full Fees Student Fees Early October 30 RMB 4000(USD 620) RMB 3000(USD 465) Late November 19 RMB 5000(USD 775) RMB 4000(USD 620) On-site after November 19 RMB 5000(USD 775) RMB 4000(USD 620) The details of payment methods could be found at: http://basics.sjtu.edu.cn/conference/aplas2010/registration.htm Please download the registration form at http://basics.sjtu.edu.cn/conference/aplas2010/files/registration.pdf and send the completed form to basics at sjtu.edu.cn. ACCOMMODATION We provide two choices for participants at special rates: - Hengshan Hotel (RMB 590 per night), a 5-star luxurious hotel where the the symposium will be held. - Jiangong Jinjiang Hotel (RMB 400 per night), a 4-star hotel about 150 meters from Hengshan Hotel. Please visit http://basics.sjtu.edu.cn/conference/aplas2010/local_info.htm for the details of reservation procedure. (Note: Those who also require a room on 26Nov and/or 2Dec are advised to book early. These two hotels do NOT provide reservations at the APLAS 2010 rate online.) VISA International participants (except Japan, Singapore and Brunei) will need visa to enter China. Please visit the APLAS webpage for details. GENERAL CHAIR Yuxi Fu, Shanghai Jiao Tong University PROGRAM CHAIR Kazunori Ueda, Waseda University, Tokyo LOCAL ARRANGEMENTS CHAIR Xiaoju Dong, Shanghai Jiao Tong University POSTER SESSION CHAIR Guoqiang Li, Shanghai Jiao Tong University CONTACT E-mail: basics at sjtu.edu.cn Fax: (86-21) 34204728 From icfp.publicity at googlemail.com Fri Oct 22 10:18:15 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Fri, 22 Oct 2010 16:18:15 +0200 Subject: [TYPES/announce] ICFP 2011: Call for Workshop Proposals Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2011 16th ACM SIGPLAN International Conference on Functional Programming September 19 - 21, 2011 Tokyo, Japan http://www.icfpconference.org/icfp2011 The 16th ACM SIGPLAN International Conference on Functional Programming will be held in Tokyo, Japan on September 19-21, 2011. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2011 and sponsored by SIGPLAN. These events should be more informal and focused than ICFP itself, include sessions that enable interaction among the attendees, and be fairly low-cost. The preference is for one-day events, but other schedules can also be considered. NEW THIS YEAR: The workshops are scheduled to occur on September 18 (the day before ICFP) and September 22-24 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 19, 2010 Notification of acceptance: December 17, 2010 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2011 workshop co-chairs (Gabriele Keller and Derek Dreyer), via email to icfp11-workshops at mpi-sws.org by November 19, 2010. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 17, 2010, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2011/icfp11-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2010 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Gabriele Keller (University of New South Wales) Workshop Co-Chair: Derek Dreyer (MPI-SWS) General Co-Chair: Manuel Chakravarty (University of New South Wales) General Co-Chair: Zhenjiang Hu (National Institute of Informatics) Program Chair: Olivier Danvy (Aarhus University) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Gabriele Keller and Derek Dreyer), via email to icfp11-workshops at mpi-sws.org. From vladimir at ias.edu Mon Oct 25 19:03:06 2010 From: vladimir at ias.edu (Vladimir Voevodsky) Date: Mon, 25 Oct 2010 19:03:06 -0400 Subject: [TYPES/announce] 2012-2013 special program at IAS Message-ID: <03F422BF-5086-4730-AEC5-103E55786D85@ias.edu> The announcement and the preliminary description of the 2012-2013 special program are on the IAS web site now. Go to http://www.math.ias.edu/ and click at the link under "Univalent Foundations of Mathematics". Vladimir. From mwh at cs.umd.edu Wed Oct 27 09:10:42 2010 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 27 Oct 2010 09:10:42 -0400 Subject: [TYPES/announce] 2nd call for papers: HotSWUp III Message-ID: <62692C72-F839-492A-9DF6-030EA77B3C0B@cs.umd.edu> [Types play a central role in many topics involved in software upgrades; e.g., types can be used to describe evolving database schemas or system data representations, and dependent types can characterize relationships between old an new versions. If you have ideas, we'd love to hear about them! ---Mike] CALL FOR PAPERS HotSWUp 2011: Third ACM Workshop on Hot Topics in Software Upgrades (co-located with ICDE 2011) Hannover, Germany April 16, 2011 http://www.hotswup.org Submission deadline: 15 November 2010 SUBMISSION SITE NOW OPEN OBJECTIVES Actively-used software systems are upgraded regularly to incorporate bug fixes and security patches or to keep up with the evolving requirements. Whether upgrades are applied offline or online, they significantly impact the system's performance and reliability. Recently-introduced commercial products aim to address various aspects of this problem; however, recent studies and a large body of anecdotal evidence suggest that upgrades remain failure-prone, tedious, and expensive. The goal of the HotSWUp Workshop is to identify cutting-edge research for supporting software system upgrades that are flexible, efficient, robust, and easy to specify and apply. Many diverse research areas are concerned with building large, evolving, highly-available systems. As such, HotSWUp seeks contributions from all these areas, ranging from databases to distributed systems, and from programming languages to software engineering, and separately reflected in conferences such as SIGMOD, ICDE, SOSP, OSDI, OOPSLA, PLDI, ICSE, and FSE. By seeking contributions from both academic researchers and industry practitioners, HotSWUp aims to combine novel ideas with experience from upgrading real systems. The present workshop aims to build on the successes of HotSWUp'08 and HotSWUp'09 where the paper presentations and lively discussions attracted a diverse audience of researchers. The topics of interest include, but are not limited to: - Upgrading Information Systems under Schema Evolution. - Programming language / operating system / database support for software upgrades. - Improving the reliability of upgrades (e.g., support for upgrade validation and for rollback after failures). - Support for system or data restructuring (e.g., evolving APIs, changes to database schemas). - Identifying dependencies between components and guaranteeing safe interactions among mixed versions. - Coordinating and disseminating upgrades in large-scale distributed systems. - Software upgrades and the Cloud Computing Infrastructure. - Tools for preparing, testing, and applying software upgrades. - Human factors in software upgrades (e.g., usability of upgrading tools, common operator mistakes). SUBMISSION GUIDELINES We are interested in papers that address practical as well as theoretical aspects of software upgrades from large scale to embedded applications. Particularly welcome this year are submissions concerning software upgrade issues in database systems. Preferably, submissions should fall into one of the following categories: - Suggest how a successful approach can be applied in a different context (e.g., static dependency analysis applied to distributed-system upgrades). - Refute an old assumption about software upgrades (e.g., by presenting negative results). - Describe a new problem or propose a novel solution to an old problem. - Present empirical evidence related to the practical implementation of software upgrades. Papers must not exceed 5 pages, in IEEE camera-ready format (templates at http://www.ieee.org/web/publications/pubservices/confpub/AuthorTools/conferenceTemplates.html). Papers must be submitted electronically at http://www.hotswup.org. IMPORTANT DATES Submission deadline 15 November 2010 Acceptance notification 15 December 2010 Camera-ready deadline 3 January 2011 Workshop date 16 April 2011 PROGRAM COMMITTEE Rida Bazzi, Arizona State University, USA (co-organizer) Carlo Aldo Curino, Massachusetts Institute of Technology, USA Fabien Dagnat, Telecom Bretagne, France Johann Eder, University of Vienna, Austria Michael Hicks, University of Maryland, College park, USA (co-organizer) Manuel Oriol, University of York, UK George Papastefanatos, National Technical University of Athens, Greece Paolo Papotti, Universit? Roma Tre, Italy Jason Nieh, Columbia University, USA Xin Qi, Facebook, USA Mark Segal, Laboratory for Telecommunications Sciences, USA Liuba Shrira, Brandeis University, USA Carlo Zaniolo, University of California, Los Angeles, USA (co-organizer) MORE INFORMATION Visit the workshop's homepage at: http://www.hotswup.org From maffeis at doc.ic.ac.uk Mon Nov 1 06:07:05 2010 From: maffeis at doc.ic.ac.uk (Sergio Maffeis) Date: Mon, 01 Nov 2010 10:07:05 +0000 Subject: [TYPES/announce] PhD Studentship in Foundations of Secure Web Programming at Imperial College London Message-ID: <4CCE9149.2000101@doc.ic.ac.uk> *** PhD Studentship in Foundations of Secure Web Programming *** *** Imperial College London *** We are looking for a student with a top degree from a good university and a strong interest in some of these topics: - formal semantics of programming languages; - theorem provers and proof assistants; - static analysis and type systems; - web security. Starting date is as soon as possible. Applications will be considered on an ongoing basis until December 31st, 2010. The PhD Studentship consists of a 3 years tax free bursary of ?15,590 per annum, plus UK/EU tuition fees and an allowance for equipment and academic travel costs. http://www3.imperial.ac.uk/computing/research/degrees/studentships#7 For further information please contact Dr. Sergio Maffeis: sergio.maffeis at imperial.ac.uk. From tobias.wrigstad at it.uu.se Tue Nov 2 19:20:53 2010 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Wed, 3 Nov 2010 00:20:53 +0100 Subject: [TYPES/announce] STOP'11 CFP -- Extended Deadline Nov 8th Message-ID: **** Deadline extended to Nov. 8th **** Call for Papers Script to Program Evolution (STOP) at POPL 2011 Jan 29th, 2011, Austin, TX Recent years have seen increased use of scripting languages in large applications. Scripting languages optimize development time, especially early in the software life cycle, over safety and robustness. As the understanding of the system reaches a critical point and requirements stabilize, scripting languages become less appealing. Compromises made to optimize development time make it harder to reason about program correctness, harder to do semantic-preserving refactorings, and harder to optimize execution speed. Lack of type information makes code harder to navigate and to use correctly. In the worst cases, this situation leads to a costly and potentially error-prone rewrite of a program in a compiled language, losing the flexibility of scripting languages for future extension. Recently, pluggable type systems and annotation systems have been proposed. Such systems add compile-time checkable annotations without changing a program's run-time semantics which facilitates early error checking and program analysis. It is believed that untyped scripts can be retrofitted to work with such systems. Furthermore, integration of typed and untyped code, for example, through use of gradual typing, allows scripts to evolve into safer programs more suitable for program analysis and compile-time optimizations. With few exceptions, practical reports are yet to be found. The STOP workshop focuses on the evolution of scripts, largely untyped code, into safer programs, with more rigid structure and more constrained behavior through the use of gradual/hybrid/pluggable typing, optional contract checking, extensible languages, refactoring tools, and the like. The goal is to further the understanding and use of such systems in practice, and connect practice and theory. To this end, we encourage not only submissions presenting original research results, but also papers that attempt to establish links between different approaches and/or papers that include survey material, experience reports and tool demonstrations. Original research results should be clearly described, and their usefulness to practitioners outlined. Paper selection will be based on the quality of the submitted material, including surveys. Important Dates --------------- Submission: Nov 8th, 2010 (extended) Notification: Dec 15th, 2010 Final Version: Jan 15, 2011 Workshop: Jan 29, 2011 Programme Committee ------------------- Amal Ahmed, Indiana Robby Findler, Northwestern (chair) Fritz Henglein, DIKU Gavin Bierman, Microsoft Gilad Bracha, Cloud Programming Model Jeff Foster, Maryland Peter Thiemann, Freiburg Sam Tobin-Hochstadt, Northeastern Organizers ---------- Jan Vitek, Purdue Tobias Wrigstad, Uppsala Steering Committee ------------------ Matthias Felleisen, Northeastern Cormac Flanagan, UC Santa Cruz Nate Nystrom, UTA Jan Vitek, Purdue Philip Wadler, Edinburg Tobias Wrigstad, Uppsala Selection Process ----------------- Both full papers (up to 12 pages LNCS) and position papers (1-2 pages LNCS) are welcome. All submissions will be reviewed by the program committee. The accepted papers, after rework by the authors, will be published in the Workshop Proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Submissions are made through Continue: http://continue2.cs.brown.edu/stop-2010/ Questions may be directed to Tobias Wrigstad (tobias.wrigstad@ it.uu.se) and Robby Findler (robby at eecs.northwestern.edu). From mhofmann at tcs.ifi.lmu.de Wed Nov 3 03:15:41 2010 From: mhofmann at tcs.ifi.lmu.de (Martin Hofmann) Date: Wed, 3 Nov 2010 08:15:41 +0100 (CET) Subject: [TYPES/announce] 3 years research assistant position in TCS, LMU Munich Message-ID: <48387.10.153.138.14.1288768541.squirrel@imap.ifi.lmu.de> A position for a research assistant in a DFG project is available. Project title: Pointers as an abstract data type: complexity-theoretic and programming-language aspects (PURPLE) Investigators: Martin Hofmann and Ulrich Sch?pp Duration: 36 months Start date: as soon as possible but not later than June 2011. Remuneration: German scale 13 TV-L (38k-54k EUR according to age, experience, family status) Background: PhD in theoretical informatics with some topical overlap, see project description. Candidates with an excellent Diploma or Master in this area are also encouraged to apply; in this case the project work may lead to a PhD. Location: The project will be carried out at the Institute for Informatics of Ludwig-Maximilians-Universit?t Munich, Germany. LMU is an equal opportunities employer. Applications should be sent by E-Mail to Sigrid Roden roden at tcs.ifi.lmu.de as a single PDF file containing in particular CV, research statement, and the names of two potential referees. There is no deadline. Applications will be assessed on an on-going basis until the position is filled. Questions about the position can be directed to the investigators {mhofmann, schoepp}@tcs.ifi.lmu.de. Project description: In programming languages and logics, graphs and similar data structures are often treated as structured data rather than bit-sequences or words. This means that elements of abstract data structures are often accessed using pointers, which support only a restricted set of operations, such as lookup, update and test for equality. The concrete representation of pointers remains hidden. Traditional computability and complexity theory, on the other hand, rely on concrete representations of data. In this project we want to explore the expressivity of abstract pointer concepts in the sense of complexity theory. In particular we aim at a separation of programming language versions of LOGSPACE and PTIME. For example, we conjecture that the PTIME-complete problem of Horn-satisfiability cannot be solved with a constant number of abstract pointers, even in the presence of non-determinism or an oracle for reachability. Additionally, we want to contribute to the formal specification and verification of programs with abstract pointers. For instance, we would like to ascribe rigorous meaning to preconditions like `It makes no guarantees as to the iteration order of the set ...' in the specification of the HashSet class in java.util. For further background reading, we refer to: - Project proposal to Deutsche Forschungsgemeinschaft (DFG): http://www2.tcs.ifi.lmu.de/~schoepp/Docs/purple_antrag.pdf - Martin Hofmann und Ulrich Sch?pp. Pure Pointer Programs with Iteration. ACM Transactions on Computational Logic, 2010. - Martin Hofmann und Ulrich Sch?pp. Pointer Programs and Undirected Reachability. Logic in Computer Science (LICS), 2009. Extended version: Electronic Colloquium on Computational Complexity (ECCC) 15(090), 2008 From alain.girault at inria.fr Wed Nov 3 18:05:03 2010 From: alain.girault at inria.fr (Alain Girault) Date: Wed, 03 Nov 2010 23:05:03 +0100 Subject: [TYPES/announce] MEMOCODE 2011 Call for Papers Message-ID: <4CD1DC8F.2030004@inria.fr> MEMOCODE 2011 Call for Papers The ninth ACM-IEEE* International Conference on Formal Methods and Models for Codesign (MEMOCODE 2011) will be held on July 11-13, 2011 in Microsoft Research Cambridge, UK. http://www.memocode-conference.com -------------------------------------------------------------------- IMPORTANT DATES Abstract submission deadline: February 25, 2011 Paper submission deadline: March 4, 2011 Notification of acceptance: April 29, 2011 Final Version for Papers: May 13, 2011 Poster submission deadline: May 13, 2011 Notification for Posters: May 27, 2011 -------------------------------------------------------------------- The ninth MEMOCODE conference will attract researchers and practitioners who create methods, tools, and architectures for the design of hardware/software systems. These systems face increasing design complexity including tighter constraints on timing, power, costs, and reliability. MEMOCODE seeks submissions that present novel formal methods and design techniques addressing these issues to create, refine, and verify hardware/software systems. We also invite application-oriented papers, and especially encourage submissions that highlight the design perspective of formal methods and models, including success stories and demonstrations of hardware/software codesign. Furthermore, we invite poster presentations describing ongoing work with promising preliminary results. Topics of interest for regular submissions include but are not limited to * system- and transaction-level modeling and verification, abstraction and refinement between different modeling levels, formal, semi-formal, and specification-driven verification, * design and verification methods for composition of concurrent systems: multi-core platform architectures, systems-on-chip, networks-on-chip, * formal methods and tools for hardware and software verification including theorem proving, decision procedures, * non-traditional and domain-specific design languages for hardware and software, novel models of computation, and new design paradigms that unify hardware and software design, * system-level estimation of performance and power in heterogeneous hardware/software architectures, * applications and demonstrators of formal design methodologies and case studies of innovative system-level design flows, * modeling and reuse of intellectual property at system-level, and * design abstraction and high-level design demonstrating productivity and quality in generating and validating RTL and software. PROCEEDINGS: Conference proceedings will be published by the IEEE Computer Society. SUBMISSION: Submissions of research and experience papers will only be accepted through the conference website. Papers must not exceed 10 pages and must be formatted following IEEE Computer Society guidelines. Submissions must be written in English, describe original work, and not substantially overlap papers that have been published or are being submitted to a journal or another conference with published proceedings. Poster submissions should consist of an abstract of at most 250 words. The abstract will be distributed to the conference attendants but will not be published. Note that the poster deadline is different from the paper deadline. SUBMISSION WEBSITE: http://www.easychair.org/conferences/?conf=memocode2011 -------------------------------------------------------------------- DESIGN CONTEST: MEMOCODE will again have a design contest. The contest will start March 1, 2011. The deadline for submission is 31 March 2011 and the notification of the results is on May 13, 2011. The conference will sponsor at least two prize categories, each with a significant cash award. We awarded a $1000 prize in each of the two categories in 2010. Each team that submits a complete and working entry will be invited to submit for review a 2-page abstract for the formal conference proceedings and present a poster at the conference; winning teams will be invited to contribute a 4-page short paper and present their work at the conference. Each team submitting a completed and working entry will also receive a commemorative plaque with their name and results. Please refer to the website for more information and updates. DESIGN CONTEST WEBSITE: see conference webpage -------------------------------------------------------------------- SPONSORS: Microsoft Research Cambridge, IEEE CEDA*, IEEE CAS*, ACM SIGBED*, and ACM SIGDA* -------------------------------------------------------------------- ORGANIZATION COMMITTEE: General and Finance Chair: Satnam Singh (MSR Cambridge) Program Chairs: Barbara Jobstmann (CNRS/Verimag) Michael Kishinevsky (Intel) Design Contest Chair: Derek Chiou (UT Austin) Publication Chair: Jens Brandt (TU Kaiserslautern) Local Chair: Robert Mullins (University of Cambridge) -------------------------------------------------------------------- PROGRAM COMMITTEE: David Atienza Alonso (EPFL) Twan Basten (Eindhoven University of Technology) Roderick Bloem (Graz University of Technology) Forrest Brewer (University of California, Santa Barbara) Tevfik Bultan (University of California, Santa Barbara) Luca Carloni (Columbia University) Satrajit Chatterjee (Intel) Ashish Darbari (ARM) Robert de Simone (INRIA, Sophia Antipolis) Rolf Drechsler (University of Bremen) Stephen A. Edwards (Columbia University) Franco Fummi (University of Verona) Thierry Gautier (INRIA) Alain Girault (INRIA) Ganesh Gopalakrishnan (University of Utah) David Greaves (Univ. Cambridge) Andreas Griesmayer (Imperial College London) Ziyad Hanna (Jasper Design Automation) Franjo Ivancic (NEC Labs) Barbara Jobstmann (CNRS/Verimag) Michael Kishinevsky (Intel) Daniel Kroening (Oxford University) Luciano Lavagno (Politecnico Torino) Elizabeth Leonard (Naval Research Laboratory) Alan Mycroft (University of Cambridge) Rishiyur S. Nikhil (Bluespec, Inc.) John O'Leary (Intel) Jan Reineke (University of California, Berkeley) Klaus Schneider (University of Kaiserslautern) Natasha Sharygina (University of Lugano) Satnam Singh (Microsoft Research) Daryl Stewart (ARM) Michael Theobald (D. E. Shaw Research) * Sponsorship approval pending -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From Marieke.Huisman at ewi.utwente.nl Thu Nov 4 10:53:26 2010 From: Marieke.Huisman at ewi.utwente.nl (Marieke Huisman) Date: Thu, 04 Nov 2010 15:53:26 +0100 Subject: [TYPES/announce] PhD and Post Doc position on ERC project Verifcation of Concurrent Data Structures (U. Twente, Netherlands) Message-ID: <4CD2C8E6.9080503@ewi.utwente.nl> The research group Formal Methods and Tools at the University of Twente (Enschede - The Netherlands) is looking for a PhD researcher (4 years) and a post doc researcher (3 years), to work on the 5 year research project VerCors (Verification of Concurrent Data Structures), funded by the European Research Council. The PhD student will work in particular on: The specification and Verification of Concurrent Data Structures with different Locking Policies The post doc researcher will work in particular on: User-friendly specification and automated verification of concurrent data structures Our research: ------------- Goal of the VerCors project is to develop a general specification and verification technique for multithreaded software. In earlier work, we developed a variant of permission-based separation logic that is particularly suited to reason about multithreaded Java programs with dynamic thread creation and termination, and reentrant locks. Expressiveness of this logic will be extended, to specify and verify different concurrent data structures. The PhD student will work on the parametrisation of the verification logic over the locking policy, so that a high-level specification of the behaviour of a data structure can be reused for different implementations. Thus the implementation of a concurrent data structure can be changed, without affecting correctness of the applications using it. The developed technique will be applied on standard concurrency libraries, such as java.concurrency.util. The post doc will be actively involved in the whole project. In addition, he or she is expected to work in particular on the following topics: - the development of an appropriate specification language, combining readability ? la JML and expressiveness related with concurrency as in separation logic. - the automated verification of proof obligations, by developing or extending appropriate solvers for separation logic, and developing ownership type-based techniques to prove the absence of aliasing automatically. All results of the VerCors will be integrated in a tool set that generates and proves proof obligations automatically. It will be validated on realistic case studies. For more information about the project, see: http://fmt.cs.utwente.nl/projects/VerCors/ We seek: -------- A PhD student with an MSc degree in Computer Science (or an equivalent qualification) and a post doc with a PhD degree in Computer Science (or an equivalent qualification). The candidate should be enthousiastic, and have a thorough theoretical background, a demonstrable interest in program verification, and some knowledge about multithreaded programming (in Java/C/C++). We are looking for a researcher with an independent mind who is willing to cooperate in our team. It is understood that he or she works on the topics listed above. Further we ask for good communicative and good collaboration skills. Candidates should be prepared to prove their English language skills. As a research outcome we expect publications, (prototype) tools, and for the PhD student a PhD thesis. Starting date of the position: as soon as possible after February 1, 2011. We offer: --------- - A PhD position for four years (38 hrs/week) and a post doc position for three years (38 hrs/week) - A stimulating scientific environment - Gross salary for a PhD student ranging from E 2042 tot E 2612 (4th yr) per month - Post doc salary is dependent on experience and background, but will minimally be EUR 2861 gross per month, plus benefits. - Holiday allowance (8%), end-of-year bonus (8.3%) - Excellent facilities for professional and personal development. - Good secondary conditions, in accordance with the collective labour agreement CAO-NU for Dutch universities - A green Campus with lots of sports facilities The PhD student will be a member of the Twente Graduate School in the research programme 'Dependable and Secure Computing' under the leadership of Prof Dr Jaco van de Pol. The research programme offers advanced courses to deepen your scientific knowledge in preparation to your future career (within or outside academia). We provide our PhD students with excellent opportunities to broaden their personal knowledge and to professionalise their academic skills. Participation in national and/or international summer schools and workshops, and visits to other prestigious research institutes and universities can be part of this programme. Further information: -------------------- - FMT group: http://fmt.cs.utwente.nl/ - Dr. Marieke Huisman (Marieke.Huisman at ewi.utwente.nl) Application: ------------ Please submit your application via http://www.utwente.nl/vacatures/en/ before December 15th, 2010. However, we strongly encourage interested applicants to send in their applications as soon as possible. Your application should consist of: - a cover letter (explain your specific interest and qualifications); - a full Curriculum Vitae, to apply for the PhD student position, this should include a list of all courses + marks, and a short description of your MSc thesis; to apply for the post doc position, this should include a list of all publications, and a short description of your PhD thesis; - references (contact information) of two scientific staff members. From christian.retore at labri.fr Thu Nov 4 17:54:21 2010 From: christian.retore at labri.fr (retore) Date: Thu, 4 Nov 2010 22:54:21 +0100 Subject: [TYPES/announce] logic, categories, semantics - Bordeaux 12-13 nov. Message-ID: <769A4A42-7E2B-45C8-A479-8839B4E95DD7@labri.fr> Dear colleagues, Here is a colloquium on logic, categories and formal semantics. We have 8 places left (if there are extra participants, they possibly will have to take care of their lunches). Registration is free, but the program below is worth a visit to Bordeaux. Best regards, -- Christian Retor? http://www.labri.fr/perso/retore LOGIQUE, CATEGORIES, SEMANTIQUE / LOGIC, CATEGORIES, SEMANTICS international colloquium organised by Jean Gillibert & Christian Retor? (IMB, INRIA, LABRI) under the auspices of the French Mathematical Society (SMF) http://www.labri.fr/perso/retore/LCS/index.html 12 AND 13 NOVEMBRE 2010 Salle de conf?rences Institut de Math?matiques de Bordeaux B?t. A33 Universit? Bordeaux 1, 351 cours de la Lib?ration 33405 Talence, PROGRAMME VENDREDI 12 NOVEMBRE 08:45 - 08:55 Pr?sentation (Jean Gillibert, Christian Retor?) 09:00 - 09:40 Pierre Cartier (IHES, Orsay) 09:45 - 10:25 Jean-Yves Girard (CNRS, IML, Marseille) Interdire ou r?futer ? Le statut ambigu de la normativit? Break. 11:00 - 11:40 Nicholas Asher (CNRS, IRIT, Toulouse) A web of words 11:45 - 12:25 Steve Vickers (University of Birmingham) Aspects of geometric logic Lunch. 14:00-14:40 Thomas Streicher (Technische Universit?t Darmstadt) Types as Kan complexes 14:45 - 15:25 Fran?ois Lamarche (INRIA, LORIA, Nancy) The intensional equality predicate in Martin-L?f type theory and the path functor in topology Visit of the Chateau Couhins. Diner at La belle ?poque. SAMEDI 13 NOVEMBRE 09:00 - 09:40 Carl Pollard (Ohio State University, Columbus) Remarks on categorical semantics of natural language 09:45 - 10:25 Anne Preller (LIRMM, Universit? de Montpellier) Pregroup Semantics in compact closed monoidal categories and in two-sorted first order logic Break 11:00 - 11:40 Paul-Andr? Melli?s (CNRS, PPS, Paris) Logical proofs understood as topological knots 11:45 - 12:25 Dion Coumans / Mai Gehrke (Radbout Universiteit Nijmegen) Semantics and Duality Lunch 14:00 - 14:40 Michael Moortgat (Universiteit Utrecht) 14:45- 15:25 Michele Abrusci (Universit? di Roma tre) Ontologies, by means of coherent spaces / Des espaces de coh?rence aux ontologies 15:30 - 16:15 Everyone Discussion, in particular on the interdisciplinary perspectives Drink. Topic of the workshop The relationship between logic and category theory goes back to the seventies, with the important connection between intuitionistic logic, sheaves and topoi (1) but it extended into other directions, in particular the proof as morphisms semantics (2), and we also include the study of proof normalisation (3). Ideally, the workshop will consider the three levels of foundations , according to the terminology of Jean-Yves Girard, as well as their mutual relationships. These structures provide models of computation but also models of meaning organisation des lexemes, phrases, sentences, discourses and dialogues: we do not exclude the first application, but we shall privilege the linguistic application which is quite new, although Joachim Lambek suggested to do so more than twenty years ago. http://www.labri.fr/perso/retore/LCS/index.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From cbraga at ic.uff.br Fri Nov 5 09:01:49 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Fri, 5 Nov 2010 11:01:49 -0200 Subject: [TYPES/announce] SBLP 2011: Call For Papers Message-ID: [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 22nd, 2011 Full paper submission: April 29th, 2011 Notification of acceptance: May 30th, 2011 Final papers due: July 29th, 2011 INVITED SPEAKERS Gary T. Leavens, Univ. of Central Florida Jose Luis Fiadeiro, Univ. of Leicester INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Easychair template. (http://www.easychair.org/easychair.zip) In particular, we encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. From 2003 to 2008 editions of SBLP there were special issues of the Journal of Universal Computer Science, published by Springer. The post-proceedings of SBLP 2009 and 2010 are being edited as special issues of Science of Computer Programming, published by Elsevier. GENERAL CO-CHAIRS Denise Stringhini FCI, Mackenzie Alfredo Goldman IME, USP PROGRAMME CHAIRS Christiano Braga, UFF Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Alex Garcia, IME * Alvaro Freitas Moreira, UFRGS (TBC) * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Edward Hermann Haeusler, PUC-Rio (TBC) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC (TBC) * Giuseppe Castagna, Paris 7 (TBC) * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE (TBC) * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG (TBC) * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE (TBC) * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Sophia Drossopoulou, Imperial College (TBC) * Varmo Vene, Univ. de Tartu (TBC) * Vladimir Di Iorio, UFV (TBC) From carlos.martin at urv.cat Sun Nov 7 06:46:05 2010 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Sun, 07 Nov 2010 12:46:05 +0100 Subject: [TYPES/announce] LATA 2011: 2nd call for papers Message-ID: ********************************************************************* 2nd Call for Papers 5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011) Tarragona, Spain, May 30 ? June 3, 2011 http://grammars.grlmc.com/LATA2011/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - neural networks - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - term rewriting - transducers - trees, tree languages and tree machines - weighted machines STRUCTURE: LATA 2011 will consist of: - 3 invited talks - 2 invited tutorials - refereed contributions - open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants) INVITED SPEAKERS: Thomas Colcombet (Paris), Green's Relations and Their Use in Automata Bakhadyr Khoussainov (Auckland), Automaticity (tutorial) Kevin Knight (Marina del Rey), Automata for Deciphering Natural Language J?rome L?roux (Bordeaux), On Automata Representing Presburger Sets (tutorial) Narad Rampersad (Li?ge), Abstract Numeration Systems PROGRAMME COMMITTEE: Andrew Adamatzky (Bristol) Cyril Allauzen (New York) Amihood Amir (Ramat-Gan) Franz Baader (Dresden) Marie-Pierre B?al (Marne-la-Vall?e) Philip Bille (Lyngby) Mikl?s B?na (Gainesville) Symeon Bozapalidis (Thessaloniki) Vasco Brattka (Cape Town) Maxime Crochemore (London) James Currie (Winnipeg) J?rgen Dassow (Magdeburg) Cunsheng Ding (Hong Kong) Rodney Downey (Wellington) Manfred Droste (Leipzig) Enrico Formenti (Nice) Amy Glen (Perth) Serge Haddad (Cachan) Shunsuke Inenaga (Fukuoka, co-chair) Jesper Jansson (Tokyo) Jarkko Kari (Turku) Marek Karpinski (Bonn) Maciej Koutny (Newcastle) Gregory Kucherov (Lille) Markus Lohrey (Leipzig) Benedikt L?we (Amsterdam) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n-Vide (Brussels, co-chair) Giancarlo Mauri (Milano) Alexander Meduna (Brno) Kenichi Morita (Hiroshima) Sven Naumann (Trier) Gonzalo Navarro (Santiago, CL) Mark-Jan Nederhof (St Andrews) Joachim Niehren (Lille) Joakim Nivre (Uppsala) Kemal Oflazer (Doha) Alexander Okhotin (Turku) Witold Pedrycz (Edmonton) Dominique Perrin (Marne-la-Vall?e) Giovanni Pighizzini (Milano) Alberto Policriti (Udine) Lech Polkowski (Warsaw) Helmut Prodinger (Stellenbosch) Mathieu Raffinot (Paris) Philippe Schnoebelen (Cachan) Ayumi Shinohara (Sendai) Jamie Simpson (Perth) Magnus Steinby (Turku) James Storer (Boston) Jens Stoye (Bielefeld) Andrzej Tarlecki (Warsaw) Richard Thomas (Leicester) Gy?rgy Vaszil (Budapest) Heiko Vogler (Dresden) Pascal Weil (Bordeaux) Damien Woods (Pasadena) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Shunsuke Inenaga (Fukuoka, co-chair) Carlos Mart?n-Vide (Brussels, co-chair) Bianca Truthe (Magdeburg) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2011 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing refereed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On-site registration fees: 580 Euro On-site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide ? LATA 2011). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference?s account. On-site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: January 3, 2011 Notification of paper acceptance or rejection: February 14, 2011 Early registration: February 28, 2011 Final version of the paper for the LNCS proceedings: February 28, 2011 Late registration: May 16, 2011 Starting of the conference: May 30, 2011 Submission to the post-conference special issue: August 30, 2011 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From rensink at cs.utwente.nl Tue Nov 9 09:06:13 2010 From: rensink at cs.utwente.nl (Arend Rensink) Date: Tue, 09 Nov 2010 15:06:13 +0100 Subject: [TYPES/announce] EAPLS PhD Award 2010: Call for Nominations Message-ID: <4CD95555.7090902@cs.utwente.nl> EAPLS PhD Award 2010: Call for Nominations ========================================== URL: http://eapls.org/pages/phd_award/ The European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. Eligibility ----------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 January 2009 ? 1 November 2010 Nominations ----------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to http://www.easychair.org/conferences/?conf=eaplsphd2010. The nomination must be accompanied by (a zip file containing) * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. Procedure --------- The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2010. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. Important dates --------------- 31 December 2010: Deadline for nominations 1 March 2011: Announcement of the award winner Expert committee ---------------- The Expert committee consists of the following members: * Roland Backhouse, University of Nottingham, U.K. * Rastislav Bodik, University of California at Berkeley, U.S.A. * Eerke Boiten, University of Kent, U.K. * Mark van den Brand, Universiteit Eindhoven, The Netherlands * Maurice Bruynooghe, University of Leuven, Belgium * Paolo Ciancarini, University of Bologna, Italy * Olivier Danvy, University of Aarhus, Denmark * Kei Davis, Los Alamos National Laboratory, U.S.A. * David de Frutos Escrig, Univers?dad Complutense de Madrid, Spain * Pierpaolo Degano, University of Pisa, Italy * JosuKa D?az Labrador, Universidad de Deusto, Spain * Marko van Eekelen, Radboud University Nijmegen * Maurizio Gabbrielli, University of Bologna, Italy * Giorgio Ghelli, University of Pisa, Italy * Stefan Gruner, University of Pretoria, South Africa * Kevin Hammond, University of St Andrews, U.K. * Manuel Hermenegildo, Universidad Polyt?cnica de Madrid, Spain * Paul Klint, CWI and University of Amsterdam, The Netherlands * Jens Knoop, Technische Universit?t Wien, Austria * Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. * Tiziana Margaria, University of Potsdam, Germany * Alan Mycroft, Cambridge University, U.K. * Catuscia Palamidessi, Ecole Polytechinique, Paris, France * Arnd Poetsch-Heffter, University of Kaiserslautern, Germany * Arend Rensink, Universiteit Twente, The Netherlands * Bernhard Steffen, Technical University of Dortmund, Germany * Peter Thiemann, University of Freiburg, Germany * Peter Van Roy, Universit? Catholique de Louvain, Belgium From valeria.depaiva at gmail.com Sun Nov 14 18:41:11 2010 From: valeria.depaiva at gmail.com (Valeria de Paiva) Date: Sun, 14 Nov 2010 15:41:11 -0800 Subject: [TYPES/announce] IMLA11: Call for Papers In-Reply-To: References: Message-ID: ? ? ? ? ? ? ? ? ? Fifth International Workshop on ? ? ? ? ? ? ?Intuitionistic Modal Logic and Applications ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? (IMLA'11) ? ? ? ? ? ? ?(http://www.agents.cs.nott.ac.uk/events/imla11) ?A 14th Logic, Methodology and Philosophy of Science affiliated workshop ? ? ? ? ? ? ? ? ? ? ? ? ? ?Nancy, France, July, 2011 Constructive modal logics and type theories are of increasing foundational and practical relevance in computer science. Applications are in type disciplines for programming languages, and meta-logics for reasoning about a variety of computational phenomena. Theoretical and methodological issues center around the question of how the proof-theoretic strengths of constructive logics can best be combined with the model-theoretic strengths of modal logics. Practical issues center around the question which modal connectives with associated laws or proof rules capture computational phenomena accurately and at the right level of abstraction. This workshop will bring together designers, implementers, and users to discuss all aspects of intuitionistic modal logics and type theories. Topics include, but are not limited to: * applications of intuitionistic necessity and possibility * monads and strong monads * constructive belief logics and type theories * applications of constructive modal logic and modal type theory to formal verification, foundations of security, abstract interpretation, and program analysis and optimization * modal types for integration of inductive and co-inductive types, higher-order abstract syntax, strong functional programming * models of constructive modal logics such as algebraic, categorical, Kripke, topological, and realizability interpretations * notions of proof for constructive modal logics * extraction of constraints or programs from modal proofs * proof search methods for constructive modal logics and their implementations The workshop continues a series of previous LICS-affiliated workshops, which were held as part of FLoC'99, Trento, Italy and of FLoC'02, Copenhagen, Denmark,part of LiCS2005, Chicago, USA and LiCS2008, Pittsburgh, USA. We solicit submissions on work in progress and on more mature results. Submissions should be extended abstracts of 5-10 pages sent in PDF format to either or both of the ?co-chairs nza at cs.nott.ac.uk, valeria.depaiva at gmail.com. IMPORTANT DATES: Submission: December 15, 2010 Notification: January ?15, 2011 Final papers due: March 31, 2011 Workshop Date: TBA It is planned to publish workshop proceedings as Electronic Notes in Theoretical Computer Science (ENTCS) or in CEURS, to be decided. Authors please use the generic ENTCS macro package at http://www.math.tulane.edu/~entcs. INVITED SPEAKERS include: Michael Mendler (Bamberg, DE) Brian Logan (Nottingham, UK) Lutz Strassburger (LIX, FR) PROGRAM COMMITTEE Nick Benton (Microsoft, UK) Natasha Alechina (Nottingham, UK) Didier Galmiche (Nancy, FR) Hermann Hausler (PUC-RJ, BR) Valeria de Paiva (Birmingham, UK) CONTACTS Natasha Alechina (nza at cs.nott.ac.uk) Valeria de Paiva (valeria.depaiva at gmail.com) -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/www/ -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/www/ From soner at mtu.edu Sun Nov 14 21:50:15 2010 From: soner at mtu.edu (Soner Onder) Date: Sun, 14 Nov 2010 21:50:15 -0500 Subject: [TYPES/announce] ASPLOS 2011 Call for Posters Message-ID: <4CE09FE7.7060500@mtu.edu> ** We apologize if you receive this announcement from multiple sources. We expect that it will be of interest to the Programming Language Community. ** A student poster session will be held with the reception on the Sunday before the conference (March 6). The student poster session is an excellent venue for graduate and undergraduate students to present and discuss their ongoing research work. The poster session features short presentations by student speakers followed by informal one-on-one interactions between presenters and other conference participants. The goal of the poster session is to help students obtain early feedback on their research projects and establish contacts with other researchers with similar interests. Submissions and Evaluations Students who intend to present a poster must send the following information to Iulian Neamtiu (http://www.cs.ucr.edu/~neamtiu) by Friday, Jan 28, 2011: 1. Title, author names, and affiliations. 2. One-page abstract in PDF format of the proposed presentation, prepared using the ACM SIGPLAN format. 3. Name and email address of the student presenter. 4. Please include "ASPLOS poster submission" in the email title. Selected student presenters will be notified via email starting February 15, 2011. The poster selection committee consists of Philip Brisk, Brian Demsky, and Iulian Neamtiu. Funding Student authors/presenters are encouraged to apply for travel support. Posted by: Soner Onder - ASPLOS 2011 Publicity Chair -------------- next part -------------- A non-text attachment was scrubbed... Name: ASPLOS2011-CFPoster.pdf Type: application/pdf Size: 231619 bytes Desc: not available URL: From soner at mtu.edu Sun Nov 14 21:57:46 2010 From: soner at mtu.edu (Soner Onder) Date: Sun, 14 Nov 2010 21:57:46 -0500 Subject: [TYPES/announce] CALL FOR PAPERS for ASPLOS Workshops ASSMA, GPGPU, and WoDET Message-ID: <4CE0A1AA.70606@mtu.edu> * We apologize if you receive this announcement from multiple sources. We expect that these workshops will be of interest to the Programming Language Community * CALL FOR PAPERS for the Workshops co-located with the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI) http://asplos11.cs.ucr.edu/tutorialworkshop.html Contained in this note: 1) CALL FOR PAPERS 1st Workshop on Architecture and Systems Support for Mobile Applications (ASSMA) http://sites.google.com/site/assmaworkshop 2) CALL FOR PAPERS Workshop on General Purpose Processing Using GPUs (GPGPU) http://www.ece.neu.edu/GPGPU/ 3) CALL FOR PAPERS 2nd Workshop on Determinism and Correctness in Parallel Programming (WoDET) http://sites.google.com/site/2ndwodet/ ------------------------------------------------------------------------------------------ 1) CALL FOR PAPERS ASSMA The 1st Workshop on Architecture and Systems Support for Mobile Applications (http://sites.google.com/site/assmaworkshop) Newport Beach, California, March 5, 2011 In conjunction with the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI) The Workshop on Architecture and Systems Support for Mobile Applications (ASSMA) is a multidisciplinary forum for new ideas and experimental results in architecture and systems research targeting mobile applications. As the market for mobile computing devices (e.g., smartphones, PDAs, media players) continues its tremendous growth, it is becoming increasingly important to optimize the execution of applications on these devices. This workshop aims to identify emerging applications, understand their execution, and optimize their execution through innovations in hardware and software. The goal of the workshop is to promote discussion between academia and industry on challenges in this area that span the hardware-software computing stack, including architecture, compilers, programming languages, systems, applications, and the end user. Topics of interest include, but are not limited to: . Characterization of mobile applications and usage behavior . Application-specific, reconfigurable, and accelerator-based processing for mobile applications . Programming language techniques and extensions for mobile applications . Energy-efficient mobile architecture and systems design . Multicore design challenges with mobile applications . Mobile web browser design, implementation, and optimization . Support for integration, collection, and analysis of sensor data in mobile applications . Profiling, debugging, and software development tools for mobile devices . Experiences with real mobile computing platforms Papers should report on original research, and include adequate background material to make them accessible to the architecture and systems community. Submissions will be judged based upon their correctness, relevance, originality, significance, and clarity. Submission Guidelines All submissions are to be made electronically through the submission web site. Submissions should be between 6 and 8 pages in length, include the full list of authors and affiliations, be in standard double column ACM conference format, and submitted in PDF format. Templates for ACM format are available for Microsoft Word and LaTeX at http://www.sigplan.org/authorInformation.htm(use the 9 pt. template). Important Dates: Submission Dec 6, 2010, 6pm PST Notification Jan 20, 2010 Final Feb 28, 2011 Organizers: Alex Shye, Qualcomm Calin Cascaval, Qualcomm Program Committee Murali Annavarum, USC Ras Bodik, UC Berkeley Calin Cascaval, Qualcomm Luis Ceze, U Washington Chandra Krintz, UCSB Krisztian Flautner, ARM Sam King, U Illinois Jose Martinez, Cornell U Gokhan Memik, Northwestern U Trevor Mudge, U Michigan Jens Palsberg, UCLA Keshav Pingali, UT Austin Alex Shye, Qualcomm Michael Taylor, UCSD ------------------------------------------------------------------------------------------------------------------------------------- 2) CALL FOR PAPERS GPGPU Workshop on General Purpose Processing Using GPUs ( http://www.ece.neu.edu/GPGPU/) Newport Beach, California, March 5, 2011 In conjunction with the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI) Overview: The goal of this workshop is to provide a forum to discuss new and emerging general-purpose purpose programming environments and platforms, as well as evaluate applications that have been able to harness the horsepower provided by these platforms. This year's work is particularly interested on new heterogeneous GPU platforms. Papers are being sought on many aspects of GPUs, including (but not limited to): + GPU applications + GPU compilation + GPU programming environments + GPU power/efficiency + GPU architectures + GPU benchmarking/measurements + Multi-GPU systems + Heterogeneous GPU platforms Paper Submission: Authors should submit a 8 page paper in ACM double-column style using the directions on the conference website at www.ece.neu.edu/GPGPU/ Important Dates: ---------------- Paper submission: December 10, 2010 (no extensions will be given) Author notification: January 15, 2011 Final paper: January 30, 2011 Organizers: John Cavazos, University of Delaware David Kaeli, Northeastern University Program Committee: Tor Aamodt, Univ. of British Columbia Mark Barnell, AFRL Francois Bodin, CAPS Albert Cohen, INRIA Michael Gschwind, IBM Research Wen-mei Hwu, UIUC Won-Ki Jeong, Harvard University Richard Johnson, NVIDIA Volodymyr Kindratenko, UIUC James Malcolm, Accelereyes Nacho Navarro, UPC Nicholas Pinto, MIT Chris Rossbach, Microsoft Norm Rubin, AMD/ATI Nayda Santiago, UPRM Dale Shires, Army Research Labs Michela Taufer, Univ. of Delaware Guru Venkataramani, GWU Jeffrey Vetter, Oak Ridge National Labs Sudhakar Yalamanchili, Georgia Tech All papers will be made available at the workshop and will also be published in the ACM Conference Proceedings Series. ------------------------------------------------------------------------------------------------ 3) CALL FOR PAPERS WoDET 2nd Workshop on Determinism and Correctness in Parallel Programming http://sites.google.com/site/2ndwodet/ Newport Beach, California, March 6, 2011 In conjunction with the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI) Unintentional non-determinism is the bane of multithreaded software development. Defective software might execute correctly hundreds of times before a subtle synchronization bug appears, and when it does, developers often cannot readily reproduce it while debugging. Nondeterminism also complicates testing as good coverage requires both a wide range of program inputs and a large number of possible interleavings for each input. These problems have taken on renewed urgency as multicore systems have driven parallel programming to become mainstream. Determinism is emerging as an important research area, ranging from techniques for existing code (including deterministic execution models, parallelizing compilers, and deterministic replay for debugging) to new programming models (including deterministic general purpose languages and run-time systems). Deterministic multiprocessing yields deep open questions in programming languages, compilers, operating systems, runtime systems and architecture. While there is a growing consensus that determinism would greatly help with the programmability challenges of multicore systems, there is still little consensus on many important questions. What are the performance and programmability trade-offs for enforcing deterministic semantics with different approaches? Should deterministic semantics be strictly enforced or guaranteed only for programs that are "well-behaved" in certain ways? How can we support truly non-deterministic algorithms, where non-determinism is intentionally used for improved parallel performance? How can each layer of the system stack contribute to these goals? What are other safety guarantees useful in making parallel programming easier and less error prone (e.g., race-freedom, atomicity, etc..)? The Second Workshop on Determinism and Correctness in Parallel Programming is an across-the-stack forum to discuss the role of a wide range of correctness properties in parallel and concurrent programming. While determinism is an important theme, the scope of the workshop includes other correctness properties for parallel programs and systems. The workshop will be a full day event with a few invited talks, a moderated debate, and technical sessions for short peer-reviewed papers discussing ideas, positions, or preliminary research results. In addition to answers to the questions above, topics of interest include: * Language extensions for disciplined parallel programming models (deterministic, data race-free, etc.) * Architecture, operating system, runtime system and compiler support for parallel program correctness * Concurrency debugging techniques * New properties of parallel programs * Limit studies and empirical studies of the cost of safety properties * Studies of the applicability of correctness properties in parallel programs and algorithms * Concurrency bug avoidance techniques * Real-world experience with safe parallel programming models, systems, or tools We are seeking submissions of short position papers to be presented at the workshop. Position papers may introduce new ideas relevant to the workshop, propose interesting research directions, and/or describe preliminary research results. Workshop submissions will be judged on novelty, technical merit, and potential for creating thought-provoking discussion at the workshop. There will NOT be a formal proceedings so work presented at this workshop is eligible for republication in future ACM conferences or journals (and other formal venues that have similar republication policies). Submissions must be in PDF format, in two columns, 10-point font, 1-inch margins, and no longer than 6 pages in total. Please contact the organizers if any of these present a hardship. Please check back for the submissions link here: http://sites.google.com/site/2ndwodet/ ## Important Dates Friday, January 14, 2011 - Paper Submission (by 11:59pm US Eastern Standard Time) Monday, February 7, 2011 - Acceptance notifications ## Organizers Vikram Adve, University of Illinois at Urbana-Champaign Luis Ceze, University of Washington Bryan Ford, Yale University ## Program Committee Vikram Adve, University of Illinois at Urbana-Champaign Saman Amarasinghe, MIT Emery Berger, University of Massachusetts Hans-J Boehm, HP Labs Luis Ceze, University of Washington Bryan Ford, Yale University Tim Harris, MSR Jim Larus, MSR Vivek Sarkar, Rice University ** Posted by Soner Onder, ASPLOS 2011 Publicity Chair ** ------------------------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Klaus.Havelund at jpl.nasa.gov Mon Nov 15 05:45:45 2010 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (317J)) Date: Mon, 15 Nov 2010 02:45:45 -0800 Subject: [TYPES/announce] [fm-announcements] NASA Formal Methods Symposium - NFM 2011 : Third Call for Papers In-Reply-To: Message-ID: THIRD CALL FOR PAPERS NFM 2011 Third NASA Formal Methods Symposium Pasadena, California, USA April 18 - 20, 2011 http://lars-lab.jpl.nasa.gov/nfm2011 IMPORTANT DATES Submission deadline : *** December 19, 2010 *** Notification of acceptance/rejection : January 21, 2011 Final version due : February 18, 2011 Conference : April 18-20, 2011 THEME The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, government and industry, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. The focus of the symposium is on formal methods, and aims to foster collaboration between NASA researchers and engineers and the wider aerospace and academic formal methods communities. The symposium will be comprised of a mixture of invited talks by leading researchers and practitioners, presentation of accepted papers, and panels. TOPICS OF INTEREST * Theorem proving * Model checking * Real-time, hybrid, stochastic systems * SAT and SMT solvers * Symbolic execution * Abstraction * Compositional verification * Program refinement * Static analysis * Dynamic analysis * Automated testing * Model-based testing * Model-based development * Fault protection * Security and intrusion detection * Application experiences * Modeling and specification formalisms * Requirements specification and analysis INVITED SPEAKERS Rustan Leino Microsoft Research, USA "From Retrospective Verification to Forward-Looking Development" Oege de Moor University of Oxford, UK "Do Coding Standards Improve Software Quality?" Andreas Zeller Saarland University, Germany "Specifications for Free" TUTORIALS Bart Jacobs Katholieke Universiteit Leuven, Belgium "VeriFast: a Powerful, Sound, Predictable, Fast Verifier for C and Java" Michal Moskal Microsoft Research, USA "Verification of Functional Correctness of Concurrent C Programs with VCC" HISTORY NFM 2011 is the third edition of the NASA Formal Methods Symposium, organized by NASA on a yearly basis. The first in 2009 and was organized at NASA Ames Research Center, Moffett Field, California. The second in 2010 was organized at NASA head quarters, Washington D.C. The symposium originated from the earlier Langley Formal Methods Workshop series. PAPER SUBMISSION There are two categories of submissions: * Regular paper: up to 15 pages, describing fully developed work and complete results. Papers can present theory, software engineering aspects, or case studies. * Tool papers: up to 6 pages, describing an operational tool. The authors of accepted tool papers will give demonstrations of their tools in tool demo sessions. Tool papers should explain enhancements that have been done compared to previously published work. A tool paper does not need to present the theory behind the tool but can focus more on its features, and how it is used, with screen shots and examples. All papers should be in English and describe original work that has not been published or submitted elsewhere. Submissions will be fully reviewed and the symposium proceedings will appear as a volume in Lecture Notes of Computer Science. Papers must use the LNCS style, and be in pdf format. COSTS There will be no registration fee charged to participants. PROGRAMME CHAIRS Mihaela Bobaru, NASA/Jet Propulsion Laboratory Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Rajeev Joshi, NASA/Jet Propulsion Laboratory PROGRAMME COMMITTEE Rajeev Alur, University of Pennsylvania, USA Tom Ball, Microsoft Research, USA Howard Barringer, University of Manchester, UK Saddek Bensalem, Verimag Laboratory, France Nikolaj Bjoerner, Microsoft Research, USA Eric Bodden, Technical University Darmstadt, Germany Marsha Chechik, University of Toronto, Canada Rance Cleaveland, University of Maryland, USA Dennis Dams, Bell Labs/Alcatel-Lucent, Belgium Ewen Denney, NASA Ames Research Center, USA Matt Dwyer, University of Nebraska, USA Cormac Flanagan, UC Santa Cruz, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Patrice Godefroid, Microsoft Research, USA Alex Groce, Oregon State University, USA Radu Grosu, Stony Brook, USA John Hatcliff, Kansas State University, USA Mats Heimdahl, University of Minnesota, USA Mike Hinchey, Lero - the Irish SW. Eng. Research Centre, Ireland Sarfraz Khurshid, University of Texas at Austin, USA Orna Kupferman, Jerusalem Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Rupak Majumdar, Max Planck Institute, Germany Kenneth McMillan, Cadence Berkeley Labs, USA Cesar Munoz, NASA Langley, USA Madan Musuvathi, Microsoft Research, USA Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Shaz Qadeer, Microsoft Research, USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Nicolas Rouquette, NASA/Jet Propulsion Laboratory, USA Kristin Rozier, NASA Ames Research Center, USA John Rushby, SRI International, USA Wolfram Schulte, Microsoft Research, USA Koushik Sen, Berkeley University, USA Sanjit Seshia, Berkeley University, USA Natarajan Shankar, SRI International, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Ben Di Vito, NASA Langley, USA Mike Whalen, University of Minnesota, USA STEERING COMMITTEE Ewen Denney, NASA Ames Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin Y. Rozier, NASA Ames Research Center Ben Di Vito, NASA Langley -------------- next part -------------- An HTML attachment was scrubbed... URL: From gethin at dcs.gla.ac.uk Tue Nov 16 04:30:57 2010 From: gethin at dcs.gla.ac.uk (Gethin Norman) Date: Tue, 16 Nov 2010 09:30:57 +0000 Subject: [TYPES/announce] QAPL 2011 Second Call For Papers Message-ID: <707EB051-D768-4DB5-A0C1-EE98966B1DBF@dcs.gla.ac.uk> [Apologies for multiple copies] ******************************************************************************* SECOND CALL FOR PAPERS Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL2011) Affiliated with ETAPS 2011 April 1-3, 2011, Saarbrucken, Germany http://www.dcs.gla.ac.uk/qapl11/ ******************************************************************************* SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues TOPICS: Topics include (but are not limited to) probabilistic, timing and general quantitative aspects in: Language design, Information systems, Asynchronous HW analysis, Language extension, Multi-tasking systems, Automated reasoning, Language expressiveness, Logic, Verification, Quantum languages, Semantics, Testing, Time-critical systems, Performance analysis, Safety, Embedded systems, Program analysis, Risk and hazard analysis, Coordination models, Protocol analysis, Scheduling theory, Distributed systems, Model-checking, Security, Biological systems, Concurrent systems, and Resource analysis. INVITED SPEAKERS: * Prakash Panangaden (McGill, Canada) * Erik de Vink (Technische Universiteit Eindhoven, the Netherlands) SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits two types of submissions - regular papers and presentations: 1. Regular paper submissions must be original work, and must not have been previously published, nor be under consideration for publication elsewhere. Regular paper submission must not exceed 15 pages, possibly followed by a clearly marked appendix which will be removed for the proceedings and contains technical material for the reviewers. 2. Presentation reports concern recent or ongoing work on relevant topics and ideas, for timely discussion and feedback at the workshop. There is no restriction as for previous/future publication of the contents of a presentation. Typically, a presentation is based on a paper which recently appeared (or which is going to appear) in the proceedings of another recognized conference, or which has not yet been submitted. The (extended) abstract of presentation submissions should not exceed 4 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: http://www.easychair.org/conferences/?conf=qapl11 The workshop PC will review all regular paper submissions select appropriate ones for acceptance, based on their relevance, merit, originality, and technical content. Presentation reports will receive a lightweight review to establish their relevance for the workshop. The authors of the accepted submissions of both type are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Publication of a selection of the papers in a special issue of a journal is under consideration. For regular papers: Submission (regular paper): December 17, 2010 Notification: January 21, 2011 Final version (ETAPS proceedings): February 4, 2011 Final version (EPTCS proceedings): TBA For presentation reports: Submission: January 24, 2011 Notification: January 26, 2011 ORGANIZATION: PC Chairs: * Mieke Massink, CNR-ISTI, Pisa, Italy * Gethin Norman, University of Glasgow, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, University of Dresden, Germany * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, IRISA/INRIA Rennes, France * Patricia Bouyer, Oxford University, UK * Jeremy Bradley, Imperial College London, UK * Tomas Brazdil, Masaryk University, Czech Republic * Frank van Breugel, York University, Canada * Antonio Cerone, UNU-IIST, Macao * Kostas Chatzikokolakis, University of Eindohoven, NL * Josee Desharnais, University of Laval, Canada * Alessandra Di Pierro, University of Verona, Italy * Mieke Massink, CNR-ISTI, Pisa, Italy * Paulo Mateus, Technical University of Lisbon, Portugal * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Oxford, UK * Anne Remke, University of Twente, the Netherlands * Jeremy Sproston, University of Torino, Italy * Herbert Wiklicky, Imperial College London, UK * Verena Wolf, Saarland University, Germany The University of Glasgow, charity number SC004401 From Manuela.Bujorianu at manchester.ac.uk Wed Nov 17 10:53:54 2010 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Wed, 17 Nov 2010 15:53:54 +0000 Subject: [TYPES/announce] HAS@ETAPS'2011 Message-ID: <20101117155354.50793iwd5oc6da4y@webmail.manchester.ac.uk> Dear all, We apologize for the inevitable cross-posting! If you are interested in research topics at the interplay between control engineering, computer science, applied mathematics and artificial intelligence, then the following event might be of interest to you. HAS, the two days workshop on ``Hybrid Autonomous Systems?, is an inter-disciplinary event associated with ETAPS 2011, in Saarbrucken, Germany. It promotes the applications of the hybrid discrete/continuous models to autonomous systems. These are now mature paradigms that still raise many research topics. We are very liberal in receiving submissions that deal with any sort of topic in the area, especially from inter-disciplinary perspectives. In addition to publishing quality submissions in a special issue of the Elsevier?s ENTCS journal, we are also considering the possibility to edit a book after the workshop. Therefore, extended versions that exceed the 16 pages limit are welcome, and they will be fully reviewed. However, the final versions have to be within the page limit. All relevant details can be found in the call for papers attached below. Thank you for your attention! Best wishes from me and all colleagues involved in the organization, Manuela ============================================================================== HAS 2011 HYBRID AUTONOMOUS SYSTEMS A satellite event of European Joint Conferences on Theory and Practice of Software ETAPS 2011 2-3 April, 2011, Saarbrucken, Germany _______________________________________________________________________ 2nd Call for Papers _______________________________________________________________________ URL: http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/HAS.htm ETAPS: http://www.etaps.org/workshops _______________________________________________________________________ CHAIRS Manuela Bujorianu, University of Manchester, UK Martin Fr?nzle, Carl von Ossietzky Universit?t Oldenburg, DE Antonios Tsourdos, Cranfield University, UK _______________________________________________________________________ SCOPE The variety of autonomous systems is increasing both in industry and academia. Such systems must operate with limited human intervention in a changing environment and they must be able to compensate for significant system failure without external intervention. In highly autonomous systems, the system behavior is normally so complex that it is either impossible or inappropriate to describe it with conventional mathematical system models. The complexity of the system model needed in design depends on both the complexity of the physical system and on how demanding the design specifications are. The most appropriate models of autonomous systems can be find in the class are hybrid systems (which study continuous-state dynamic processes via discrete-state controllers) that interact with their environment. The symposium will bring together researchers interested in all aspects of autonomy and adaptivity of hybrid systems. _______________________________________________________________________ PLENARY SPEAKERS Howard Barringer, University of Manchester, UK Mike Hinchey, Lero-the Irish Software Engineering Research Centre, IE Joost-Pieter Katoen, RWTH Aachen, DE Pieter J. Mosterman, The MathWorks, CA Holger Voos, University of Luxembourg, LU _______________________________________________________________________ TOPICS OF INTEREST These include, but are not restricted to: ? new modelling paradigms for autonomous systems; ? extending hybrid systems with autonomous behaviours; ? formal methods for autonomous systems ? verification and safety certification techniques ? modelling, analysis and control of hybrid systems, ? uncertainty and stochastic modelling; ? multi-agent systems; ? algebraic and categorical methods ? reports on practical experiments _______________________________________________________________________ SUBMISSION All submitted papers will undergo a thorough review process; each paper will be refereed by at least three experts in the field based on relevance, originality, significance, quality and clarity. Submissions should: - contain original contributions that have not been published or submitted to other conferences/journals in parallel with this event; - clearly state the problem being addressed, the goal of the work, the results achieved, and the relation to other works; - be in PS or PDF and formatted according to ENTCS Instructions for authors: http://www.entcs.org/prelim.html; - be in English and in a form that can be immediately included in the proceedings without major revision; - be with a maximum length of 16 pages - be attached (if necessary) by an Appendix that contains proofs, figures, tables, additional material. The appendix will be reviewed. - be sent electronically (as a PostScript or PDF file) through the submissions link to the conference website: https://www.easychair.org/account/signin.cgi?conf=has2011 Submission deadline (NEW!): 21st December 2010 _______________________________________________________________________ PUBLICATION Accepted papers will be included in HAS 2011 Proceedings. At least one of the authors will be required to register and attend the symposium to present the paper in order to include the paper in the proceedings. All accepted papers will be published by Elsevier in the Electronic Notes in Theoretical Computer Science journal. _______________________________________________________________________ PROGRAM COMMITTEE Jose Luiz Fiadeiro, University of Leicester, UK Michael Fisher, University of Liverpool , UK Alessandro Giua, Universita' di Cagliari, IT Klaus Havelund, JPL, NASA, USA Michael Hofbaur, Private University UMIT, AT Joost-Pieter Katoen, RWTH Aachen, DE Rom Langerak, University Of Twente, NL Corina Pasareanu, NASA Ames, USA Maria Prandini, Technical University of Milan, IT Manuel Silva, GISED, Zaragoza, SP Joerg Raisch, Technische Universitaet Berlin, DE Sandeep Shukla, Virginia Tech, USA Olaf Stursberg, University of Kassel, DE Janan Zaytoon, CReSTIC, Reims, FR ============================================================================== From phil at site.uottawa.ca Fri Nov 19 12:03:40 2010 From: phil at site.uottawa.ca (Philip Scott) Date: Fri, 19 Nov 2010 12:03:40 -0500 Subject: [TYPES/announce] Call for Papers: MSCS Special Issue on PCA's, Realizability, and Computability Message-ID: Call for papers: A special Issue of Mathematical Structures in Computer Science on "Partial Combinatory Algebras in Realizability and Computability" Notice of intention to submit: Deadline: January 2011 Submission: Deadline: April 30, 2011 Special editors: Pieter Hofstra (phofstra at uottawa.ca) and Robin Cockett (robin at cpsc.ucalgary.ca) Background: Following the July 9th (2010) LICS workshop on PCAs, realizability, and computability http://www.floc-conference.org/PCARC-home.html we are now accepting and soliciting papers for a special issue of MSCS on the general topic of that workshop. Constraints: * Submission is open to both participants and to those who could not/did not attend. * Submissions should be on a topic related to the workshop. Survey and overview papers will also be considered. * If you intend to submit a paper please do let us know as soon as possible but certainly by the new year: this will greatly facilitate our planning. * The papers will be refereed in the usual manner of a journal submission. Subject area: * All aspects of (partial) combinatory logic and lambda calculi * Partial combinatory algebras, models of computation, and generalizations * Categorical and type theoretic aspects of computability * Realizability. If you have questions please do not hesitate to contact one of the editors. Pieter Hofstra Robin Cockett From bram at cs.queensu.ca Sat Nov 20 20:41:15 2010 From: bram at cs.queensu.ca (Bram Adams) Date: Sat, 20 Nov 2010 20:41:15 -0500 Subject: [TYPES/announce] CFP: MISS 2011 workshop (ex ACP4IS) at AOSD 2011 Message-ID: <1D1ACE01-31E8-4D84-A221-D78B4C4595D4@cs.queensu.ca> [sorry for duplicate reception of this cfp] ************************************************************************* 1st AOSD Workshop on Modularity in Systems Software MISS 2011 (ex ACP4IS) March 22, 2011 Porto de Galinhas, Pernambuco (Brazil) http://www.aosd.net/workshops/miss A one-day workshop to be held in conjunction with the 10th International Conference on Aspect-Oriented Software Development (AOSD'11), March 21 -- March 25, 2011, Porto de Galinhas, Pernambuco (Brazil) http://aosd.net/conference ************************************************************************** The importance of "systems infrastructure" software - including application servers, virtual machines, middleware, compilers, and operating systems - is increasing as application programmers demand better and higher-level support for software development. Vendors that provide superior support for application development have a competitive advantage. The software industry as a whole benefits as the base level of abstraction increases, thus decreasing the need for application programmers to continually "reinvent the wheel". These trends, however, mean that the demands on infrastructure software are increasing. More and more features and requirements are being "pushed down" into the infrastructure, and the developers of systems software need better tools and techniques for handling these increased demands. The design and implementation of systems-level software presents unique opportunities and challenges for research on software modularity. These challenges include the need to address the inherent complexity of infrastructure software, the need for strong assurances of correct and predictable behaviour, the need for maximum run-time performance, and the necessity of dealing with the large body of existing systems software components. MISS 2011 aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between exciting new modularity constructs for systems software such as aspects, components, traits and context layers. The goal is to put these constructs into a common reference frame and to build connections between the software engineering and systems communities. Following up on last year's workshop, MISS 2011 puts special focus on the challenges in system's programming introduced by multi-core platforms. As hardware-supported parallelization becomes mainstream, there is an increasing pressure on systems infrastructure to exploit this new parallelism to its fullest. However, the non-modular nature of parallel execution, and the numerous levels at which parallelism can be achieved (application, systems infrastructure, hardware or even a combination) make it hard to come up with an intuitive, yet efficient parallel architecture. We solicit novel ideas and experience reports on this emerging research area. Other suggested topics for position papers include, but are not restricted to: - Approaches that combine or relate techniques based on advanced modularization concepts - Dimensions of infrastructure software quality including comprehensibility, configurability (by implementers), customizability (by users), reliability, evolvability, scalability, and run-time characteristics such as performance and code size - Merits and downsides of container-, ORB-, and system-based separation of concerns - Architectural techniques for particular system concerns, e.g., security, static and dynamic optimization, and real-time behaviour - Design patterns for systems software - "Mining" and refactoring of concerns in systems code - Application- or domain-specific optimization of systems - Reasoning and optimization across architectural layers - Quantitative and qualitative evaluation AGENDA The workshop will be structured to encourage fruitful discussions and build connections between workshop participants. To this end, approximately half of the workshop time will be devoted to short presentations of accepted papers, with the remaining half devoted to semi-structured discussion groups and lightning talks. The latter are short talks that are combined with tool demos, aimed at stimulating even more interaction between workshop attendees. Participants will be expected to have read the accepted papers prior to the workshop, to help ensure focused discussions. SUBMISSION GUIDELINES Invitation to the workshop will be based on accepted position papers, 3-5 pages in length. All papers must be submitted as PDF documents in ACM format through the MISS 2011 online submission system found at: http://www.easychair.org/conferences/?conf=miss11. Paper submissions will be reviewed by the workshop program committee and by designated reviewers. Papers will be evaluated based on technical quality, originality, relevance, and presentation. In addition to position papers, we also solicit proposals for lightning talks, i.e., a combination of a 5 minute talk and 5 minute tool demo. Prospective lightning presenters should send us an abstract of 250 words (deadline: March 13, 2010). Abstracts will NOT be published, they are intended to be read by the reviewers only (hence the late deadline). Comments and questions can be sent to miss11 AT aosd DOH net. PUBLICATION OF PAPERS All accepted papers will be posted at the workshop web site prior to the workshop date, to give all participants the opportunity to read them before the workshop. In addition, the accepted position papers will be published in a Workshop Proceedings in the ACM Digital Library. IMPORTANT DATES Paper Deadline: January 7, 2011 at 23:59 (Apia time) Notification of acceptance: January 23, 2011 Final papers due: February 19, 2011 Lightning abstracts: March 13, 2011 Workshop: March 22, 2011 PROGRAM COMMITTEE - Bram Adams, Queen's University - Walter Binder, University of Lugano - Michael Haupt, Hasso Plattner Institut - Mick Jordan, Oracle Labs - Julia Lawall, DIKU - David Lorenz, The Open University of Israel - Stefan Marr, Vrije Universiteit Brussel - Eddy Truyen, KU Leuven - Eric Wohlstadter, University of British Columbia - Charles Zhang Hong Kong University of Science and Technology - more to be announced soon ... ORGANIZING COMMITTEE - Bram Adams, Queen's University - Michael Haupt, Hasso Plattner Institut - David Lorenz, The Open University of Israel - Eric Wohlstadter, University of British Columbia STEERING COMMITTEE - Eric Eide, University of Utah - Olaf Spinczyk, University of Dortmund - Yvonne Coady, University of Victoria - David Lorenz, The Open University of Israel From thomas.ehrhard at pps.jussieu.fr Sun Nov 21 10:55:17 2010 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Sun, 21 Nov 2010 16:55:17 +0100 Subject: [TYPES/announce] Foundation Sciences Mathematiques de Paris: post-doc and post-graduate programs Message-ID: <4CE940E5.2000307@pps.jussieu.fr> Dear colleagues, The Foundation Sciences Mathematiques de Paris www.sciencesmaths-paris.fr that covers all fields of mathematics as well as (theoretical) computer science, has opened its 2011 programs, including a (1 year or 2 years) postdoc program, and a post-graduate education program. POSTDOC PROGRAMME: Applications that are particularly suited for one of the three computer science research labs of the Foundation: LIAFA and PPS, at university Paris 7 - Paris Diderot: www.liafa.jussieu.fr and www.pps.jussieu.fr DI - LIENS at Ecole Normale Sup?rieure: www.di.ens.fr or/and for one of the research teams of INRIA Rocquencourt associated with the Foundation are welcome. The deadline for postdoc applications is **** December 14, 2010 **** The application procedure is as indicated on the website of the Foundation (English version available). But I can only highly recommend that potential candidates take prior contacts with a member of the hosting laboratory or team. Only candidates with a clear research fit, and a high research profile may have a chance to win this tough competition, given its broad scope! Don't hesitate to contact me or one of my colleages in Paris 7 University and Ecole Normale Superieure for further details or advice. POST-GRADUATE PROGRAMME. The students who will be selected under this programme will be enrolled in the wide and already well-established Master Parisien de Recherche in Informatique (some courses are offered in English), or in the Computer Science curriculum of the ENS: http://mpri.master.univ-paris7.fr/ http://predoc.di.ens.fr/ The deadline for postgraduate applications is (also) **** December 14, 2010 **** If you wish to recommend a particularly good and motivated student, we recommend that you contact a close colleague working in one of the labs and teams of the Foundation. Best regards, Thomas Ehrhard, PPS -------------- next part -------------- An HTML attachment was scrubbed... URL: From hidaka at nii.ac.jp Tue Nov 23 17:03:32 2010 From: hidaka at nii.ac.jp (Soichiro Hidaka) Date: Wed, 24 Nov 2010 07:03:32 +0900 Subject: [TYPES/announce] NII Shonan Meetings - Call for seminar proposals Message-ID: <20101124070332Z.hidaka@nii.ac.jp> NII SHONAN MEETINGS: CALL FOR PROPOSAL (1) Objective NII Shonan Meetings, following the well-known Dastughl Seminars, aim to promote informatics and informatics research at an international level, by providing yet another world's premier venue for world-class scientists, promising young researchers, and practitioners to come together in Asia to exchange their knowledge, discuss their research findings, and explore a cutting-edge informatics topics. The meetings are held in Shonan Village Center (near Tokyo), which offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. The friendly and open atmosphere is to promote a culture of communication and exchange among the meeting participants. The NII International Meetings are managed by National Institute of Informatics (NII) in Japan. (2) Scope and Style NII Shonan Meetings follow the style of the Dagstuhl Seminars. A meeting usually lasts for four days (Monday to Thursday) or shorter. It is initiated by at most three organizers (one from Asia), established leaders in their field, representing the different communities invited to the Seminar, preferably from different institutions. NII invites on their behalf about 25 to 35 researchers of international standing from academia and industry. Like Dagstuhl Seminars, an NII Shonan Meeting typically does not come with a fixed program. Instead, the pace and the program are guided by topics and presentations that evolve through discussions. In particular, NII does not require participants to submit a paper for presentation, or to give a presentation at all. On the contrary, NII encourages to present new ideas and work in progress. All administrate work of a meeting will be supported by the NII team in the preparation phase and during the seminars themselves, so that the organizers can focus on choosing research topics and selecting active researchers for the meeting. (3) Proposal Submissions NII invites international standing scientists to submit proposals for international meetings (with about 25-35 participants) on any topics of informatics. The proposal should clearly motivate the topic of your seminar and include the following items: - Meeting Title - Organizers (at most three, 1-page CV for each) - Proposed Dates for the Meeting - Description of the Meeting (1-2 pages, in English) - Invitation list (Title/Name/Afflication/Email/URL) The proposal should be submitted via the following easychair page: http://www.easychair.org/conferences/?conf=nim1 The proposal will be reviewed by the Academic Committee. Once the proposal is approved, our staff will help to organize the seminar. We welcome proposal submission anytime through a whole year, although submission is closed in June 15th & December 15th. Notification of acceptance is only made after about 40 days of each closing day. (4) Locations and Expenses The meetings are held in Shonan Village Center (near Tokyo), whose nearest train station can be accessed by a direct train from Narita International Airport, and offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. http://www.shonan-village.co.jp/svc/ The following rates cover overnight accommodation (single room) and full board (breakfast, lunch, and dinner) per day: - Meeting organizers: free - Participants from academia: 8000 Yen/day - Participants from industry and accompanying persons: 15,000 Yen/day (5) Organizing Committee Yoh'ichi Tohkura (NII): Chair Zhenjiang Hu (NII) Akiko Aizawa (NII) Hiroshi Hosobe (NII) Hiroyuki Kato (NII) Soichiro Hidaka (NII) (6) Inquiry Should you have any questions, please feel free to contact us by sending an email to shonan at nii.ac.jp More information about NII Shonan Meetings is available at the following website: http://www.nii.ac.jp/shonan/ ============================================================ Soichiro Hidaka, Ph.D. Assistant Professor Information Systems Architecture Research Division National Institute of Informatics, JAPAN E-mail: hidaka at nii.ac.jp URL : http://research.nii.ac.jp/~hidaka ============================================================ From andrei at chalmers.se Wed Nov 24 08:50:19 2010 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Wed, 24 Nov 2010 14:50:19 +0100 Subject: [TYPES/announce] PhD and Postdoc Positions in Language-based Security at Chalmers Message-ID: <4CED181B.6080705@chalmers.se> *PhD* and *Postdoc* Positions in Programming Language-based Security Dept. of Computer Science and Engineering, Chalmers University of Technology, Sweden Application deadline: January 12, 2011 ------------------------------------------------------------------------ *Job description* The PhD students and postdocs will join a world-leading team of researchers on programming language-based security. Language-based security facilitates specifying and enforcing security policies at the level of programming languages early in the software design and construction phase. The focus of the advertised positions is on the following directions of work: - To design rich security policies for confidentiality and integrity, as demanded by practical applications (such as web applications). - To develop practical enforcement mechanisms for these policies in expressive programming languages (such as web languages). These enforcement mechanisms may combine static (for example, type system-based) and dynamic (for example, execution monitoring-based) techniques. - To support the above with case studies in web-application security. In pursuing these goals, there are possibilities for collaboration with our high-profile academic and industrial partners. ------------------------------------------------------------------------ *Details about Employment* PhD student positions are limited to five years and will then normally include 20 per cent departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers' general agreement for PhD student positions. Currently the starting salary is around 25,000SEK a month before tax. The positions are intended to start in spring or fall 2011. Postdoc positions are typically for one year with possibility for extension with one year (two years in total is the typical duration). As a Chalmers employee, the monthly salary will be set according to current salary agreements (currently around 33,000SEK before tax). The starting date is negotiable. ------------------------------------------------------------------------ *Suitable Background* Applicants for a PhD position must have a degree in Computing Science or in a related subject with a strong Computing Science component. They must also have a strong, documented interest in doing research. The ideal candidate for the project will have strong background in both programming languages and security. You may even apply if you have not yet completed your degree, but expect to do so before the position starts. Applicants for a Postdoc position should have a recent PhD degree in Computing Science. They must have a well-documented research track record. Expertise in either programming languages or security and interest to both areas is a prerequisite. You may even apply if you have not yet completed your PhD degree, but expect to do so before the position starts. ------------------------------------------------------------------------ *The Department* The department provides a strong, international, and dynamic research environment with about 75 faculty and 75 PhD students. For more information, see http://www.chalmers.se/cse/EN/ . Knowledge of Swedish is not a prerequisite for application. English is our working language for research. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes. The rest come from more than 30 different countries. ------------------------------------------------------------------------ *How to Apply* Electronic application can be submitted following these guidelines: PhD positions: http://www.chalmers.se/cse/EN/news/vacancies/positions/phd-student-positions-in Postdoc positions: http://www.chalmers.se/cse/EN/news/vacancies/positions/post-doc-positions-in From tarmo at cs.ioc.ee Sat Nov 27 12:56:03 2010 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sat, 27 Nov 2010 19:56:03 +0200 Subject: [TYPES/announce] 16th Estonian Winter School in Comput. Sci., Call for Partic. Message-ID: <20101127195603.7991c82c@duality> [Lecturers: Boyen, Gor?, Hofmann, Jacobs, Sadeghi. Place/time: Palmse, Estonia, 27 Feb-4 March 2011. Deadline for application and submission of abstracts for student talks: ** 14 Jan 2011 **.] CALL for PARTICIPATION 16th Estonian Winter School in Computer Science, EWSCS '11 Palmse, Estonia, 27 Feb-4 March 2011 http://cs.ioc.ee/ewscs/2011/ BACKGROUND AND OBJECTIVES EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics, a research institute of Tallinn University of Technology. The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The working language of the schools is English. EWSCS '11 is the sixteenth event of the series. PROGRAMME The schools' scientific programme consists of short courses by renowned specialists and a student session. Courses of EWSCS '11 * Xavier Boyen (Universit? de Li?ge, Belgium): Lattice-based cryptology * Rajeev Gor? (Australian National University, Canberra, Australia): Automated reasoning in modal, tense and temporal logics * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen, Germany): Amortized resource analysis * Bart Jacobs (Radboud Universiteit Nijmegen, The Netherlands): Introduction to coalgebra * Ahmad-Reza Sadeghi (Technische Universit?t Darmstadt and Fraunhofer-Institut f?r Sichere Informationstechnologie, Germany): Trusted and trustworthy computing: are we ready for clouds? The purpose of the student session is to give students an opportunity to present their work (typically, thesis work) and get feedback. Registrants are invited to propose short talks (20 min) on topics of theoretical computer science, broadly understood. The selection will be based on abstracts of 150-400 words. The social programme consists of an excursion and a conference dinner. VENUE Palmse is a small settlement 80 kms to the east from Tallinn in the county of L??ne-Viru. It is renowned for a large manor that used to belong to the von Pahlen family, today hosting the visitors' center of the Lahemaa National Park, a museum, and a hotel. Tallinn, Estonia's capital, is famous for its picturesque medieval Old Town, a UNESCO World Heritage site. In 2011, Tallinn, along with Turku in Finland, is the cultural capital of Europe. There are direct flights to Tallinn Lennart Meri airport from Amsterdam, Brussels, Copenhagen, Dublin, D?sseldorf Weeze, Edinburgh, Frankfurt, Gothenburg, Helsinki, Kiev, London Gatwick, Luton and Stansted, Milan Bergamo and Malpensa, Moscow, Munich, Oslo Gardermoen and Rygge, Prague, Riga, Stockholm Arlanda and Skavsta, St Petersburg, Warsaw and Vilnius, ferries from Stockholm and Helsinki. From Vilnius, Riga, St Petersburg the Lux Express coach services are the practical travel option. APPLICATION AND COST The deadline for application and submission of student talk abstracts is 14 January 2011. All applicants will be notified of admission to the school and acceptance of their talks by 28 January 2011. Admitted applicants are entitled and expected to attend the courses and student session of the school. They will also receive a binder with the course material and access to additional materials on the school website. The participation fee is 320 EUR and includes full board accommodation at Palmse, transportation from Tallinn to Palmse, the excursion and conference dinner (by contributing towards the associated expense). We may be able to reduce the fee for a small number of participants. To apply for fee reduction, please fill in the online fee reduction request form. PROGRAMME COMMITTEE / ORGANISING COMMITTEE * Tarmo Uustalu (Institute of Cybernetics) (chair) * Monika Perkmann (Institute of Cybernetics) (secretary) * Helger Lipmaa (Cybernetica AS) * Peeter Laud (Cybernetica AS) * Varmo Vene (University of Tartu) * Sven Laur (University of Tartu) SPONSORS * Tiger University Plus programme of the Estonian Information Technology Foundation * Estonian Centre of Excellence in Computer Science, EXCS, funded by the European Regional Development Fund FURTHER INFORMATION Details on the application procedure and cost, submission of student talk abstrats are available from the school webpage, http://cs.ioc.ee/ewscs/2011/. Questions should be sent to ewscs11(at)cs.ioc.ee. From kremer at lsv.ens-cachan.fr Mon Nov 29 15:20:19 2010 From: kremer at lsv.ens-cachan.fr (Steve Kremer) Date: Mon, 29 Nov 2010 21:20:19 +0100 Subject: [TYPES/announce] Information and Computation special issue on security and rewriting Message-ID: <4CF40B03.2070607@lsv.ens-cachan.fr> Special issue of Information and Computation on Security and Rewriting Techniques http://www.lsv.ens-cachan.fr/~kremer/secret-special-issue/ Call for Papers Scope: Rewriting Techniques in a broad sense, including for instance constraint solving techniques, logic programming and automata techniques, have been recently applied with success in various areas of security. Typical examples include security protocols, security policies, web services, and access control. We seek submissions of original research papers in these areas. They will be evaluated according to the high standards of Information and Computation and accepted papers will appear in a special issue of this journal. Submissions: Submissions, in pdf format, must be sent to the two guest editors by E-mail, no later than February 18, 2011 We encourage the use of Elsevier's elsarticle.cls latex macro package, that can be retrieved from http://www.elsevier.com/wps/find/authorsview.authors/elsarticle Editors: Steve Kremer kremer at lsv.ens-cachan.fr Paliath Narendran dran at cs.albany.edu Please send any further inquiry to any of the two above editors. From jeremy.siek at colorado.edu Tue Nov 30 11:20:42 2010 From: jeremy.siek at colorado.edu (Jeremy Siek) Date: Tue, 30 Nov 2010 09:20:42 -0700 Subject: [TYPES/announce] Call for Participation - PEPM'11 (co-located with POPL'11) Message-ID: =============================================================== CALL FOR PARTICIPATION ACM SIGPLAN 2011 Workshop on Partial Evaluation and Program Manipulation (PEPM'11) Austin Texas, USA, January 24-25, 2011 20th Anniversary Edition (Affiliated with POPL'11) http://www.program-transformation.org/PEPM11 =============================================================== PEPM 2011 is the 20th edition of the PEPM series! To celebrate this 20th anniversary, the program chairs from the first PEPM, Charles Consel and Olivier Danvy, will give invited talks on the first day of the conference and Martin Rinard will give the invited talk on the second day of the conference. INVITED TALKS: * Charles Consel (INRIA/LaBRI/University of Bordeaux, France) Title: DiaSuite: A Paradigm-Oriented Software Development Approach * Olivier Danvy (Aarhus University, Denmark) Title: A Walk in the Semantic Park * Martin Rinard (MIT, USA) Title: Probabilistic Accuracy Bounds for Perforated Programs Abstracts of all papers and presentations are available from the above web site. CONTRIBUTED TALKS: * Torben Mogensen. Partial Evaluation of the Reversible Language Janus * Yuta Ikeda and Susumu Nishimura Calculating Tree Navigation with Symmetric Relational Zipper * Enrique Martin-Martin. Type Classes in Functional Logic Programming * Tim Bauer, Martin Erwig, Alan Fern and Jervis Pinto. Adaptation-Based Programming in Java * Hugo Pacheco and Alcino Cunha. Calculating with Lenses: Optimising Bidirectional Transformations * Rinus Plasmeijer, Peter Achten, Pieter Koopman, Bas Lijnse, Thomas van Noort and John van Groningen. iTasks for a Change - Type-safe run-time change in dynamically evolving workflows * Joao Paulo Fernandes, Joao Saraiva, Daniel Seidel and Janis Voigtlander. Strictification of Circular Programs * Carl Friedrich Bolz, Antonio Cuni, Maciej Fijalkowski, Michael Leuschel, Samuele Pedroni and Armin Rigo. Allocation Removal by Partial Evaluation in a Tracing JIT * Rafael Caballero. A Program Transformation for Returning States in Functional-Logic Programs * Dimitrios Vardoulakis and Olin Shivers. Ordering Multiple Continuations on the Stack * Olaf Chitil. A Semantics for Lazy Assertions * Peter A. Jonsson and Johan Nordlander. Taming Code Explosion in Supercompilation * Jacques Carette, Mustafa Elsheikh and Spencer Smith. A Generative Geometric Kernel * Yan Wang and Veronica Gaspes. An Embedded Language for Programming Protocol Stacks in Embedded Systems * Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hahnle, German Puebla and Guillermo Roman Diez. Verified Resource Guarantees using COSTA and KeY IMPORTANT DATES: * Early registration deadline: December 31, 2010 * Hotel registration deadline: December 21, 2010 *** Important note: This year, the registration for POPL is capped at 300 in order to provide an optimal conference experience at the Omni Hotel (students who receive travel grants are not subject to the cap). Therefore, please register early! -- ____________________________________ Jeremy Siek http://ecee.colorado.edu/~siek/ Assistant Professor Dept. of Electrical, Computer, and Energy Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: From sweirich at cis.upenn.edu Tue Nov 30 16:17:57 2010 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Tue, 30 Nov 2010 16:17:57 -0500 Subject: [TYPES/announce] TLDI 2011 Call for participation Message-ID: ********************************************************************* CALL FOR PARTICIPATION TLDI 2011 ACM SIGPLAN Workshop on Types in Language Design and Implementation 25 January 2011 Austin, TX, USA To be held in conjunction with POPL 2011 http://www.mpi-sws.org/~dreyer/tldi2011/ ********************************************************************* IMPORTANT DATES Deadline for student travel grant applications: December 17, 2010 Hotel reservation deadline: December 21, 2010 Notification of student travel awards: December 27, 2010 Early registration deadline: December 31, 2010 VENUE TLDI'11 and all POPL'11 affiliated events will take place at the Omni Austin Hotel in downtown Austin, TX. REGISTRATION To register for TLDI'11, follow the link from the POPL 2011 page, at https://regmaster3.com/2011conf/POPL11/register.php SCOPE The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. WORKSHOP PROGRAM Session 1: Invited Talk (9:30 - 10:30) Type Design Patterns for Computer Mathematics Georges Gonthier (Microsoft Research, Cambridge) Break (10:30-11:00) Session 2 (11:00-12:30) Singleton: A General-Purpose Dependently-Typed Assembly Language Simon Winwood and Manuel Chakravarty A Type and Effect System for Deadlock Avoidance in Low-Level Languages Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas Extended Alias Type System using Separating Implication Toshiyuki Maeda, Haruki Sato and Akinori Yonezawa Lunch (12:30-14:30) Session 3: Invited Talk (14:30-15:30) Type Safety from the Ground Up Chris Hawblitzel (Microsoft Research, Redmond) Break (15:30-16:00) Session 4 (16:00-17:30) AuraConf: A Unified Approach to Authorization and Confidentiality Jeffrey Vaughan Information Flow Enforcement in Monadic Libraries Dominique Devriese and Frank Piessens The Essence of Monotonic State Alexandre Pilkiewicz and Fran?ois Pottier From pmt6sbc at maths.leeds.ac.uk Wed Dec 1 08:55:48 2010 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Wed, 1 Dec 2010 13:55:48 +0000 (GMT) Subject: [TYPES/announce] New: Algorithmic Randomness and Complexity Message-ID: BOOK ANNOUNCEMENT: ********************************************************************** Rodney G. Downey and Denis R. Hirschfeldt: 'Algorithmic Randomness and Complexity' (Springer, November 2010) One of the most eagerly anticipated books for some years has finally been published. It is the first book in the new CiE book series "Theory and Applications of Computability". Please ensure your library orders this mammoth work, a book destined to be a standard reference work in the field for many years. For ordering details see the Springer webpage: http://www.springer.com/mathematics/numerical+and+computational+mathematics/book/978-0-387-95567-4 or Amazon: http://www.amazon.com/Algorithmic-Randomness-Complexity-Applications-Computability/dp/0387955674 And for the Springer page for the series: http://www.springer.com/series/8819 ********************************************************************** For a printable flyer for your notice board, giving information on the book series see: http://www.maths.leeds.ac.uk/cie/images/DH.flyer.pdf There are further exciting book titles in the series on the way. And the editors are looking for new proposals for books. __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2011 http://cie2011.fmi.uni-sofia.bg CiE 2012 http://www.cie2012.eu CiE Membership Application Form http://www.cs.swan.ac.uk/acie CiE on Twitter http://twitter.com/AssociationCiE __________________________________________________________________________ From samo at imm.dtu.dk Wed Dec 1 14:13:59 2010 From: samo at imm.dtu.dk (=?iso-8859-1?Q?Sebastian_Alexander_M=F6dersheim?=) Date: Wed, 1 Dec 2010 20:13:59 +0100 Subject: [TYPES/announce] ARSPA-WITS 2011 - deadline extension Message-ID: <19DA828C-D59B-433D-B94F-E9A34ED36046@imm.dtu.dk> Due to several requests, the deadline is extended to December 10 for abstracts and December 17 for papers. CALL FOR PAPERS =============== ARSPA-WITS'11 Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security http://www.avantssar.eu/arspa-wits11 Saarbruecken, Germany March 26-27, 2011 Affiliated with ETAPS 2011 IMPORTANT DATES =============== Abstract due: (extended) December 10, 2010 Papers due: (extended) December 17, 2010 Author Notification: January 21, 2011 SCOPE ===== Computer security is an established field of computer science of both theoretical and practical significance. In recent years, there has been increasing interest in logic-based foundations for various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application to confidentiality policies, system composition, and covert channel analysis. We are interested both in new results in theories of computer security and also in more exploratory presentations that examine open questions and raise fundamental concerns about existing theories, as well as in new results on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. We thus solicit submissions of papers both on mature work and on work in progress. Possible topics include, but are not limited to: Automated reasoning techniques Composition issues Formal specification Verification methods Information flow analysis Language-based security Logic-based design Program transformation Security models Static analysis Quantitative and statistical methods Tools for Access control and resource usage control Authentication Availability and denial of service Covert channels analysis Anonymity, privacy and confidentiality Integrity Intrusion detection Preventing malicious code Mobile code Trust management Security policies Security protocols SUBMISSION AND PUBLICATION ========================== All submissions will be peer-reviewed. Authors of accepted papers must guarantee that their paper will be presented at the workshop. To preserve ARSPA-WITS's tradition of being an open forum, authors may decide whether they would like a revised version of a paper to appear in the post-proceedings. Authors should clearly state at time of submission whether a paper is intended for presentation only or also for publication: this should be stated at the end of the abstract of the paper. Papers for presentation only may substantially overlap other (cited) work of the authors. This choice will not affect the selection procedure in any other way. Submissions should be at most 16 page long excluding references and appendices with a total length not exceeding 20 pages. Manuscripts should be written in the Springer LNCS style available at the URL http://www.springer.com/lncs. If your paper does not fit into this page limit, please contact the Program Chairs before submitting your paper. Authors are invited to submit their papers electronically, as portable document format (pdf) or postscript (ps); please, do not send files formatted for work processing packages (e.g., Microsoft Word or Wordperfect files). The only mechanism for paper submissions is via the electronic submission web-site powered by EasyChair: http://www.easychair.org/conferences/?conf=arspawits11 The post-proceedings of the workshop will be published by Springer in the LNCS series. PROGRAM COMMITTEE ================= Alessandro Armando (Universita` di Genova & Fondazione Bruno Kessler, Italy) Lujo Bauer (CMU, USA) Achim D. Brucker (SAP Research, Germany) Yannick Chevalier (Universite' de Toulouse, France) Luca Compagna (SAP Research, France) Jorge Cuellar (Siemens AG, Germany) Cas Cremers (ETH Zurich, Switzerland) Pierpaolo Degano (Universita` di Pisa, Italy) Riccardo Focardi (Universita` Ca' Foscari di Venezia) Dieter Gollmann (Hamburg University of Technology, Germany) Joshua Guttman (Worcester Polytechnic Institute, USA) Jan Juerjens (TU Dortmund and Fraunhofer ISST, Germany) Gavin Lowe (Oxford University, UK) Catherine Meadows (Naval Research Laboratory, USA) John Mitchell (Stanford University, USA) Sebastian A. Moedersheim (Technical University of Denmark; co-chair) Catuscia Palamidessi (INRIA and LIX, France; co-chair) Michael Rusinowitch (INRIA-Lorraine, France) Mark Ryan (University of Birmingham, UK) Vladimiro Sassone (University of Southampton, UK) Geoffrey Smith (Florida International University, USA) Graham Steel (LSV, INRIA & CNRS & ENS-Cachan, France) Luca Vigano` (Universita` di Verona, Italy) Bogdan Warinschi (University of Bristol, UK) From Jean-Yves.Marion at loria.fr Thu Dec 2 00:47:49 2010 From: Jean-Yves.Marion at loria.fr (Jean-Yves Marion) Date: Thu, 2 Dec 2010 06:47:49 +0100 Subject: [TYPES/announce] Second call for papers : DICE 2011 / ETAPS Message-ID: <57DEBB07-1E13-49CF-AD04-ED96D103142B@loria.fr> ------------------------------------------------------------------------------ ------- Call for papers --------- ---------------------------------------------------------------------------------- Second International Workshop on Developments in Implicit Computational complExity (DICE 2011) http://dice11.loria.fr/ April, 2nd-3rd, Saarbr?cken, Germany as part of ETAPS 2011 ----------------------------------------------------------------------------------- SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity- bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 2010 at ETAPS. Before that, several meetings on this topic had already been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) , and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html). INVITED SPEAKERS: * Martin Hofmann * Daniel Leivant * Ricardo Pe?a IMPORTANT DATES: * Paper submission: December 15th, 2010 * Notification date: January 27th, 2011 * Final version due: February 8th, 2011 * Workshop: April 2nd-3rd, 2011 SUBMISSION PROCEDURE: There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be sumbitted electronically, as pdf files, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. We plan to publish post-proceedings. PROGRAMME COMMITTEE: Amir Ben-Amram (Academic College of Tel-Aviv) Patrick Baillot (ENS Lyon, CNRS) Jean-Yves Marion (Universit? de Lorraine) (Chair) Simone Martini (Universit? di Bologna) Damiano Mazza (Universit? Paris 13) Georg Moser (Universit?t Innsbruck) Ricardo Pe?a (Universidad de Madrid) Luca Roversi (Universit? di Torino) Jim Royer (Syracuse University) STEERING COMMITTEE: Patrick Baillot (ENS Lyon, CNRS) (Chair) Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) Jean-Yves Marion (Universit? de Lorraine) Simona Ronchi Della Rocca (Universit? di Torino) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: Jean-Yves.Marion at loria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From scaladays2011 at cunei.com Fri Dec 3 10:38:48 2010 From: scaladays2011 at cunei.com (Antonio Cunei) Date: Fri, 03 Dec 2010 16:38:48 +0100 Subject: [TYPES/announce] CFP: The Second Scala Workshop - Scala Days 2011 Message-ID: <4CF90F08.50504@cunei.com> The Second Scala Workshop ========================= Call for Papers --------------- Scala is a general purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. This workshop is a forum for researchers and practitioners to share new ideas and results of interest to the Scala community. The secondn annual workshop will be held at Stanford University in the San Francisco Bay Area, on Thursday the 2nd of June 2011, co-located with Scala Days 2011 (2nd-3rd of June). We seek papers on topics related to Scala, including (but not limited to): 1. Language design and implementation -- language extensions, optimization, and performance evaluation. 2. Library design and implementation patterns for extending Scala -- embedded domain-specific languages, combining language features, generic and meta-programming. 3.Formal techniques for Scala-like programs -- formalizations of the language, type system, and semantics, formalizing proposed language extensions and variants, dependent object types, type and effect systems. 4. Concurrent and distributed programming -- libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. 5. Safety and reliability -- pluggable type systems, contracts, static analysis and verification, runtime monitoring. 6. Tools -- development environments, debuggers, refactoring tools, testing frameworks. 7. Case studies, experience reports, and pearls Important Dates --------------- Submission: Tuesday, Feb 8, 2011 (24:00 in Apia, Samoa) Notification: Tuesday, Mar 15, 2011 Final revision: Friday, Apr 15, 2011 Workshop: Thursday, Jun 2, 2011 Submission Guidelines --------------------- Submitted papers should describe new ideas, experimental results, or projects related to Scala. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. Submissions must be in English and at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (10pt). No formal proceedings will be published, but there will be a webpage linking to all accepted papers. The workshop also welcomes short papers. The papers can be submitted by using the Scala Workshop EasyChair website: http://www.easychair.org/conferences/?conf=days2011 Additional details about the Scala Days 2011 event are available at: http://days2011.scala-lang.org. Program Committee ----------------- Nathan Bronson, Stanford University Miguel Garcia, EPFL Klaus Havelund, Jet Propulsion Laboratory Cay Horstmann, San Jose State University Doug Lea, State University of New York at Oswego Nate Nystrom, University of Lugano Martin Odersky, EPFL (chair) Kunle Olukotun, Stanford University James Strachan, FuseSource From rensink at cs.utwente.nl Tue Dec 7 05:18:17 2010 From: rensink at cs.utwente.nl (Arend Rensink) Date: Tue, 07 Dec 2010 11:18:17 +0100 Subject: [TYPES/announce] Reminder: EAPLS PhD Award 2010: Call for Nominations (deadline 31-12-2010) Message-ID: <4CFE09E9.9080307@cs.utwente.nl> EAPLS PhD Award 2010: Call for Nominations ========================================== URL: http://eapls.org/pages/phd_award/ The European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. Eligibility ----------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 January 2009 ? 1 November 2010 Nominations ----------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to http://www.easychair.org/conferences/?conf=eaplsphd2010. The nomination must be accompanied by (a zip file containing) * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. Procedure --------- The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2010. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. Important dates --------------- 31 December 2010: Deadline for nominations 1 March 2011: Announcement of the award winner Expert committee ---------------- The Expert committee consists of the following members: * Roland Backhouse, University of Nottingham, U.K. * Rastislav Bodik, University of California at Berkeley, U.S.A. * Eerke Boiten, University of Kent, U.K. * Mark van den Brand, Universiteit Eindhoven, The Netherlands * Maurice Bruynooghe, University of Leuven, Belgium * Paolo Ciancarini, University of Bologna, Italy * Olivier Danvy, University of Aarhus, Denmark * Kei Davis, Los Alamos National Laboratory, U.S.A. * David de Frutos Escrig, Univers?dad Complutense de Madrid, Spain * Pierpaolo Degano, University of Pisa, Italy * JosuKa D?az Labrador, Universidad de Deusto, Spain * Marko van Eekelen, Radboud University Nijmegen * Maurizio Gabbrielli, University of Bologna, Italy * Giorgio Ghelli, University of Pisa, Italy * Stefan Gruner, University of Pretoria, South Africa * Kevin Hammond, University of St Andrews, U.K. * Manuel Hermenegildo, Universidad Polyt?cnica de Madrid, Spain * Paul Klint, CWI and University of Amsterdam, The Netherlands * Jens Knoop, Technische Universit?t Wien, Austria * Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. * Tiziana Margaria, University of Potsdam, Germany * Alan Mycroft, Cambridge University, U.K. * Catuscia Palamidessi, Ecole Polytechinique, Paris, France * Arnd Poetsch-Heffter, University of Kaiserslautern, Germany * Arend Rensink, Universiteit Twente, The Netherlands * Bernhard Steffen, Technical University of Dortmund, Germany * Peter Thiemann, University of Freiburg, Germany * Peter Van Roy, Universit? Catholique de Louvain, Belgium From p.gardner at imperial.ac.uk Wed Dec 8 11:40:36 2010 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Wed, 8 Dec 2010 16:40:36 +0000 Subject: [TYPES/announce] lectureship at Imperial Message-ID: <9EE11386-7E14-46E9-ADC6-46BC5DC4DE65@imperial.ac.uk> There's a lectureship going in Imperial (actually we're hoping it'll turn into two). Deadline 10th January. Philippa Imperial College London Department of Computing Lectureship Post (equiv. Assistant Professor) Lectureship Salary: GBP 42,500 to GBP 47,450 per annum Imperial College London is a world leading university whose reputation for excellence in teaching and research attracts students and staff of the highest international quality. The three Faculties - Engineering, Natural Sciences and Medicine - together with the Business School explore the interface between science, medicine, engineering and management. The Department of Computing is a leading department of Computer Science among the UK Universities. It has consistently been awarded the highest research rating (5*) in Research Assessment Exercises and was rated as "Excellent" in the previous national assessment of teaching quality. Research in the Department is clustered into the following themes: Computer Systems, Human Centered Computing, Logic & Artificial Intelligence, Theory of Computational Systems, Quantitative Analysis and Optimization, Distributed Software Engineering and Visual Information Processing. Applications are invited for Lectureship positions in the Department of Computing in any of the above areas. Candidates are expected to have a proven international record relevant to the above areas and will be expected to play a full part in the teaching and administrative activities of the Department. For further information on the Department visit http://www.imperial.ac.uk/computing. Interviews will be held in mid February 2011. For more details regarding the position, please refer to http://www.imperial.ac.uk/computing/vacancies Our preferred method of application is online via this website: http://www.imperial.ac.uk/employment. Please download the following application form and save to your computer. Once completed, please upload your application form prior to submitting your application. In addition to the application form, you should attach a full CV (including a list of publications) that covers any aspects of your career not covered by the online form, a 2-3 page statement of your research plans over the next 5 years and a brief statement of your teaching interests. Should you have any queries regarding the application process contact Margaret Hall by email at: margaret.hall at imperial.ac.uk Closing date: 10 January 2011. Committed to equality and valuing diversity. We are an Athena Silver SWAN Award winner and a Stonewall Diversity Champion. From G.A.McCusker at bath.ac.uk Thu Dec 9 06:46:50 2010 From: G.A.McCusker at bath.ac.uk (Guy McCusker) Date: Thu, 9 Dec 2010 11:46:50 +0000 Subject: [TYPES/announce] PhD opportunities in Computer Science at Bath Message-ID: ** PhD studies in Logic and Semantics of Computation at Bath *** **** Apply by January 18th 2011 to be considered for University Research Studentships **** Applications are invited for PhD study in the Logic and Semantics of Computation research group at the University of Bath. Our staff include Alessio Guglielmi, Jim Laird, Guy McCusker and John Power. We welcome students interested in logic and proof theory, semantics of programming languages and proof systems, and category theory. The research publications of the Department of Computer Science at Bath were ranked 3rd in the UK at the 2008 Research Assessment Exercise. The department's other research interests include computer algebra, computational geometry, logic programming, computer vision and graphics, artificial intelligence, agents, and human-computer interaction. A wide range of funding opportunities, including full stipendiary studentships as well as scholarships and fee-waivers, is available, for studies commencing in October 2011. Every application will be considered competitively for all eligible funding sources. The sooner you apply, the more opportunities are available. Applications received by January 18th 2011 will be considered for University Research Studentships, which pay the cost of EU-rate fees and a stipend. Please direct informal enquiries to G.A.McCusker at bath.ac.uk or visit http://www.bath.ac.uk/comp-sci/pgr/phd/ for application details ----- Guy McCusker Professor of Computer Science Dept of Computer Science University of Bath Bath BA2 7AY United Kingdom +44 (0) 1225 383578 -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Thu Dec 9 07:25:32 2010 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Thu, 9 Dec 2010 13:25:32 +0100 Subject: [TYPES/announce] ICFP 2011: Call for papers Message-ID: ===================================================================== Call for Papers ICFP 2011: International Conference on Functional Programming Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011 http://www.icfpconference.org/icfp2011 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Titles, abstracts & keywords due: Thursday 17 March 2011 at 14:00 UTC Submissions due: Thursday 24 March 2011 at 14:00 UTC Author response: Tuesday & Wednesday 17-18 May Notification: Monday 30 May 2011 Final copy due: Friday 01 July 2011 Conference: Monday-Wednesday 19-21 September 2011 Scope ~~~~~ ICFP 2011 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Particular topics of interest include * Language Design: type systems; concurrency and distribution; modules; components and composition; metaprogramming; relations to imperative, object-oriented, or logic programming; interoperability * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; mathematical logic; monads; continuations; delimited continuations; global, delimited, or local effects * Transformation and Analysis: abstract interpretation; partial evaluation; program transformation; program calculation; program proofs; normalization by evaluation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security; education * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By 17 March 2011, 14:00 UTC, submit a title, an abstract of at most 300 words, and keywords. * By 24 March 2011, 14:00 UTC, submit a full paper of at most 12 pages (6 pages for a Functional Pearl and for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm In addition, authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no rewiewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents by signing an additional permission form at the time of the presentation. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available from SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted electronically at a URL to be named later. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on Tuesday 17 May 2010, to read reviews and respond to them. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2011. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Conference Chairs: Manuel M T Chakravarty, University of New South Wales, Australia Zhenjiang Hu, National Institute of Informatics (NII), Japan Program Chair: Olivier Danvy, Aarhus University, Denmark Program Committee: Kenichi Asai, Ochanomizu University, Japan Josh Berdine, Microsoft Research, UK Adam Chlipala, Harvard University, USA William Cook, University of Texas at Austin, USA Maribel Fernandez, King's College London, UK Ronald Garcia, Carnegie Mellon University, USA Neal Glew, Intel Labs, USA Jacques Garrigue, Nagoya University, Japan Suresh Jagannathan, Purdue University, USA Sam Lindley, University of Edinburgh, UK Frank Pfenning, Carnegie Mellon University, USA Paola Quaglia, University of Trento, Italy Alexis Saurin, University of Paris VII, France Mike Spivey, Oxford University, UK Kristian Stoevring, University of Copenhagen, Denmark Doaitse Swierstra, Utrecht University, The Netherlands David Van Horn, Northeastern University, USA Rene Vestergaard, JAIST, Japan Edwin Westbrook, Rice University, USA From swarat at cse.psu.edu Thu Dec 9 13:04:57 2010 From: swarat at cse.psu.edu (Swarat Chaudhuri) Date: Thu, 09 Dec 2010 13:04:57 -0500 Subject: [TYPES/announce] POPL 2011: Call for participation In-Reply-To: Message-ID: ************************************************************** * ? ? ? ? ? ? ? ? ?ACM SIGPLAN-SIGACT Symposium ? ? ? ? ? ? ? ? ? ? * ? ? ? ? ? ? ? ? ? ? ? ? ? ?on ? ? ? ? ? ? ? ? ? ? ? ? ? ? * Principles of Programming Languages ? ? ? ? ? ? ? ? ? * ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? * ? ? ? ?January 26-28, 2011 ? ? ? ? ? ? ? ? ? ? ? ? ? * ? ? ? ?Austin, TX, USA ? ? ? ? ? ? ? ? ? ? ? ? ? * ? ? ? ? ? ? ? ? ? Call for Participation ? ? ? ? ? ? ? ? ? ? ? ? * ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? * http://www.cse.psu.edu/popl/11/ *************************************************************** Important dates ------------------------ * Deadline for student travel grant ?applications for full consideration: December 17, 2010 * Hotel reservation deadline: December 21, 2010 * Early registration deadline: December 31, 2010 * Conference: January 26-28, 2011 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. Hotel ------------------------- All the conference events will take place at the Omni Austin Hotel in downtown Austin, TX. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: ?http://www.cse.psu.edu/popl/11/ To be eligible for the special conference rate, bookings must be made by ** December 21, 2010 **. However, as the conference rate applies only to a limited number of rooms, attendees are encouraged to make their hotel reservations at the earliest opportunity. Registration -------------------------- To register online, please go to ? ? ?https://regmaster3.com/2011conf/POPL11/register.php The early registration deadline is ** December 31, 2010 **. This year, we are capping the registration for POPL at 300 in order to provide an optimal conference experience at the Omni Hotel. Therefore, please register early. Student Attendees -------------------------- The SIGPLAN Professional Activities Committee (PAC) awards travel grants that are typically reserved for students presenting papers or posters at conferences. In addition to the SIGPLAN PAC grants, we are pleased to announce the availability of a limited number of travel awards, though a grant from the National Science Foundation, for students who want to attend the conference but are not presenting. If you are a student interested in learning more about state of the art research in programming language principles, please consider applying for a POPL 2011 travel award. More information about student travel grants are available at the conference homepage. This student travel grant program is designed specifically to encourage participation from junior students and underrepresented groups. Preliminary program -------------------------- A preliminary program can be found at the end of this email in text format, or it can be found here: ?http://www.cse.psu.edu/popl/11/program.html Program Highlights ------------------------- Invited talks: ? * Xavier Leroy (INRIA). "Verified squared: does critical software ? ? ?deserve verified tools?" ? * ?Matthew MacLaurin (Microsoft). "The Design of Kodu: A Tiny ? ? ?Visual Programming Language for Children on the Xbox 360." ?* ?Talks In memory of Robin Milner. Organized by Andrew Gordon ? ? ?(Microsoft) and Peter Sewell (Cambridge). ? ? ?Speakers: Robert Harper (CMU), Alan Jeffrey (Bell Labs), and ? ? John Harrison (Intel). Other attractions ------------------------- POPL Games and Jazz Dinner: The POPL dinner will be at the conference hotel on the evening of Wednesday January 26. It will feature live Jazz music and Xbox/Kinect gaming. Three Kinect-enabled Xboxes, ready to play, will be available before and after the POPL dinner. ? POPL Xbox 360 Raffle We will give away the three Xbox 360 4GB Console with Kinect bundles in a raffle at the very end of the conference. Your POPL registration enters you in the raffle. You must be present to win. General Chair: -------------------------- Thomas Ball Microsoft Research One Microsoft Way, Redmond, WA 98052, USA. tball at microsoft.com Program Chair: --------------------------- Mooly Sagiv Schreiber 317, School of Computer Science Tel-Aviv University, Tel-Aviv 69978, Israel msagiv at post.tau.ac.il Program Committee: --------------------------- Radhia Cousot ? ? ? ? ? ?Ecole Normale Sup??rieure Oege de Moor ? ? ? ? ? ? Oxford University Computing Laboratory Derek Dreyer ? ? ? ? ? ? MPI-SWS Azadeh Farzan ? ? ? ? ? ?University of Toronto Kathleen Fisher ? ? ? ? ?AT&T Laboratories Matthew Fluet ? ? ? ? ? ?Rochester Institute of Technology Jeff Foster ? ? ? ? ? ? ?University of Maryland Stephen Freund ? ? ? ? ? Williams College Philippa Gardner ? ? ? ? Imperial College, London Dan Grossman ? ? ? ? ? ? University of Washington Sumit Gulwani ? ? ? ? ? ?Microsoft Research Tim Harris ? ? ? ? ? ? ? Microsoft Research Naoki Kobayashi ? ? ? ? ?Tohoku University Viktor Kuncak ? ? ? ? ? ?EPFL Ken McMillan ? ? ? ? ? ? Cadence Research Laboratories Anders Moeller ? ? ? ? ? Aarhus University Peter Muller ? ? ? ? ? ? ETH Zurich Aleks Nanevski ? ? ? ? ? IMDEA Software David Naumann ? ? ? ? ? ?Stevens Institute of Technology Prakash Panangaden ? ? ? McGill University G. Ramalingam ? ? ? ? ? ?Microsoft Research Jan Vitek ? ? ? ? ? ? ? ?Purdue University Eran Yahav ? ? ? ? ? ? ? IBM Research Hongseok Yang ? ? ? ? ? ?Queen Mary, University of London Steve Zdancewic ? ? ? ? ?University of Pennsylvania Affiliated Events -------------------------- * DAMP: Declarative Aspects of Multicore Programming ? * January 23, 2011 * Nominal: Tutorial on Using Nominal Isabelle for PL Research ? * January 23, 2011 * PLPV: Programming Languages meets Program Verification ? * January 29, 2011 * PADL: Practical Applications of Declarative Languages ? * January 24-25, 2011 * PEPM: Partial Evaluation and Semantics-Based Program Manipulation ? * January 24-25, 2011 * STOP: Workshop on Script to Program Evolution ?* January 29, 2011 * TLDI:Types in Language Design and Implementation ? * January 25, 2011 * TPTPA: Tutorial on Theorem Proving Tools for Program Analysis ?* January 24-25, 2011 * Verico: Verification of Concurrent Data Structures ?* January 29, 2011 * VMCAI:Verification Model Checking and Abstract Interpretation ? * January 23-25, 2011 Preliminary Program --------------------------- Wednesday, January 26 =========================== * 8:45-9:00: Welcome (Tom Ball, Mooly Sagiv) * 9:00-10:00: Invited Talk ?- "Verified squared: does critical software deserve verified tools?" ? ?Xavier Leroy, INRIA. * 10:00-10:30: Break * 10:30-12:00: Session on Pointer Analysis: - "Points-To Analysis with Efficient Strong Updates." O. Lhotak, K. Chung - "Pick Your Contexts Well: Understanding Object-Sensitivity (The Making of a Precise and Scalable Pointer Analysis)." Y. Smaragdakis, M. Bravenboer, O. Lhotak - "Learning Minimal Abstractions." P. Liang, O. Tripp, M. Naik * 10:30-12:00: Session on Semi-Automated Verification: - "Relaxed-Memory Concurrency and Verified Compilation." J. Sevcik, V. Vafeiadis, F. Zappa Nardelli, S. Jagannathan, P. Sewell. - "Mathematizing C++ Concurrency." M. Batty, S. Owens, S. Sarkar, P. Sewell, T. Weber - "Formal verification of object layout for C++ multiple inheritance." T. Ramananandro, G. Reis, X. Leroy * 12:00-1:30: Lunch * 1:30-3:00: Session on Static Analysis: - "Static Analysis for Multi-Staged Programs via Unstaging Translation." W. Choi, B. Aktemur, K. Yi, M. Tatsuta - "Static analysis of interrupt-driven programs." M. Schwarz, H. Seidl, V. Vojdani, M. Muller-Olm, P. Lammich - "A Parametric Segmentation Functor for Fully Automatic and Scalable Array Content Analysis." ?P. Cousot, R. Cousot, F. Logozzo * 1:30-3:00: Session on Semantic Models and Translations: - "Step-Indexed Kripke Models over Recursive Worlds." L. Birkedal, B. Reus, J. Schwinghammer, K. Stovring, J. Thamsborg, H. Yang - "A Kripke Logical Relation Between ML and Assembly." C. Hur, D. Dreyer - "A typed store-passing translation for general references." F. Pottier * 3:00-3:30: Break * 3:30-5:00: Session on Shape Analysis: - "A Shape Analysis for Optimizing Parallel Graph Programs." D. Prountzos, R. Manevich, K. Pingali, K. McKinley - "Calling Context Abstraction with Shapes." X. Rival, B. Chang - "Precise Reasoning for Programs Using Containers." I. Dillig, T. Dillig, A. Aiken * 3:30-5:00: Session on Type Abstractions: - "Blame for All." A. Ahmed, R. Findler, J. Siek, P. Wadler - "Correct Blame for Contracts: No More Scapegoating." C. Dimoulas, R. Findler, C. Flanagan, M. Felleisen - "Generative type abstraction and type-level computation." ?S. Weirich, D. Vytiniotis, ?S. Peyton-Jones, S. Zdancewic * 5:00-7:00: Free time * 7:00-8:00: Appetizers, Drinks, and Xbox/Kinect/Kodu Game Room * 8:00-9:30: Buffet Dinner and Jazz * 9:30-11:00: Xbox/Kinect/Kodu Game Room Thursday, January 27 =========================== * 9:00-10:00: Invited Talk ?- "The Design of Kodu: A Tiny Visual Programming Language for Children ? on the Xbox 360." ? ?Matthew MacLaurin, Microsoft ? * 10:00-10:30: Break * 10:30-12:00: Session on Separation Logic: - "A separation logic for refining concurrent objects." A. Turon, M. Wand - "Modular Reasoning for Deterministic Parallelism." M. Dodds, S. Jagannathan, M. Parkinson - "Expressive Modular Fine-Grained Concurrency Specifications." B. Jacobs, F. Piessens * 10:30-12:00: Session on Automata: - "The Tree Width of Auxiliary Storage." P. Madhusudan, G. Parlato - "Fresh-Register Automata." N. Tzevelekos - "Vector Addition System Reachability Problem In Less Than 7 Pages." J. Leroux * 12:00-1:30: Lunch * 1:30-3:00: Session on Synthesis: - "Automating String Processing in Spreadsheets using Input-Output Examples." S. Gulwani - "Constraint Based Inference of Auxiliary Variables and Relies/Guarantees for ?Verifying Multi-Threaded Programs." A. Gupta, C. Popeea, A. Rybalchenko - "Geometry of Synthesis III: Resource management through type inference." D. Ghica, A. Smith * 1:30-3:00: Session on Algebra: - "Multivariate Amortized Resource Analysis." J. Hoffmann, K. Aehlig, M. Hofmann - "Elements of Symmetric Lenses." M. Hofmann, B. Pierce, D. Wagner - "Regular Expression Containment: Coinductive Axiomatization and Computational Interpretation." F. Henglein, L. Nielsen * 3:00-3:30: Break * 3:30-5:00: Session on Model Checking: - "Making Prophecies with Decision Predicates." B. Cook, E. Koskinen - "Delay-bounded scheduling." M. Emmi, S. Qadeer, Z. Rakamaric - "On Interference Abstractions." N. Sinha, C. Wang * 3:30-5:00: Session on Types: - "Dynamic Multirole Session Types." P. Denielou, N. Yoshida - "Practical Affine Types." ?J. Tov, R. Pucella - "Dynamic Inference of Static Types for Ruby." J. An, A. Chaudhuri, J. Foster, M. Hicks * 5:00-5:15: Break * 5:15-6:15: Business Session * 6:15-8:00: Break * 8:00-10:00: Student Presentation Session Friday, January 28 =========================== * 9:00-10:00: Invited Talk ?- "Robin Milner: Verification, Languages, and Concurrency" ? ?Andrew D. Gordon (Microsoft), Peter Sewell (Cambridge), Robert Harper (CMU), ?Alan Jeffrey (Bell Labs), John Harrison (Intel) ? * 10:00-10:30: Break * 10:30-12:00: Session on Complexity: - "Space Overhead Bounds for Dynamic Memory Management with Partial Compaction." A. Bendersky, E. Petrank - "Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated." H. Attiya, R. Guerraoui, D. Hendler, P. Kuznetsov, M. Michael, M. Vechev - "Complexity of Pattern-based Verification for Multithreaded Programs." J. Esparza, P. Ganty * 10:30-12:00: Medley Session: - "EigenCFA: Accelerating flow analysis with GPUs." T. Prabhu, S. Ramalingam, M. Might, M. Ha - "Bisimulation for quantum processes." Y. Feng, R. Duan, M. Ying - "Safe Nondeterminism in a Deterministic-by-Default Parallel Language." R. Bocchino, S. Heumann, N. Honarmand, S. Adve, V. Adve, A. Welc, T. Shpeisman * 12:00-1:30: Lunch * 1:30-3:00: Session on Compilation: - "Loop Transformations: Convexity, Pruning and Optimization." L. Pouchet, U. Bondhugula, C. Bastoul, A. Cohen, J. Ramanujam, P. Sadayappan, N. Vasilache - "The Essence of Compiling with Traces." S. Guo, J. Palsberg - "Resourceable, Retargetable, Modular Instruction Selection Using a Machine-Independent, Type-Based Tiling of Low-Level Intermediate Code." N. Ramsey, J. Dias * 1:30-3:00: Session on Verification: - "Verifying Higher-Order Programs with Pattern-Matching Algebraic Data Types." C. Ong, S. Ramsay - "Streaming Transducers for Algorithmic Verification of Single-Pass List Processing Programs." R. Alur, P. Cerny - "Decidable logics combining heap structures and data." P. Madhusudan, G. Parlato, X. Qiu * 3:00-3:30: Break * 3:30-4:00: - "A Technique for the Effective and Automatic Reuse of Classical Compiler Optimizations on Multithreaded Code." P. G. Joisha, R. S. Schreiber, P. Banerjee, Hans-J. Boehm * 4:00-4:15: Wrap-up and Xbox/Kinect Raffle Drawing From vv at di.fc.ul.pt Fri Dec 10 07:11:44 2010 From: vv at di.fc.ul.pt (Vasco T. Vasconcelos) Date: Fri, 10 Dec 2010 12:11:44 +0000 Subject: [TYPES/announce] Places 2011 - Call for Papers Message-ID: <180BEB91-A934-4E0C-BF46-CE086DD6B774@di.fc.ul.pt> CALL FOR PAPERS PLACES'11 Programming Language Approaches to Concurrency and communication-cEntric Software 2nd April 2011, Saarbr?cken, Germany Affiliated with ETAPS 2011 http://places11.di.fc.ul.pt/ Theme and Goals Applications on the web today are built using numerous interacting services; soon off-the-shelf CPUs will host hundreds of cores; and sensor networks will be composed from a large number of processing units. Much normal software, including applications and system-level services, will soon need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems will be inherently concurrent and communication-centred. To exploit and harness the richness of this computing environment, designers and programmers will utilise a rich variety of programming paradigms, depending on the shape of the data and control flow. Plausible candidates for such paradigms include structured imperative concurrent programming, stream-based programming, concurrent functions with asynchronous message passing, higher-order types for events, and the use of types for communications and data structures (such as session types and linear types), to name but a few. Combinations of these abstractions will be used even in a single application, and the runtime environment needs to ensure seamless execution without relying on differences in available resources such as the number of cores. The development of effective programming methodologies for the coming computing paradigm demands exploration and understanding of a wide variety of ideas and techniques. This workshop aims to offer a forum where researchers from different fields exchange new ideas on one of the central challenges for programming in the near future, the development of programming methodologies and infrastructures where concurrency and distribution are the norm rather than a marginal concern. Topics of Interest Submissions are invited in the general area of foundations of programming languages for concurrency, communication and distribution. Specific topics include: language design and implementations for communications and/or concurrency, program analysis, session types, multicore programming, use of message passing in systems software, interface languages for communication and distribution, concurrent data types, concurrent objects and actors, web services, novel programming methodologies for sensor networks, integration of sequential and concurrent programming, high-level programming abstractions for security concerns in concurrent, distributed programming, and runtime architectures for concurrency, scalability and/or resource allocations. Papers are welcome which present novel and valuable ideas as well as experiences. Submission Guidelines Authors are invited to submit a five-page abstract in PDF format by 10th January using the EasyChair proceedings template available at http://www.easychair.org/easychair.zip. Abstracts and full papers should be submitted using EasyChair, http://www.easychair.org/conferences/?conf=places11. Preliminary proceedings will be available at the workshop. Post-proceedings will be published in a journal (the past post-proceedings were published in ENTCS and EPTCS). Important Dates Deadline of 5-page abstracts: Wednesday 10th Jan 2011 Notification: Wednesday 2nd Feb 2011 Camera Ready for pre-proceedings: Wednesday 9th Feb 2011 Program Committee Marco Carbone, IT University of Copenhagen Swarat Chaudhuri, Pennsylvania State University Alastair Donaldson, Oxford University Tim Harris, Microsoft Research Cambridge Alan Mycroft, University of Cambridge Jens Palsberg, University of California, Los Angeles Vijay A. Saraswat, IBM Research Vivek Sarkar, Rice University (co-chair) Vasco T. Vasconcelos, University of Lisbon (co chair) Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London From swarat at cse.psu.edu Fri Dec 10 11:31:04 2010 From: swarat at cse.psu.edu (Swarat Chaudhuri) Date: Fri, 10 Dec 2010 11:31:04 -0500 Subject: [TYPES/announce] Postdoctoral position in concurrency/parallel programming/verification at Penn State In-Reply-To: <4D0237B8.7090004@cse.psu.edu> Message-ID: Postdoctoral position in concurrency/parallel programming/verification at Penn State --------------------------------------------------------------------- The Programming Languages Laboratory at Pennsylvania State University (http://www.cse.psu.edu/~swarat) is seeking a postdoctoral fellow in the areas of Parallel Programming and Concurrency, for work on a joint research project with the Habanero Multicore Software research group at Rice University (http://habanero.rice.edu). The researcher will be based at Penn State (located at University Park, Pennsylvania) and be jointly mentored by Prof. Swarat Chaudhuri (Penn State) and Prof. Vivek Sarkar (Rice). The position is for two years, but can be potentially renewed. The ideal applicant would have a passion for bringing together theory and practice, an interest in concurrency and parallelism, and deep expertise in one of the following areas: * Program verification and synthesis. We would benefit from expertise in any of the three main approaches to verification/synthesis: abstract interpretation (e.g., concurrent shape analysis), model checking (e.g., model checking of concurrent programs), and deductive reasoning (e.g., axiomatic reasoning about memory models). *** If you have a background in verification but have not previously worked on concurrency, please still consider applying. *** * Models and semantics of concurrency and parallelism (e.g., parallel functional programming, software transactions). * Parallel compilers and runtime systems. To be considered for this position, please send a CV and a brief statement of interest to Swarat Chaudhuri (swarat at cse.psu.edu). From Magne.Haveraaen at ii.uib.no Fri Dec 10 11:47:49 2010 From: Magne.Haveraaen at ii.uib.no (Magne Haveraaen) Date: Fri, 10 Dec 2010 10:47:49 -0600 Subject: [TYPES/announce] PhD position available on the DMPL project at Bergen Language Design Laboratory (BLDL) Message-ID: <4D0259B5.4010901@ii.uib.no> A PhD scholarship is currently available on the project "Design of a Mouldable Programming Language" (DMPL) financed by the Research Council of Norway. DMPL is a research project at the Bergen Language Design Laboratory (BLDL) within the Department of Informatics at the University of Bergen. The project centres around exploring ideas of flexibility, adaptability, genericity and robustness (in short, mouldability) in programming languages. As part of the project, we are designing and implementing the prototype mouldable language Magnolia, and also putting it to real life testing by developing applications using the language. http://bldl.ii.uib.no/dmpl.html Application deadline 2010-12-19 CET through the form at (click in the upper right corner for English): http://www.jobbnorge.no/job.aspx?jobid=70684 Note that the online application procedure is somewhat cumbersome, so start filling in the application well before the deadline. For more information on positions at BLDL: http://bldl.ii.uib.no/vacancies.html -- Magne Haveraaen https://www.ii.uib.no/~magne/ http://bldl.ii.uib.no/ From Klaus.Havelund at jpl.nasa.gov Sat Dec 11 19:02:13 2010 From: Klaus.Havelund at jpl.nasa.gov (Havelund, Klaus (317J)) Date: Sat, 11 Dec 2010 16:02:13 -0800 Subject: [TYPES/announce] [fm-announcements] NFM 2011 - Deadline extension Message-ID: CALL FOR PAPERS *** DEADLINE EXTENSION : December 26, 2010 *** NFM 2011 Third NASA Formal Methods Symposium Pasadena, California, USA April 18 - 20, 2011 http://lars-lab.jpl.nasa.gov/nfm2011 IMPORTANT DATES Submission deadline : *** DEADLINE EXTENDED TO: December 26, 2010 *** Notification of acceptance/rejection : January 28, 2011 Final version due : February 18, 2011 Conference : April 18-20, 2011 THEME The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, government and industry, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. The focus of the symposium is on formal methods, and aims to foster collaboration between NASA researchers and engineers and the wider aerospace and academic formal methods communities. The symposium will be comprised of a mixture of invited talks by leading researchers and practitioners, presentation of accepted papers, and panels. TOPICS OF INTEREST * Theorem proving * Model checking * Real-time, hybrid, stochastic systems * SAT and SMT solvers * Symbolic execution * Abstraction * Compositional verification * Program refinement * Static analysis * Dynamic analysis * Automated testing * Model-based testing * Model-based development * Fault protection * Security and intrusion detection * Application experiences * Modeling and specification formalisms * Requirements specification and analysis INVITED SPEAKERS Rustan Leino, Microsoft Research, USA "From Retrospective Verification to Forward-Looking Development" Oege de Moor, University of Oxford, UK "Do Coding Standards Improve Software Quality?" Andreas Zeller, Saarland University, Germany "Specifications for Free" TUTORIALS Andreas Bauer, NICTA and Australian National University, Australia, and Martin Leucker, University of Luebec, Germany "The Theory and Practice of SALT - Structured Assertion Language for Temporal Logic" Bart Jacobs, Katholieke Universiteit Leuven, Belgium "VeriFast: a Powerful, Sound, Predictable, Fast Verifier for C and Java" Michal Moskal, Microsoft Research, USA "Verification of Functional Correctness of Concurrent C Programs with VCC" HISTORY NFM 2011 is the third edition of the NASA Formal Methods Symposium, organized by NASA on a yearly basis. The first in 2009 and was organized at NASA Ames Research Center, Moffett Field, California. The second in 2010 was organized at NASA head quarters, Washington D.C. The symposium originated from the earlier Langley Formal Methods Workshop series. PAPER SUBMISSION There are two categories of submissions: * Regular paper: up to 15 pages, describing fully developed work and complete results. Papers can present theory, software engineering aspects, or case studies. * Tool papers: up to 6 pages, describing an operational tool. The authors of accepted tool papers will give demonstrations of their tools in tool demo sessions. Tool papers should explain enhancements that have been done compared to previously published work. A tool paper does not need to present the theory behind the tool but can focus more on its features, and how it is used, with screen shots and examples. All papers should be in English and describe original work that has not been published or submitted elsewhere. Submissions will be fully reviewed and the symposium proceedings will appear as a volume in Lecture Notes of Computer Science. Papers must use the LNCS style, and be in pdf format. COSTS There will be no registration fee charged to participants. PROGRAMME CHAIRS Mihaela Bobaru, NASA/Jet Propulsion Laboratory Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Rajeev Joshi, NASA/Jet Propulsion Laboratory PROGRAMME COMMITTEE Rajeev Alur, University of Pennsylvania, USA Tom Ball, Microsoft Research, USA Howard Barringer, University of Manchester, UK Saddek Bensalem, Verimag Laboratory, France Nikolaj Bjoerner, Microsoft Research, USA Eric Bodden, Technical University Darmstadt, Germany Marsha Chechik, University of Toronto, Canada Rance Cleaveland, University of Maryland, USA Dennis Dams, Bell Labs/Alcatel-Lucent, Belgium Ewen Denney, NASA Ames Research Center, USA Matt Dwyer, University of Nebraska, USA Cormac Flanagan, UC Santa Cruz, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Patrice Godefroid, Microsoft Research, USA Alex Groce, Oregon State University, USA Radu Grosu, Stony Brook, USA John Hatcliff, Kansas State University, USA Mats Heimdahl, University of Minnesota, USA Mike Hinchey, Lero - the Irish SW. Eng. Research Centre, Ireland Sarfraz Khurshid, University of Texas at Austin, USA Orna Kupferman, Jerusalem Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Rupak Majumdar, Max Planck Institute, Germany Kenneth McMillan, Cadence Berkeley Labs, USA Cesar Munoz, NASA Langley, USA Madan Musuvathi, Microsoft Research, USA Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Shaz Qadeer, Microsoft Research, USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Nicolas Rouquette, NASA/Jet Propulsion Laboratory, USA Kristin Rozier, NASA Ames Research Center, USA John Rushby, SRI International, USA Wolfram Schulte, Microsoft Research, USA Koushik Sen, Berkeley University, USA Sanjit Seshia, Berkeley University, USA Natarajan Shankar, SRI International, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Ben Di Vito, NASA Langley, USA Mike Whalen, University of Minnesota, USA STEERING COMMITTEE Ewen Denney, NASA Ames Research Center Dimitra Giannakopoulou, NASA Ames Research Center Klaus Havelund, NASA/Jet Propulsion Laboratory Gerard Holzmann, NASA/Jet Propulsion Laboratory Cesar Munoz, NASA Langley Corina Pasareanu, NASA Ames Research Center James Rash, NASA Goddard Kristin Y. Rozier, NASA Ames Research Center Ben Di Vito, NASA Langley -------------- next part -------------- An HTML attachment was scrubbed... URL: From cbraga at ic.uff.br Mon Dec 13 05:52:21 2010 From: cbraga at ic.uff.br (Christiano Braga) Date: Mon, 13 Dec 2010 08:52:21 -0200 Subject: [TYPES/announce] SBLP 2011 - 2nd. call for papers Message-ID: <3841ABFB-E253-4675-871B-73B66C61BF9F@ic.uff.br> [Apologies for multiple copies of this call.] SBLP 2011: Call For Papers 15th Brazilian Symposium on Programming Languages Sao Paulo, Brazil September 26-30, 2011 http://www.each.usp.br/cbsoft2011/ IMPORTANT DATES Paper abstract submission (15 lines): April 22nd, 2011 Full paper submission: April 29th, 2011 Notification of acceptance: May 30th, 2011 Final papers due: July 1st, 2011 INVITED SPEAKERS * Jose Luis Fiadeiro, Univ. of Leicester Talk title: "Service-oriented computing as a paradigm for programming dynamically reconfigurable software" * Gary T. Leavens, Univ. of Central Florida Talk title: "Ptolemy: Taming Aspects with Explicit Event Announcement and Greybox Specifications" INTRODUCTION The 15th Brazilian Symposium on Programming Languages, SBLP 2011, will be held in Sao Paulo, Brazil, between September 26th and 30th, 2011. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 2nd Brazilian Conference on Software: Theory and Practice, CBSoft 2011, http://www.each.usp.br/cbsoft2011/, which will host four well-established Brazilan symposia: * XXV Brazilian Symposium on Software Engineering (SBES) * XV Brazilian Symposium on Programming Languages (SBLP) * XIV Brazilian Symposium on Formal Methods (SBMF) * V Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2011 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical approaches. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Submissions should be done using SBLP 2011 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2011. Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. All papers should be prepared using the Springer Lecture Notes in Computer Science (LNCS) template. (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) We encourage the submission of short papers reporting on master dissertations or doctoral theses at early stages of their development. All accepted papers, with at least one author registered in the conference, will be published in the conference proceedings. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP 2009 and 2010, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. ORGANIZATION CHAIRS - For CBSoft * Marcelo Fantinato, EACH - USP * Luciano Silva, FCI - Mackenzie - For SBLP * Denise Stringhini FCI, Mackenzie * Alfredo Goldman IME, USP PROGRAMME COMMITTEE CHAIRS * Christiano Braga, UFF * Jose Luiz Fiadeiro, Univ. of Leicester PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Andre Du Bois, UFPel * Alex Garcia, IME * Andre Santos, UFPE * Artur Boronat, Univ. of Leicester * Carlos Camarao, UFMG * Christiano Braga, UFF (co-chair) * Fernando Castor Filho, UFPE * Fernando Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC * Jens Palsberg, UCLA * Joao Saraiva, Universidade do Minho * Johan Jeuring, Utrecht Univ. * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester (co-chair) * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho * Marcelo A. Maia, UFU * Marcelo d'Amorim, UFPE * Marco Tulio Valente, UFMG * Mariza A. S. Bigonha, UFMG * Martin A. Musicante, UFRN * Noemi Rodriguez, PUC-Rio * Paulo Borba, UFPE * Peter Mosses, Swansea University * Renato Cerqueira, PUC-Rio * Ricardo Massa, UFPE * Roberto S. Bigonha, UFMG * Roberto Ierusalimschy, PUC-Rio * Sandro Rigo, UNICAMP * Sergio Soares, UFPE * Sergiu Dascalu, Univ. of Nevada * Simon Thompson, Univ. of Kent * Varmo Vene, Univ. de Tartu From Jean-yves.marion at loria.fr Tue Dec 14 16:24:13 2010 From: Jean-yves.marion at loria.fr (Jean-Yves Marion) Date: Tue, 14 Dec 2010 22:24:13 +0100 Subject: [TYPES/announce] DICE 2011 : Extended deadline and publication information Message-ID: <190E9E95-DF59-41C9-AAD0-42CCABA1ED3D@loria.fr> ------------------------------------------------------------------------------ ------- Call for papers --------- Extended deadline => January 3rd, 2011 ---------------------------------------------------------------------------------- Second International Workshop on Developments in Implicit Computational complExity (DICE 2011) http://dice11.loria.fr/ April, 2nd-3rd, Saarbr?cken, Germany as part of ETAPS 2011 ----------------------------------------------------------------------------------- IMPORTANT DATES: => Paper submission: January 3rd, 2011 * Notification date: January 27th, 2011 * Final version due: February 8th, 2011 * Workshop: April 2nd-3rd, 2011 PUBLICATIONS: * Selected regular papers are planned to be published in EPTCS. * There will be a call for paper after the workshop for a special issue of Information and Computation. INVITED SPEAKERS: * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) * Daniel Leivant (Indiana University) * Ricardo Pe?a (Universidad complutense de Madrid) SUBMISSION PROCEDURE: There will be two categories of submissions: * Full papers: up to 15 pages (including bibliography). * Extended abstracts for short presentations (that will not be included in the proceedings): up to 3 pages; Authors must indicate if their submission belongs to the second category (by mentioning "(Extended Abstract)" in the title). Papers must be sumbitted electronically, as pdf files, at the following URL: http://www.easychair.org/conferences/?conf=dice2010 Submissions of the first category (full papers) should not have been published before or submitted simultaneously to another conference or journal. This restriction does not hold for the second category (extended abstracts). These latter submissions will be an opportunity to present work in progress or to get a feedback from the audience on a work already published elsewhere. Submissions of papers authored by PC members are allowed. SCOPE AND TOPIC: The area of Implicit Computational Complexity (ICC) has grown out from several proposals to use logic and formal methods to provide languages for complexity- bounded computation (e.g. Ptime, Logspace computation). It aims at studying computational complexity without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: - to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; - to design methods suitable for static verification of program complexity. Therefore ICC is related on the one hand to the study of complexity classes, and on the other hand to static program analysis. The workshop will be open to contributions on various aspects of ICC including (but not exclusively): - types for controlling complexity, - logical systems for implicit computational complexity, - linear logic, - semantics of complexity-bounded computation, - rewriting and termination orderings, - interpretation-based methods for implicit complexity, - programming languages for complexity bounded computation, - application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages) The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 2010 at ETAPS. Before that, several meetings on this topic had already been held with success in Paris in 2008 (WICC'08, http://www-lipn.univ-paris13.fr/~mogbil/wicc08/ ), in Marseille in 2006 (GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) , and Paris in 2004 (ICC and logic meeting, http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html) PROGRAMME COMMITTEE: Amir Ben-Amram (Academic College of Tel-Aviv) Patrick Baillot (ENS Lyon, CNRS) Jean-Yves Marion (Universit? de Lorraine) (Chair) Simone Martini (Universit? di Bologna) Damiano Mazza (Universit? Paris 13) Georg Moser (Universit?t Innsbruck) Ricardo Pe?a (Universidad complutense de Madrid) Luca Roversi (Universit? di Torino) Jim Royer (Syracuse University) STEERING COMMITTEE: Patrick Baillot (ENS Lyon, CNRS) (Chair) Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) Jean-Yves Marion (Universit? de Lorraine) Simona Ronchi Della Rocca (Universit? di Torino) FINANCIAL SUPPORT: The workshop is partially supported by: ANR project COMPLICE (Implicit Computational Complexity, Concurrency and Extraction), ANR-08-BLANC-0211-01. CONTACT: Jean-Yves.Marion at loria.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From iswanghao at acm.org Tue Dec 14 22:28:22 2010 From: iswanghao at acm.org (Hao Wang) Date: Wed, 15 Dec 2010 11:28:22 +0800 Subject: [TYPES/announce] Post-doc opportunity: Verification of Time Sensitive Safety Critical Systems using High Performance Computing Message-ID: This is a two-year post doctoral position offering the successful candidate the opportunity to be at the forefront in developing technology for safety critical systems targeting health services delivery. The motivational problems involve modeling and verifying workflow systems using innovative workflow management frameworks. Case studies will involve very large workflows for community-based health care programs. The candidate will have the opportunity to: ? work with researchers and graduate students in a large interdisciplinary R&D project led by Dr. Wendy MacCaull, at StFX University in Antigonish, Nova Scotia, (see www.logic.stfx.ca); ? collaborate with our industry partners; ? work closely with a variety of health care professionals; ? collaborate and network with the Canadian Consortium in High Performance Computing, and researchers at universities across Canada; ? reside in a small town with an affordable lifestyle, close to beaches and scenic landscapes, with a thriving Academic and Arts community, in close proximity (2 hours) to a major metropolitan city. This position is partially supported by the ACEnet (Atlantic Computational Excellence Network see www.ace-net.ca) Research Fellowships Program and by ACOA through the Atlantic Innovation Fund. Qualifications: - PhD in Computer Science and a strong background in formal methods or related area; knowledge and expertise in parallel and distributed computing is an asset; - Commitment to work on applied problems; - Ability to present information in English clearly, both in verbal and written formats; - Enjoys working in a collaborative environment. Salary: $43,000 per year (plus a funding allowance for conference presentations). Second year funding is contingent on satisfactory performance during the first year. To apply: Send (1) a 1 page cover letter briefly describing how your education and experience fit the requirements of this position; (2) a detailed CV with descriptions of previous research projects and applied experience; (3) names and contact information for 3 references (names, addresses, e-mail addresses and phone numbers); (4) copies of recent publications, to Wendy MacCaull at wmaccaul at stfx.ca. Use the subject: Verification Methods for Workflow using HPC - Rnd 3. Review of the applications will begin immediately; the researcher must be in place by mid-March 2011. -------------- next part -------------- An HTML attachment was scrubbed... URL: From massimo.merro at univr.it Wed Dec 15 09:52:09 2010 From: massimo.merro at univr.it (Massimo Merro) Date: Wed, 15 Dec 2010 15:52:09 +0100 Subject: [TYPES/announce] Postdoctoral Fellowship in Formal Methods for Wireless Systems Message-ID: Formal Methods for Wireless Systems - University of Verona One postdoctoral Research Fellowship Applications are invited for ONE post-doctoral position to undertake research into Foundations of Wireless Systems. The position is within the SPY Lab of the Department of Computer Science at University of Verona, Italy, under the direction of Massimo Merro, which seeks to establish a firm mathematical and logical basis for the next generation of wireless networks (ad hoc networks, sensor networks, vehicular ad hoc networks, etc). Applicants should have a PhD in Computer Science, or a closely related discipline. Candidates with expertise in following areas are particularly welcome: - operational semantics - concurrency theory - model checking - verification techniques - type theory - program logics The post is tenable from January 2011 at a salary commensurate with the successful candidates' qualifications and experience. Appointments will be made initially for a 12 month period, although there will be scope for a 12 month extension. Further particulars of the posts may be obtained from the address below, and informal enquiries are also welcomed. Applications should include - detailed curriculum vitae, in pdf format - copies of relevant publications, or url-pointers to them - the names of two referees - a statement outlining the applicant's suitability to the project. Applications should be sent to: Massimo Merro Dipartimento di Informatica Ca' Vignal 2 Universita' degli Studi di Verona 37134 Verona Italy email: massimo.merro at univr.it tel: +39 045 802 7992 From Lutz.Schroeder at dfki.de Thu Dec 16 04:32:40 2010 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Thu, 16 Dec 2010 10:32:40 +0100 Subject: [TYPES/announce] Post-doctoral position in coalgebraic logic at DFKI Bremen Message-ID: <4D09DCB8.1040302@dfki.de> [Thanks for distributing the job advertisement below.] The German Research Center for Artificial Intelligence (DFKI GmbH) is seeking a Postdoctoral Researcher for its Safe and Secure Cognitive Systems Lab in Bremen working in the area of security policies within the DFG-project GenMod2, which will start in February 2011. The project GenMod2 ("Generic Algorithms in Modal and Hybrid Logics") is concerned with the further development of a coalgebraic generic framework for automatic deduction in various extensions of modal logic, including probabilistic, strategy-oriented, and non-monotonic logics. Applications of such logics are found on the one hand in various areas of knowledge representation, that is, in extensions of description logic, and on the other hand in the specification and verification of reactive systems. One of the goals of the project is to increase the scope and efficiency of the generic modal reasoner CoLoSS. We expect applicants to have experience in at least one of the following topics: Modal logic / description logic Automatic reasoning Coalgebra In the field of innovative software technologies, the German Research Center for Artificial Intelligence (DFKI) is the leading research institution in Germany, and in the international science community the DFKI ranks among the most important ?Centers of Excellence? worldwide. The position is at the postdoctoral level; however, candidates without a PhD can be considered in case of exceptional qualification. In this case, the position offers the opportunity to work towards a PhD from the University of Bremen. The initial employment contract will run for two years. More information about the lab is available at http://www.dfki.de/web/research/sks The DFKI is an equal opportunities employer. Women are especially encouraged to apply. Handicapped applicants with equal qualification will be given preferential treatment. Applications should be sent to PD Dr. Lutz Schr?der, DFKI, Enrique-Schmidt-Str. 5, 28359 Bremen, or via e-mail to Lutz.Schroeder at dfki.de. -- -------------------------------------- PD Dr. Lutz Schr?der Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder at dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum f?r K?nstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch?ftsf?hrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From pmt6sbc at maths.leeds.ac.uk Thu Dec 16 05:41:32 2010 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Thu, 16 Dec 2010 10:41:32 +0000 (GMT) Subject: [TYPES/announce] CiE 2011 - 2nd call for papers: Deadline 14 January 2011 Message-ID: _____________________________________________________________________ CiE 2011: Computability in Europe Models of Computation in Context Sofia, Bulgaria 27 June 2011 - 2 July 2011 Second Call for Papers Submission Deadline: 14 January 2011 http://cie2011.fmi.uni-sofia.bg/ _____________________________________________________________________ TUTORIALS: Jack Lutz (Ames IA, U.S.A.), Geoffrey Pullum (Edinburgh, U.K.) PLENARY TALKS: Scott Aaronson (Cambridge MA, U.S.A.), Christel Baier (Dresden, Germany), Michiel van Lambalgen (Amsterdam, The Netherlands), Antonio Montalban (Chicago IL, U.S.A.), Alexandra Shlapentokh (Greenville NC, U.S.A.), Theodore Slaman (Berkeley CA, U.S.A.), Janet Thornton (Cambridge, U.K.), Alasdair Urquhart (Toronto ON, Canada). SPECIAL SESSIONS: * Computability in Analysis, Algebra, and Geometry (Organizers: Alexandra Shlapentokh, Dieter Spreen) : Ulrich Berger (Swansea), Vasco Brattka (Cape Town): Valentina Harizanov (Washington, DC), Russel Miller (New York, NY). * Classical Computability Theory (Organizers: Doug Cenzer, Bj?rn Kjos-Hanssen): Mingzhong Cai (Cornell), Rachel Epstein (Harvard), Charles Harris (Leeds), Guohua Wu (NTU, Singapore) * Natural Computing (Organizers: Erzs?bet Csuhaj-Varj?, Ion Petre): Natalio Krasnogor (University of Nottingham), Martin Kutrib (University of Giessen), Victor Mitrana (University of Bucharest), Agust?n Riscos-N?nez (University of Seville) * Relations between the physical world and formal models of computability (Organizers: Viv Kendon, Sonja Smets): Pablo Arrighi (University of Grenoble), ?aslav Brukner (University of Vienna), Elham Kashefi (University of Edinburgh),Prakash Panangaden (McGill University) * Theory of transfinite computations (Organizers: Peter Koepke, C.T. Chong): Noam Greenberg (Victoria University of Wellington), Sy D. Friedman (University of Vienna), Wei Wang (Sun Yat-sen University), Merlin Carl (Rheinische Friedrich-Wilhelms-Universit?t Bonn) * Computational Linguistics (Organizers: Tejaswini Deoskar, Tinko Tinchev): Klaus U. Schulz (Ludwig-Maximilians-Universit?t M?nchen)& Stoyan Mihov (Bulgarian Academy of Sciences), Ian Pratt-Hartmann (University of Manchester). CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. The Programme Committee (Dag Normann and Ivan Soskov co-chairs) cordially invites all researchers in the area of the conference to submit their papers (in PDF-format, at most 10 pages) for presentation at CiE 2011 to http://www.easychair.org/conferences/?conf=cie2011. The best of the accepted papers will be published in the conference proceedings within the Lecture Notes in Computer Science (LNCS) series of Springer, which will be available at the conference. Other accepted contributed papers together with abstracts of informal presentations will appear in our local pre-conference proceedings volume. We particularly invite papers that build bridges between different parts of the research community. Since women are underrepresented in mathematics and computer science, we emphatically encourage submissions by female authors (see below for the 'Women in Computability' grants). IMPORTANT DATES: Submission Deadline: January 14, 2011 Notification of Authors: March 12, 2011 Final Version: April 2, 2011 Authors of accepted papers are expected to present their work at the conference. Submitted papers must describe work not previously published, and they must neither be accepted nor under review at a journal or at another conference with refereed proceedings. All papers need to be prepared in LNCS-style LaTeX. Papers should not exceed 10 pages; full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Submissions authored or co-authored by a Programme Committee member are not allowed. GRANTS: Women in Computability: In 2011, we continue the programme "Women in Computability" (funded from 2008 to 2010 by the Elsevier Foundation) now supported by the journal "Annals of Pure and Applied Logic" (Elsevier). As part of this programme, we can offer four modest "Elsevier Women in Computability grants" for female graduate students or junior researchers. These grants will be paid as a reimbursement of up to 200 EUR of travel and accommodation expenses. More information about deadlines and the application procedure will become available from the CiE 2011 website in March 2011. ASL Student Travel Grants: CiE 2011 is sponsored by the Association for Symbolic Logic. All student members of the ASL can apply for travel funding. To be considered for a Travel Award, please (1) send a letter of application, and (2) ask your thesis supervisor to send a brief recommendation letter. The application letter should be brief (preferably one page) and should include: (1) your name; (2) your home institution; (3) your thesis supervisor's name; (4) a one-paragraph description of your studies and work in logic, and a paragraph explaining why it is important to attend the meeting; (5) your estimate of the travel expenses you will incur; (6) (for citizens or residents of the USA) citizenship or visa status; and (7) (voluntary) indication of your gender and minority status. Women and members of minority groups are strongly encouraged to apply. Applications should be sent to asl at vassar.edu before March 27 2011. EMS grants for Young East European Researches: Thanks to the generous support from European Mathematical Society, CiE 2011 is glad to be able to offer partial or total fee waivers for a small number of Eastern European researchers and researchers from the former Soviet Union member states, whose work has been accepted for presentation at CiE2011. Preference will be given to young researchers and researchers with papers accepted for publication in the LNCS proceedings. To apply, please send an application to cie2011 at fmi.uni-sofia.bg before March 27 2011. The application should include the applicant's name, affiliation and the title of the submission for CiE 2011. Best student paper award: Papers that have only student authors are eligible for the "CiE 2011 Best Student Paper Award?. The Programme Committee will select the best submission among these after acceptance. Springer will sponsor the Best student paper award - a Springer book voucher for the winner. All questions about the conference could be send at cie2011 at fmi.uni-sofia.bg. __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2011 http://cie2011.fmi.uni-sofia.bg CiE 2012 http://www.cie2012.eu CiE Membership Application Form http://www.cs.swan.ac.uk/acie ALAN TURING YEAR http://www.turingcentenary.eu CiE on Twitter http://twitter.com/AssociationCiE ATY on Twitter http://twitter.com/AlanTuringYear __________________________________________________________________________ From cristi at ifi.uio.no Thu Dec 16 07:32:26 2010 From: cristi at ifi.uio.no (Cristian Prisacariu) Date: Thu, 16 Dec 2010 13:32:26 +0100 Subject: [TYPES/announce] CfP: FCT 2011 - Fundamentals of Computer Theory, 18th International Symposium Message-ID: Sorry for possible multiple copies of this announcement. Call for Papers FCT 2011 18th International Symposium on Fundamentals of Computer Theory August 22-25, 2011, Oslo, Norway The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, as well as new emerging fields such as bio-inspired computing. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009). PROCEEDINGS The conference proceedings will be published (as usual) in the Lecture Notes in Computer Science series of Springer-Verlag (to be confirmed). SUBMISSIONS (topics) Authors are invited to submit papers presenting original unpublished research in all areas of theoretical computer science. Topics of interest include (but not limited to): * Algorithms: o algorithm design and optimization o combinatorics and analysis of algorithms o computational complexity o approximation, randomized, and heuristic methods o parallel and distributed computing o circuits and boolean functions o online algorithms o machine learning and artificial intelligence o computational geometry o computational algebra * Formal methods: o algebraic and categorical methods o automata and formal languages o computability and nonstandard computing models o database theory o foundations of concurrency and distributed systems o logics and model checking o models of reactive, hybrid and stochastic systems o principles of programming languages o program analysis and transformation o specification, refinement and verification o security o type systems * Emerging fields: o ad hoc, dynamic, and evolving systems o algorithmic game theory o computational biology o foundations of cloud computing and ubiquitous systems o quantum computation Authors are invited to submit a paper with at most 12 pages in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed. IMPORTANT DATES Submission Deadline: Tuesday, 5. April 2011 Author Notification: Monday, 6. June 2011 Camera ready manuscript: Friday 17. June 2011 For further information on the conference, please visit the URL at http://fct11.ifi.uio.no/ PROGRAM CHAIRS - Olaf Owe (U. of Oslo) - Martin Steffen (U. of Oslo) - Jan Arne Telle (U. of Bergen) PROGRAM COMMITTEE Erika Abraham (RWTH Aachen, Germany) Wolfgang Ahrendt (Chalmers, Sweden) David Coudert (INRIA Sophia-Antipolis, France) Camil Demetrescu (La Sapienza University of Rome, Italy) Jiri Fiala (Charles University, Prague, Czech Republic) Martin Hofmann (LMU, Munich) Thore Husfeldt (IT University of Copenhagen, Denmark) Alexander Kurz (U. of Leicester, UK) Andrzej Lingas (Lund University, Sweden) Peter Csaba Oelveczky (U. of Oslo, Norway) Olaf Owe (U. of Oslo, Norway) Miguel Palomino (U. Complutense, Madrid, Spain) Yuri Rabinovich (U. of Haifa, Israel) Saket Saurabh (Inst. of Mathematical Sciences, Chennai, India) Martin Steffen (U. of Oslo, Norway) Jan Arne Telle (U. of Bergen, Norway) Tarmo Uustalu (Inst. of Cybernetics, Tallinn, Estland) Ryan Williams (IBM Almaden Research Center, San Jose, USA) Gerhard Woeginger (U. of Eindhoven, The Netherlands) David Wood (U. of Melbourne, Australia) STEERING COMMITTEE Bogdan Chlebus (Warszawa/Denver, Poland/USA) Zoltan Esik (Szeged, Hungary) Marek Karpinski - chair (Bonn, Germany) Andrzej Lingas (Lund, Sweden) Miklos Santha (Paris, France) Eli Upfal (Providence, USA) ----------------------------------------------------------------- Have a nice day from Cristian Prisacariu member of PMA group (Precise Modeling and Analysis) at Dept. of Informatics, Univ. of Oslo http://www.ifi.uio.no/forskning/grupper/pma/ Also visit my home page at http://www.ifi.uio.no/~cristi Please, would you consider planting Trees? http://www.naturefund.de/ or calculating your carbon footprint? http://www.carbonfootprint.com/ ----------------------------------------------------------------- ----------------------------------------------------------------- Have a nice day from Cristian Prisacariu member of PMA group (Precise Modeling and Analysis) at Dept. of Informatics, Univ. of Oslo http://www.ifi.uio.no/forskning/grupper/pma/ Also visit my home page at http://www.ifi.uio.no/~cristi Please, would you consider planting Trees? http://www.naturefund.de/ or calculating your carbon footprint? http://www.carbonfootprint.com/ ----------------------------------------------------------------- ----------------------------------------------------------------- Have a nice day from Cristian Prisacariu member of PMA group (Precise Modeling and Analysis) at Dept. of Informatics, Univ. of Oslo http://www.ifi.uio.no/forskning/grupper/pma/ Also visit my home page at http://www.ifi.uio.no/~cristi Please, would you consider planting Trees? http://www.naturefund.de/ or calculating your carbon footprint? http://www.carbonfootprint.com/ ----------------------------------------------------------------- ----------------------------------------------------------------- Have a nice day from Cristian Prisacariu member of PMA group (Precise Modeling and Analysis) at Dept. of Informatics, Univ. of Oslo http://www.ifi.uio.no/forskning/grupper/pma/ Also visit my home page at http://www.ifi.uio.no/~cristi Please, would you consider planting Trees? http://www.naturefund.de/ or calculating your carbon footprint? http://www.carbonfootprint.com/ ----------------------------------------------------------------- From asyropoulos at yahoo.com Fri Dec 17 08:09:30 2010 From: asyropoulos at yahoo.com (Apostolos Syropoulos) Date: Fri, 17 Dec 2010 05:09:30 -0800 (PST) Subject: [TYPES/announce] CIT-11 conference announcement Message-ID: <704618.66561.qm@web110106.mail.gq1.yahoo.com> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Preliminary Call for Papers The 11th IEEE International Conference on Computer and Information Technology (CIT-11), 31st August -- 2nd September 2011 Coral Beach Hotel, Paphos, Cyprus http://www.cs.ucy.ac.cy/CIT2011 CIT has become a primary venue for researchers and industry practitioners to discuss open problems, new research directions, and real-world case studies on all aspects of computer and information technology. CIT is soliciting original, previously unpublished and high quality papers addressing research challenges and advances spanning over the multidisciplinary aspects of information technology, computing science and computer engineering. The topics of the conference include, but are not limited to, broadly understood: - Computer and System Architecture - High Performance Computing - Utility Computing - Cloud Computing - Ubiquitous Computing - Software Engineering - Computer Networks - Telecommunications - Artificial Intelligence and Multi-Agent Systems - Computer Graphics/Image Processing - Information Visualization - Information Security - Management of Data and Database Systems - New Web Technology and Applications - IT in e-Health, e-Business, e-Learning, and e-Government Proceedings The conference proceedings will be published by IEEE Computer Society. Important Dates Submission Deadline: March 15, 2011 Notification of Acceptance: May 15, 2011 Camera-ready papers due: June 15, 2011 Paper Submission Guidelines All papers must be submitted electronically and in PDF format. The material presented should be original and not published or under submission elsewhere. Authors should submit full papers of up to 8 pages, following strictly the IEEE Computer Society Proceedings Manuscript style (available at http://www.computer.org/portal/web/cscps/formatting), using two-column, single-space format, with 10-point font size. Figures and references must be included in the 8 pages. Oversized papers will be automatically rejected by the PC chairs. At least one of the authors of each accepted paper must register early to attend the conference, in order for the paper to appear in the conference proceedings. ---------------------- Apostolos Syropoulos Xanthi, Greece From ricardo at sip.ucm.es Fri Dec 17 11:24:43 2010 From: ricardo at sip.ucm.es (=?ISO-8859-1?Q?Ricardo_Pe=F1a?=) Date: Fri, 17 Dec 2010 17:24:43 +0100 Subject: [TYPES/announce] 1st CFP Trends in Functional Programming 2011 Message-ID: <4D0B8ECB.5080406@sip.ucm.es> TFP 2011 PC Chair -- Ricardo Pe~na e-mail: ricardo at sip.ucm.es Departamento Sistemas Informaticos y Computacion Facultad de Informatica C/ Profesor Jose Garcia Santesmases s/n Universidad Complutense de Madrid, 28040 MADRID Ph: (+ 34) 91 394 7627 FAX: (+ 34) 91 394 7529 http://dalila.sip.ucm.es/~ricardo -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: CFP-TFP11.txt URL: From soner at mtu.edu Fri Dec 17 21:46:42 2010 From: soner at mtu.edu (Soner Onder) Date: Fri, 17 Dec 2010 21:46:42 -0500 Subject: [TYPES/announce] ASPLOS 2011 Travel Grants Message-ID: <4D0C2092.6050205@mtu.edu> ** Our apologies if you receive this announcement from multiple resources ** ----------------------------------------------------------------------------------------------- ASPLOS 2011 Travel Grants ----------------------------------------------------------------------------------------------- Funded by: NSF, SIGARCH, SIGOPS, SIGPLAN, & Google. ASPLOS will offer travel grants for students to attend the conference, in addition to reduced student registration fees. Travel grants will also be made available to junior faculty members, under-represented minorities, and faculty members from non-Ph.D. granting colleges. The size and number of these grants will vary depending on funding availability and the number of applications that we receive. Expenses will be reimbursed after the conference; grant recipients will be asked to submit original receipts. While we encourage all in need of a travel grant to apply, priority will be given to paper and poster presenters, co-authors, and under-represented minorities (including women and undergraduate students interested in research). Google will provide travel support for up to 2 female Computer Science Ph.D. students. The application to receive funding from Google is available here: http://google.eresources.com/applications/login.asp The deadline to apply for funding from Google is January 10th , 2011; Google will notify all applicants of their decisions on or before January 21st, 2011. Students who receive travel support from Google will be ineligible to receive additional funding from ASPLOS. To apply for a travel grant directly from ASPLOS, please complete the following steps: * Complete the application form (http://asplos11.cs.ucr.edu/travel_grant_application_form.doc). * Applicants, compose an email to asplos2011travel at gmail dot com. For your subject line, please use ?Travel Grant Application for ?. * In the body of your email, please briefly describe your reasons for attending ASPLOS and your research interests. * Attach a current resume and the completed application form. Student applicants also need to ask their advisor to send an e-mail to asplos2011travel at gmail dot com with the subject line ?Student Travel Status Confirmation for ?, stating that you are a full time student pursuing an MS/Ph.D. or undergraduate research in the areas covered by ASPLOS. Travel grant applications must be received by January 26th, 2011. For students, the confirmation email from their advisor needs to be received by that date also. Because of the large number of applications we expect to receive, we will not solicit these letters from your advisors - it is your responsibility to ensure that your advisor sends the email before the deadline. We will acknowledge receipt of your application within a week of receipt. If you do not receive such an acknowledgement, please resend. If you still don't receive an acknowledge mail, please call the Travel Chair, Philip Brisk, at +1 (951) 827-2030. We will do our best to notify you about the status of your application by January 30th, which is 3 days before the conference early registration deadline. Note that award decisions will be made based on funding availability. Note also that some awards may be made only after the conference. Please contact Philip Brisk for information. Funding for ASPLOS travel grants has been generously provided by the NSF, the SIGARCH, the SIGOPS, and the ACM SIGPLAN Professional Activities Committee (PAC). -------------------------------------------------------------------------------------------------- Soner Onder, ASPLOS Publicity Chair. From carlos.martin at urv.cat Sat Dec 18 14:02:02 2010 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Sat, 18 Dec 2010 20:02:02 +0100 Subject: [TYPES/announce] LATA 2011: final call for papers Message-ID: ********************************************************************* Final Call for Papers 5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011) Tarragona, Spain, May 30 ? June 3, 2011 http://grammars.grlmc.com/LATA2011/ ********************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - algebraic language theory - algorithms for semi-structured data mining - algorithms on automata and words - automata and logic - automata for system analysis and programme verification - automata, concurrency and Petri nets - cellular automata - combinatorics on words - computability - computational complexity - computational linguistics - data and image compression - decidability questions on words and languages - descriptional complexity - DNA and other models of bio-inspired computing - document engineering - foundations of finite state technology - fuzzy and rough languages - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - grammatical inference and algorithmic learning - graphs and graph transformation - language varieties and semigroups - language-based cryptography - language-theoretic foundations of artificial intelligence and artificial life - neural networks - parallel and regulated rewriting - parsing - pattern recognition - patterns and codes - power series - quantum, chemical and optical computing - semantics - string and combinatorial issues in computational biology and bioinformatics - string processing algorithms - symbolic dynamics - term rewriting - transducers - trees, tree languages and tree machines - weighted machines STRUCTURE: LATA 2011 will consist of: - 3 invited talks - 2 invited tutorials - peer-reviewed contributions - open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants) INVITED SPEAKERS: Thomas Colcombet (Paris), Green's Relations and Their Use in Automata Bakhadyr Khoussainov (Auckland), Automaticity (tutorial) Kevin Knight (Marina del Rey), Automata for Deciphering Natural Language J?rome L?roux (Bordeaux), Vector Addition System Reachability Problem: A Short Self-Contained Proof (tutorial) Narad Rampersad (Li?ge), Abstract Numeration Systems PROGRAMME COMMITTEE: Andrew Adamatzky (Bristol) Cyril Allauzen (New York) Amihood Amir (Ramat-Gan) Franz Baader (Dresden) Marie-Pierre B?al (Marne-la-Vall?e) Philip Bille (Lyngby) Mikl?s B?na (Gainesville) Symeon Bozapalidis (Thessaloniki) Vasco Brattka (Cape Town) Maxime Crochemore (London) James Currie (Winnipeg) J?rgen Dassow (Magdeburg) Cunsheng Ding (Hong Kong) Rodney Downey (Wellington) Manfred Droste (Leipzig) Enrico Formenti (Nice) Amy Glen (Perth) Serge Haddad (Cachan) Shunsuke Inenaga (Fukuoka, co-chair) Jesper Jansson (Tokyo) Jarkko Kari (Turku) Marek Karpinski (Bonn) Maciej Koutny (Newcastle) Gregory Kucherov (Lille) Markus Lohrey (Leipzig) Benedikt L?we (Amsterdam) Salvador Lucas (Valencia) Sebastian Maneth (Sydney) Carlos Mart?n-Vide (Brussels, co-chair) Giancarlo Mauri (Milano) Alexander Meduna (Brno) Kenichi Morita (Hiroshima) Sven Naumann (Trier) Gonzalo Navarro (Santiago, CL) Mark-Jan Nederhof (St Andrews) Joachim Niehren (Lille) Joakim Nivre (Uppsala) Kemal Oflazer (Doha) Alexander Okhotin (Turku) Witold Pedrycz (Edmonton) Dominique Perrin (Marne-la-Vall?e) Giovanni Pighizzini (Milano) Alberto Policriti (Udine) Lech Polkowski (Warsaw) Helmut Prodinger (Stellenbosch) Mathieu Raffinot (Paris) Philippe Schnoebelen (Cachan) Ayumi Shinohara (Sendai) Jamie Simpson (Perth) Magnus Steinby (Turku) James Storer (Boston) Jens Stoye (Bielefeld) Andrzej Tarlecki (Warsaw) Richard Thomas (Leicester) Gy?rgy Vaszil (Budapest) Heiko Vogler (Dresden) Pascal Weil (Bordeaux) Damien Woods (Pasadena) Thomas Zeugmann (Sapporo) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Shunsuke Inenaga (Fukuoka, co-chair) Carlos Mart?n-Vide (Brussels, co-chair) Bianca Truthe (Magdeburg) Florentina Lilica Voicu (Tarragona) SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at: http://www.easychair.org/conferences/?conf=lata2011 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/ Early registration fees: 500 Euro Early registration fees (PhD students): 400 Euro Late registration fees: 540 Euro Late registration fees (PhD students): 440 Euro On-site registration fees: 580 Euro On-site registration fees (PhD students): 480 Euro At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings. Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches. PhD students will need to prove their status on site. PAYMENT: Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Juli?n Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide ? LATA 2011). Please write the participant?s name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference?s account. On-site registration fees can be paid only in cash. A receipt for payments will be provided on site. Besides paying the registration fees, it is required to fill in the registration form at the website of the conference. IMPORTANT DATES: Paper submission: January 3, 2011 Notification of paper acceptance or rejection: February 14, 2011 Early registration: February 28, 2011 Final version of the paper for the LNCS proceedings: February 28, 2011 Late registration: May 16, 2011 Starting of the conference: May 30, 2011 Submission to the post-conference special issue: August 30, 2011 FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: LATA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 From pmt6sbc at maths.leeds.ac.uk Mon Dec 20 06:25:00 2010 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Mon, 20 Dec 2010 11:25:00 +0000 (GMT) Subject: [TYPES/announce] TAMC 2011, Tokyo, Japan - SECOND CALL FOR PAPERS Message-ID: SECOND CALL FOR PAPERS TAMC 2011 8th Annual Conference on Theory and Applications of Models of Computation May 23 -- 25, 2011, Tokyo, Japan EMAIL: tamc2011 at easychair.org http://www.tamc2011.com/ After six annual meetings in China ('04-'09) and one in Czech Republic ('10), TAMC2011 will be held in Japan, at the University of Electro-Communications, approximately 10 miles southwest of the Shinjuku district in Tokyo. AIM AND SCOPE TAMC aims at bringing together a wide range of researchers with interests in computational models and their applications. The main themes of the conference are computability, complexity, and algorithms. The topics of interest include (but are not limited to): - algebraic computation, - approximation algorithms, - automata theory, - biological computing, - circuit complexity, - computability, - computational biology, - computational complexity, - computational game theory, - computational logic, - computational geometry, - cryptography, - data structures, - distributed algorithms, - graph algorithms, - information and randomness, - learning theory, - natural computation, - network algorithms, - neural computational models, - online algorithms, - parallel algorithms, - proof complexity, - quantum computing, - randomized algorithms, - streaming algorithms. SUBMISSION GUIDELINE Submission is through EasyChair: https://www.easychair.org/account/signin.cgi?conf=tamc2011. A submission must be typeset with LaTeX using the Springer-Verlag Lecture Notes style. Its length must be no more than ten pages. A clearly marked appendix may be added, but it will be read at the discretion of PC. Submission of papers accepted for publication in journals is not permitted. Nor is simultaneous submission to other conferences with published proceedings. PROCEEDINGS The conference proceedings will be published as a volume in Lecture Notes in Computer Science. JOURNAL SPECIAL ISSUES A special issue of selected papers from TAMC2011 in Theoretical Computer Science is being planned. Another TAMC special issue may be published in Mathematical Structures in Computer Science. PLENARY SPEAKERS Tetsuo Asano (JAIST, Japan) Richard Lipton (Georgia Tech., USA) PROGRAM COMMITTEE Olaf Beyersdorff (Hannover, Germany) Cristian Calude (Auckland, New Zealand) Amit Chakrabarti (Hanover, USA) Danny Chen (Notre Dame, USA) Zhi-Zhong Chen (Tokyo, Japan) Marek Chrobak (Riverside, USA) Pierluigi Crescenzi (Firenze, Italy) William Gasarch (College Park, USA) Tero Harju (Turku, Finland) Miki Hermann (Palaisseau, France) Sanjay Jain (Singapore, Singapore) Ming-Yang Kao (Chicago, USA) S Rao Kosaraju (Baltimore, USA) Carlos Martin Vide (Tarragona, Spain) Peter Bro Miltersen (Aarhus, Denmark) Mitsunori Ogihara, chair (Miami, USA) Ruediger Reischuk (Luebeck, Germany) Christian Sohler (Dortmund, Germany) Jun Tarui, co-chair (Tokyo, Japan) Takeshi Tokuyama (Sendai, Japan) Chee-Keng Yap (New York, USA) STEERING COMMITTEE Manindra Agrawal (Kanpur, India) Jin-Yi Cai (Madison, USA) S. Barry Cooper (Leeds, UK) John Hopcroft (Ithaca, USA) Angsheng Li (Beijing, China) IMPORTANT DATES Submission Deadline Jan. 10, '11 Notification of Acceptance Feb. 18, '11 Final Version Due Mar. 7, '11 Early Registration Deadline Mar. 28, '11 From luigi.santocanale at lif.univ-mrs.fr Tue Dec 21 02:30:54 2010 From: luigi.santocanale at lif.univ-mrs.fr (luigi.santocanale at lif.univ-mrs.fr) Date: Tue, 21 Dec 2010 08:30:54 +0100 (MET) Subject: [TYPES/announce] TACL 2011, first call for papers Message-ID: <201012210730.oBL7Ussg024602@corsica.cmi.univ-mrs.fr> [Apologies for multiple copies] =============================================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011) =============================================================================== 26-30 July 2011 Universit?s Aix-Marseille I-II-III, France http://www.lif.univ-mrs.fr/tacl2011/ Scope ----- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2011 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the fifth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009). Featured topics --------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Fuzzy and many-valued logics * Lattice theory * Lattices with operators * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Submissions ----------- Contributed presentations will be of two types: 20 minutes long presentations in parallel sessions and featured, 30 minutes long, plenary presentations. The submission of an abstract of 1-4 pages is required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure is available on the conference website. Important dates --------------- April 18, 2011: Abstract submission deadline May 20, 2011: Notification to authors July 26-30, 2011: Conference Program Committee ----------------- Guram Bezhanishvili, New Mexico State University Petr Cintula, Academy of Sciences of the Czech Republic Thierry Coquand, University of Gothenburg Mai Gehrke, Radboud University, Nijmegen Silvio Ghilardi, Universit? degli Studi di Milano Rob Goldblatt, Victoria University, Wellington Martin Hyland, King's College, Cambridge Ramon Jansana, Universitat de Barcelona Achim Jung (PC co-chair), University of Birmingham Alexander Kurz, University of Leicester Yves Lafont, Universit? Aix-Marseille II Tadeusz Litak, University of Leicester Paul-Andr? Melli?s, CNRS Paris Diderot George Metcalfe, Universit?t Bern Nicola Olivetti, Universit? Aix-Marseille III Hiroakira Ono, Japan Advanced Institute of Science and Technology Luigi Santocanale, Universit? Aix-Marseille I Kazushige Terui, Kyoto University Costantine Tsinakis, Vanderbilt University Yde Venema (PC co-chair), University of Amsterdam Friedrich Wehrung, Universit? de Caen Michael Zakharyaschev, University of London More Information ---------------- If you have any queries please send them to the conference email address: tacl2011 at lif.univ-mrs.fr =============================================================================== From freek at cs.ru.nl Tue Dec 21 08:32:04 2010 From: freek at cs.ru.nl (Freek Wiedijk) Date: Tue, 21 Dec 2010 14:32:04 +0100 Subject: [TYPES/announce] ITP 2011 (Preliminary Call for Papers) Message-ID: <20101221133204.GA5317@auriga.local> Preliminary Call for Papers ITP 2011: 2nd International Conference on Interactive Theorem Proving 22-25 August 2011, Nijmegen, The Netherlands http://itp2011.cs.ru.nl/ ----- ITP is the premier international conference for researchers from all areas of interactive theorem proving and its applications. The inaugural meeting of ITP was held on 11-14 July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC, 9-21 July 2010). The second edition of ITP will take place in Nijmegen, The Netherlands, on 22-25 August 2011. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The program committee welcomes submissions on all aspects of interactive theorem proving and its applications. Examples of typical topics include formal aspects of hardware or software (specification, verification, semantics, synthesis, refinement, compilation, etc.); formalization of significant bodies of mathematics; advances in theorem prover technology (automation, decision procedures, induction, combinations of systems and tools, etc.); other topics including those relating to user interfaces, education, comparisons of systems, and mechanizable logics; and concise and elegant worked examples ("Proof Pearls"). Submission details will be provided in a forthcoming call for paper. Two types of submissions are possible. Research papers may be no longer than 16 pages must describe original unpublished work not submitted for publication elsewhere. Rough diamond submissions are limited to six pages and may consist of an extended abstract. They will be refereed: they will be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. All papers must be presented in a way that users of other systems can understand. As for the last edition, the intention is to publish the proceedings as a Springer's LNCS volume. Authors of accepted papers are expected to present their papers at the conference and will be required to sign copyright release forms. All submissions must be written in English. Important dates (midnight GMT): Abstract submission deadline: 13 February 2011 Paper submission deadline: 20 February 2011 Notification of paper decisions: 18 April 2011 Camera-ready papers due from authors: 15 May 2011 Conference dates: 22-25 August 2011 Web page: http://itp2011.cs.ru.nl/ Invited Speakers: Georges Gonthier, Microsoft Research Don Batory, University of Texas at Austin Conference co-chairs: Marko Van Eekelen, Radboud University Nijmegen/Open University of the Netherlands Herman Geuvers, Radboud University Nijmegen Julien Schmaltz, Open University of the Netherlands/Radboud University Nijmegen Freek Wiedijk, Radboud University Nijmegen Program Committee: David Aspinall (Univ. of Edinburgh, UK) Jeremy Avigad (CMU, USA) Stefan Berghofer (TUM, Gremany) Yves Bertot (INRIA Sofia-Antipolis, France) Sandrine Blazy (IRISA, France) Jens Brandt (Univ. of Kaiserslautern, Germany) Jared Davis (Centaur, USA) Amy Felty (Univ. of Ottawa, Canada) Jean-Christophe Filliatre (INRIA Saclay, France) Herman Geuvers - co-Chair (Radboud University Nijmegen, The Netherlands) Georges Gonthier (Microsoft Research, USA) Elsa Gunther (UIUC, USA) John Harrison (Intel, USA) Reiner H?hnle (Chalmers Univ. of Technology, Sweden) Matt Kaufmann (Univ. of Texas at Austin, USA) Gerwin Klein (NICTA, Australia) Assia Mahboubi (LIX, France) Panagiotis Manolios (Northeastern Univ., USA) John Matthews (Galois, USA) Paul Miner (NASA, USA) J Moore (Univ. of Texas at Austin, USA) Greg Morrisett (Harvard Univ., USA) Magnus O. Myreen (Univ. of Cambridge, UK) Tobias Nipkow (TU Munich, Germany) Michael Norrish (NICTA, Australia) Sam Owre (SRI, USA) Christine Paulin-Mohring (Univ. Paris-Sud, France) Lawrence Paulson (Univ. of Cambridge, UK) Brigitte Pientka (McGill Univ., Canad) Lee Pike (Galois, USA) Sandip Ray (Univ. of Texas at Austin, USA) Jose-Luis Ruiz-Reina (Univ. of Sevilla, Spain) David Russinoff (AMD, USA) Julien Schmalz - co-Chair (Open Univ. of the Netherlands, The Netherlands) Konrad Slind (Rockwell Collins, USA) Sofiene Tahar (Concordia, Canada) Marko van Eekelen - co-Chair (Open Univ. of the Netherlands, The Netherlands) Makarius Wenzel (Univ. of Paris-Sud, France) Freek Wiedijk - co-Chair (Radboud University Nijmegen, The Netherlands) From awodey at andrew.cmu.edu Tue Dec 21 13:43:31 2010 From: awodey at andrew.cmu.edu (Steve Awodey) Date: Tue, 21 Dec 2010 13:43:31 -0500 Subject: [TYPES/announce] Post-Doc at Carnegie Mellon Message-ID: <6B363A29-5334-4DCA-ADA0-7FF57899F287@andrew.cmu.edu> The Carnegie Mellon Department of Philosophy invites applications for the Herbert Simon Fellowship in Scientific Philosophy. We are seeking applications from scholars working in logic or philosophy of mathematics (including its history). Applications in the following areas of logic are particularly welcome: proof theory, category theory, categorical logic, formal verification, and automated proof search. The Fellowship is intended primarily for those who have recently received doctorates, including scholars with a continuing faculty appointment elsewhere. The Fellowship has a tenure of two years (non-renewable), with teaching duties of 2 courses/year, one of which should be a research seminar in the Fellow's specialty. Appointments of one year are possible for applicants with a continuing faculty appointment elsewhere. Residence in Pittsburgh is expected. Applications (including a statement of purpose, CV, at least one writing sample and two letters of reference) may be sent to: The Philosophy Department; Carnegie Mellon University; Pittsburgh PA 15213. Attention: Simon Fellowship Committee. Electronic applications, preferably in pdf format enclosed as attachments, are welcome and indeed preferred. Send email to: phil-search at andrew.cmu.edu. The (extended) deadline for application is February 1, 2010. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ss.datics at gmail.com Tue Dec 21 18:08:41 2010 From: ss.datics at gmail.com (SS DATICS) Date: Wed, 22 Dec 2010 07:08:41 +0800 Subject: [TYPES/announce] International Workshop: DATICS-ISPA'11 (EI Indexed) In-Reply-To: References: Message-ID: ===================================================================== Apologies for any multiple copies received. We would appreciate it if you could distribute the following call for papers to any relevant mailing lists you know of. International Workshop: DATICS-ISPA'11 CALL FOR PAPERS http://datics.nesea-conference.org/datics-ispa2011 Busan, Korea, 26-28 May, 2011. ===================================================================== Aims and Scope of DATICS-ISPA?11 Workshop: DATICS Workshops were initially created by a network of researchers and engineers both from academia and industry in the areas of Design, Analysis and Tools for Integrated Circuits and Systems. Recently, DATICS has been extended to the fields of Communication, Computer Science, Software Engineering and Information Technology. The main target of DATICS-ISPA?11 is to bring together software/hardware engineering researchers, computer scientists, practitioners and people from industry to exchange theories, ideas, techniques and experiences related to all aspects of DATICS. Topics of interest include, but are not limited to, the following: Circuits, Systems and Communications: digital, analog, mixed-signal, VLSI, asynchronous and RF design processor and memory DSP and FPGA/ASIC-based design synthesis and physical design embedded system hardware/software co-design CAD/EDA methodologies and tools statistical timing analysis and low power design methodologies network/system on-a-chip and applications hardware description languages, SystemC and SystemVerilog simulation, verification and test technology semiconductor devices and solid-state circuits fuzzy and neural networks communication signal processing mobile and wireless communications peer-to-peer video streaming and multimedia communications communication channel modeling antenna radio-wave propagation Computer Science, Software Engineering and Information Technology: equivalence checking, model checking, SAT-based methods, compositional methods and probabilistic methods graph theory, process algebras, petri-nets, automaton theory, BDDs and UML formal methods distributed, real-time and hybrid systems reversible computing and biocomputing software architecture and design software testing and analysis software dependability, safety and reliability programming languages, tools and environments face detection and recognition database and data mining image and video processing watermarking artificial intelligence average-case analysis and worst-case analysis design and programming methodologies for network protocols and applications coding, cryptography algorithms and security protocols evolutionary computation numerical algorithms e-commerce Please note that all accepted papers will be included in IEEE Xplore and indexed by EI Compendex. After workshop, several special issues of international journals such as IJDATICS and IJCECS will be arranged for selected papers. For more details about DATICS-ISPA'11, please visit http://datics.nesea-conference.org/datics-ispa2011 From s.p.luttik at tue.nl Wed Dec 22 05:18:20 2010 From: s.p.luttik at tue.nl (Bas Luttik) Date: Wed, 22 Dec 2010 11:18:20 +0100 Subject: [TYPES/announce] PhD position in probabilistic processes and modal logic Message-ID: <4D11D06C.7080707@tue.nl> In the project From Modal Logic to Probabilistic Processes and Back there is a vacancy for a 4 year PhD position at the Vrije Universiteit in Amsterdam This is a joint research project between the Theoretical Computer Science group at the Vrije Universiteit in Amsterdam and the Model Driven Software Engineering group at Eindhoven University of Technology. The project involves research at the crossroads of modal logic, process algebra, and structural operational semantics, in the context of probabilistic processes. More information on the project can be found at http://www.cs.vu.nl/~tcs/problog.pdf To apply, send a CV, letter of motivation, and names of at least two references to Wan Fokkink (w.j.fokkink at vu.nl) and Bas Luttik (s.p.luttik at tue.nl). Deadline for application is January 10, 2011. From f.rabe at jacobs-university.de Wed Dec 22 07:53:24 2010 From: f.rabe at jacobs-university.de (Florian Rabe) Date: Wed, 22 Dec 2010 13:53:24 +0100 Subject: [TYPES/announce] Call for Papers: CICM conference 2011 (= MKM 2011 + Calculemus 2011) Message-ID: <9F788CB17C340BD860106EA8@[10.71.192.179]> Call for Papers Conference on Intelligent Computer Mathematics (CICM) Bertinoro, Forli (Italy), 18-23 July 2011 http://cicm11.cs.unibo.it/cicm11/ Track A: Mathematical Knowledge Management (MKM) Track B: Calculemus In addition to the formal tracks above, CICM has historically had associated workshops, and workshop proposals should be sent to the CICM PC Chair (J.H.Davenport at bath.ac.uk), preferably by the end of February 2011. Mathematical Knowledge Management is an innovative field at the intersection of mathematics, computer science, library science, and scientific publishing. Its development is driven, on the one hand, by new technological possibilities which computer science, the Internet, and intelligent knowledge processing offer, and, on the other hand, by the increasing demand by engineers and scientists for new techniques to help in producing, transmitting, consuming, and managing sophisticated mathematical knowledge. Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. After successfully colocating as the Conference of Intelligent Computer Mathematics (CICM), MKM and Calculemus will formally join for CICM 2011. CICM seeks original high-quality submissions in two tracks. The topics of interest include but are not limited to: ** MKM track ** * Representations of mathematical knowledge * Repositories of formalized mathematics * Mathematical digital libraries * Diagrammatic representations * Multi-modal representations * Mathematical OCR * Mathematical search and retrieval * Deduction systems * Math assistants, tutoring and assessment systems * Authoring languages and tools * MathML, OpenMath, and other mathematical content standards * Web presentation of mathematics * Data mining, discovery, theory exploration * Computer algebra systems * Collaboration tools for mathematics * Challenges and solutions for mathematical workflows ** Calculemus track ** * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Theory exploration techniques * Input languages, programming languages, types and constraint languages, and modeling languages for mechanised mathematics systems (PA, CAS, and ATP). * Infrastructure for mathematical services Papers on other topics closely related to the above research areas will also be welcomed for consideration. ***** Submission ***** CICM seeks both formal and work-in-progress submissions. Formal submissions must not exceed 15 pages and will be reviewed by blind peer review and evaluated regarding to relevance, clarity, quality, originality, and impact. Shorter papers, e.g., for system descriptions, are welcome. Authors will have an opportunity to respond to their papers' reviews before the programme committee makes a decision. Selected formal submissions will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. In addition to these formal proceedings, authors are permitted and encouraged to publish the final versions of their papers on arXiv.org. Work-in-progress submissions are intended to provide a forum for the presentation of original work that is not (yet) in a suitable form for submission as a full or system description paper. This includes work in progress and emerging trends. Their size is not limited, but we recommend 5 - 10 pages. The programme committee may offers authors of rejected formal submission to publish as an work-in-progress submission instead. Depending on the number of work-in-progress papers accepted, presentation may be as a short talk or as a poster. The work-in-progress proceedings will be published as a technical report. All papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNCS series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html). By submitting a paper the authors agree that if it is accepted at least one of the authors will attend the conference to present it. The web page for electronic submission is: http://www.easychair.org/conferences/?conf=cicm2011 ***** Important Dates ***** For formal submissions: Abstract submission: 03/March/2011 Submission deadline: 11/March/2011 Reviews sent to authors: 07/April/2011 Rebuttals due: 14/April/2011 Notification of acceptance: 21/April/2011 Camera ready copies due: 09/May/2011 For work-in-progress submissions: Abstract submission: April 30, 2011 Submission deadline: May 7, 2011 Notification of acceptance: May 30, 2011 Camera ready copies due: June 7, 2011 CICM conference: ***** Programme Committee Chairs ***** General chair: James Davenport (University of Bath) ** MKM track ** Florian Rabe (Jacobs University, Germany) Chair Laurent Bernardin (Maplesoft) Thierry Bouche (Joseph Fourier University, Grenoble) Simon Colton (Imperial College) Patrick Ion (American Mathematical Society) Johan Jeuring (University of Utrecht) Fairouz Kamareddine (Heriot-Watt University) Manfred Kerber (University of Birmingham) Andrea Kohlhase (DFKI Bremen) Paul Libbrecht (University of Saarbruecken) Bruce Miller (National Institute of Science and Technology) Adam Naumowicz (University of Bialystok) Claudio Sacerdoti Coen (University of Bologna) Petr Sojka (Masaryk University) Volker Sorge (University of Birmingham) Masakazu Suzuki (Kyushu University) Enrico Tassi (INRIA) Makarius Wenzel (University of Paris-South) Freek Wiedijk (Radboud University Nijmegen) ** Calculemus track ** William Farmer (McMaster University, Canada) Chair Thorsten Altenkirch (Nottingham University) Serge Autexier (DFKI Bremen) Christoph Benzmueller (Articulate Software) Anna Bigatti (University of Genoa) Herman Geuvers (Radboud University Nijmegen) Deepak Kapur (University of New Mexico) Cezary Kaliszyk (University of Tsukuba) Assia Mahboubi (Ecole Polytechnique) Francisco-Jesus Martin-Mateos(University of Seville) Russell O'Connor (INRIA and McMaster University) Grant Passmore (University of Cambridge and University of Edinburgh) Silvio Ranise (Fondazione Bruno Kessler) Alan Sexton (University of Birmingham) Adam Strzebonski (Wolfram Research) More details are at http://cicm11.cs.unibo.it/cicm11/index.html From paolini at di.unito.it Wed Dec 22 11:54:29 2010 From: paolini at di.unito.it (Luca Paolini) Date: Wed, 22 Dec 2010 17:54:29 +0100 Subject: [TYPES/announce] TLCA 2011 --- Last Call for Papers Message-ID: <1293036869.2335.77.camel@gmoon> ===================================== ***** Final CALL FOR PAPER ***** Typed Lambda Calculi and Applications TLCA 2011, 1-3 June 2011, Novi Sad ===================================== http://www.rdp2011.uns.ac.rs/tlca/index.html ------------------------------------------------ ** Title and abstract due 26 January 2011 ** ** Deadline for submission 2 February 2011 ** ------------------------------------------------ The conference proceedings will be published by Springer in the ARCoSS subline of LNCS series: http://www.springer.com/computer/lncs?SGWID=0-164-6-737109-0 Invited Speakers * Alexandre Miquel (Universite Paris VII) * Stephanie Weirich (University of Pennsylvania, United States) * Vladimir Voevodsky, to be confirmed (Princeton, United States) The 10th Conference on Typed Lambda Calculi and Applications (TLCA 2011) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: * Proof-theory: formal reasoning based on type theory, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: game semantics, realisability, categorical and other models * Types: dependent types, polymorphism, intersection types and related approaches (union types, refinement / liquid types, behavioural types), type inference, types in program analysis and verification * Programming: foundational aspects of functional and object-oriented programming, flow analysis of higher-type computation, program equivalence (step-indexed, bisimulation and related methods) Programme Committee Chair * Luke Ong (Oxford, GB) Programme Committee * Thorsten Altenkirch (University of Nottingham) * Stefano Berardi (University of Torino) * Adriana Compagnoni (Stevens Institute of Technology, New Jersey) * Giles Dowek (Ecole Polytechnique, Paris) * Silvia Ghilezan (University of Novi Sad) * Hugo Herbelin (INRIA, Paris) * Atsushi Igarashi (Kyoto University) * Ranjit Jhala (UC San Diego) * Ralph Matthes (CNRS, IRIT) * Ugo dal Lago (University of Bologna) * Luke Ong (University of Oxford) (PC Chair) * Rick Statman (Carnegie Mellon University) * Tachio Terauchi (Tohoku University) * Nobuko Yoshida (Imperial College, London) TLCA Publicity Chair * Luca Paolini (Turin) From carlos.martin at urv.cat Fri Dec 24 13:27:17 2010 From: carlos.martin at urv.cat (carlos.martin at urv.cat) Date: Fri, 24 Dec 2010 19:27:17 +0100 Subject: [TYPES/announce] SSFLA 2011: 2nd call Message-ID: 2011 INTERNATIONAL SPRING SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS (SSFLA 2011) (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain, April 18-22, 2011 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://grammars.grlmc.com/ssfla2011/ ****************************************** ADDRESSED TO: Undergraduate and graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) are welcome too provided they have a good background in discrete mathematics. All courses will be made compatible in terms of schedule. COURSES AND PROFESSORS: Franz Baader (Dresden), Automata and Logic [advanced, 4 hours] Thomas B?ck (Leiden), Natural Computing [introductory, 10 hours] Markus Holzer (Giessen), Computational Complexity [introductory, 14 hours] Claude Kirchner (Bordeaux), Rewriting and Deduction Modulo [introductory, 6 hours] Thierry Lecroq (Rouen), Text Searching and Indexing [introductory, 10 hours] Rupak Majumdar (Kaiserslautern), Software Model Checking [introductory, 10 hours] Risto Miikkulainen (Austin), Natural Language Processing with Subsymbolic Neural Networks [introductory, 6 hours] Bernhard Steffen (Dortmund), Automata Learning from Theory to Application [introductory/advanced, 18 hours] Wolfgang Thomas (Aachen), omega-Automata and Infinite Games [introductory/advanced, 6 hours] Sheng Yu (London ON), Finite Automata and Regular Languages [introductory/advanced, 8 hours] SCHOOL PAPER: On a voluntary basis, within 6 months after the end of the School, students will be expected to draft an individual or jointly-authored research paper on a topic covered during the classes under the guidance of the lecturing staff. REGISTRATION: It has to be done on line at http://grammars.grlmc.com/ssfla2011/Registration.php FEES: They are variable, depending on the number of courses each student takes. The rule is: 1 hour = - 10 euros (for payments until November 30, 2010), - 15 euros (for payments after November 30, 2010). The fees must be paid to the School's bank account: Uno-e Bank (Julian Camarillo 4 C, 28037 Madrid, Spain): IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide GRLMC) Please mention SSFLA 2011 and your full name in the subject. An invoice will be provided on site. Bank transfers should not involve any expense for the School. To check the eligibility for early registration, what counts is the date when the payment is received (not the date when the registration form was filled in). People registering on site at the beginning of the School must pay in cash. ACCOMMODATION: Information about accommodation will be provided through the website of the School in January 2011. CERTIFICATES: Students will be delivered a diploma stating the courses attended, their contents, and their duration. Those participants who will choose to be involved in a research paper will receive an additional certificate at the end of the task, independently on whether the paper will finally get published or not. IMPORTANT DATES: Announcement of the programme: October 8, 2010 Starting of the registration: October 11, 2010 Early registration deadline: November 30, 2010 Starting of the School: April 18, 2011 End of the School: April 22, 2011 QUESTIONS AND FURTHER INFORMATION: Carlos Martin-Vide: carlos.martin at urv.cat WEBSITE: http://grammars.grlmc.com/ssfla2011/ POSTAL ADDRESS: SSFLA 2011 Research Group on Mathematical Linguistics Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386