From francesco.tiezzi at imtlucca.it Wed Jan 2 05:57:11 2013 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Wed, 2 Jan 2013 11:57:11 +0100 Subject: [TYPES/announce] DisCoTec 2013: Second Call for Workshop Proposals Message-ID: [We apologize for multiple copies] ====================================================================== Second Call for Workshop Proposals DisCoTec 2013 8th International Federated Conference on Distributed Computing Techniques http://www.discotec.org/ Firenze, Italy, June 3-6 2013 ====================================================================== DisCoTec 2013 invites proposals for one-day workshops to be part of the joint event. DisCoTec 2013 hosts conferences in the area of coordination languages, distributed systems and formal methods for distributed systems, ranging from practice to theory. We invite workshops in these areas to provide a forum for presentations of preliminary research results and ongoing work as well as presentations of research work to a focused audience. DisCoTec workshops provide a vivid and open forum for discussions. One-day workshops will be held in conjunction with the main events. Prospective workshop organizers are requested to follow the guidelines below and are encouraged to contact the workshops chair (Rosario Pugliese) if any questions arise. * Important Dates * January 8, 2013 Workshop proposal deadline January 15, 2013 Workshop proposal notification June 3-5, 2013 Main conferences June 6, 2013 Workshops Submission and notification deadlines of the workshops are at the discretion of the individual workshop organizers, however notification must be no later than the early registration deadline for DisCoTec. * Proposal Submission Guidelines * Workshop proposals must be written in English, not exceed 5 pages with reasonable font and margin, and be submitted in PDF format via email to * Rosario Pugliese (rosario.pugliese AT unifi.it). Proposals should include the following information: * The title, theme, and goals of the workshop. * The targeted audience and the expected number of participants. We prefer that workshops remain open to participation from any members of the community, but by-invitation-only workshops will also be considered. Please explicitly state your preference. * The publicity strategy that will be used by the workshop organizers to promote the workshop. * The participant solicitation and selection process. * Publication plan. Each workshop is responsible for managing its own publication (e.g., pre- and/or post- proceedings), if any is desired. * Approximate budget proposal (see Budget section below for details). * A preliminary version of the call for papers, which must include important dates (e.g. submission, notification, and camera-ready deadlines). * The equipment and any other resource necessary for the organization of the workshop. * A brief description of the organizer's background, including relevant past experience on organizing workshops and contact information. * Review Process * Workshop proposals will be reviewed by the following committee: * Michele Loreti, Univ. of Firenze, Italy (general chair) * Rosario Pugliese, Univ. of Firenze, Italy (workshops chair) * Francesco Tiezzi, IMT Lucca, Italy (publicity chair) Acceptance is based on an evaluation of the workshop's potential for generating useful results, the timeliness and expected interest in the topics, the organizer's ability to lead a successful workshop, and potential for attracting sufficient number of participants. * Workshop Publicity * Workshop publicity is responsibility of the workshop organizers. In particular they are in charge of 1. Providing a workshop description (200 words) for inclusion on the DisCoTec website. 2. Hosting and maintaining web pages either on the DisCoTec website or linked from it. 3. Editing workshop proceedings, if any. 4. Publicising the event. * Budget * DisCoTec will provide registration and organizational support for the workshops. Registration fees must be paid for all participants, including organizers and invited guests. To cover lunches, coffee breaks and basic organizational expenses, all workshops will be required to charge a minimum participation fee (the precise amount is still to be determined). Each workshop may increase this fee to cover additional expenses such as publication charges, student scholarships, costs for invited speakers, etc. All fees will be collected by the DisCoTec organizers as part of the registration and will be used to cover the expenses of each workshop as agreed with the workshop organizers. * Contact Information * Rosario Pugliese (rosario.pugliese AT unifi.it) From alur at seas.upenn.edu Wed Jan 2 10:20:59 2013 From: alur at seas.upenn.edu (Rajeev Alur) Date: Wed, 2 Jan 2013 10:20:59 -0500 Subject: [TYPES/announce] Post-doc positions in NSF center ExCAPE on software synthesis Message-ID: <201301021520.r02FKxqS010324@minus.seas.upenn.edu> Postdoctoral positions in theory and practice of software synthesis Expeditions in Computer Augmented Program Engineering (ExCAPE) is a multi-university multi-disciplinary project funded by US National Science Foundation as part of the Expeditions in Computing program (see excape.cis.upenn.edu) The goal of ExCAPE is to transform the way programmers develop software by advancing the theory and practice of software synthesis. To achieve this goal, the ExCAPE team brings together expertise in theoretical foundations (computer-aided verification, control theory, program analysis), design methodology (human-computer interaction, model-based design, programming environments), and applications (concurrent programming, network protocols, robotics, system architecture). ExCAPE has funding available for multiple post-doctoral research positions. We seek applicants with domain expertise necessary to advance the practice of synthesis in one of the challenge problems as well as applicants with expertise in theory and tools for synthesis. Applicants should email the CV and a research statement to Liz ng (wng at seas.upenn.edu), and also ask two or three references to email letters of recommendation to Liz Ng. For more information, please feel free to contact any of the ExCAPE PIs (see excape.cis.upenn.edu/principal-investigators.html ). From math.semantic.web at gmail.com Thu Jan 3 05:48:21 2013 From: math.semantic.web at gmail.com (Christoph LANGE) Date: Thu, 03 Jan 2013 11:48:21 +0100 Subject: [TYPES/announce] 2nd CfP (deadline 14 Jan): Enabling Domain Experts to use Formalised Reasoning, Stage 2 (AISB 2013, Exeter, UK, 2-3 Apr 2013) Message-ID: <50E561F5.9020707@gmail.com> Do-Form: Enabling Domain Experts to use Formalised Reasoning http://cs.bham.ac.uk/research/projects/formare/events/aisb2013 CALL FOR CONTRIBUTIONS Symposium at the annual convention of the AISB (Society for the Study of Artificial Intelligence and Simulation of Behaviour; http://www.aisb.org.uk) University of Exeter, UK 2-5 April 2013 http://emps.exeter.ac.uk/computer-science/research/aisb/ SPECIAL SESSIONS with * Utku ?nver (market design and matching problems) * Peter Cramton (auctions) * Neels Vosloo (finance markets regulation) SUBMISSION DEADLINE: 14 January This symposium is motivated by the long-term VISION of making information systems dependable. In the past even mis-represented units of measurements caused fatal ENGINEERING disasters. In ECONOMICS, the subtlety of issues involved in good auction design may have led to low revenues in auctions of public goods such as the 3G radio spectra. Similarly, banks' value-at-risk (VaR) models ? the leading method of financial risk measurement ? are too large and change too quickly to be thoroughly vetted by hand, the current state of the art; in the London Whale incident of 2012, JP Morgan claimed that its exposures were $67mn under one of its VaR models, and $129 under another one. Verifying a model's properties requires formally specifying them; for VaR models, any work would have to start with this most basic step, as regulators' current desiderata are subjective and ambiguous. We believe that these problems can be addressed by representing the knowledge underlying such models and mechanisms in a formal, explicit, machine-verifiable way. Contemporary computer science offers a wide choice of knowledge representation languages well supported by verification tools. Such tools have been successfully applied, e.g., for verifying software that controls commuter rail or payment systems (cf. the symposium homepage for further background). Still, DOMAIN EXPERTS without a strong computer science background find it challenging to choose the right tools and to use them. This symposium aims at investigating ways to support them. Some problems can be addressed now, others will bring new challenges to computer science. General TOPICS of interest include: * for DOMAIN EXPERTS: what problems in application domains could benefit from better verification and knowledge management facilities? Possible fields include: * Example 1 (economics): auctions, VaR, trading algorithms, market design * Example 2 (engineering): system interoperability, manufacturing processes, product classification * for COMPUTER SCIENTISTS: how to provide the right knowledge management and verification tools to domain experts without a computer science background? * wikis and blogs for informal, semantic, semiformal, and formal mathematical knowledge; * general techniques and tools for online collaborative mathematics; * tools for collaboratively producing, presenting, publishing, and interacting with online mathematics; * automation and computer-human interaction aspects of mathematical wikis; * ontologies and knowledge bases designed to support knowledge management and verification in application domains; * practical experiences, usability aspects, feasibility studies; * evaluation of existing tools and experiments; * requirements, user scenarios and goals. We particularly invite submissions that address the problems or that apply the tools presented in the papers submitted for stage 1 (see "submission" below). THE SYMPOSIUM is designed to bring domain experts and formalisers into close and fruitful contact with each other: domain experts will be able to present their fields and problems to formalisers; formalisers will be exposed to new and challenging problem areas. We will combine talks and hands-on sessions to ensure close interaction among participants from both sides. World-class economists will offer dedicated HANDS-ON SESSIONS on the following topics: * Market design and matching problems (Utku ?nver, Boston College): These include matching students to schools, interns to hospitals, and kidney donors to recipients. See the documentation for the 2012 Nobel Memorial Prize in Economic Sciences for more background information (http://www.nobelprize.org/nobel_prizes/economics/laureates/2012/). * Auctions (Peter Cramton, University of Maryland): Peter works on auctions for ICANN (the ?knock out? domain name auctions), Ofcom UK (4G spectrum auction), the UK Department of the Environment and Climate Change, and others. * Finance (Neels Vosloo, Financial Services Authority UK): It is currently impossible for regulators to properly inspect either risk management models, or algorithmic trading platforms. To what extent can techniques from mechanised reasoning automate some of the inspection process? SUBMISSIONS We solicit submissions on any of the TOPICS outlined initially but prefer submissions that specifically address topics identified in the earlier submission Stage 1. In Stage 1 we had solicited * from DOMAIN EXPERTS descriptions of "nails": canonical models and problems in their domain that might benefit from better verification and knowledge management facilities. Descriptions should focus on aspects of these models that domain users find particularly problematic, and suspect might be aided by formalisation tools * from COMPUTER SCIENTISTS descriptions of "hammers": formalisation, verification and knowledge management tools, with an emphasis on how they could be applied in a concrete real-world setting, or tailored to such application domains. Commented versions of these submissions are now online at http://www.cs.bham.ac.uk/research/projects/formare/events/aisb2013/stage1.php. A tool whose description is submitted to Stage 2 could, e.g., be motivated with a Stage 1 problem, and sketch how the tool could, or will, be applied in this domain. Each submission will be refereed by three PC members on average. Submissions will be judged based on the PC's views of the likelihood of contributing to a better matching of hammers (formalisation and verification tools) to nails (domain problems). At this stage we accept PDF submissions in any layout but count 1200 words as one page for fair comparison. We invite research and position papers, as well as tool and system descriptions, from 3 to 10 pages. Besides PDFs we invite the submission of formalised knowledge representations with human-readable annotations. To submit a paper, please go to the Do-Form EasyChair page (http://www.easychair.org/conferences/?conf=doform2013) and follow the instructions for Stage 2 there. FINAL VERSIONS Final versions should be prepared in LaTeX according to the AISB formatting guidelines linked from the symposium homepage. For the final version, non-PDF submissions should be accompanied by a PDF abstract of 2 to 4 pages. Electronic proceedings (with an ISBN) will be made available to the convention delegates on a memory stick, and on the AISB website. Given a sufficient number of high-quality submissions, we will invite authors to submit revised and extended versions to a SPECIAL ISSUE of a relevant JOURNAL. (E.g., co-chair Manfred Kerber is on the editorial board of Mathematics in Computer Science.) IMPORTANT DATES * Submission (Stage 2): 14 January 2013 * Notification: 11 February 2013 * Final versions due: 4 March 2013 * Symposium: 2-3 April 2013 (most likely) * AISB Convention: 2-5 April 2013 PROGRAMME COMMITTEE 1. Bill Andersen, Highfleet, US 2. Rob Arthan, Lemma 1, Reading, UK 3. Christoph Benzm?ller, Free University of Berlin, Germany 4. Peter Cramton, University of Maryland, US 5. James Davenport, University of Bath, UK 6. Michael Gr?ninger, University of Toronto, Canada 7. Manfred Kerber, University of Birmingham, UK (co-chair) 8. Michael Kohlhase, Jacobs University Bremen, Germany 9. Christoph Lange, University of Birmingham, UK (co-chair) 10. Till Mossakowski, University of Bremen, Germany 11. Colin Rowat, University of Birmingham, UK (co-chair) 12. Todd Schneider, Raytheon, US 13. Richard Steinberg, London School of Economics, UK 14. Geoff Sutcliffe, University of Miami, US 15. Theodore L Turocy, Centre for Behavioural and Experimental Social Science, University of East Anglia, UK 16. Makarius Wenzel, University of Paris Sud, France 17. Wolfgang Windsteiger, RISC / JKU Linz, Austria COMMENTS/QUESTIONS/ENQUIRIES to be sent to DoForm2013 at easychair.org From ulrik at cs.aau.dk Fri Jan 4 15:19:46 2013 From: ulrik at cs.aau.dk (Ulrik Nyman) Date: Fri, 4 Jan 2013 21:19:46 +0100 Subject: [TYPES/announce] CfP: EXTENDED DEADLINE: Advances in Systems of Systems an ETAPS workshop Message-ID: <50E73962.5040106@cs.aau.dk> AiSoS - Advances in Systems of Systems http://aisos.cs.aau.dk Due to multiple requests we have extended the deadline for submission to the *14th of January* We are delighted to present a new *ETAPS* workshop with a focus on the growing trend of more complex systems of systems. Examples are*smart grid, intelligent buildings, smart cities, transport systems*, etc. There is a need for new modeling formalisms, analysis methods and tools to help make trade-off decisions during design and evolution avoiding leading to sub-optimal design and rework during integration and in service. The workshop should focus on the modeling and analysis of System of Systems. The workshop Advances in Systems of Systems aims to gather people from different communities in order to encourage exchange of methods and views. The workshop welcomes submissions on *new modeling approaches, analysis technique, tools,** **case studies, surveys and tutorials.* Post proceedings will be published in EPTCS. Submission deadline:*January 14th* Best regards AiSoS organizers. - Kim G. Larsen, Axel Legay and Ulrik Nyman -- Ulrik Nyman,http://people.cs.aau.dk/~ulrik, phone +45 9940 9985 Associate Professor, Ph.D. Center for Embedded Software Systems, Department of Computer Science Aalborg University, Selma Lagerl?fs Vej 300, DK-9220 Aalborg East -------------- next part -------------- An HTML attachment was scrubbed... URL: From dargenio at famaf.unc.edu.ar Sun Jan 6 16:52:27 2013 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Sun, 6 Jan 2013 18:52:27 -0300 Subject: [TYPES/announce] Final Call for Workshops CONCUR 2013 Message-ID: [We apologise for multiple copies.] -------------------------------------------------------------------------------- * CONCUR 2013 * (http://www.concur-conferences.org/concur2013) Call for affiliated workshops The 24th Conference on Concurrency Theory (CONCUR 2013) will be held from August 26th to August 31st 2013, in Buenos Aires, Argentina. It will be co-located with the 10th International Conference on Quantitative Evaluation of SysTems (QEST), the 11th International Conference on Formal Modeling and Analysis of Timed Systems FORMATS and the 8th International Symposium on Trustworthy Global Computing (TGC). Researchers and practitioners are invited to submit proposals for workshops to be affiliated to CONCUR 2013, on topics related to concurrency theory and its applications. Example topics include: semantics, logics, verification techniques for concurrent systems, cross-fertilization between industry and academia and opportunities for young and prospective researchers. Past CONCUR conferences have been accompanied by successful workshops on a variety of topics, such as formal and foundational methods, models of systems (biological, timed), security issues, semantical issues, and verification methods. See the following links for examples of past workshops: http://conferences.ncl.ac.uk/concur-2012/workshops.htmlhttp://concur2011.rwth-aachen.de/workshopshttp://concur2010.inria.fr/workshopshttp://concur09.cs.unibo.it/satevents.html The purpose of the workshops is to provide participants with a friendly, interactive atmosphere for presenting novel ideas and discussing their application. The workshops take place on Monday, August 26th and Saturday, August 31st, 2013. Proposals should include: * The name and the preferred date of the proposed workshop. * Proposed workshop duration. * A short scientific summary of the topic, its scope and significance, including a discussion on the relation with CONCUR topics. * If applicable, a description of past versions of the workshop, including dates, organizers, submission and acceptance counts, and attendance. * Procedures for selecting papers and/or talks, plans for dissemination (for example, proceedings and special issues of journals), and the expected number of participants. Important Dates: Workshop proposals due: January 14, 2013 Notification of acceptance: January 21, 2013 Workshops: August 26 and August 3, 2013 Submissions to: Eduardo Bonelli (ebonelli at unq.edu.ar) and Diego Garbervetsky (diegog at dc.uba.ar) The CONCUR organization offers: * Link from the CONCUR web site. * Setup of meeting space, and related equipment. * Coffee-breaks. * Lunches. * On-line and on-site registration to the workshop. * One free workshop registration (for an invited speaker) The main responsibility of organizing a workshop goes to the workshop chairperson(s), including: * Workshop publicity (possibly including call for papers, submission and review process). * Scheduling workshop activities in collaboration with the CONCUR workshop chairs. For more information, please contact us via email ebonelli at unq.edu.ar and diego at dc.uba.ar The CONCUR 2013 workshop chairs, Eduardo Bonelli and Diego Garbervetsky -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Pichardie at irisa.fr Mon Jan 7 08:45:46 2013 From: David.Pichardie at irisa.fr (David Pichardie) Date: Mon, 7 Jan 2013 08:45:46 -0500 Subject: [TYPES/announce] ITP 2013: Last Call for Papers In-Reply-To: <88C25021-5301-4157-9FAA-E39B568C04B7@irisa.fr> References: <88C25021-5301-4157-9FAA-E39B568C04B7@irisa.fr> Message-ID: <353EDE25-C792-48FB-986A-4EF5C864AD00@irisa.fr> ITP 2013: 4th International Conference on Interactive Theorem Proving 23-26 July 2013, Rennes, France http://itp2013.inria.fr 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 in July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC), the second meeting took place in Nijmegen, The Netherlands, in August 2011 and the third meeting was held in Princeton, New Jersey, in August 2012. ITP 2013 will take place in Rennes, France on 23-26 July 2013 with workshops preceding the main conference. 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: All papers must be submitted electronically, via EasyChair: https://www.easychair.org/conferences/?conf=itp2013 Papers may be no longer than 16 pages and are to be submitted in PDF using the Springer "llncs" format. Instructions may be found at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/instruct/authors/typeinst.pdf with Latex source file typeinst.tex in the same directory. Submissions must describe original unpublished work not submitted for publication elsewhere, presented in a way that users of other systems can understand. The proceedings will be published as a volume in the Springer Lecture Notes in Computer Science series and will be available to participants at the conference. In addition to regular submissions, described above, there will be a "rough diamonds" section. 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. Accepted diamonds will be published in the main proceedings, and will be presented as short talks. Both regular and rough diamond submissions require an abstract of 70 to 150 words to be submitted electronically at the above address one week before the full submission. All submissions must be written in English. Submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. This material can be uploaded via easychair or made available online if a suitable URL is provided in the submitted paper. This material will not be accessed until February 11th (10 days after the paper submission deadline). Authors who have strong reasons (e.g. of commercial/legal nature) for violating this policy should contact the PC chairs in advance. At the time of abstract submission, proof assistants and other tools necessary for evaluating the submission should be indicated using the Keywords section of the web interface. 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: Abstract submission deadline: 28 January 2013 Paper submission deadline: 1st February 2013 Notification of paper decisions: 28 March 2013 Final versions due from authors: 22 April 2013 Conference dates: 23-26 July 2013 Web page: http://itp2013.inria.fr Program Committee: Wolfgang Ahrendt, Chalmers University, Sweden Jeremy Avigad, Carnegie Mellon University, USA Nick Benton, Microsoft Research, UK Lennart Beringer, Princeton University, USA Sandrine Blazy, University of Rennes, France (co-chair) Adam Chlipala, MIT, USA Thierry Coquand, Chalmers University, Sweden Amy Felty, University of Ottawa, Canada Ruben Gamboa, University of Wyoming, USA Herman Geuvers, Radboud University Nijmegen, The Netherlands Elsa Gunter, University of Illinois at Urbana-Champaign, USA David Hardin, Rockwell Collins, Inc., USA John Harrison, Intel Corporation, USA Gerwin Klein, NICTA and UNSW, Australia Assia Mahboubi, INRIA - ?cole polytechnique, France Panagiotis Manolios, Northeastern University, USA Conor Mcbride, University of Strathclyde, UK C?sar Mu?oz, NASA, USA Magnus O. Myreen, University of Cambridge, UK Tobias Nipkow, TU M?nchen, Germany Michael Norrish, NICTA and ANU, Australia Sam Owre, SRI International, USA Christine Paulin-Mohring, Universit? Paris-Sud 11, France (co-chair) Lawrence Paulson, University of Cambridge, UK David Pichardie, Inria Rennes/Harvard University, France (co-chair) Brigitte Pientka, McGill University, Canada Laurence Pierre, TIMA, France Lee Pike, Galois, Inc., USA Claudio Sacerdoti Coen, University of Bologna, Italy Julien Schmaltz, Open University of the Netherlands, The Netherlands Makoto Takeyama, AIST/COVS, Japan Laurent Th?ry, Inria Sophia-Antipolis, France Ren? Thiemann, University of Innsbruck, Austria Makarius Wenzel, Universit? Paris-Sud 11, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From Jeremy.Gibbons at cs.ox.ac.uk Mon Jan 7 08:55:06 2013 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Mon, 07 Jan 2013 13:55:06 +0000 Subject: [TYPES/announce] Three University Lectureships in Software Engineering at Oxford Message-ID: <201301071355.r07Dt6Rv021401@linux1.cs.ox.ac.uk> University of Oxford Department of Computer Science in association with Kellogg College, Oxford UNIVERSITY LECTURERS IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) - THREE POSTS The Department of Computer Science proposes to appoint three University Lecturers in Computer Science from 1st April 2013 and no later than 1st October 2013. The successful candidate will be offered a Non-Tutorial Fellowship at Kellogg College under arrangements described in Further Particulars. The salary will be on a scale currently up to ?57,581 per annum. The teaching duties of the appointees will be performed for the Software Engineering Programme, which offers part-time MScs in Software Engineering and Software and Systems Security, taught via a series of intensive one-week modules. The research interests of candidates should be in any area of Software Engineering or Computer Science relevant to these programmes. Applicants should hold a relevant PhD and have experience in any area which broadens the activities of the Software Engineering Programme (http://www.softeng.ox.ac.uk/). Full details of the qualifications required and the duties of the post can be found in the Further Particulars (http://www.cs.ox.ac.uk/files/5213/SEP_UL_FPs.pdf). The closing date for applications is Friday 8th February 2013. Queries about the post should be addressed in the first instance to Elizabeth Walsh at elizabeth.walsh at cs.ox.ac.uk or telephone: +44 (0) 1865 283503. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The University is an Equal Opportunities Employer. From Anuj.Dawar at cl.cam.ac.uk Mon Jan 7 10:45:00 2013 From: Anuj.Dawar at cl.cam.ac.uk (Anuj Dawar) Date: Mon, 07 Jan 2013 15:45:00 +0000 Subject: [TYPES/announce] Ackermann Award 2013 - call for nominations Message-ID: ACKERMANN AWARD 2013 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Eligible for the 2013 Ackermann Award are PhD dissertations in topics specified by the EACSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2011 and 31.12.2012. The deadline for submission is 15 April 2013. Submission details follow below. Nominations can be submitted from 1 January 2013 on and should be sent to the chair of the Jury, Anuj Dawar, by e-mail: anuj.dawar at cl.cam.ac.uk The Award The 2013 Ackermann award will be presented to the recipient(s) at the annual conference of the EACSL (CSL'13), 2-5 September 2013, in Torino (Italy). The award consists of * a diploma, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, * travel support to attend the conference. The jury is entitled to give more (or less) than one award per year. Jury The jury consists of: * Thierry Coquand (Chalmers University of Gothenburg); * Anuj Dawar (University of Cambridge), the president of EACSL; * Thomas A. Henzinger (IST Austria); * Daniel Leivant (Indiana University, Bloomington); * Damian Niwinski (University of Warsaw); * Luke Ong (University of Oxford), LICS representative; * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Wolfgang Thomas (RWTH, Aachen). How to submit The candidate or his/her supervisor has to submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior faculty or researchers in equivalent positions (in English); supporting letters can also be sent directly to Anuj Dawar (anuj.dawar at cl.cam.ac.uk); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period (scanned as pdf-file or faxed). The submission should preferably be sent by e-mail as attachments to professor Anuj Dawar: anuj.dawar at cl.cam.ac.uk With the following subject line and text: * Subject: Ackermann Award Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text. Letters of support and documents can also be faxed to: Prof. Anuj Dawar Ackermann Award +44 1223 334678 The Jury has the right to declare submissions to be out of scope or not to meet the requirements. From A.Murawski at warwick.ac.uk Tue Jan 8 12:41:44 2013 From: A.Murawski at warwick.ac.uk (Andrzej Murawski) Date: Tue, 8 Jan 2013 17:41:44 +0000 Subject: [TYPES/announce] LICS 2013 - Second Call for Workshop Proposals In-Reply-To: References: Message-ID: ********************************************************** Second Call for Workshop Proposals LICS 2013 28th ACM/IEEE Symposium on Logic In Computer Science http://lii.rwth-aachen.de/lics/lics13/ ********************************************************** The twenty-eighth ACM/IEEE Symposium on Logic In Computer Science (LICS 2013) will be held in New Orleans, USA, 25--28 June 2013. It will be colocated with MFPS (Mathematical Foundations of Programming Semantics) and CSF (IEEE Computer Security Foundations). Possible dates for workshops are Monday 24 June, Friday 28 June afternoon, and Saturday 29 June. Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - A discussion of the proposed format and agenda. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Your preferred dates. This is important! - Let us know if you would like your workshop to be a joint workshop with CSF. In that case you should submit to both. - Procedures for selecting participants and papers. - Expected number of participants. This is important! - Potential invited speakers. - Plans for dissemination (for example, special issues of journals). Proposals should be submitted via Easychair at https://www.easychair.org/conferences/?conf=licsworkshops2013 ********************************************************** Important dates: Submission deadline: February 15, 2013 Notification: February 25, 2013 Program of the workshops ready: April 30, 2013 Workshops: June 24, 2013 or June 28-29, 2013 LICS conference: June 25-28, 2013 ********************************************************** The workshops selection committee consists of the LICS General Chair (Luke Ong), LICS Workshops Chair (Patricia Bouyer-Decitre), LICS 2013 PC Chair (Orna Kupferman) and LICS 2013 Conference Chair (Mike Mislove). From corina.s.pasareanu at nasa.gov Tue Jan 8 17:39:31 2013 From: corina.s.pasareanu at nasa.gov (Corina Pasareanu) Date: Tue, 8 Jan 2013 14:39:31 -0800 Subject: [TYPES/announce] Call for Papers: PASTE 2013 Message-ID: <50ECA023.9000007@nasa.gov> 11th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) Seattle, WA - June 20, 2012, co-located with PLDI 2013 http://www.cs.williams.edu/PASTE2013/index.html PASTE 2013 is the eleventh workshop in a series that brings together the program analysis, software tools, and software engineering communities to focus on applications of program analysis techniques in software tools. PASTE 2013 will provide a forum for the presentation of exciting research, empirical results, and new directions in areas including (but not limited to): * program analysis for program understanding, debugging, testing, and reverse engineering * integration of program analysis into the software development and maintenance process * user interfaces for software tools and software visualization * applications of program analysis techniques * analysis of program execution or program evolution * integration of, or tradeoffs between, different analysis techniques * issues in scaling analyses and user interfaces to deal with large systems PASTE will be a true workshop, with research presentations, organized discussions, opportunities for all attendees to make short presentations, and ample time for debate. Submission Categories Regular papers: research papers that describe ongoing research or new results. The page limit for this category is 8 pages. The entire paper (including bibliography, appendices, related work discussion, etc.) must fit within the 8-page limit. Short papers: papers that discuss controversial issues in the field, or describe interesting or thought-provoking ideas that are not yet fully developed. The page limit for this category is 4 pages. The program committee will select papers based on technical quality, relevance to the PASTE community, and ability to inspire new research and productive discussions at the workshop. Submission Guidelines Papers should not exceed the page limits and must follow the ACM formatting guidelines. Submissions should be in PDF format, printable on US Letter size paper. Papers that do not respect these requirements or are submitted late will be summarily rejected. Papers submitted to PASTE 2013 must be original work, must not substantially duplicate previous work, and must not be under simultaneous review elsewhere. Violation of any of these criteria will be sufficient grounds for automatic rejection. Please consult the relevant ACM policies and SIGPLAN policies. At least one author of every accepted paper must register and attend the event to present their work. All accepted papers will be published by ACM, will appear in the ACM Digital Library, and will be subject to ACM copyright. Authors of accepted papers will be required to sign an ACM copyright form; please ensure with your employer that you will be authorized to transfer the copyright. Program Committee George Avrunin University of Massachusetts Eric Bodden EC Spride and Technical University Darmstadt Marsha Chechik University of Toronto Stephen N. Freund (co-chair) Williams College Sarfraz Khurshid The University of Texas at Austin Ben Liblit University of Wisconsin-Madison Ana Milanova Rensselaer Polytechnic Institute Aditya Nori Microsoft Research India Corina Pasareanu (co-chair) CMU (Silicon Valley) and NASA Ames Suzette Person NASA Langley Research Center Important Dates Friday, February 15, 2013 - Deadline of submission of technical papers Friday, March 29, 2013 - Notification of acceptance May, 2013 - Submission of final papers for proceedings Thursday, June 20, 2013 - Workshop -- Corina Pasareanu CMU SV, NASA Ames http://ti.arc.nasa.gov/profile/pcorina From coglio at kestrel.edu Wed Jan 9 01:46:07 2013 From: coglio at kestrel.edu (Alessandro Coglio) Date: Tue, 08 Jan 2013 22:46:07 -0800 Subject: [TYPES/announce] Research Positions at Kestrel Institute Message-ID: <50ED122F.3060503@kestrel.edu> Research Positions at Kestrel Institute ======================================= Kestrel Institute has several openings for computer science researchers in the broad topics of formal methods, program verification, software synthesis, and computer security. Areas that are of interest include: - Tools and methods for producing software that is known/proved to be correct and secure - Developing high-level, rigorous specifications/models and validating them using provers/solvers - Formalizing design and implementation knowledge (e.g., as libraries of refinements and program transformations) and generating high-quality code that satisfies security and correctness properties - Analyzing specifications, transformations, and code for security and correctness - Developing high-assurance plans and schedules Candidates should have a strong background in computer science, preferably at the Master's or Ph.D. level (or equivalent experience). Experience with one or more of the following is desirable: formal logic, theorem provers, formal specification systems, formal verification, functional programming languages, program transformation systems, or SAT/SMT solvers. Candidates should have strong implementation skills and a willingness to adapt to new application domains. Domains that are currently of interest include planning and scheduling, network operations, smart cards, Java analysis, memory management, synthetic diversity, computer and network security, security and communication protocols, embedded controllers, and malware detection. Kestrel Institute is a non-profit research center. Our website, www.kestrel.edu, describes our research. We offer competitive salaries and excellent benefits. All of our researchers are offered opportunities to take on project leadership roles, if so inclined. U.S. citizenship is a plus. Resumes may be submitted by email, fax, or mail to: Careers Reference: Computer Scientist Position Kestrel Institute 3260 Hillview Ave. Palo Alto, CA 94304 Fax: 650-424-1807 Email:careers at kestrel.edu Principals only, and no phone calls please. -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 3735 bytes Desc: S/MIME Cryptographic Signature URL: From web.alessio.guglielmi at gmail.com Wed Jan 9 12:14:10 2013 From: web.alessio.guglielmi at gmail.com (Alessio Guglielmi) Date: Wed, 9 Jan 2013 17:14:10 +0000 Subject: [TYPES/announce] Post-doc in Bath on the semantics of a bureaucracy-free formalism Message-ID: <50eda56a.d199cc0a.2840.76b8@mx.google.com> Hello, Please note that the closing date for this post-doc, which might be interesting to types people, is only two weeks from now. The link provided should lead you to the application pages. Don't hesitate to get in touch with me for any questions regarding this position. Ciao, -Alessio Research Officer - Computer Science (Fixed Term 3 Yrs) Salary: Starting from ?30,424, rising to ?36,298 Closing Date: Wednesday 23 January 2013 Interview Date: To be confirmed Reference: VH1457 The post is associated with the three-year EPSRC project "Efficient and Natural Proof Systems". The project is about developing an ambitious, modern semantic-motivated proof theory for representing natural proofs of minimal complexity. We are looking for a researcher who can work with categorical models of proofs and who has an interest in geometric proof representations such as proof nets and atomic flows. The main focus of this position will be in the semantic aspects of the new proof theory, working mainly with Guy McCusker, Alessio Guglielmi and Paola Bruscoli. The post will be available for up to 3 years, with effect from 1st February 2013. Web site of the project: This is our group: Paola Bruscoli Anupam Das Alessio Guglielmi Willem Heijltjes Jim Laird Guy McCusker John Power Cai Wingfield We are part of the Mathematical Foundations group of the Computer Science Department of the University of Bath. We study the mathematics of logical reasoning, of programs, of processes and of programming languages. In our research we use and develop category theory, game theory, model theory, proof theory, type theory and complexity theory. Our department has an outstanding research profile: in the most recent national Research Assessment Exercise our research output was ranked fourth out of 81 university submissions in the UK. This year our university has been recognised as third in the country in The Sunday Times University Guide. From deligu at di.unito.it Thu Jan 10 03:33:04 2013 From: deligu at di.unito.it (Ugo de' Liguoro) Date: Thu, 10 Jan 2013 09:33:04 +0100 Subject: [TYPES/announce] Control Operators and their Semantics (COS'13) - Call for Papers Message-ID: <50EE7CC0.7020705@di.unito.it> ================================================= Control Operators and their Semantics (COS'13) - Call for Papers Satellite event of RDP'13 June 24 - 25, 2013, Eindhoven, The Nederlands http://cos2013.di.unito.it/ ================================================= Modern programming languages provide sophisticated control mechanisms, commonly referred to as control operators which are widely used to realize a variety of applications. Since we cannot escape control features, it becomes a challenge to provide them with sound reasoning principles. There is a very active research on understanding, manipulating, representing, and reasoning about elaborated non-local control structures, in particular in declarative programming languages such as functional and logic languages. Ideas and results originating from this research area have impact in many other areas of computer science, like distributed and concurrent systems, proof theory, proof mining, web programming and linguistics. For instance, the study of the logical foundations of control operators renewed the study of the connections between proofs and programs via the so-called Curry-Howard correspondence, providing new methods to extract the computational content of classical proofs. The focus of the workshop is on the interplay between syntax and semantics, namely the central question of what a program means and how it does define the intended procedure. This is a crucial issue especially in the case of control operators, since they are as powerful as potentially obscure, and programs that use them are usually more error prone than purely declarative ones. The issue of a better understanding of control is also relevant for communicating across different research areas and communities. More abstract views can be achieved via several means, that include operational semantics of formal calculi, abstract machines, algebraic specifications and rewriting, type assignment systems, denotational semantics and game semantics, category theory and logic, to say the least. Relevant topics include, but are not limited to: - continuations and delimited continuations - categorical models of continuations - compositionality and modularity of control operators - denotational semantics of control, event structures and causality - operational semantics and abstract machines - type systems for control operators - game semantics of programming languages and of logical proofs - usage of control operators in proof search and proof mining - semantics of control operators in logic programming Invited speakers (topics): - delimited continuations TBA - game semantics of control TBA Program Committee: Zena Ariola University of Oregon Stefano Berardi Turin University Hugo Herbelin INRIA and Laboratoire PPS (Paris 7) Ugo de'Liguoro (chair) Turin Univerisity Ken-etsu Fujita Gunma University Koji Nakazawa Kyoto University Alexis Saurin, INRIA Laboratoire PPS (Paris 7) Proceedings: will appear in the EPTCS series. Submission: authors of original papers, which have not been published elsewhere, are invited to submit title and abstract to the site: https://www.easychair.org/conferences/?conf=cos2013 on EasyChair, within 24th March 2013. The proper submission is expected within 6th April via EasyChair. It consists of a LaTex generated pdf file, using EPTCS macro package, available from: http://info.eptcs.org/ Notifaction of acceptance is due to 31th May 2013. Accepted papers will be submitted via EasyChair both as pdf and source files, within 15th June 2013. Important Dates: Abstract: March, 24 2013 Submission: April, 6 2013 Notification: May, 31 2013 Final version: June, 15 2013 Workshop: June, 24-25 2013 Contact: Ugo de'Liguoro Dipartimento di Informatica, Universit? di Torino, Corso Svizzera 185, 10149 Torino, Italy email: deliguoro at di.unito.it Web sites: COS'13: http://cos2013.di.unito.it RTD'13: http://www.win.tue.nl/rdp2013/ From james.cheney at gmail.com Thu Jan 10 06:34:24 2013 From: james.cheney at gmail.com (James Cheney) Date: Thu, 10 Jan 2013 11:34:24 +0000 Subject: [TYPES/announce] PhD opportunities at the University of Edinburgh In-Reply-To: References: Message-ID: Hi, To follow up the earlier announcement: in addition to a PhD studentship in any research area, advertised below, we now have confirmed funding from Microsoft Research for the following project: Provenance for Configuration Language Security http://homepages.inf.ed.ac.uk/jcheney/msr-phd.html Ideal candidates would have a background in programming languages, security or databases, and a strong interest in combining foundational and practical research techniques. The application deadline for full consideration is January 28; all applications by this date will be considered for full funding. Applications will be accepted until the position is filled or March 1, whichever is earlier. Prospective applicants are strongly encouraged to contact me ( jcheney at inf.ed.ac.uk) or Paul Anderson (dcspaul at ed.ac.uk) to discuss their suitability for the project before applying. If you have already applied and are interested in this position please let us know (it is not necessary to re-apply). --James On Wed, Nov 21, 2012 at 6:24 PM, James Cheney wrote: > Hi, > > I am recruiting for at least one funded PhD studentship at the University > of Edinburgh, working with me on one of the following topics (with further > details given at the associated links). > > * Nominal logic, automated reasoning and type theory ( > http://wcms.inf.ed.ac.uk/lfcs/study/nominal-logic-automated-reasoning-and-type-theory > ) > > * Provenance, programming languages, and security ( > http://wcms.inf.ed.ac.uk/lfcs/study/provenance-programming-languages-and-security > ) > > * XML query/update languages and static analysis ( > http://wcms.inf.ed.ac.uk/lfcs/study/xquery-update-static-analysis) > > * Provenance, curation, and archiving for scientific data ( > http://wcms.inf.ed.ac.uk/lfcs/study/provenance-curation-and-archiving-for-scientific-data > ) > > Projects in other areas related to programming languages, data management, > or their intersection are also possible; prospective applicants are > encouraged to contact James Cheney (jcheney at inf.ed.ac.uk), Stratis Viglas > (sviglas at inf.ed.ac.uk), Peter Buneman (opb at inf.ed.ac.uk) or Paul Anderson > (dcspaul at ed.ac.uk) to discuss potential project ideas. Possible research > topics with others in LFCS are listed at > http://wcms.inf.ed.ac.uk/lfcs/study/research-topics along with contact > information for prospective supervisors. > > Available funding can cover full fees and a stipend for a 3-year PhD > project for a student from the UK or EU. Additional studentships on > similar terms may be available contingent on funding decisions. For > students from other countries, the School provides assistance identifying > and applying for appropriate sources of funding to cover additional > applicable fees. > > To apply, please follow the instructions at: > > http://www.ed.ac.uk/schools-departments/informatics/postgraduate/apply/ > > and apply to the LFCS PhD program (or just jump directly to > http://www.ed.ac.uk/studying/postgraduate/degrees?id=493&cw_xml=details.php). > The first deadline for applications is *December 14*; applications received > by this date will receive full consideration for available funding > sources. Please get in touch early in case of questions about the > application process, project ideas or study in the UK or Edinburgh. > > --James > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From lutz at lix.polytechnique.fr Thu Jan 10 07:35:40 2013 From: lutz at lix.polytechnique.fr (Lutz Strassburger) Date: Thu, 10 Jan 2013 13:35:40 +0100 (CET) Subject: [TYPES/announce] Postdoc position in proof theory in Paris Message-ID: -------------------------------------------------------- Postdoc position in proof theory in Paris -------------------------------------------------------- There is an opening of a postdoc position on structural and computational proof theory. The position is financed by the ANR within the project STRUCTURAL. The postdoc will be hosted by INRIA and the Laboratoire d'Informatique (LIX) at the Ecole Polytechnique, one of the "Grand Ecoles" in the French university system, located in the suburbs of Paris. The successful candidate will be working within the PARSIFAL team. Starting date should be between February and April 2013. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and related topics. The principal responsibility of the postdoc will be to carry out research in the area of proof theory within the project STRUCTURAL. There are no teaching duties. For further information, see or contact Lutz Strassburger Applications should be sent via email to Lutz Strassburger and should include a CV, a research statement (1-2 pages), and one or two recommendation letters. The application deadline is *** January 31, 2013 *** From katoen at cs.rwth-aachen.de Thu Jan 10 15:04:48 2013 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Thu, 10 Jan 2013 21:04:48 +0100 Subject: [TYPES/announce] ETAPS 2013 Call for Participation Message-ID: <50EF1EE0.2020201@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** CALL FOR PARTICIPATION: ETAPS 2013 European Joint Conferences on Theory And Practice of Software March 16 - March 24, 2013 Rome, Italy http://www.etaps.org/2013 Early registration deadline: January 30, 2013 ****************************************************************** -- 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 six main annual conferences, accompanied by satellite workshops and invited tutorials (new in 2013). ETAPS 2013 is already the sixteenth event in the series. -- MAIN CONFERENCES -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED SPEAKERS -- * Gilles Barthe (Fundaci?n IMDEA Software, Madrid, Spain) * Emily Berger (Univ. of Mussachusetts, Amherst, USA) * Krzysztof Czarnecki (Univ. of Waterloo, Canada) * Cedric Fournet (Microsoft Research, Cambridge, UK) * Orna Grumberg (Technion, Haifa, Israel) * Martin Hofmann (Univ. of Munich, Germany) * Jean-Pierre Hubaux (EPFL, Losanna, Switzerland) * Mark S. Miller (Google Research, USA) -- INVITED TUTORIAL SPEAKERS -- * John C. Mitchell (Stanford Univ., USA) * Martin Fr?nzle (Univ. of Oldenburg, Germany) * Ralf K?sters (Univ. of Trier, Germany) The tutorials take place on Sunday March 17 before ETAPS 2013. -- SATELLITE EVENTS -- 22 satellite workshops will take place before or after ETAPS 2013. ACCAT, AiSoS, BX, DICE, Found. Syst. Spec., HAS, HotSpot, MBT, MEALS, SR, OCCP, and VSSE will take place in the weekend on 16-17 March 2013. Bytecode, CerCo, FESCA, GT-VMT, GRAPHITE, IC1201, MLQA, PLACSE, QAPL, and TERMGRAPH are scheduled for 31 March-1 April 2012. -- REGISTRATION Early registration is until Sunday, January 30 2013. -- ACCOMMODATION Roma has a huge hotel capacity. You can either arrange your accommodation on your own or find some reserved hotels on the registration page. Such reservations expire on February 15, but new ones will appear after this deadline during the entire registration period. -- HOST CITY -- Rome is the capital of Italy and the country's largest and most populated municipality. The city is located in the central- western portion of the Italian Peninsula, on the Tiber river. Rome's history spans over two and a half thousand years. It was the capital city of the Roman Kingdom, of the Roman Republic and of the Roman Empire, which was a major political and cultural influence in the lands bordering the Mediterranean Sea. Since the 2nd century AD, Rome has been the seat of the Papacy and, after the end of the Byzantine domination, in the eighth century it became the capital of the Papal States. In 1871, Rome became the capital of the Kingdom of Italy, and in 1946 that of the Italian Republic. Rome's influence on western Civilisation can hardly be overstated, and the city is still recognised as a centre of the arts and education. Due to this centrality on many levels, and much of the city's past power and influence, Rome has been nicknamed "Caput Mundi" (Latin for "Capital of the World") and "The Eternal City". -- ORGANIZERS -- The event is organized in Sapienza Universit? di Roma. Sapienza has a very long and prestigious history, it is the largest university in Europe and the second-largest in the world, with more than 150,000 students. * General chair: Daniele Gorla * Conferences Chair: Francesco Parisi Presicce * Workshops Chairs: Paolo Bottoni and Pietro Cenciarelli * Publicity Chair: Ivano Salvo * Finance Chairs: Enrico Tronci and Federico Mari * Web Site Chair: Igor Melatti -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps13 at di.uniroma1.it. From g.grov at hw.ac.uk Fri Jan 11 04:07:32 2013 From: g.grov at hw.ac.uk (Gudmund Grov) Date: Fri, 11 Jan 2013 09:07:32 +0000 Subject: [TYPES/announce] SCP Special Issue on Invariant Generation - Final Call for Papers [1 month to go] Message-ID: <581A30D3-5870-4541-AA85-F838F4BCFC1B@hw.ac.uk> (Apologies if you receive multiple copies of this announcement) ------------------------------------------------------------ Science of Computer Programming Special Issue on Invariant Generation -- FINAL CALL FOR PAPERS [1 month to go] -- ------------------------------------------------------------ This special issue is devoted to the 4th international Workshop on Invariant Generation (WING 2012) http://cs.nyu.edu/acsys/wing2012/ which was held on June 30 2012 in Manchester as a satellite event of IJCAR 2012. The scope of the workshop is the automation of extracting and synthesising auxiliary properties of programs, in particular providing, debugging, and verifying auxiliary invariant annotations. This should be seen in a broad sense and relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive assertion generation * Inductive proofs for reasoning about loops * Applications to assertion generation using: - abstract interpretation, - static analysis, - model checking, - theorem proving, - theory formation, - algebraic techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Submission to this special issue is completely open. We expect original articles (typically not more than 30 pages) that present high-quality contributions and must not be simultaneously submitted for publication elsewhere. Submission of extended versions of previously published papers is possible as long as the extension is significant, i.e., the submission can be considered a new paper, the previous paper is referenced, and the new material is clearly marked. Submissions must comply with SCP's author guidelines http://www.elsevier.com/wps/find/journaldescription.cws_home/505623/authorinstructions and be written in English. Submission is over the SCP website: http://ees.elsevier.com/scico/default.asp which you will have to register for if you do not have an account. When submitting your paper please choose the article type "Special issue: WING 2012". IMPORTANT DATES --------------- * Submission of papers: February 11, 2013. * Notification: April 26, 2013. GUEST EDITORS -------------- * Gudmund Grov (Heriot-Watt University, UK) * Thomas Wies (New York University, USA) CONTACT -------------- Please send any queries you may have to: wing2012 at easychair.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278. From paolini at di.unito.it Fri Jan 11 03:46:40 2013 From: paolini at di.unito.it (Luca Paolini) Date: Fri, 11 Jan 2013 09:46:40 +0100 Subject: [TYPES/announce] TLCA 2013 Last Call for Papers Message-ID: <50EFD170.4010008@di.unito.it> ================================================================ TLCA 2013 Last Call for Papers 11th International Conference on Typed Lambda Calculi and Applications Eindhoven, 23-28 June 2013 co-located with RTA 2013 as part of RDP 2013 TLCA 2013 webpage: http://www.kurims.kyoto-u.ac.jp/tlca2013/ RDP 2013 webpage: http://www.win.tue.nl/rdp2013/ *** Title and abstract due 25 January 2013 *** *** Deadline for submission 1 February 2013 *** ================================================================ The 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013) 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: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models * Types: subtypes, dependent types, polymorphism, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants * Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, flow analysis of higher-type computation, program equivalence, program transformation and optimization INVITED SPEAKERS * Simon Peyton-Jones (Microsoft Cambridge, UK) Joint invited speaker for RTA+TLCA 2013 * Hugo Herbelin (INRIA, France) invited speaker for TLCA 2013 * Damiano Mazza (Universite Paris-Nord, France) invited speaker for TLCA 2013 IMPORTANT DATES * Paper Registration (titles & short abstracts): 25 January 2013 * Full Paper Submission: 1 February 2013 * Author Notification: 22 March 2013 * Camera-Ready Paper for the Proceedings: 12 April 2013 SUBMISSION GUIDELINES We solicit submissions of research papers, which must: * be in English and not exceed 15 pages (including figures and bibliography). Additional material intended for the reviewers 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. Reviewers will be told that they may choose to ignore the appendix. * present original research which is unpublished and not submitted elsewhere (conferences, journals, books, etc.) * use the Springer-Verlag LNCS style. * be submitted electronically in PDF via the EasyChair TLCA 2013 Submission Webpage https://www.easychair.org/conferences/?conf=tlca2013 . Submissions deviating from these instructions may be rejected without review. A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. The proceedings will be published as a volume in the ARCoSS subline series of Springer-Verlag Lecture Notes in Computer Science. Final papers will be in the format specified by Springer-Verlag. Any questions regarding the submission guidelines should be directed to the Programme Committee Chair (Masahito Hasegawa ) prior to submitting. COLOCATED EVENTS TLCA 2013 is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the International Conference on Rewriting Techniques and Applications (RTA 2013) and several related events. Details on workshops affiliated with RDP 2013 will be available at the web site in due course. CONFERENCE CHAIR Herman Geuvers (Radboud University Nijmegen, Netherlands) PROGRAMME COMMITTEE CHAIR Masahito Hasegawa (Kyoto University, Japan) PROGRAMME COMMITTEE Andreas Abel (LMU Munchen, Germany) Patrick Baillot (CNRS and ENS Lyon, France) Nick Benton (Microsoft Cambridge, UK) Lars Birkedal (IT University of Copenhagen, Denmark) Herman Geuvers (Radboud University Nijmegen, Netherlands) Masahito Hasegawa (Kyoto University, Japan) (PC chair) Naoki Kobayashi (University of Tokyo, Japan) Paul-Andre Mellies (CNRS and Universite Paris Diderot, France) Thomas Streicher (TU Darmstadt, Germany) Lorenzo Tortora de Falco (Universita Roma Tre, Italy) Stephanie Weirich (University of Pennsylvania, US) TLCA STEERING COMMITTEE Samson Abramsky (University of Oxford, UK) Henk Barendregt (Radboud University Nijmegen, Netherlands) Pierre-Louis Curien (CNRS and Universite Paris Diderot, France) Mariangiola Dezani-Ciancaglini (Universita di Torino, Italy) Martin Hofmann (LMU Munchen, Germany) Luke Ong (University of Oxford, UK) Simona Ronchi Della Rocca (Universita di Torino, Italy) Pawel Urzyczyn (University of Warsaw, Poland) TLCA HONORARY ADVISOR Roger Hindley (Swansea University) TLCA PUBLICITY CHAIR Luca Paolini (Universita di Torino, Italy) From ulrich.fahrenberg at irisa.fr Fri Jan 11 07:08:51 2013 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Fri, 11 Jan 2013 13:08:51 +0100 Subject: [TYPES/announce] Call for Papers: Runtime Verification 2013 Message-ID: <50F000D3.4070406@irisa.fr> Apologies should you receive multiple copies of this email: CALL FOR PAPERS RV'13 Fourth International Conference on Runtime Verification INRIA Rennes, France 24-27 September 2013 http://rv2013.gforge.inria.fr/ RV'13, the Fourth International Conference on Runtime Verification, will take place at INRIA Rennes, France, from 24 to 27 September 2013. IMPORTANT DATES Abstract submission: 28 April 2013 Paper submission: 5 May 2013 Notification: 17 June 2013 Final version: 15 July 2013 SCOPE Runtime verification is concerned with monitoring and analysis of soft- ware and hardware system executions. Runtime verification techniques are crucial for system correctness and reliability; they are signif- icantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for verification and debugging purposes, and after deployment for ensuring reliability, safety and security, and for providing fault containment and recovery. TOPICS - specification languages and formalisms for traces - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization PUBLICATION The RV'13 proceedings will be published as a volume of the LNCS series at Springer. Submission of papers to RV'13 is handled through EasyChair. The submission link is https://www.easychair.org/conferences/?conf=rv13 For more information, see http://rv2013.gforge.inria.fr/ From einarj at ifi.uio.no Fri Jan 11 09:08:58 2013 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Fri, 11 Jan 2013 15:08:58 +0100 Subject: [TYPES/announce] iFM 2013 deadline extension Message-ID: <8056378D-1E9A-4174-9780-F505BF893B88@ifi.uio.no> iFM 2013 - DEADLINE EXTENSION! ********************************************************************** 10th International Conference on integrated Formal Methods (iFM 2013) June 10 - 14, 2013 - Turku, Finland http://www.it.abo.fi/iFM2013/ ********************************************************************** Please note that the following extended deadlines are strict. IMPORTANT DATES - Abstract Submission: January 17, 2013 - Paper submission: January 27, 2013 - Paper notification: March 11, 2013 - Final version paper: March 31, 2013 OBJECTIVES AND SCOPE Applying formal methods may involve modeling different aspects of a system which are best expressed using different formalisms. Correspondingly, different analysis techniques may be used to examine different 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 hybrid approaches to formal modeling and analysis; i.e., 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: - Formal and semiformal modelling notations; - Integration of formal methods into software engineering practice; - Refinement; - Theorem proving; - Tools; - Logics; - Model checking; - Model transformations; - Semantics; - Static Analysis; - Type Systems; - Verification; - Case Studies; - Experience reports INVITED SPEAKERS iFM 2013 will have the following keynote speakers: - Jean-Raymond Abrial, Marseille, France: From Z to B and then Event-B: Assigning Proofs to Meaningful Programs - Susanne Graf, VERIMAG, France: Integrating Distributed Control over Systems with Priorities - Cosimo Laneve, University of Bologna, Italy: An Algebraic Theory for Web Services Contracts - Kim Larsen, Aalborg University, Denmark: Statistical Model Checking with Priced Timed Automata SPECIAL ISSUES To celebrate the 10th edition of iFM, there will be special issues of the Springer journals - Formal Aspects of Computing - Software and Systems Modeling The best papers from iFM 2013 will be invited for these special issues, complemented by an open call for papers, and undergo a separate peer-review process according to the usual scientific standards of these journals. WORKSHOPS AND TUTORIALS There will be two days of workshops and tutorials before the iFM conference. The conference will take place June 12-14, 2013 and the tutorials and workshops June 10-11, 2013. We are happy to announce the following workshops and tutorials that will accompany iFM 2013: - CompMod 2013: The 4th International Workshop on Computational Models for Cell Processes Website: http://combio.abo.fi/compmod13/ Organiser: Ion Petre, ?bo Akademi University, Finland - The 11th Overture Workshop Website: http://wiki.overturetool.org/index.php/11th_Overture_Workshop Organisers: Stefan Hallerstede, Aarhus University, Denmark and Ken Pierce, University of Newcastle, UK - Rodin User and Developer Workshop 2013 Website: http://wiki.event-b.org/index.php/Rodin_Workshop_2013 Organisers: Michael Butler, University of Southampton; Stefan Hallerstede, Aarhus University; Thierry Lecomte, ClearSy; Michael Leuschel, University of D?sseldorf; Alexander Romanovsky, University of Newcastle; Laurent Voisin, Systerel; Marina Walden, ?bo Akademi University - FMDEP 2013: Workshop on Formal Methods for Dependable Computer-Based Systems Website: to be announced Organisers: J?ri Vain, Tallinn University of Technology, Estonia and Leonidas Tsiopoulos, ?bo Akademi University, Finland - BCS FACS 2013 Refinement Workshop 2013 Website: http://www.refinenet.org.uk/ref13/cfp.html Organisers: Eerke Boiten, University of Kent, UK; John Derrick, University of Sheffield, UK; Steve Reeves, University of Waikato, NZ - Tutorial: Specification and Proof of Programs with Frama-C Organizers: Nikolai Kosmatov, Virgile Prevosto, and Julien Signoles (Software Safety Laboratory, CEA LIST) SUBMISSION GUIDELINES iFM 2013 solicits high quality papers reporting research results and/or experience reports related to the overall theme of method integration. The conference proceedings will be published in Springer's Lecture Notes in Computer Science series. All submissions must be original, unpublished, and not submitted for publication elsewhere. Submissions must be in PDF format, using the Springer LNCS style files; we suggest to use the LaTeX2e package (the llncs.cls class file, available in llncs2e.zip and the typeinst.dem available in typeinst.zip as a template for your contribution). Papers should not exceed 15 pages in length. Each paper will undergo a thorough review process. Submissions should be made using the iFM 2013 Easychair web site: https://www.easychair.org/account/signin.cgi?conf=ifm2013 All accepted papers must be presented at the conference. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by the early date, to be indicated by the organizers, and present the paper. iFM PROGRAMME COMMITTEE CHAIRS: - Einar Broch Johnsen, University of Oslo, Norway - Luigia Petre, ?bo Akademi University, Finland iFM 2013 TUTORIALS and WORKSHOPS CHAIR Pontus Bostr?m, ?bo Akademi University, Finland iFM 2013 ORGANIZING COMMITTEE CHAIR Luigia Petre, ?bo Akademi University, Finland PROGRAM COMMITTEE - Erika Abraham, RWTH Aachen University, Germany; - Elvira Albert, Complutense University of Madrid, Spain; - Marcello Bonsangue, Leiden University, the Netherlands; - Phillip J Brooke, Teesside University, UK; - Ana Cavalcanti, University of York, UK; - Dave Clarke, Catholic University of Leuven, Belgium; - John Derrick, Unversity of Sheffield, UK; - Jin Song Dong, National University of Singapore, Singapore; - Kerstin Eder, University of Bristol, UK; - John Fitzgerald, Newcastle University, UK; - Andy Galloway, University of York, UK; - Marieke Huisman, University of Twente, the Netherlands; - Reiner H?hnle, Technical University of Darmstadt, Germany; - Einar Broch Johnsen, University of Oslo, Norway; - Peter Gorm Larsen, Aarhus University, Denmark; - Diego Latella, ISTI-CNR, Pisa, Italy; - Michael Leuschel, University of Duesseldorf, Germany; - Shaoying Liu, Hosei University, Japan; - Michele Loreti, University of Florence, Italy; - Dominique Mery, LORIA and University of Lorraine, France; - Stephan Merz, INRIA Lorraine, France; - Richard Paige, University of York, UK; - Luigia Petre, ?bo Akademi University, Finland; - Kristin Yvonne Rozier, NASA Ames Research Center, USA; - Philipp Ruemmer, Uppsala University, Sweden; - Thomas Santen, European Microsoft Innovation Center, Germany; - Ina Schaefer, Technical University of Braunschweig, Germany; - Steve Schneider, University of Surrey, UK; - Emil Sekerinski, McMaster University, Canada; - Graeme Smith, University of Queensland, Australia; - Colin Snook, University of Southampton, UK; - Kenji Taguchi, AIST, Japan; - Helen Treharne, University of Surrey, UK; - Heike Wehrheim, University of Paderborn, Germany; - Herbert Wiklicky, Imperial College, UK; - Gianluigi Zavattaro, University of Bologna, Italy ********************************************************************** This call for papers and additional information about the conference can be found at http://www.it.abo.fi/iFM2013 For information regarding the conference you can contact: ifm2013 at abo.fi From Jean-Christophe.Filliatre at lri.fr Fri Jan 11 11:43:09 2013 From: Jean-Christophe.Filliatre at lri.fr (Jean-Christophe Filliatre) Date: Fri, 11 Jan 2013 17:43:09 +0100 Subject: [TYPES/announce] ARiSVe 2013 Call for Papers Message-ID: <50F0411D.70302@lri.fr> Call For Papers 1st International Workshop on Automated Reasoning in Software Verification http://arisve2013.lri.fr/ Monday, June 10, 2013 Lake Placid, NY, USA Affiliated with CADE-24 Aims and Scope The focus of the workshop is application of automated reasoning in the context of software verification, and, more generally, automation in software verification. Relevant topics include but are not limited to: * specifics of verification-related automated reasoning tasks; * efficient translation of high-level verification conditions to logical languages of automated reasoning tools; * handling of the prover's feedback: proofs, models, answer terms; * logical theories of interest for program verification, decision procedures, integration into existing ATP and SMT systems; * combination of automated and user-assisted verification; * tool presentations, tool comparisons, and benchmarks; * experience reports on verification of complex algorithms and real-life software with the use of automated reasoning tools. Paper Submission and Proceedings All submissions are reviewed by the programme committee. We expect that one author of every accepted paper will present their work at the workshop. Submissions are limited to 6-12 pages in the LaTeX EasyChair format easychair.cls (http://www.easychair.org/publications/easychair.zip). Technical details may be included in an appendix to be read at the reviewers' discretion. Tool presentation papers and experience reports are welcome. Papers should be submitted through EasyChair, at http://www.easychair.org/conferences/?conf=arisve2013 Submissions must be in PDF format. Electronic version of proceedings will be freely distributed from the workshop web site. Important Dates * Abstract submission deadline: March 8, 2013 * Submission deadline: March 15, 2013 * Notification: April 10, 2013 * Camera ready versions due: May 10, 2013 * Workshop: June 10, 2013 Invited Speaker K. Rustan M. Leino (Microsoft Research) Program Committee * June Andronick (NICTA) * Clark Barrett (New York University) * Ernie Cohen (Microsoft Corp.) * Lo?c Correnson (CEA) * Gidon Ernst (Ausburg University) * Jean-Christophe Filli?tre (CNRS), co-chair * Alwyn Goodloe (NASA) * Matthias Horbach (Koblenz University) * Vladimir Klebanov (Karlsruhe Institute of Technology) * Konstantin Korovin (The University of Manchester) * Rosemary Monahan (National University of Ireland) * Andrei Paskevich (Universit? Paris-Sud), co-chair * Silvio Ranise (Fondazione Bruno Kessler) From herbert at doc.ic.ac.uk Fri Jan 11 14:57:18 2013 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Fri, 11 Jan 2013 19:57:18 +0000 Subject: [TYPES/announce] QAPL 2013 - Call for short papers and participation Message-ID: <50F06E9E.7070407@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************** CALL FOR PAPERS & PARTICIPATION Eleventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2013) Affiliated with ETAPS 2013 March 23 - 24, 2013, Rome, Italy http://qapl2013.units.it qapl2013 at units.it ******************************************************************************** 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, Cyber-physical systems, Concurrent systems, and Resource analysis. SHORT PAPERS: 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=qapl13 Presentation reports will receive a light weight review to establish their relevance for the workshop. The authors of accepted reports are expected to present and discuss their work at the workshop. DATES FOR SHORT PAPERS: Submission: January 23, 2013 Notification: January 25, 2013 REGISTRATION: The registration for QAPL'13 is via the ETAPS'13 web-page: http://www.etaps.org/2013 Early registration from 9 January 2013 to 30 January 2013. Normal registration from 31 January 2013 to 8 March 2013. On-site registration from 16 March 2013 to 24 March 2013. From math.semantic.web at gmail.com Fri Jan 11 18:20:50 2013 From: math.semantic.web at gmail.com (Christoph LANGE) Date: Fri, 11 Jan 2013 23:20:50 +0000 Subject: [TYPES/announce] Deadline Extension (28 Jan): Enabling Domain Experts to use Formalised Reasoning, Stage 2 (AISB 2013, Exeter, UK, 2-5 Apr 2013) Message-ID: <50F09E52.1020508@gmail.com> Do-Form: Enabling Domain Experts to use Formalised Reasoning http://cs.bham.ac.uk/research/projects/formare/events/aisb2013 CALL FOR CONTRIBUTIONS Symposium at the annual convention of the AISB (Society for the Study of Artificial Intelligence and Simulation of Behaviour; http://www.aisb.org.uk) University of Exeter, UK 2-5 April 2013 http://emps.exeter.ac.uk/computer-science/research/aisb/ SPECIAL SESSIONS with * Utku ?nver (market design and matching problems) * Peter Cramton (auctions) * Neels Vosloo (finance markets regulation) SUBMISSION DEADLINE (extended): 28 January This symposium is motivated by the long-term VISION of making information systems dependable. In the past even mis-represented units of measurements caused fatal ENGINEERING disasters. In ECONOMICS, the subtlety of issues involved in good auction design may have led to low revenues in auctions of public goods such as the 3G radio spectra. Similarly, banks' value-at-risk (VaR) models ? the leading method of financial risk measurement ? are too large and change too quickly to be thoroughly vetted by hand, the current state of the art; in the London Whale incident of 2012, JP Morgan claimed that its exposures were $67mn under one of its VaR models, and $129 under another one. Verifying a model's properties requires formally specifying them; for VaR models, any work would have to start with this most basic step, as regulators' current desiderata are subjective and ambiguous. We believe that these problems can be addressed by representing the knowledge underlying such models and mechanisms in a formal, explicit, machine-verifiable way. Contemporary computer science offers a wide choice of knowledge representation languages well supported by verification tools. Such tools have been successfully applied, e.g., for verifying software that controls commuter rail or payment systems (cf. the symposium homepage for further background). Still, DOMAIN EXPERTS without a strong computer science background find it challenging to choose the right tools and to use them. This symposium aims at investigating ways to support them. Some problems can be addressed now, others will bring new challenges to computer science. General TOPICS of interest include: * for DOMAIN EXPERTS: what problems in application domains could benefit from better verification and knowledge management facilities? Possible fields include: * Example 1 (economics): auctions, VaR, trading algorithms, market design * Example 2 (engineering): system interoperability, manufacturing processes, product classification * for COMPUTER SCIENTISTS: how to provide the right knowledge management and verification tools to domain experts without a computer science background? * wikis and blogs for informal, semantic, semiformal, and formal mathematical knowledge; * general techniques and tools for online collaborative mathematics; * tools for collaboratively producing, presenting, publishing, and interacting with online mathematics; * automation and computer-human interaction aspects of mathematical wikis; * ontologies and knowledge bases designed to support knowledge management and verification in application domains; * practical experiences, usability aspects, feasibility studies; * evaluation of existing tools and experiments; * requirements, user scenarios and goals. We particularly invite submissions that address the problems or that apply the tools presented in the papers submitted for stage 1 (see "submission" below). THE SYMPOSIUM is designed to bring domain experts and formalisers into close and fruitful contact with each other: domain experts will be able to present their fields and problems to formalisers; formalisers will be exposed to new and challenging problem areas. We will combine talks and hands-on sessions to ensure close interaction among participants from both sides. World-class economists will offer dedicated HANDS-ON SESSIONS on the following topics: * Market design and matching problems (Utku ?nver, Boston College): These include matching students to schools, interns to hospitals, and kidney donors to recipients. See the documentation for the 2012 Nobel Memorial Prize in Economic Sciences for more background information (http://www.nobelprize.org/nobel_prizes/economics/laureates/2012/). * Auctions (Peter Cramton, University of Maryland): Peter works on auctions for ICANN (the ?knock out? domain name auctions), Ofcom UK (4G spectrum auction), the UK Department of the Environment and Climate Change, and others. * Finance (Neels Vosloo, Financial Services Authority UK): It is currently impossible for regulators to properly inspect either risk management models, or algorithmic trading platforms. To what extent can techniques from mechanised reasoning automate some of the inspection process? SUBMISSIONS We solicit submissions on any of the TOPICS outlined initially but prefer submissions that specifically address topics identified in the earlier submission Stage 1. In Stage 1 we had solicited * from DOMAIN EXPERTS descriptions of "nails": canonical models and problems in their domain that might benefit from better verification and knowledge management facilities. Descriptions should focus on aspects of these models that domain users find particularly problematic, and suspect might be aided by formalisation tools * from COMPUTER SCIENTISTS descriptions of "hammers": formalisation, verification and knowledge management tools, with an emphasis on how they could be applied in a concrete real-world setting, or tailored to such application domains. Commented versions of these submissions are now online at http://www.cs.bham.ac.uk/research/projects/formare/events/aisb2013/stage1.php. A tool whose description is submitted to Stage 2 could, e.g., be motivated with a Stage 1 problem, and sketch how the tool could, or will, be applied in this domain. Each submission will be refereed by three PC members on average. Submissions will be judged based on the PC's views of the likelihood of contributing to a better matching of hammers (formalisation and verification tools) to nails (domain problems). At this stage we accept PDF submissions in any layout but count 1200 words as one page for fair comparison. We invite research and position papers, as well as tool and system descriptions, from 3 to 10 pages. Besides PDFs we invite the submission of formalised knowledge representations with human-readable annotations. To submit a paper, please go to the Do-Form EasyChair page (http://www.easychair.org/conferences/?conf=doform2013) and follow the instructions for Stage 2 there. FINAL VERSIONS Final versions should be prepared in LaTeX according to the AISB formatting guidelines linked from the symposium homepage. For the final version, non-PDF submissions should be accompanied by a PDF abstract of 2 to 4 pages. Electronic proceedings (with an ISBN) will be made available to the convention delegates on a memory stick, and on the AISB website. Given a sufficient number of high-quality submissions, we will invite authors to submit revised and extended versions to a SPECIAL ISSUE of a relevant JOURNAL. (E.g., co-chair Manfred Kerber is on the editorial board of Mathematics in Computer Science.) IMPORTANT DATES * Submission (Stage 2): 28 January 2013 * Notification: 18 February 2013 * Final versions due: 4 March 2013 * Symposium: 2-5 April 2013 (days to be fixed) * AISB Convention: 2-5 April 2013 PROGRAMME COMMITTEE 1. Bill Andersen, Highfleet, US 2. Rob Arthan, Lemma 1, Reading, UK 3. Christoph Benzm?ller, Free University of Berlin, Germany 4. Peter Cramton, University of Maryland, US 5. James Davenport, University of Bath, UK 6. Michael Gr?ninger, University of Toronto, Canada 7. Manfred Kerber, University of Birmingham, UK (co-chair) 8. Michael Kohlhase, Jacobs University Bremen, Germany 9. Christoph Lange, University of Birmingham, UK (co-chair) 10. Till Mossakowski, University of Bremen, Germany 11. Colin Rowat, University of Birmingham, UK (co-chair) 12. Todd Schneider, Raytheon, US 13. Richard Steinberg, London School of Economics, UK 14. Geoff Sutcliffe, University of Miami, US 15. Theodore L Turocy, Centre for Behavioural and Experimental Social Science, University of East Anglia, UK 16. Makarius Wenzel, University of Paris Sud, France 17. Wolfgang Windsteiger, RISC / JKU Linz, Austria COMMENTS/QUESTIONS/ENQUIRIES to be sent to DoForm2013 at easychair.org From nswamy at microsoft.com Sat Jan 12 15:58:11 2013 From: nswamy at microsoft.com (Nikhil Swamy) Date: Sat, 12 Jan 2013 20:58:11 +0000 Subject: [TYPES/announce] PLAS 2013 : Call for papers Message-ID: <3aab85f87b5548cfaedb733c1b85793f@BY2PR03MB075.namprd03.prod.outlook.com> ACM SIGPLAN Eighth Workshop on Programming Languages and Analysis for Security (PLAS) June 20, 2013 Seattle, USA Co-located with PLDI 2013 http://research.microsoft.com/en-us/events/plas2013/ 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. -------------------------------------------------------------------------------- Important Dates Submissions due: March 1, 2013 Notification: April 5, 2013 PLAS 2012 workshop: June 20, 2013 -------------------------------------------------------------------------------- Call for papers 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 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: 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 more 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 Aslan Askarov (Harvard University) Karthikeyan Bhargavan (INRIA) Nataliia Bielova (INRIA-Rennes) Vinod Ganapathy (Rutgers) Ana Almeida Matos (Instituto Superior T?cnico and Instituto de Telecomunica??es) Prasad Naldurg (co-chair) (MSR India) Grigore Rosu (University of Illinois at Urbana-Champaign) Nikhil Swamy (co-chair) (MSR Redmond) Ankur Taly (Google) From p.k.f.holzenspies at utwente.nl Mon Jan 14 05:30:20 2013 From: p.k.f.holzenspies at utwente.nl (p.k.f.holzenspies at utwente.nl) Date: Mon, 14 Jan 2013 10:30:20 +0000 Subject: [TYPES/announce] CfP Trends in Functional Programming In Education 2013 (TFPIE 2013) Message-ID: L.S., Apologies for any duplicates you may receive. Please find enclosed the Call for Papers for the Second International Workshop on Trends in Functional Programming In Education (TFPIE). More information will become available on the workshop's website [1]. Please forward this CfP to whatever forum you consider appropriate. Regards, Philip K.F. H?lzenspies Programme Committee Chair TFPIE 2013 [1] http://wwwhome.ewi.utwente.nl/~holzenspiespkf/TFPIE2013.html -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: TFPIE2013_CfP.PDF Type: application/pdf Size: 165607 bytes Desc: TFPIE2013_CfP.PDF URL: From A.Murawski at warwick.ac.uk Mon Jan 14 06:29:15 2013 From: A.Murawski at warwick.ac.uk (Andrzej Murawski) Date: Mon, 14 Jan 2013 11:29:15 +0000 Subject: [TYPES/announce] Postdoc at Warwick (automata and verification) In-Reply-To: References: Message-ID: RESEARCH FELLOW Department of Computer Science, University of Warwick Duration: 24 months Salary: ?27,854 to ?36,298 pa Deadline: Thursday 24 January 2013 (midnight, British time) Applications are invited for a postdoctoral position on a two-year EPSRC-funded project in the area of semantics-based software verification. We are looking for candidates with a strong background in automata theory and/or program verification, who can contribute to the design and implementation of verification procedures involving automata over infinite alphabets. The project will be led by Andrzej Murawski (University of Warwick) in collaboration with Nikos Tzevelekos (Queen Mary, University of London). Other members of the Department at Warwick working on related topics include Marcin Jurdzinski, Sara Kalvala and Ranko Lazic. The official advert can be found at http://www.jobs.ac.uk/job/AFS125/research-fellow/ The post is available immediately. Informal enquiries are very welcome. From tase2013 at aston.ac.uk Wed Jan 16 06:40:36 2013 From: tase2013 at aston.ac.uk (TASE 2013) Date: Wed, 16 Jan 2013 11:40:36 +0000 Subject: [TYPES/announce] 5th CFP for TASE 13, 1 - 3 July 2013, Birmingham, UK (DEADLINE EXTENSION!) Message-ID: Please note the new (STRICT!) submission deadlines. The 7th International Symposium on Theoretical Aspects of Software Engineering ? TASE 2013 1st ? 3rd July 2013, Aston University Conference Centre, Birmingham, UK 4th Call for Papers Dear Colleagues, On behalf of the organizing committee, we are pleased to invite you to submit papers to the 7th International Symposium on Theoretical Aspects of Software Engineering (TASE 2013). We apologise for any eventual cross-posting and we cordially encourage you to forward this call for papers to all of your colleagues and students who might be interested. Overview Software engineering is at the heart of many state of the art tools designed to simplify and improve our lives, including cloud computing applications, the semantic web and self-configuring systems. As these instruments are involved in fields of vital importance, by providing customised solutions for education, businesses, government and health care, the role played by the theory behind their working principles bears an undeniable weight. In this context, the TASE International Symposium strives to provide top scientists with a framework for communicating their latest and most valuable theoretical results in the field of software engineering. Subject Areas We invite contributions concerning the theoretical aspects of the following areas (please note that this is not an exhaustive list): ? model driven software engineering * component based software engineering * service oriented and cloud computing * semantic web and web services * software security, reliability, simulation and verification * probabilistic fundamentals of software engineering * embedded and real time software systems * program logics and underlying mathematical issues * aspect, rule and object oriented software design * self-configuring software systems ? reverse engineering Paper Submission System We invite all prospective authors to submit their manuscripts via the TASE13 portal, hosted on Easychair at: https://www.easychair.org/conferences/?conf=tase2013 The instructions for authors (e.g. paper format and length) are now available on the symposium website: http://www1.aston.ac.uk/eas/research/groups/csrg/events/tase13/instructions-for-authors/ Important Dates Title and abstract submission: 1 February 2013 Paper submission: 8 February 2013 Acceptance/rejection notification: 22 March 2013 Camera-ready version submission: 26 April 2013 Contact tase2013 at aston.ac.uk www.aston.ac.uk/tase2013 Alternative Formats A PDF version of this CFP is available on the symposium website or by following this link: http://www1.aston.ac.uk/EasySiteWeb/GatewayLink.aspx?alId=128755 We are looking forward to receiving your submissions. Hai Wang Richard Banach Program Chairs, TASE 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From bmuller at glam.ac.uk Thu Jan 17 04:34:01 2013 From: bmuller at glam.ac.uk (Muller B (AT)) Date: Thu, 17 Jan 2013 09:34:01 +0000 Subject: [TYPES/announce] LAM'13 Extended deadline for abstract submission Message-ID: In accordance with the AISB convention organisers, the submission deadline for all symposia has been set to 28 January. *** Final CALL FOR ABSTRACTS & PAPERS *** 6th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM?13), 5 April 2013, University of Exeter, United Kingdom organised as symposium at the AISB Annual Convention 2013 (http://emps.exeter.ac.uk/computer-science/research/aisb/) * Important Submission Information * Please submit your extended abstract (2 pages) by 28 January 2013. You will be notified of acceptance/rejection by 18 February 2013. The full version of your papers is then due by 4 March 2013. Organisers: Berndt ?Bertie? M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://lam2013.wordpress.com * Workshop Purpose * The aim of this series of workshops is to bring together active researchers in the areas of logics and other formal frameworks on the one hand, and mobile systems on the other hand. The main focus is on the field of applications of logics and calculi for mobile agents, smart intelligent solutions and multi-agent systems. Many notions used in the theory of agents are derived from philosophy, logic, and linguistics (belief, desire, intention, speech act, etc.), and interdisciplinary discourse has proved fruitful for the advance of this domain. Outside of academia, the deployment of large-scale pervasive infrastructures (mobile ad-hoc networks, mobile devices, RFIDs, etc.) is becoming a reality. This raises a number of scientific and technological challenges for the software modelling and programming models for such large-scale, open and highly-dynamic distributed systems. The agent and multi-agent systems approach seems particularly adapted to tackle this challenge, but there are many issues remaining to be investigated. For instance, the agents must be location-aware since the actual services available to them may depend on their (physical or virtual) location. The quality and quantity of resources at their disposal is also largely fluctuant, and the agents must be able to adapt to such highly dynamic environments. Moreover, mobility itself raises a large number of difficult issues related to safety and security, which require the ability to reason about the software (e.g. for analysis or verification). Logics and type systems with temporal or other kinds of modalities (relating to location, resource and/or security-awareness) play a central role in the semantic characterisation and then verification of properties about mobile agent systems. There are still many open problems and research questions in the theory of such systems. The workshop is intended to showcase results and current work being undertaken in these areas with a focus on logics for specification and verification of dynamic, mobile systems. The topics of interest lie in the area of logics and concurrent systems with a focus on the special application domain of mobile systems and (multi-)agent-based systems, such as: * Applications of logics and/or multi-agent systems * Smart/intelligent solutions * Models of concurrency * Models of resource-bounded systems * Models of location-based reasoning * Logics for concurrency with a perspective on mobility * Models of mobile systems * Verification and analysis techniques * Related programming models Scopes of Interest * applications of MAS * logics for specification and reasoning about agents, MAS, and mobile systems * treatment of location and resources in logics * security (e.g., in ad-hoc networks) * temporal logics and model checking * type systems and static analysis * logic programming * concurrency theory with a focus on mobility or dynamics in agent systems. * Previous Workshops * LAM?08: 4?8 August 2008 at ESSLI in Hamburg, Germany LAM?09: 10 August 2009 at LICS in Los Angeles, USA LAM?10: 15 July 2010 at LICS in Edinburgh, Scotland, UK LAM?11: 10 September 2011 at CONCUR in Aachen, Germany LAM?12: 25 June 2012 at Petri Nets 2012, Hamburg, Germany * Format of the Workshop * The workshop will be held as a one day of the convention. There will be a short introduction and brief survey of the field by the organisers as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and will offer opportunities for discussion. The latter will give the participants a chance to discuss informally research directions, open problems, and possible co-operations. * Invited Speakers * [To be announced.] * Submission details * Authors are invited to submit an extended abstract (about 2 pages) or a full paper of original work in the areas mentioned above. The workshop chair should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper will be expected to present it at the LAM?13 workshop. Full papers should not exceed 15 pages, preferably using the LaTeX article or LNCSS class. The following formats are accepted: PDF, PS. Please send your submission electronically via EasyChair: http://www.easychair.org/conferences/?conf=lam13 The submissions will be reviewed by the workshop?s program committee and additional reviewers. Accepted papers will appear in electronic proceedings and authors will be encouraged to re-submit papers to formal proceedings to be published as a separate publication, e.g. as a special journal issue. * Important Dates * Abstract Submission Deadline: 28th January 2013 Notification of acceptance/rejection: 18 February 2013 Final version of full papers due: 4 March 2013 Workshop: at AISB 2013, 5 April 2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From troina at di.unito.it Thu Jan 17 12:09:37 2013 From: troina at di.unito.it (Angelo Troina) Date: Thu, 17 Jan 2013 18:09:37 +0100 Subject: [TYPES/announce] CS2Bio'13 - First Call for Papers Message-ID: <8425594E-A5D7-409F-B9B3-91F37851AA83@di.unito.it> ======================================================================== First call for papers CS2Bio'13 4th International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'13 06th of June 2013 Florence, Italy http://cs2bio13.di.unito.it/ ======================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science and Life Sciences. In particular, in this forth edition, we solicit the contribution of original results, from any research areas, such as Mathematics, Physics, Complex Systems, and Computational Sciences that address both theoretical aspects of modelling and applied work on the comprehension of biological behaviour. Furthermore, to facilitate the integration of different research areas we encourage the presentation of the main objectives and preliminary results of active projects on the CS2Bio topics conducted by interdisciplinary teams. *** SCOPE *** Contributions selected for presentation at CS2Bio should either present the modelling of a specific biological phenomenon using formal techniques, or a modelling, simulation, testing or verification approach in computer science that leads to a novel and promising application to a range of biological or medical systems. In the latter case, some emphasis on the scope and scalability of the approach will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning the complex interactions encountered. Topics of interest include, but shall not be limited to: - Formal Biological Modelling - Formal methods for the representation of biological systems and their dynamics; - 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; - Prediction of biological behaviour from incomplete information; - Model checking, abstract interpretation, type systems, etc. - Novel Computational Paradigms for Understanding Biological Complex Systems - Quantum information and life sciences; - Geometry, algebraic and computational topology and biomathematics; - Information processing and biomedicine; - Statistical mechanics and biophysics. - 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 *** - Giuseppe Longo (ENS Paris, France) - Mario Rasetti (ISI Foundation, Italy) *** SUBMISSION GUIDELINES *** We solicit three kinds of contributions: - Regular papers: must report previously unpublished work and not be submitted concurrently to a journal or to another conference with refereed proceedings (limited to 14 pages). - Tool presentations: describing new tools or platforms for the modelling of biological systems (limited to 7 pages). - Dissemination of project results: concern recent or ongoing work on topics relevant to CS2Bio and are intended to provide discussion and stimulate feedback during the workshop. The focus of a dissemination should be put on the main objectives and preliminary results of active projects on topics relevant to the workshop. There are no restrictions about previous or future publication of the contents of a dissemination, it could also be based on a recently published paper or on a work which has not yet been submitted (limited to 4 pages). Authors should submit their contributions via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio13) in the form of a pdf file compiled using the ENTCS style for the workshop proceedings (http://www.entcs.org/files/cs2bio/prentcsmacro.sty). If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). *** DISSEMINATION *** The proceedings of the workshop will be published in a volume of the Elsevier series "Electronic Notes on Theoretical Computer Science". After the event, papers presented at the workshop will be invited to be furtherly extended and submitted to an open special issue of the journal "Theoretical Computer Science". *** IMPORTANT DATES *** - Submission deadline: 26 March 2013 - Notification to authors: 03 May 2013 - Workshop: 06 June 2013 *** PROGRAM COMMITTEE *** - Erik de Vink - Jasmin Fisher - Paola Giannini - Radu Grosu - Jean Krivine - Pietro Lio' - Daniele Manini - Emanuela Merelli (Co-chair) - Paolo Milazzo - Ion Petre - Marco Pettini - Christian Reidys - David Safranek - Luca Tesei - Angelo Troina (Co-chair) - Verena Wolf *** STEERING COMMITTEE *** - Erik de Vink - Paola Giannini - Jean Krivine - Angelo Troina From brucker at spamfence.net Fri Jan 18 01:07:37 2013 From: brucker at spamfence.net (Achim D. Brucker) Date: Fri, 18 Jan 2013 07:07:37 +0100 Subject: [TYPES/announce] TAP 2013: Final Call for Papers Message-ID: <20130118060737.GA13562@shinanogawa.brucker.ch> (Apologies if you receive this announcement multiple times.) !LNCS publication is confirmed! **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 18-19, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== Paul Ammann Dirk Beyer Achim D. Brucker Robert Claris? Marco Comini Catherine Dubois Juhan Ernits Gordon Fraser Angelo Gargantini Christoph Gladisch Martin Gogolla Arnaud Gotlieb Wolfgang Grieskamp Reiner H?hnle Bart Jacobs Thi?rry Jeron Jacques Julliand Gregory Kapfhammer Nikolai Kosmatov Victor Kuliamin Michael Leuschel Karl Meinke Alexandre Petrenko Holger Schlingloff T.H. Tse Margus Veanes (co-chair) Luca Vigan? (co-chair) Burkhart Wolff Fatiha Zaidi Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/ From albertolluch at gmail.com Fri Jan 18 04:11:33 2013 From: albertolluch at gmail.com (Alberto Lluch Lafuente) Date: Fri, 18 Jan 2013 10:11:33 +0100 Subject: [TYPES/announce] CFP: 8th International Symposium on Trustworthy Global Computing (TGC 2013) Message-ID: == CALL FOR PAPERS =================================================== 8th International Symposium on Trustworthy Global Computing (TGC 2013) Buenos Aires, 30-31 August 2013 (co-located with CONCUR, QEST & FORMATS 2013) http://sysma.lab.imtlucca.it/tgc2013/ Call for Papers ====================================================================== Important dates =============== 15 April 2013 Deadline for abstract submission 22 April 2013 Deadline for paper submission 10 June 2013 Notification to authors 30-31 August 2013 Symposium Scope ===== The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in the so-called global computers, i.e., those computational abstractions emerging in large-scale infrastructures such as service-oriented architectures, autonomic systems and cloud computing. The TGC series focuses on providing frameworks, tools, algorithms and protocols for designing open-ended, large-scaled applications and for reasoning about their behaviour and properties in a rigorous way. The related models of computation incorporate code and data mobility over distributed networks that connect heterogeneous devices and have dynamically changing topologies. Topics ====== We solicit papers in all areas of global computing, including (but not limited to): * theories, languages, models and algorithms; * language concepts and abstraction mechanisms; * security, trust, privacy and reliability; * resource usage and information flow policies; * software development and software principles; * model checkers, theorem provers and static analyzers. Submission details ================== Papers are to be submitted through EasyChair. Contributions must be in PDF format 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. Collaboration with CONCUR ========================= Exceptionally, however, concurrent submissions to CONCUR 2013 and TGC 2013 are allowed, and in fact encouraged for those paper that may potentially enhance both conferences. Authors of such double submissions should identify them to the Program Chairs at the time of submission (by choosing the ?Regular Paper submitted to CONCUR? paper category). Reviews may be shared between CONCUR 2013 and TGC 2013. CONCUR?s timeline is ahead of TGC?s; submissions accepted by CONCUR will be considered automatically withdrawn from TGC. 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. Steering committee ================== Gilles Barthe (IMDEA Software, Madrid, Spain) Rocco De Nicola (IMT Institute for Advanced Studies Lucca, Italy) Christos Kaklamanis (University of Patras, Greece) Ugo Montanari(University of Pisa, Italy) Davide Sangiorgi (University of Bologna, Italy) Don Sannella (University of Edinburgh, Scotland) Vladimiro Sassone (University of Southampton, UK) Martin Wirsing (LMU University of Munich, Germany) Programme chairs ================ Mart?n Abadi (Microsoft Research and UC Santa Cruz, USA) Alberto Lluch Lafuente (IMT Institute for Advanced Studies Lucca, Italy) Programme committee =================== Gul Agha (University of Illinois at Urbana-Champaign, USA) Myrto Arapinis (University of Birmingham, UK) Rocco De Nicola (IMT Lucca, Italy) Luis Caires (Universidade Nova de Lisboa, Portugal) Jos? Luiz Fiadeiro (Royal Holloway University of London, UK) Andrew D. Gordon (Microsoft Research and University of Edinburgh, UK) Radha Jagadeesan (DePaul University, USA) Sergio Maffeis (Imperial College London, UK) Matteo Maffei (Saarland University, Germany) Davide Sangiorgi (University of Bologna, Italy) Catuscia Palamidessi (INRIA & ?cole Polytechnique, France) Frank Pfenning (Carnegie Mellon University, USA) Sriram Rajamani (Microsoft Research, India) Tamara Rezk (INRIA, France) Alejandro Russo (Chalmers University of Technology, Sweden) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Sebasti?n Uchitel (University of Buenos Aires, Argentina and Imperial College London, UK) Martin Wirsing (LMU University of Munich, Germany) Contact information =============== tgc2013 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From maffei at cs.uni-saarland.de Fri Jan 18 08:23:19 2013 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Fri, 18 Jan 2013 14:23:19 +0100 Subject: [TYPES/announce] CSF 2013 Final Call for Papers and Panels Message-ID: ***************************************************** CSF 2013 Final Call for Papers and Panels 26th IEEE Computer Security Foundations Symposium http://csf2013.seas.harvard.edu/ June 26 - 28, 2013 Tulane University, New Orleans Louisiana, USA Invited Speakers: - Joseph Halpern (Cornell University), joint invited talk with LICS - Markus Jakobsson (PayPal) - Benjamin Pierce (University of Pennsylvania) ***************************************************** The Computer Security Foundations Symposium is an annual conference for researchers in computer security. CSF seeks papers on foundational aspects of computer security, e.g., formal security models, relationships between security properties and defenses, principled techniques and tools for design and analysis of security mechanisms as well as their application to practice. While CSF welcomes submissions beyond the topics listed below, the main focus of CSF is foundational security: submissions that lack foundational aspects risk rejection. Topics ------ New theoretical results in computer security are welcome. Possible topics include, but are not limited to: Access control, Accountability, Anonymity and Privacy, Authentication, Data and system integrity, Database security, Data provenance, Decidability and complexity, Distributed systems security, Electronic voting, Executable content, Formal methods for security, Game Theory and Decision Theory, Hardware-based security, Information flow, Intrusion detection, Language-based security, Network security, Resource usage control, Security for mobile computing, Security models, Security protocols, Socio-technical security*, Trust and trust management. *Socio-technical security: concepts, models and techniques to analyse the role of humans in [information] security Challenges and Vision Papers: ----------------------------- We particularly encourage challenge/vision papers, which may describe open questions and raise fundamental concerns about practical security. Challenges and/or vision papers should typically identify a real world security problem, argue why it raises foundational issues, explain why the currently available and relevant foundational techniques are inadequate for addressing it, and identify foundational challenges that have to be addressed to solve the problem. These papers will appear in the CSF proceedings and will be presented at the conference without any distinction from papers that present new technical results. Proceedings, published by the IEEE Computer Society Press, will be available at the symposium, and selected papers will be invited for submission to the Journal of Computer Security. ***************************************************** IMPORTANT DATES Abstract due: January 30, 2013, 11:59pm Eastern Standard Time Papers due: February 6, 2013, 11:59pm Eastern Standard Time Panel proposals due: March 15, 2013 Notification: April 5, 2013 Camera ready: April 25, 2013 Symposium: June 26 - 28, 2013 Colocated workshops: June 29 - 30, 2013 ***************************************************** PROGRAM COMMITTEE Gilles Barthe, IMDEA Software Institute, Spain David Basin, ETH Zurich, Switzerland Giampaolo Bella, University of Catania, Italy James Cheney, University of Edinburgh, UK Veronique Cortier, Loria, CNRS, France Anupam Datta, Carnegie Mellon University, USA Stephanie Delaune, CNRS, France Riccardo Focardi, Ca' Foscari University of Venice, Italy Joshua Guttman, Worcester Polytechnic Institute, USA Limin Jia, Carnegie Mellon University, USA Ralf Kuesters, University of Trier, Germany Boris Koepf, IMDEA Software Institute, Spain Matteo Maffei, Saarland University, Germany Catuscia Palamidessi, INRIA Saclay, France Rafael Pass, Cornell University, USA Frank Pfenning, Carnegie Mellon University, USA Peter Ryan, University of Luxembourg, Luxembourg Andre Scedrov, University of Pennsylvania, USA Graham Steel, INRIA, France ***************************************************** PAPER SUBMISSION INSTRUCTIONS Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with published proceedings. Failure to clearly identify any duplication or overlap with other published or submitted papers is ground for rejection without full review. Papers should be submitted in Portable Document Format (PDF). Papers submitted in a proprietary word processor format such as Microsoft Word cannot be considered. At least one coauthor of each accepted paper is required to attend CSF to present the paper. Papers must be submitted using the two-column IEEE Proceedings style available for various document preparation systems at the IEEE Conference Publishing Services page. Regular papers should be at most 12 pages long, not counting bibliography and well-marked appendices. Challenge/vision papers should be clearly identified and should follow the same format requirements as regular paper. Committee members are not required to read appendices, and so the paper must be intelligible without them. Papers not adhering to the page limits will be rejected without consideration of their merits. Papers should be submitted using the CSF 2013 submission site. The full paper submission deadline is February 6th, 2013. The preliminary submission of an abstract is mandatory and the deadline is January 30th, 2013. https://www.easychair.org/conferences/?conf=csf2013 ***************************************************** PANEL PROPOSALS Proposals for panels are welcome. They should be no more than three pages in length, and should include the names of possible panelists and an indication of which of those panelists have confirmed a desire to participate. They should be submitted by email to the program chairs. ***************************************************** PC Chairs Veronique Cortier, Loria, CNRS, France Anupam Datta, Carnegie Mellon University, USA General Chair Stephen Chong, Harvard University, USA Publications Chair Deepak Garg, Max Planck Institute for Software Systems, Germany --- Dr. Matteo Maffei Language-based Security Group Computer Science, Saarland University email: maffei at cs.uni-saarland.de webpage: www.lbs.cs.uni-saarland.de -------------- next part -------------- An HTML attachment was scrubbed... URL: From jay.mccarthy at gmail.com Fri Jan 18 09:00:10 2013 From: jay.mccarthy at gmail.com (Jay McCarthy) Date: Fri, 18 Jan 2013 07:00:10 -0700 Subject: [TYPES/announce] Trends in Functional Programming 2013: 2nd Call for Papers Message-ID: CALL FOR PAPERS 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 2nd, 2013 Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: Tuesday, May 14th, 2013 Camera ready for draft proceeding: Monday, April 29th, 2013 The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. http://ce.byu.edu/cw/tfp/ TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Steering Committee Secretary: Marco T. Moraz?n, Seton Hall University, New Jersey, U.S.A. Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Danny Yoo from the University of Utah Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universit?t Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Shrijvers from Ghent University Vikt?ria Zs?k from E?tv?s Lor?nd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://ce.byu.edu/cw/tfp/ -- Jay McCarthy Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93 From ak155 at mcs.le.ac.uk Fri Jan 18 13:06:06 2013 From: ak155 at mcs.le.ac.uk (Alexander Kurz) Date: Fri, 18 Jan 2013 18:06:06 +0000 Subject: [TYPES/announce] Call for Registration: MGS Spring School Message-ID: <50F98F0E.8080101@mcs.le.ac.uk> ************************************************************* Midlands Graduate School 2013 in the Foundations of Computing ************************************************************* The Midlands Graduate School is taking place 8 - 12 April 2013 at the University of Leicester, UK. EARLY REGISTRATION UNTIL 8th FEB at http://www.cs.le.ac.uk/events/mgs2013/ The early registration fee is 520 GBP and covers accommodation, meals, and lectures. The School provides an intensive course of lectures on the Foundations of Computing. It is very well established, having run annually for 10 years, and has always proved a popular and successful event. This year we have Philip Wadler, University of Edinburgh, as guest lecturer. Natasha Alechina, Modal Logic Venanzio Capretta, Coalgebras and Infinite Data Structures Paul Levy, Typed Lambda-Calculus Brian Logan, Multi-agent programming Uday Reddy, Category Theory Eike Ritter, Security and applied pi-calculus Georg Struth, Kleene Algebra Rick Thomas, Formal Languages and Group Theory Philip Wadler, tba The lectures are aimed at graduate students, typically in their first or second year of study for a PhD. However, the school is open to anyone who is interested in learning more about mathematical foundations of computing. From G.A.McCusker at bath.ac.uk Sun Jan 20 11:14:42 2013 From: G.A.McCusker at bath.ac.uk (Guy McCusker) Date: Sun, 20 Jan 2013 16:14:42 +0000 Subject: [TYPES/announce] British Colloquium for Theoretical Computer Science: first call for participation Message-ID: British Colloquium for Theoretical Computer Science Bath, UK 24th-27th March 2013 http://cs.bath.ac.uk/bctcs2013 FIRST CALL FOR CONTRIBUTED TALKS AND PARTICIPATION Deadline for application for bursaries: 28th February 2013 Deadline for abstract submission: 10th March 2013 Deadline for registration: 10th March 2013 The 29th British Colloquium for Theoretical Computer Science will be hosted by the Department of Computer Science, University of Bath, from 24th to 27th March 2013. The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. 25 fully-funded PhD Student Bursaries are available, covering UK travel, accommodation at University rate, and full registration. It is easy to apply for one. Please see the website for details. We are grateful to the Heilbronn Institute for Mathematical Research for sponsoring these bursaries. The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK. The colloquium features both invited and contributed talks. This year's invited speakers are Susanne Albers, Humboldt-Universit?t zu Berlin, the LMS-sponsored keynote speaker in Discrete Mathematics Samson Abramsky, University of Oxford Assia Mahboubi, ?cole Polytechnique, Paris plus a representative of Altran UK; details to be announced. Participants wishing to give 30 minute contributed talks may simply to submit a title and abstract (100--300 words) by the deadline given below. Further details are available from the Colloquium website: http://cs.bath.ac.uk/bctcs2013 Important dates: 18th January 2013 --- Registration/accommodation booking open 28th February 2013 --- Deadline for application for bursaries 10th March 2013 --- Abstract submission deadline for participants wishing to give contributed talks. 10th March 2013 --- Deadline for registration. 24th--27th March 2013 --- Colloquium. From dargenio at famaf.unc.edu.ar Sun Jan 20 11:16:12 2013 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Sun, 20 Jan 2013 13:16:12 -0300 Subject: [TYPES/announce] CONCUR 2013 - Second call for papers Message-ID: [We apologise for multiple copies.] ============================================================================ CONCUR 2013 - Second Call for Papers 24th International Conference on Concurrency Theory August 27 - 30, 2013, Buenos Aires Argentina http://concur-conferences.org/concur2013 ============================================================================ The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. INVITED SPEAKERS - Lorenzo Alvisi (University of Texas Austin, USA) - Joost-Pieter Katoen (RWTH Aachen University, Germany) - Philippe Schnoebelen (LSV, CNRS & ENS de Cachan, France) - Reinhard Wilhelm (Saarland University, Germany) TOPICS Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, graph transformation systems and Petri nets; - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, and type systems; - Related programming models such as distributed, component-based, object-oriented, and web services. CO-LOCATED EVENTS 10th Intl. Conference on Quantitative Evaluation of SysTems (QEST 2013) 11th Intl. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS 2013) 8th Intl. Symposium on Trustworthy Global Computing (TGC 2013) There will be co-located workshops, which take place on August 26 and August 31, and tutorials (associated with QEST) which take place on August 26. PAPER SUBMISSION CONCUR 2013 solicits high quality papers reporting research results and/or experience reports related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. Exceptionally, however, concurrent submissions to CONCUR 2013 and TGC 2013 are allowed, and in fact encouraged for those paper that may potentially enhance both conferences. Authors of such double submissions should identify them to the Program Chairs at the time of submission (by choosing the "Regular paper submitted also to TGC" category in the EasyChair site). Reviews may be shared between CONCUR 2013 and TGC 2013. Submissions accepted by CONCUR will be considered automatically withdrawn from TGC. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Contributions must be submitted as PDF files. They should also not exceed 15 pages in length and comply the Springer LNCS style. Papers should be submitted electronically using EasyChair online submission system (https://www.easychair.org/conferences/?conf=concur2013) The CONCUR 2013 proceedings will be published by Springer in the ArCoSS subseries of LNCS. The proceedings will be available at the conference. IMPORTANT DATES Abstract Submission: 1st April 2013 Paper Submission: 8th April 2013 Paper Notification: 27th May, 2013 Camera Ready Copy Due: 10t June, 2013 CONCUR 2012: 27th-30th August, 2013 PROGRAM CHAIRS - Pedro R. D'Argenio (Universidad Nacional de C?rdoba, Argentina) - Hern?n Melgratti (Universidad de Buenos Aires, Argentina) PROGRAM COMMITTEE Christel Baier (Technical University of Dresden, DE) Paolo Baldan (Universit? di Padova, IT) Eike Best (Universit?t Oldenburg, DE) Patricia Bouyer (LSV, CNRS & ENS Cachan, FR) Tomas Brazdil (Masaryk University, CZ) Franck van Breugel (York University, CA) Krishnendu Chatterjee (IST, AT) Rance Cleaveland (University of Maryland, US) Wan Fokkink (Vrije Universiteit Amsterdam, NL) Daniele Gorla (University of Rome "La Sapienza", IT) Holger Hermanns (Saarland University, DE) Radha Jagadeesan (DePaul University, US) Bengt Jonsson (Uppsala University, SE) Kim G. Larsen (Aalborg University, DK) Ugo Montanari (Universit? di Pisa, IT) Prakash Panangaden (McGill University, CA) David Parker (University of Birmingham, UK) Frank Pfenning (Carnegie Mellon University, US) Nir Piterman (University of Leicester, UK) Shaz Qadeer (Microsoft Research, US) Jean-Francois Raskin (Universit Libre de Bruxelles, BE) Jan Rutten (CWI, NL) Davide Sangiorgi (University of Bologna, IT) Geoffrey Smith (Florida International University, US) P.S. Thiagarajan (National University of Singapore, SG) Frits Vaandrager (Radboud University Nijmegen, NL) Frank Valencia (CNRS, Ecole Polytechnique de Paris, FR) Rob Van Glabbeek (NICTA, AU) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Technical University of Denmark, DK) STEERING COMMITTEE Roberto Amadio (PPS, Universite Paris Diderot - Paris 7, France) Jos Baeten (Centrum Wiskunde & Informatica (CWI), The Netherlands) Eike Best (Carl von Ossietzky Universit?t Oldenburg, Germany) Kim Larsen (Aalborg University, Denmark) Ugo Montanari (Universit? di Pisa, Italy) Scott Smolka (SUNY, Stony Brook University, USA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From dargenio at famaf.unc.edu.ar Sun Jan 20 11:16:39 2013 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Sun, 20 Jan 2013 13:16:39 -0300 Subject: [TYPES/announce] QEST 2013 - Second call for papers Message-ID: [We apologise for multiple copies.] -------------------------------------------------------------------------------- Second Call for Papers 10th International Conference on Quantitative Evaluation of SysTems QEST 2013 http://www.qest.org/qest2013/ August 26th-30th, 2013 - Buenos Aires, Argentina Co-located with CONCUR, FORMATS, and TGC IMPORTANT DATES: Abstract submission 4 March 2013 Paper submission 11 March 2013 Author notification 12 May 2013 Final version 2 June 2013 INVITED SPEAKERS: Lorenzo Alvisi, University of Texas Austin, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Edmundo de Souza e Silva, Federal University of Rio de Janeiro, Brazil SCOPE AND TOPICS: QEST is the leading forum on evaluation and verification of computer systems and networks, through stochastic models and measurements. QEST has a broad range of interests - the common thread is that the evaluation be quantitative. The range of performance metrics of interest spans classical measures involving performance and reliability, as well as quantification of properties that are classically qualitative, such as safety, correctness, and security. QEST welcomes measurement-based studies as well as analytic studies. QEST welcomes diversity in the model formalisms and methodologies employed, as well as development of new formalisms and methodologies. QEST is keenly interested in case studies highlighting the role of quantitative evaluation in the design of systems, where the notion of system is broad. Systems of interest include computer hardware and software architectures, communication systems, embedded systems and biological systems. Moreover, tools for supporting the practical application of research results in all of the above areas are of special interest, and therefore tool papers are sought. In short, QEST aims to create a sound methodological basis for assessing and designing systems using quantitative means. EVALUATION OF PAPERS: All submitted papers will be thoroughly judged by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria (in no particular order): 1. Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. 2. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Process structure and the individual steps should be clearly described. If the methodology has already been evaluated with applications, a brief description of the lessons learned would be very helpful. 3. Application: describes a novel application, and compares with previous results (if any). 4. Tools: should motivate the development of the new tools and the formalisms they support. Tool papers need neither discuss their theoretical underpinnings nor their algorithms. Instead, they should focus on the software architecture and discuss its practical capabilities with particular reference to the size and type of model it can handle within reasonable time and space limits. 5. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. SUBMISSIONS: We invite submissions of original papers related to the aforementioned topics. Submissions must be in English, Springer LNCS format, and must indicate the above paper type. Papers must be prepared in LaTeX, following Springer's LNCS guidelines. Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Additional material for the aid of the reviewers (e.g., proofs) can be sent in a clearly marked appendix. Papers must be unpublished and not be submitted for publication elsewhere. PC members, except program co-chairs, may submit papers. All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. A best-paper award will be presented at the conference. As in previous years, we are planning to publish extended versions of selected papers in a special issue of a journal. TUTORIALS: There will be one day of tutorials at the start of the conference. Tutorial proposals (up to 4 pages Springer LNCS format) should be sent to the Tutorial Chair (Lijun Zhang, zhang at imm.dtu.dk) by 11 March 2013. GENERAL CHAIR: Pedro R. D'Argenio (AR) PC-CHAIRS: Kaustubh Joshi (US) Markus Siegle (DE) Marielle Stoelinga (NL) LOCAL ORGANIZATION CHAIR: Hern?n Melgratti (AR) TOOLS CHAIR: Kai Lampka (SE) TUTORIAL CHAIR: Lijun Zhang (DK) PROCEEDINGS CHAIR: Nicol?s Wolovick (AR) PUBLICITY CHAIR: Dami?n Barsotti (AR) PROGRAM COMMITTEE: Christel Baier (DE) Nathalie Bertrand (FR) Andrea Bobbio (IT) Peter Buchholz (DE) Hector Cancela (UY) Giuliano Casale (GB) Gianfranco Ciardo (US) Yuxin Deng (CN) Derek Eager (CA) Jane Hillston (GB) Andras Horvath (IT) David Jansen (NL) Krishna Kant (US) Peter Kemper (US) Boris Koepf (ES) Marta Kwiatkowska (GB) Kai Lampka (SE) Annabelle McIver (AU) Arif Merchant (US) Aad van Moorsel (GB) Gethin Norman (GB) Anne Remke (NL) William Sanders (US) Roberto Segala (IT) Miklos Telek (HU) Bhuvan Urgaonkar (US) Marco Vieira (PT) Verena Wolf (DE) STEERING COMMITTEE: Holger Hermanns (DE) Nathalie Bertrand (FR) Peter Buchholz (DE) Gethin Norman (UK) Andrew S. Miner (US) Susanna Donatelli (IT) William Knottenbelt (UK) Joost-Pieter Katoen (Chair, DE) Peter Kemper (US) Miklos Telek (HU) Gerardo Rubino (FR) Boudewijn Haverkort (NL) -------------- next part -------------- An HTML attachment was scrubbed... URL: From sophie.tison at lifl.fr Sun Jan 20 16:41:48 2013 From: sophie.tison at lifl.fr (Sophie Tison) Date: Sun, 20 Jan 2013 22:41:48 +0100 Subject: [TYPES/announce] RTA 2013: last call for papers Message-ID: <49FA57D9-67D8-4BCD-AC41-7976C7F52481@lifl.fr> ************************************************************************* RTA 2013: LAST CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands co-located with TLCA 2013 as part of RDP 2013 http://rta2013.few.vu.nl/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 (THIS IS A STRICT DEADLINE !) rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** INVITED SPEAKERS *** - Simon Peyton-Jones (Microsoft Research, UK) joint invited speaker for TLCA+RTA 2013 - Jarkko Kari (University of Turku, Finland) invited speaker for RTA 2013 - Mitsu Okada (Keio University, Japan) invited speaker for RTA 2013 *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: Also, authors of selected papers will be invited to submit an extension of their RTA 2013 paper to a special issue of Logical Methods in Computer Science (LMCS) . *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: , - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: . The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli National University of Quilmes, Argentina Byron Cook Microsoft Research Cambridge, UK Stephanie Delaune ENS Cachan, France Gilles Dowek Inria Paris-Rocquencourt, France Maribel Fernandez King's College London, UK Nao Hirokawa JAIST Ishikawa, Japan Delia Kesner University Paris-Diderot, France Helene Kirchner Inria Paris-Rocquencourt, France Barbara Koenig University Duisburg Essen, Germany Temur Kutsia Johannes Kepler University Linz, Austria Aart Middeldorp University of Innsbruck, Austria Vincent van Oostrom Utrecht University, The Netherlands Femke van Raamsdonk VU University Amsterdam, The Netherlands Kristoffer Rose IBM Research New York, USA Manfred Schmidt-Schauss Goethe University Frankfurt, Germany Peter Selinger Dalhousie University, Canada Paula Severi University of Leicester, UK Aaron Stump The University of Iowa, USA Tarmo Uustalu Institute of Cybernetics Tallinn, Estonia Roel de Vrijer VU University Amsterdam, The Netherlands Johannes Waldmann HTWK Leipzig, Germany Hans Zantema Eindhoven University of Technology, The Netherlands *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon Brasilia University, Brasilia Frederic Blanqui INRIA Tsinghua University Beijing, China Salvador Lucas Technical University of Valencia, Spain Georg Moser (chair) University of Innsbruck, Austria Masahiko Sakai Nagoya University, Japan Sophie Tison University of Lille, France *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl. Pr. Sophie Tison LIFL - University of Lille- CNRS www.lifl.fr/~tison sophie.tison at lifl.fr From Stephan.Merz at loria.fr Tue Jan 22 03:54:12 2013 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Tue, 22 Jan 2013 09:54:12 +0100 Subject: [TYPES/announce] Inria research positions in Nancy Message-ID: <154C69D8-C237-43CF-91CD-58B376F53739@loria.fr> Inria is a French research institute in computer science and applied mathematics with 8 research centers around France. It will recruit 20 junior researchers in 2013. Junior researchers with interests related to the topics of the Types mailing list are welcome to contact Inria teams about details. The Inria Nancy - Grand Est research center invites applications for 3 tenured junior researcher positions (CR2). We are particularly interested in developing the following research topics: * Impact of Internet and computer security issues on everyday life * Image, robotics and instrumentation for health and assistance to dependent people * Coupling and integrating methods for advanced solving in numerical engineering * Knowledge modeling for the design of individualized educational software However, all outstanding applications will be considered and thoroughly evaluated. The application deadline is February 18, 2013. Research must be carried out within one of the existing research teams of Inria Nancy - Grand Est, see http://www.inria.fr/en/research/research-teams/find-a-team/(center)/1166 or http://www.inria.fr/en/centre/nancy/research Candidates are expressly invited to contact the leader of the team in which they want to apply. Among the features of the competition: * Candidates must hold a PhD or an equivalent degree. * The competition being tough, one to two years of postdoctoral research experience is a significant plus. * Inria welcomes and encourages applications of foreign candidates. Proficiency in French is not required. * Inria promotes scientific excellence as well as software development and transfer of technology and knowledge. For more and to download application file, please visit http://www.inria.fr/en/institute/recruitment/offers/young-graduate-scientist/competitive-selection-2013 Candidates looking for additional information about the competition or Inria Nancy - Grand Est should contact Michael Rusinowitch or Sylvain Petitjean Best regards, Stephan Merz -- Stephan Merz, INRIA Nancy & LORIA Stephan.Merz at loria.fr From stephen.kell at usi.ch Wed Jan 23 10:52:06 2013 From: stephen.kell at usi.ch (Stephen Kell) Date: Wed, 23 Jan 2013 16:52:06 +0100 Subject: [TYPES/announce] Final CfP: Software Composition (SC) 2013 (deadline extended) Message-ID: <20130123155206.GB20286@ernest-5.localdomain> [Type systems feature prominently in various approaches to software composition. Therefore, the following call for papers may be of interest to many list members. Please note the extended deadline.] 12th International Conference on Software Composition (SC 2013) June 19--20 2013, Budapest, Hungary http://sc2013.ec-spride.de/ Extended Deadline -- Important Dates: Abstract submission: *** January 25, 2013 (now *mandatory*) Paper submission: *** February 1, 2013 (23:59 anywhere on Earth) The International Conference on Software Composition (SC) is the leading venue that addresses challenges of how composition of software parts may be used to build and maintain large software systems. Software Composition 2013 will be the 12th edition in the series, and we invite researchers and practitioners to submit high-quality papers. Submissions that relate theory and practice of software composition are particularly welcome. Software Composition 2013 takes place in Budapest on June 19--20 2013, as part of the STAF 2013 Federated Conferences (spanning June 17--21). Topics of Interest: The SC 2013 program committee seeks original, high-quality papers related to software composition, including but not limited to the following topics: * Component-based software engineering * Composition and adaptation techniques * Composition algebras, calculi and type systems * Feature-oriented software development * Aspect-oriented software development * Model-driven composition * Models of computation * Verification, validation and testing * Dynamic composition and reconfiguration * Large-scale component-based systems * Cloud, service-oriented architectures * Business process orchestration * Visual composition environments * Performance optimization of composite systems We solicit high-quality submissions on research results and/or experience (up to 16 pages, LNCS format, including bibliography and figures) describing a technical contribution in depth. Short and position papers are also welcome for the work in progress session (up to 8 pages, LNCS format, including bibliography and figures). Short submissions must concisely capture ongoing work, new ideas, and experiences. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submitted papers must be unpublished and not submitted for publication elsewhere. As in previous years, the proceedings of the conference will be published as a volume in Springer's Lecture Notes in Computer Science. Conference Web Site: Important Dates: Abstract submission: *** January 25, 2013 (now *mandatory*) Paper submission: *** February 1, 2013 (23:59 anywhere on Earth) Acceptance notification: March 10, 2013 Camera-ready copy: March 22, 2013 Conference: June 19--20, 2013 General Chair: Welf L?we, Linnaeus University, Sweden Program Chairs: Walter Binder, University of Lugano, Switzerland Eric Bodden, Technische Universit?t Darmstadt, Germany Publicity Chair: Stephen Kell, University of Lugano, Switzerland Program Committee: Danilo Ansaloni, University of Lugano, Switzerland Sven Apel, University of Passau, Germany Olivier Barais, University of Rennes 1, France Alexandre Bergel, University of Chile, Chile Domenico Bianculli, University of Luxembourg, Luxembourg Daniele Bonetta, University of Lugano, Switzerland Lubom?r Bulej, Charles University, Czech Republic Shigeru Chiba, University of Tokyo, Japan Ion Constantinescu, Google, USA Schahram Dustdar, Vienna University of Technology, Austria Erik Ernst, University of Aarhus, Denmark Bernd Freisleben, University of Marburg, Germany Thomas Gschwind, IBM Zurich Research Lab, Switzerland Michael Haupt, Oracle Labs, Germany Christian K?stner, Carnegie Mellon University, USA Doug Lea, State University of New York at Oswego, USA Karl Lieberherr, Northeastern University, USA David Lorenz, The Open University, Israel Hidehiko Masuhara, University of Tokyo, Japan Oscar Nierstrasz, University of Bern, Switzerland Jacques Noy?, Ecole des Mines de Nantes, France Ina Schaefer, Technische Universit?t Braunschweig, Germany Andreas Sewe, Technische Universit?t Darmstadt, Germany Mario S?dholt, Ecole des Mines de Nantes, France Clemens Szyperski, Microsoft Research, USA Immanuel Trummer, EPFL, Switzerland Alex Villaz?n, Universidad Privada Boliviana, Bolivia Eric Wohlstadter, University of British Columbia, Canada Thomas W?rthinger, Oracle Labs, Austria Cheng Zhang, Shanghai Jiao Tong University, China From aravara at fct.unl.pt Thu Jan 24 07:52:57 2013 From: aravara at fct.unl.pt (Antonio Ravara) Date: Thu, 24 Jan 2013 12:52:57 +0000 Subject: [TYPES/announce] CFP: WWV 2013 Automated Specification and Verification of Web Systems Message-ID: <51012EA9.1040207@fct.unl.pt> ************************************************************* * * * WWV 2013 * * Automated Specification and Verification of Web Systems * * 9th International Workshop * * Call for Papers * * * ************************************************************* IMPORTANT DATES Abstract Submission March 22, 2013 Full Paper Submission March 29, 2013 Acceptance Notification May 3, 2013 Camera Ready (pre-proceedings) May 20, 2013 Workshop June 6, 2013 Camera Ready (post-proceedings) June 26, 2013 SCOPE The Workshop on Automated Specification and Verification of Web Systems (WWV, http://users.dsic.upv.es/grupos/elp/wwv/) is a yearly workshop that aims at providing an interdisciplinary forum to facilitate the cross-fertilization and the advancement of hybrid methods that exploit concepts and tools drawn from Rule-based programming, Software engineering, Formal methods and Web-oriented research. Nowadays, many companies and institutions have diverted their Web sites into interactive, completely-automated, Web-based applications for, e.g., e-business, e-learning, e-government and e-health. The increased complexity and the explosive growth of Web systems has made their design and implementation a challenging task. Systematic, formal approaches to their specification and verification can permit to address the problems of this specific domain by means of automated and effective techniques and tools. Topics of either theoretical or applied interest include, but are not limited to: - Rule-based approaches to Web system analysis, certification, specification, verification, and optimization. - Languages and models for programming and designing Web systems. - Formal methods for describing and reasoning about Web systems. - Model-checking, synthesis and debugging of Web systems. - Analysis and verification of linked data. - Abstract interpretation and program transformation applied to the semantic Web. - Intelligent tutoring and advisory systems for Web specifications authoring. - Middleware and frameworks for composition and orchestration of Web services. - Web quality and Web metrics. - Web usability and accessibility. - Testing and evaluation of Web systems and applications. AUDIENCE Participation to WWV is open. The workshop is intended for, but not limited to, researchers from the communities of Rule-based programming, Software engineering, Formal methods and Web-oriented research. SUBMISSION Submitted papers should present original unpublished work and cannot be under review for publication elsewhere. Each paper will undergo a thorough evaluation by at least three reviewers, chosen by the Program Committee. Contributions should be submitted through the EasyChair online submission system in PDF format, and should be prepared in LaTeX using the EPTCS-style format and should not exceed 15 pages (typeset 11 points). Submission is a firm commitment that at least one of the authors will attend the workshop, if the paper is accepted. PUBLICATION Accepted papers will be included in the pre-proceedings, which will be made available in electronic form through the WWV web site. After the workshop, authors of accepted papers will be asked to prepare, by incorporating insights gathered during the event, a final version of their paper to be published in the post-proceedings. We plan to publish the workshop post-proceedings as a volume of the EPTCS series. STEERING COMMITTEE Maria Alpuente Technical University of Valencia, Spain (co-Chair) Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy (co-Chair) Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Rosario Pugliese University of Florence, Italy Josep Silva Technical University of Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy WORKSHOP CO-CHAIRS Antonio Ravara New University of Lisbon, Portugal Josep Silva Universidad Politecnica de Valencia, Spain PROGRAM COMMITTEE Jesus Almendros University of Almeria, Spain Maria Alpuente Universitat Polit??cnica de Val??ncia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz Universidade do Minho, Portugal Raymond Hu Imperial College London, United Kingdom Ivan Lanese University of Bologna/INRIA, Italy Anders Moller Aarhus University, Denmark Elie Najm Telecom ParisTech, France Kostis Sagonas University of Uppsala, Sweden Francesco Tiezzi IMT, Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom WORKSHOP FORMAT One full day meeting, including 1 or 2 invited talks and about 8 refereed contributions. PAST WORKSHOP EDITIONS Started in 2005, the series of this workshop established itself as a lively, friendly event with many interactions and discussions. 1. WWV'05 in Valencia, Spain; March 14-15, 2005 homepage: http://users.dsic.upv.es/workshops/wwv05/ 2. WWW'06 in Paphos, Cyprus; November 19, 2006 homepage: http://users.dsic.upv.es/workshops/wwv06/ 3. WWV'07 in Venice, Italy; December 14, 2007 homepage: http://wwv07.dimi.uniud.it/ 4. WWV'08 in Siena, Italy; July 4, 2008 homepage: http://wwv08.dimi.uniud.it/ 5. WWV'09 in Castle of Hagenberg, Austria; July 17, 2009 homepage: http://www.risc.uni-linz.ac.at/about/conferences/wwv09/ 6. WWV'10 in Vienna, Austria; July 30-31, 2010 homepage: http://www.complang.tuwien.ac.at/WWV2010/ 7. WWV'11 in Reykjavik, Iceland; June 9, 2011 (as part of DisCoTec 2011) homepage: http://rap.dsi.unifi.it/wwv2011/ 8. WWV'12 in Stockholm, Sweden; June 16, 2012 (as part of DisCoTec 2012) homepage: http://users.dsic.upv.es/~jsilva/wwv2012/ The previous 7 editions of WWV attracted high quality papers that were published in ENTCS (WWV'05, WWV'07, WWV'08), IEEE (WWV'06) and EPTCS (WWV'11,WWV'12). After WWV'09, a special issue of the Journal of Symbolic Computation on the topics of the WWV has been organized. Similarly, a special issue of the Journal of Applied Logic has been organized after WWV'10, and a special issue of the Journal of Logic and Algebraic Programming is being organized after WWV'11 and WWV'12. From n.yoshida at imperial.ac.uk Thu Jan 24 10:57:27 2013 From: n.yoshida at imperial.ac.uk (Yoshida, Nobuko) Date: Thu, 24 Jan 2013 15:57:27 +0000 Subject: [TYPES/announce] Call for Participation: PLACES'13 at ETAPS Message-ID: <3E2DE459E494E340A242A4851471E2811347D6C3@icexch-m4.ic.ac.uk> [ The themes of PLACES include types, concurrency and mobility. NY] Call For Participation PLACES'13 Programming Language Approaches to Concurrency and Communication-cEntric Software 23rd March 2013, Rome, Italy (affiliated with ETAPS 2013) http://places13.di.fc.ul.pt/ ** Registration ** Early registration from 9 January 2013 to 30 January 2013. http://www.etaps.org/ ** Invited Talk ** Stefan M?hl from Mitrionics ** Programme ** http://places13.di.fc.ul.pt/programme ** Accepted Papers ** >From Lock Freedom to Progress Using Session Types Luca Padovani (University of Torino, Italy) Session Types for Dynamically Evolvable Communicating Systems Cinzia Di Giusto (INRIA, France) and Jorge A. P?rez (New University of Lisbon, Portugal) Session Types in Abelian Logic Yoichi Hirai (University of Tokyo, Japan) Embedding Session Types in HML Romain Demangeon (Queen Mary, University of London, UK) and Laura Bocchi (University of Leicester, UK) Coinductive big-step semantics for concurrency Tarmo Uustalu (Tallinn University of Technology, Estonia) A Parallel Task Composition Approach to Manycore Programming Ashkan Tousimojarad (University of Glasgow, UK) Session Types Go Dynamic or How to Verify Your Python Conversations Rumyana Neykova (Imperial College London, UK) Towards deductive verification of MPI programs against session types Eduardo R. B. Marques, Francisco Martins, Vasco T. Vasconcelos (University of Lisbon, Portugal), Nicholas Ng (Imperial College London, UK) and Nuno Dias Martins (University of Lisbon, Portugal) Verification of Transactions in STM Haskell using Contracts and Program Transformation Romain Demeyer and Wim Vanhoof (University of Namur, Belgium) Minimising virtual machine support for concurrency Simon Dobson, Alan Dearle and Barry Porter (University of St-Andrews, UK) ** Background ** Applications today are built using numerous interacting services; soon off-the-shelf CPUs will host thousands of cores, and sensor networks will be composed from a large number of processing units. Many applications need to make effective use of thousands of computing nodes. At some level of granularity, computation in such systems is 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, * session types, * concurrent data types, * concurrent objects and actors, * multicore programming, * use of message passing in systems software, * interface languages for communication and distribution, * program analysis, * 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, * runtime architectures for concurrency, * scalability and/or resource allocations. ** Program Committee ** Alastair Beresford, University of Cambridge, UK Viviana Bono, Universita di Torino, Italy Alastair Donaldson, Imperial College London, UK Dan Ghica, University of Birmingham, UK Joshua Guttman, Worcester Polytechnic Institute, MA, US Thomas Hildebrandt, University of Copenhagen, Denmark Paul Keir, Codeplay Ltd, UK Hans-Wolfgang Loidl, Heriot-Watt University, UK Conor McBride, University of Strathclyde, UK Jeremy Singer, University of Glasgow, UK Sven-Bodo Scholz, Heriot-Watt University, UK Nikhil Swamy, Microsoft Research, US Wim Vanderbauwhede (co-chair), University of Glasgow, UK Hugo Torres Vieira, Universidade de Lisboa, Portugal Nobuko Yoshida (co-chair), Imperial College London, UK ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK Simon Gay, University of Glasgow, UK Alan Mycroft, University of Cambridge, UK Vasco Vasconcelos, University of Lisbon, Portugal Nobuko Yoshida, Imperial College London, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From amal at ccs.neu.edu Thu Jan 24 13:43:01 2013 From: amal at ccs.neu.edu (Amal Ahmed) Date: Thu, 24 Jan 2013 13:43:01 -0500 Subject: [TYPES/announce] Oregon Programming Languages Summer School Message-ID: We are pleased to announce the preliminary program for the 12th annual Oregon Programming Languages Summer School (OPLSS) to be held July 22nd to August 3rd, 2013 at the University of Oregon in Eugene. The registration deadline will be April 16th, 2013. This year's program is titled Types, Logic, and Verification and features the following speakers: Amal Ahmed -- Logical Relations Northeastern University Robert Harper -- Type Theory Foundations Carnegie Mellon University Dan Licata -- Programming in Agda Carnegie Mellon University and Institute for Advanced Study Greg Morrisett -- Coq as a Programming Language Harvard University Simon Peyton-Jones -- Functional Programming in Haskell Microsoft Research Frank Pfenning -- Linear Logic and Session-based Concurrency Carnegie Mellon University Andrew Tolmach -- Software Foundations in Coq Portland State University Stephanie Weirich -- Designing Dependently-Typed Programming Languages University of Pennsylvania Steve Zdancewic -- Verifying LLVM Optimizations in Coq University of Pennsylvania Full information on registration will be available shortly at http://www.cs.uoregon.edu/Activities/summerschool/summer13/ . Amal Ahmed Bob Constable Frank Pfenning Benjamin Pierce From dargenio at famaf.unc.edu.ar Fri Jan 25 07:37:09 2013 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Fri, 25 Jan 2013 09:37:09 -0300 Subject: [TYPES/announce] Call for participation 1st MEALS workshop @ETAPS 2013 Message-ID: Apologies should you receive multiple copies of this email:**** * * *Call for participation* * * *1st MEALS Workshop** * *a satellite event of ETAPS2013* *Rome, Italy, March 17th 2013* *http://meals-project.eu/1st-meals-workshop* ** ** Deadline for early registration: January 30**** The ETAPS online registration form is available at:**** http://www.etaps.org/2013/registration-menu-2013**** ** ** ** ** Computing systems are getting ever more ubiquitous, making us dependent on their proper functioning. MEALS (Mobility between Europe and Argentina applying Logics to Systems, http://meals-project.eu/ ) is focused on designing and developing methods which provide a formal approach to model, understand, and analyze systems, wrt their required behavior: correct (i.e. they conform their intended behaviour), safe (i.e. its operation does not have catastrophic consequences), reliable, available to provide the intended service, and secure (i.e., no user without appropriate clearance can access or modify protected data).**** ** ** MEALS is a mobility project financed by the 7th Framework programmeunder Marie Curie's International Research Staff Exchange Scheme. It involves seven academic institutions from Europe and four from Argentina, and a total of about 80 researchers to be exchanged. The project started on the 1st of October, 2011, and it has a duration of 4 years.** ** ** The purpose of this workshop arranged by MEALS is to bring researchers, practitioners and industry together to discuss the issues, challenges and latest solutions for formal techniques for the specification, verification and synthesis of dependable ubiquitous computing systems, with respect to both qualitative (i.e. pure non-deterministic models) as well as quantitative behaviour (i.e. extended with probabilistic information). The workshop is targeted towards researchers interested in formal methods in all their aspects: foundations (their mathematical and logical basis), algorithmic advances (the conceptual basis for software tool support) and practical considerations (tool construction and case studies). The workshop will feature a number of distinguished presentations on newest challenges, new techniques, case studies, and tool demonstrations.**** ** ** *Invited speaker* Dino Distefano, Department of Computer Science at Queen Mary, University of London**** ** ** *Workshop speakers* **** Christel Baier (Technische Universit?t Dresden, Germany) **** *TBA***** Joost-Pieter Katoen (RWTH Aachen University, Germany)**** *Probabilistic Programs: New Semantic Insights and Loop Analysis Techniques* Nir Piterman (University of Leicester, UK)**** *The Modal Transition System Control Problem* ** Nicol?s Bordenabe (INRIA, France) ** *Geo-Indistinguishability: Differential Privacy for Location-Based Systems***** Jan Friso Groote (Eindhoven University of Technology, The Netherlands)**** *Axiomatisation of timed branching bisimulation with unbounded choice* Anton Wijs (Eindhoven University of Technology, The Netherlands) **** *Using General Purpose Graphics Processors for Probabilistic Model Checking* Andrea Turrini (Saarland University, Germany) *The Algorithmics of Probabilistic Automata Weak Bisimulation* Hern?n Melgratti (Universidad de Buenos Aires, Argentina)**** *Realisation of Choreographies and Multi-party Session Types* Axel Legay (INRIA, France)**** *PLASMA-lab: a flexible, distributable statistical model checking library* Daniel Sykes (Imperial College, UK)**** * Learning Revised Models For Planning In Adaptive Systems* ** ** * * *Organization* Suzana Andova (Eindhoven Univ. of Technology, The Netherlands)**** Pedro R. D'Argenio (Univ. Nacional de Cordoba, Argentina)**** ** ** ** ** ********** [Please forward this announcement to anyone interested]** ** ** ** ** -------------- next part -------------- An HTML attachment was scrubbed... URL: From grlmc at urv.cat Sun Jan 27 13:14:42 2013 From: grlmc at urv.cat (GRLMC) Date: Sun, 27 Jan 2013 19:14:42 +0100 Subject: [TYPES/announce] SSTiC 2013: 1st announcement Message-ID: *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of more than 70 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: At least 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montr?al) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Matthias Felleisen (Northeastern) [introductory] Programming with Contracts Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Syed Ali Jafar (Irvine) [intermediate] Interference Alignment Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montr?al) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [introductory/advanced] From Real-time Systems to Cyber-physical Systems Daniel Moss? (Pittsburgh) [intermediate] Asymmetric Multicore Management Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation David M. Nicol (Urbana) [intermediate] Cyber-security and Privacy in the Power Grid Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Data Parallel Programming Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Yousef Saad (Minnesota) [intermediate] Projection Methods and Their Applications Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism Dawn Xiaodong Song (Berkeley) [advanced] Selected Topics in Computer Security Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [intermediate] Engaging Users in Social Computing Systems Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Ian H. Witten (Waikato) [introductory] Data Mining Using Weka Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data Yuanyuan Zhou (San Diego) [intermediate] Building Robust Software Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists REGISTRATION: It has to be done on line at http://grammars.grlmc.com/SSTiC2013/Registration.php Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation will be available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputaci? de Tarragona Universitat Rovira i Virgili -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Pichardie at irisa.fr Mon Jan 28 08:36:34 2013 From: David.Pichardie at irisa.fr (David Pichardie) Date: Mon, 28 Jan 2013 08:36:34 -0500 Subject: [TYPES/announce] ITP 2013 - Deadline Extension Message-ID: <987DB3AA-35BC-4CD9-9261-F9808F7A2477@irisa.fr> * Extended deadline * Abstract submission deadline: 29 January 2013 (anywhere on earth) Paper submission deadline: 6 February 2013 (anywhere on earth) ITP 2013: 4th International Conference on Interactive Theorem Proving 23-26 July 2013, Rennes, France http://itp2013.inria.fr 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 in July 2010 in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC), the second meeting took place in Nijmegen, The Netherlands, in August 2011 and the third meeting was held in Princeton, New Jersey, in August 2012. ITP 2013 will take place in Rennes, France on 23-26 July 2013 with workshops preceding the main conference. 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: All papers must be submitted electronically, via EasyChair: https://www.easychair.org/conferences/?conf=itp2013 Papers may be no longer than 16 pages and are to be submitted in PDF using the Springer "llncs" format. Instructions may be found at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/instruct/authors/typeinst.pdf with Latex source file typeinst.tex in the same directory. Submissions must describe original unpublished work not submitted for publication elsewhere, presented in a way that users of other systems can understand. The proceedings will be published as a volume in the Springer Lecture Notes in Computer Science series and will be available to participants at the conference. In addition to regular submissions, described above, there will be a "rough diamonds" section. 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. Accepted diamonds will be published in the main proceedings, and will be presented as short talks. Both regular and rough diamond submissions require an abstract of 70 to 150 words to be submitted electronically at the above address one week before the full submission. All submissions must be written in English. Submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Details on how to submit will be forthcoming. Authors who have strong reasons (e.g. of commercial/legal nature) for violating this policy should contact the PC chairs in advance. At the time of abstract submission, proof assistants and other tools necessary for evaluating the submission should be indicated using the Keywords section of the web interface. 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: Abstract submission deadline: 29 January 2013 Paper submission deadline: 6 February 2013 Notification of paper decisions: 28 March 2013 Final versions due from authors: 22 April 2013 Conference dates: 23-26 July 2013 Web page: http://itp2013.inria.fr Program Committee: Wolfgang Ahrendt, Chalmers University, Sweden Jeremy Avigad, Carnegie Mellon University, USA Nick Benton, Microsoft Research, UK Lennart Beringer, Princeton University, USA Sandrine Blazy, University of Rennes, France (co-chair) Adam Chlipala, MIT, USA Thierry Coquand, Chalmers University, Sweden Amy Felty, University of Ottawa, Canada Ruben Gamboa, University of Wyoming, USA Herman Geuvers, Radboud University Nijmegen, The Netherlands Elsa Gunter, University of Illinois at Urbana-Champaign, USA David Hardin, Rockwell Collins, Inc., USA John Harrison, Intel Corporation, USA Gerwin Klein, NICTA and UNSW, Australia Assia Mahboubi, INRIA - ?cole polytechnique, France Panagiotis Manolios, Northeastern University, USA Conor Mcbride, University of Strathclyde, UK C?sar Mu?oz, NASA, USA Magnus O. Myreen, University of Cambridge, UK Tobias Nipkow, TU M?nchen, Germany Michael Norrish, NICTA and ANU, Australia Sam Owre, SRI International, USA Christine Paulin-Mohring, Universit? Paris-Sud 11, France (co-chair) Lawrence Paulson, University of Cambridge, UK David Pichardie, Inria Rennes/Harvard University, France (co-chair) Brigitte Pientka, McGill University, Canada Laurence Pierre, TIMA, France Lee Pike, Galois, Inc., USA Claudio Sacerdoti Coen, University of Bologna, Italy Julien Schmaltz, Open University of the Netherlands, The Netherlands Makoto Takeyama, AIST/COVS, Japan Laurent Th?ry, Inria Sophia-Antipolis, France Ren? Thiemann, University of Innsbruck, Austria Makarius Wenzel, Universit? Paris-Sud 11, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From klaus.havelund at jpl.nasa.gov Mon Jan 28 11:52:21 2013 From: klaus.havelund at jpl.nasa.gov (Klaus Havelund) Date: Mon, 28 Jan 2013 08:52:21 -0800 Subject: [TYPES/announce] [fm-announcements] Call for Papers: Runtime Verification 2013 Message-ID: <03D843C4-7132-4C94-B4DC-A607867A6D98@jpl.nasa.gov> Apologies should you receive multiple copies of this email: CALL FOR PAPERS RV'13 Fourth International Conference on Runtime Verification INRIA Rennes, France 24-27 September 2013 http://rv2013.gforge.inria.fr/ RV'13, the Fourth International Conference on Runtime Verification, will take place at INRIA Rennes, France, from 24 to 27 September 2013. IMPORTANT DATES Abstract submission: 28 April 2013 Paper submission: 5 May 2013 Notification: 17 June 2013 Final version: 15 July 2013 SCOPE Runtime verification is concerned with monitoring and analysis of soft- ware and hardware system executions. Runtime verification techniques are crucial for system correctness and reliability; they are signif- icantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for verification and debugging purposes, and after deployment for ensuring reliability, safety and security, and for providing fault containment and recovery. TOPICS - specification languages and formalisms for traces - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization PUBLICATION The RV'13 proceedings will be published as a volume of the LNCS series at Springer. Submission of papers to RV'13 is handled through EasyChair. The submission link is https://www.easychair.org/conferences/?conf=rv13 For more information, see http://rv2013.gforge.inria.fr/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- --- To opt-out from this mailing list, send an email to fm-announcements-request at lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner at lists.nasa.gov From pangjun at gmail.com Tue Jan 29 10:38:06 2013 From: pangjun at gmail.com (Jun PANG) Date: Tue, 29 Jan 2013 16:38:06 +0100 Subject: [TYPES/announce] ICECCS 2013 in Singapore -- Last Call for Papers Message-ID: =================================================== CALL FOR PAPERS The Eighteenth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2013) 17-19 July 2013 National University of Singapore, Singapore http://www.comp.nus.edu.sg/~pat/iceccs2013 =================================================== IMPORTANT DATES --------------------------- Abstract submission: February 1, 2013 Paper submission deadline: February 15, 2013 Workshop proposal submission: February 15, 2013 Notification of acceptance: March 30, 2013 Camera-ready material for publication: April 20, 2013 Checking for Production: April 30, 2013 Conference date: July 17-19, 2013 Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. SCOPE AND TOPICS --------------------------- Authors are invited to submit papers describing original, unpublished research results, case studies and toolset research results, case studies and tools. Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: Requirement specification and analysis Verification and validation Security and privacy of complex systems Model-driven development Reverse engineering and refactoring Architecture software Big Data Management Ambient intelligence, pervasive computing Ubiquitous computing, context awareness, sensor networks Design by contract Agile methods Safety-critical & fault-tolerant architectures Adaptive, self-managing and multi-agent systems Real-time, hybrid and embedded systems Systems of systems Tools and tool integration Industrial case studies SUBMISSION --------------------------- Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. Papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. FULL PAPERS Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. POSTER PAPERS Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedings. PAPER SUBMISSION Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All submissions should be made through the Easychair Website: https://www.easychair.org/account/signin.cgi?conf=iceccs2013 ORGANIZING COMMITTEES --------------------------- General Co-Chairs Jin Song Dong, National University of Singapore, Singapore Jun Sun, Singapore University of Technology and Design, Singapore Program Committee Co-Chairs Yang Liu, Nanyang Technological University, Singapore Andrew Martin, Oxford University, UK Workshop Chair Zhenjiang Hu, National Institute of Informatics, Japan Yuan-Fang Li, Monash University, Australia Publicity Chair Jun Pang, University of Luxembourg, Luxembourg Tutorial Chair Isabelle Perseil, INSERM Research, France Local Chair Shangwei Lin, National University of Singapore, Singapore Manchun Zheng, Singapore University of Technology and Design, Singapore Doctoral Symposium Chair Zhengchang Xin, Nanyang Technological University, Singapore Registration Chair ShaoJie Zhang, Singapore University of Technology and Design, Singapore Web Chair Jianqi Shi, National University of Singapore, Singapore PROGRAMME COMMITTEES --------------------------- Marc Aiguier, Ecole Centrale Paris, France Yamine Ait Ameur, LISI/ENSMA, France Luis Almeida, da Universidade do Porto, Portugal Etienne Andre, Universit? Paris 13, France Luciano Baresi, DEI - Politecnico di Milano, Italy Karin Breitman, PUC-RJ, Brazil Phillip J Brooke, Teesside University, United Kingdom Jean-Michel Bruel, IRIT, France Radu Calinescu, University of York, United Kingdom Corina Cirstea, University of Southampton, United Kingdom Felicita Di Giandomenico, ISTI-CNR, Italy Gilles Dowek, INRIA, France Kerstin Eder, University of Bristol, United Kingdom Carlo Alberto Furia, ETH Zurich, Switzerland Sebastien Gerard, CEA LIST, France Mark Grechanik, University of Illinois at Chicago, United States Lindsay Groves, Victoria University of Wellington, New Zealand Lars Grunske, Swinburne University of Technology, Australia Esther Guerra, Universidad Aut?noma de Madrid, Spain Fei He, Tsinghua University, China Moonzoo Kim, KAIST, South Korea Joseph Kiniry, IT University of Copenhagen, Denmark Daniel Kroening, Oxford University, United Kingdom Ralf Laemmel, Universit?t Koblenz-Landau, Germany Regine Laleau, Paris Est Creteil University, France Phillip Laplante, Pennsylvania State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Yuan-Fang Li, Monash University, Australia Xiaohong Li, Tianjin University, China Peter Lindsay, The University of Queensland, Australia Yang Liu, Nanyang Technological University, Singapore Gerald Luettgen, University of Bamberg, Germany Tiziana Margaria, University of Potsdam, Germany Andrew Martin, University of Oxford, United Kingdom Julie Mccann, Imperial College, United Kingdom Dominique Mery, Universit? de Lorraine, LORIA Raffaela Mirandola, Politecnico di Milano, Italy Jun Pang, University of Luxembourg, Luxembourg Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, USA Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Cristina Seceleanu, M?lardalen University, V?ster?s, SWEDEN Janet Smart, University of Oxford, United Kingdom Volker Stolz, University of Oslo, Norway Jing Sun, University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, AIST, Japan Dalila Tamzalit LINA Laboratory, University of Nantes, France Tullio Vardanega University of Padua, Italy Xinyu Wang, Zhejiang University, China Chao Wang, Virginia Tech, United States Hai H. Wang, University of Aston, United Kingdom Bow-Yaw Wang, Academia Sinica, Taiwan Bechir Zalila, ReDCAD Laboratory, University of Sfax, Tunisia Naijun Zhan, Chinese Academy of Sciences, China Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom -------------- next part -------------- An HTML attachment was scrubbed... URL: From rseba at disi.unitn.it Tue Jan 29 15:47:15 2013 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Tue, 29 Jan 2013 21:47:15 +0100 Subject: [TYPES/announce] Postdoc positions in SAT/SMT-based Verification available in Trento Message-ID: <20130129204715.GA12130@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- One post-doc position in ICT on the research project "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" is available in Trento, Italy, under the joint supervision of - Alessandro Cimatti, FBK, Trento, and - Roberto Sebastiani, DISI, University of Trento. 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 & Security Research Program, at Department of Information Engineering and Computer Science (DISI) of University of Trento. Aim and Scope ============= The research activity will aim at investigating and developing novel techniques, methodologies and support tools for Satisfiability Modulo Theories (SMT) for the formal verification of systems. This work will be part of the "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" project, a three-year research project supported by SRC/GRC (http://www.src.org/compete/s201113/), in strict collaboration with the Formal Verification Group at Intel, Haifa, and other major HW companies. The ultimate goal of the WOLF project is to provide a comprehensive SMT package to support effective formal verification of systems ranging from RTL circuits all the way up to high-level hardware description languages (e.g. SystemC) and software. The package will be implemented on top of the MathSAT SMT platform (http://mathsat.fbk.eu/), and provided as an API. Candidate Profile ================= The ideal candidate should have an PhD in computer science or related discipline, and combine solid theoretical background and excellent software development skills (in particular C/C++). A solid background knowledge and/or previous experience on one of the following topics (in order of preference) is required: Satisfiability Modulo Theory (SMT), Propositional Satisfiability (SAT), Model Checking, Automated Reasoning. Previous experience in the following areas will also be considered favourably: Constraint Solving and Optimization, Embedded Systems Design Languages (e.g. Verilog, VHDL). The candidate should be able to work in a collaborative environment, with a strong committment to reaching research excellence and achieving assigned objectives. Terms and dates =============== The position will start as soon as possible, and will have to be renewed yearly, for a maximum of two years. The expected salary will range from about 2200 to 2400 euros net income, and the gross will include previdential (social security) contributions. Facilities for meals at the local canteen can be provided. Applications and Inquiries ========================== Interested candidates should inquire for further information and/or apply by sending email to wolf-recruit at disi.unitn.it, with subject 'POSTDOC ON WOLF PROJECT'. Applications should contain a statement of interest, with a Curriculum Vitae, and the names of reference persons. PDF format is strongly encouraged. It should also indicate an estimated starting date. Contact Persons =============== Dr. ALESSANDRO CIMATTI, Embedded Systems Research Unit, FBK-Irst, via Sommarive 18, I-38123 Povo, Trento, Italy http://sra.fbk.eu/people/cimatti/, Prof. ROBERTO SEBASTIANI Software Engineering, Formal Methods & Security Research Program DISI, University of Trento, via Sommarive 14, I-38123 Povo, Trento, Italy http://disi.unitn.it/~rseba/. ======================================================================= 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 & Security Research Program at DISI ====================================================================== The SW Engineering, Formal Methods & Security R. P. at DISI currently consists on 5 faculties, various post-docs and 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. * Optimization in SMT and its applications. * Advanced Model Checking Techniques for Formal Verification of hardware, embedded critical software, and hybrid systems. 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 francesco.tiezzi at imtlucca.it Tue Jan 29 16:37:00 2013 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Tue, 29 Jan 2013 22:37:00 +0100 Subject: [TYPES/announce] CFP - COORDINATION 2013 - 2nd Announcement Message-ID: ====================== Second Call for Papers ====================== COORDINATION 2013 15th International Conference on Coordination Models and Languages http://coordination.discotec.org/ - part of DisCoTec 2013 Firenze, Italy, June 3-5 2013 ==================================================================== * IMPORTANT DATES * February 4, 2013 Abstract submission February 11, 2013 Paper submission March 18, 2013 Notification of acceptance March 25, 2013 Camera-ready version April 25, 2013 Early registration June 3-5 2013 Conference * SCOPE * COORDINATION 2013 is the premier forum for publishing research results and experience reports on software technologies for collaboration and coordination in concurrent, distributed, and socio-technical systems. Its distinctive feature is its emphasis on high-level abstractions that capture interaction patterns manifest at all levels of the software architecture and extending into the realm of the end-user domain. We seek high-quality contributions on the usage, study, design, and implementation of languages, models, and techniques for coordination in distributed, concurrent, pervasive, and multicore software systems. * MAIN TOPICS OF INTEREST * - programming abstractions and languages; - coordination models and paradigms; - software management and software engineering; - specification and verification; - foundations and types; - software for decentralized technologies; - multicore programming; - adaptive and autonomic systems; - coordination for social and socio-technical systems. * EXPECTED CONTRIBUTIONS * - Research papers: that demonstrate an ability to increase modularity, improve adaptive behavior, simplify reasoning, and ultimately enhance the software development process and its integration into a socio-technical context. Both practical and foundational perspectives are of interest. - Experience reports: that describe lessons learned from the application of proposed models and techniques to problems in the real world. - Visions in Progress papers: that look far ahead into the future of coordination-related ideas and explore the long-term vision of coordination languages, models, middleware and algorithms. * SUBMISSIONS * All Research Papers and Experience Reports must report on original unpublished work and cannot be under review for publication elsewhere. The key criteria for evaluating submissions will be innovation, scientific and technical soundness, and the capability to prove the advantages of the proposed techniques (in addition to their potential applicability). Maximum length: 15 pages. Visions in Progress Papers can report on work that has already been presented elsewhere, but the paper in itself must be a new synthesis and must clearly outline the motivation for the vision and the path that can eventually lead to its realization. The key criteria for evaluating submissions will be solid motivations, radical innovation, capability to look far beyond the state of the art, and feasibility of the proposed vision. Maximum length: 8 pages. All contributions should be submitted electronically as Postscript or PDF, using the Springer LNCS style, via the following EasyChair submission site: https://www.easychair.org/conferences/?conf=coordination2013 Submissions exceeding the category's stated length might be rejected without review. Each paper will undergo a thorough evaluation, and the conference proceedings will be published by Springer-Verlag in the LNCS series. Proceedings will be made available at the conference. Submission of any category of paper is a commitment that at least one of the authors will attend the conference if the paper is accepted. * PC CHAIRS * Rocco De Nicola (IMT - Institute for Advanced Studies Lucca, Italy) Christine Julien (The University of Texas at Austin, USA) * PROGRAMME COMMITTEE * Gul Agha (The University of Illinois at Urbana Champaign, USA) Saddek Bensalem (Verimag Laboratory, France) Borzoo Bonakdarpour (The University of Waterloo, Canada) Giacomo Cabri (Universit? di Modena e Reggio Emilia, Italy) Paolo Ciancarini (Universit? di Bologna, Italy) Dave Clarke (KU Leuven, Belgium) Frank de Boer (CWI, The Netherlands) Wolfgang De Meuter (Vrije Universiteit Brussel, Belgium) Jose' Luiz Fiadeiro (Royal Holloway University of London, UK) Chien-Liang Fok (The University of Texas, USA) Chris Hankin (Imperial College London, UK) Raymond Hu (Imperial College London, UK) K.R. Jayaram (HP Labs, USA) eva Kuehn (Vienna University of Technology, Austria) Mieke Massink (ISTI-CNR, Pisa, Italy) Jamie Payton (The University of North Carolina at Charlotte, USA) Rosario Pugliese (Universit? di Firenze, Italy) Nikola Serbedzija (Fraunhofer FOKUS, Germany) Marjan Sirjani (Reykjavik University, Iceland) Robert Tolksdorf (Freie Universit?t Berlin, Germany) Emilio Tuosto (University of Leicester, UK) Vasco T. Vasconcelos (University of Lisbon, Portugal) Mirko Viroli (Universit? di Bologna, Italy) * STEERING COMMITTEE * Farhad Arbab (CWI and Leiden University, The Netherlands, chair) Gul Agha (University of Illinois at Urbana Champaign, USA) Dave Clarke (KU Leuven, Belgium) Jean-Marie Jacquet (University of Namur, Belgium) Wolfgang De Meuter (Vrije Universiteit Brussels, Belgium) Rocco De Nicola (IMT - Institute for Advanced Studies Lucca, Italy) Marjan Sirjani (Reykjavik University, Iceland) Carolyn Talcott (SRI, USA) Vasco T. Vasconcelos (University of Lisbon, Portugal) Gianluigi Zavattaro (University of Bologna, Italy) * PUBLICITY CHAIR * Francesco Tiezzi (IMT - Institute for Advanced Studies Lucca, Italy) * FLYER * The COORDINATION 2013 flyer is available at: http://coordination.discotec.org/docs/Coordination_2013_flyer.pdf From bart at unica.it Wed Jan 30 03:59:20 2013 From: bart at unica.it (Massimo Bartoletti) Date: Wed, 30 Jan 2013 09:59:20 +0100 Subject: [TYPES/announce] Two postdoc positions in Cagliari Message-ID: <1359536360.2878.3.camel@binka> The Trustworthy Computational Societies research group (TCS) of the University of Cagliari is looking for two post-docs to join our ongoing projects. We seek applicants with strong interest in some of the following topics: programming language design and implementation, concurrency theory, program analysis and verification, and security foundations. The successful candidates will in work in the TCS group at the Department of Mathematics and Computer Science, University of Cagliari (Italy). The scientific core of the group is the development of formal methods for security of concurrent and distributed systems, and the experimentation of these methods through actual implementations. The team is composed by both researchers in the fields of security and concurrency theory (process algebras, semantics and types for concurrency, linear logic) and developers. A detailed presentation of the research group TCS can be found at the website tcs.unica.it. Positions: 2 positions, each of 2 years and renewable for another year Gross salary: ~23K EU / year Requisites: applicants must hold a PhD in Computer Science, Mathematics or related discipline, and must produce evidence of expertise on the above-mentioned topics. The PhD degree must have been obtained not later than 10 years before the postdoc starts. Starting date: may 2013 (with possibility of delaying until sept. on candidate request) Location: Cagliari is located on the southern coast of Sardinia, the second largest island in the Mediterranean see. The Cagliari airport is only 15? from the city centre, and it is connected with >70 direct flights (many of which are low-cost Ryanair flights) to Italy and Europe. The climate is Mediterranean, with mild winters (average temp. 16.4C) and many sunny days (~300 days/year without precipitation). The main beach, Poetto, is only 10? from the city centre. The Department of Mathematics and Computer Science is hosted in the Palazzo delle Scienze, located on top of a hill nearby the historical area of Castello. Inquires may be made to Massimo Bartoletti, bart at unica.it. From Alex.Simpson at ed.ac.uk Wed Jan 30 06:47:46 2013 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Wed, 30 Jan 2013 11:47:46 +0000 Subject: [TYPES/announce] 7th Scottish Category Theory Seminar Message-ID: <20130130114746.17232gn9mu5ebjb4@www.staffmail.ed.ac.uk> This may be of interest to some readers of types. ******************************************************************** *** *** 7th Scottish Category Theory Seminar *** Friday 8 February 2013, 12:30-15:15 (= NEXT FRIDAY!) *** International Centre for Mathematical Sciences *** 15 South College Street, Edinburgh, UK *** *** http://www.maths.ed.ac.uk/~tl/sct130208.html *** ******************************************************************** We are pleased to announce the Seventh Scottish Category Theory Seminar. Everyone is welcome. We have three invited talks: 12:30-13:15 Martin Escardo (Dept of Computer Science, Birmingham) 13:45-14:30 Danny Stevenson (School of Maths & Stats, Glasgow) 14:30-15:15 Simon Willerton (School of Maths & Stats, Sheffield) Titles and abstracts will be available soon at the web address above. As an added attraction, at 16:00 there will be a colloquium: Don Zagier, "Modular forms and black holes: from Ramanujan to Hawking". Our seminar will finish in time for participants to attend Zagier's talk, which is at Edinburgh's School of Maths. Locals will be there to guide you. If you wish to attend the meeting or would like to join us for dinner afterwards, please email Tom.Leinster at ed.ac.uk. Thanks to the Glasgow Mathematical Journal Trust for financial support. Best wishes, Scottish Category Theory Seminar organizers: Neil Ghani, Tom Leinster, Alex Simpson -- 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 gadducci at di.unipi.it Wed Jan 30 10:15:32 2013 From: gadducci at di.unipi.it (Fabio Gadducci) Date: Wed, 30 Jan 2013 16:15:32 +0100 Subject: [TYPES/announce] ACCAT 2013: call for participation Message-ID: <2D5132AB-480B-4D32-ADF3-92090F451557@di.unipi.it> [We apologize if you receive multiple copies of this message.] CALL FOR PARTICIPATION ========== 8th International Workshop on Applied and Computational Category Theory ACCAT 2013 http://accat2013.zib.de/ Satellite Event of ETAPS 2013, Rome, March 17 2013 ========== Scope ===== Since the 1960s, the use of category theory in computer science has been a fruitful one, including applications to different areas such as automata theory, algebraic specification, and programming languages, among others. In recent years, techniques and methods from CT have been adopted as a standard research tool, and considered as such in different venues around the world. The ACCAT workshop on "Applied and Computational Category Theory" has been one of these venues. Since its inception in 2006, ACCAT provided a forum where invited contributors presented their own research on different facets of category theory applied to computer science. Following the tradition, the program of this year edition will include eight invited talks by top researchers in the area: Samson Abramsky Robin B. Cockett Barbara Koenig Ugo Montanari Till Mossakowski Dusko Pavlovic Andrzej Tarlecki Glynn Winskel Despite ACCAT success, we believe that the current formula of the workshop should be deeply revised. Indeed, we believe that a fully fledged conference is missing where all kinds of applications of category theory to computer science can be presented (like the former CTCS conference, which somehow ended in 2006). Therefore, after the presentations, the workshop will end up with a general discussion among the invited speakers and the attendees. We hope that the outcome of the discussion could be a decision whether to push for such high-level workshop/conference on the application of category theory to computer science, or at least to verify the viability of a further meeting focusing on this issue. For more information, please contact Fabio Gadducci (gadducci at di.unipi.it) or Ulrike Golas (golas at zib.de). From jared at cs.utexas.edu Wed Jan 30 12:01:27 2013 From: jared at cs.utexas.edu (Jared C. Davis) Date: Wed, 30 Jan 2013 11:01:27 -0600 Subject: [TYPES/announce] ACL2 2013 - 2nd Call For Papers Message-ID: ACL2 2013 International Workshop on the ACL2 Theorem Prover and its Applications May 30-31, 2013 in Laramie, Wyoming, USA http://www.cs.uwyo.edu/~ruben/acl2-13 2nd CALL FOR PAPERS IMPORTANT DATES Abstract submission: February 8, 2013 Paper submission: February 15, 2013 Acceptance Notification: March 15, 2013 Final Version Due: April 15, 2013 WORKSHOP SCOPE ACL2 2013 is the major technical forum for users of the ACL2 theorem proving system to present research related to the ACL2 theorem prover and its applications. ACL2 2013 is the eleventh in the series of ACL2 workshops, which occur approximately every 18 months. ACL2 is an industrial-strength automated reasoning system, the latest in the Boyer-Moore family of theorem provers. The 2005 ACM Software System Award was awarded to Boyer, Kaufmann, and Moore for their work in ACL2 and the other theorem provers in the Boyer-Moore family. ACL2 2013 is a two-day workshop to be held in Laramie, WY, USA on May 30-31, 2013. The workshop will feature technical papers, invited talks, and rump sessions discussing ongoing research. We invite submissions of papers on any topic related to ACL2 and its applications, and we strongly encourage submissions related to other theorem provers or formal methods that are of interest to the ACL2 community. Suggested topics include but are not limited to the following: * software or hardware verification with ACL2, * formalizations of mathematics in ACL2, * new libraries, tools, and interfaces for ACL2, * novel uses of ACL2, * experiences with ACL2 in the classroom, * reports of and proposals for improvements of ACL2, * comparisons with other theorem provers, * comparisons with other programming or specification languages, * challenge problems and their solutions, * foundational issues related to ACL2, and * implementations connecting ACL2 with other systems. PAPER SUBMISSIONS Submissions must be made electronically in PDF format, as directed in the ACL2 2013 website. Submissions should be prepared in the EPTCS templates, available from http://style.eptcs.org. The ACL2 Workshop accepts both long papers (up to sixteen pages) and extended abstracts (up to two pages). Both categories of papers will be fully refereed, but only long papers will be included in the final workshop proceedings. At least one author of each accepted papers must register for the workshop and give a presentation summarizing the paper's results. Authors of long papers will have more time to present their work at the workshop. One of the main advantages of the ACL2 Workshop is that attendees are already knowledgeable about ACL2, its syntax, its basic commands, and the art of writing models in it. So authors may assume that readers have this familiarity. The workshop proceedings will be published as a volume of Electronic Proceedings in Theoretical Computer Science (EPTCS). Many papers presented at the workshop will describe interactions with the theorem prover. We strongly encourage authors of such papers to provide ACL2 script files (aka "books") along with instructions for using these books in ACL2. Such supporting materials should follow the guidelines at http://www.cs.utexas.edu/users/moore/acl2/books/index.html. For accepted papers, these books will be mirrored on the ACL2 home page and included in the ACL2 book repository. The workshop will also feature ``rump sessions'', in which participants can describe ongoing research related to ACL2. Proposals for rump session presentations, including a title and short abstract, will be accepted until the workshop. ORGANIZATION Chairs * Ruben Gamboa, University of Wyoming, USA * Jared Davis, Centaur, USA Program Committee * Carl Eastlund, Northeastern University, USA * David Greve, Rockwell Collins, USA * Warren Hunt, University of Texas, USA * Matt Kaufmann, University of Texas, USA * Hanbing Liu, AMD, USA * Panagiotis Manolios, Northeastern University, USA * Magnus Myreen, University of Cambridge, UK * David Rager, Battelle Memorial Institute, USA * Sandip Ray, Intel, USA * Jose Luis Ruiz Reina, University of Seville, Spain * David Russinoff, Intel, USA * Jun Sawada, IBM, USA * Julien Schmaltz, Open University of the Netherlands, The Netherlands * Konrad Slind, Rockwell Collins, USA * Sol Swords, Centaur, USA * Laurent Thery, INRIA, France -- Jared C. Davis 11410 Windermere Meadows Austin, TX 78759 http://www.cs.utexas.edu/users/jared/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Christophe.Ringeissen at loria.fr Wed Jan 30 12:56:28 2013 From: Christophe.Ringeissen at loria.fr (Christophe Ringeissen) Date: Wed, 30 Jan 2013 18:56:28 +0100 Subject: [TYPES/announce] FroCoS 2013 Second Call for Papers Message-ID: [Apologies for multiple copies] SECOND CALL FOR PAPERS FroCoS 2013 9th International Symposium on Frontiers of Combining Systems Nancy, France September 18-20, 2013 Submission Deadlines: 15 Apr 2013 (Abs.), 22 Apr 2013 (Paper) http://frocos2013.loria.fr/ GENERAL INFORMATION The 9th International Symposium on Frontiers of Combining Systems will be held in Nancy, France, from 18-20 September 2013. The aim of the conference is to publish and promote progress in research areas requiring the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. FroCos 2013 will be co-located with the 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2013) held 16-19 September 2013. A joint invited speaker and joint session is planned. SCOPE OF CONFERENCE: In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. To be usable in practice, these specialized systems must be combined with each other, and must be integrated into general purpose systems. This has led in many research areas to the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. The International Symposium on Frontiers of Combining Systems (FroCoS) traditionally focusses on these types of research questions and activities. Like its predecessors, FroCoS 2013 seeks to offer a common forum for research in the general area of combination, modularization and integration of systems, with emphasis on logic-based ones, and of their practical use. Typical topics of interest include (but are not limited to): * combinations of logics such as combined higher-order, first-order, temporal, modal, or other non-classical logics; * combinations and modularity in ontologies; * combination of decision procedures, of satisfiability procedures, of constraint solving techniques or of logical frameworks; * combination and integration methods in SAT and SMT solving; * combinations and modularity in term rewriting; * integration of equational and other theories into deductive systems; * combination of deduction systems and computer algebra; * integration of data structures into constraint logic programming and deduction; * hybrid methods for deduction, resolution and constraint propagation; * hybrid systems in knowledge representation and natural language semantics; * combined logics for distributed and multi-agent systems; * logical aspects of combining and modularizing programs and specifications. INVITED SPEAKERS: Stephane Demri LSV, CNRS & ENS de Cachan (joint invited talk with TABLEAUX 2013) Konstantin Korovin The University of Manchester Joel Ouaknine Oxford University Larry Paulson University of Cambridge PUBLICATION DETAILS: The proceedings of the conference will be published in the Springer LNAI/LNCS series. PAPER SUBMISSIONS The program committee seeks high-quality submissions describing original work, written and to be presented in English, not substantially overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://www.easychair.org/conferences/?conf=frocos2013. For each accepted paper, at least one author is required to attend the symposium to present the work. Prospective authors must register a title and an abstract a week before the paper submission deadline. Further information about paper submissions will be available at the conference website. IMPORTANT DATES 15 Apr 2013 Abstract submission 22 Apr 2013 Paper submission 6 Jun 2013 Notification of paper decisions 4 Jul 2013 Camera-ready papers due 18-20 Sep 2013 FroCoS Conference PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Alessandro Artale, Free University of Bolzano-Bozen, Italy Franz Baader, TU Dresden, Germany Clark Barrett, New York University, USA Peter Baumgartner, National ICT Australia, Canberra, Australia Christoph Benzmueller, Free University Berlin, Germany Jasmin Christian Blanchette, TU Muenchen, Germany Thomas Bolander, Technical University of Denmark Clare Dixon, University of Liverpool, UK Francois Fages, INRIA Rocquencourt, France Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Vijay Ganesh, University of Waterloo, Canada Silvio Ghilardi, Universita degli Studi di Milano, Italy Guido Governatori, National ICT Australia, Queensland, Australia Bernhard Gramlich, Technische Universitaet Wien, Austria Katsumi Inoue, National Institute of Informatics, Japan Sava Krstic, Intel, USA Alessio Lomuscio, Imperial College London, UK Till Mossakowski, DFKI & University of Bremen, Germany Silvio Ranise, Fondazione Bruno Kessler, Italy Christophe Ringeissen, LORIA, INRIA, France Philipp Ruemmer, Uppsala University, Sweden Renate Schmidt, The University of Manchester, UK Roberto Sebastiani, DISI, University of Trento, Italy Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany Andrzej Szalas, Linkoepings Universitet, Sweden & University of Warsaw, Poland Rene Thiemann, University of Innsbruck, Austria Ashish Tiwari, SRI, USA Josef Urban, Radboud University, The Netherlands Christoph Weidenbach, Max-Planck-Institut fuer Informatik, Germany Frank Wolter, University of Liverpool, UK CONFERENCE CHAIR Christophe Ringeissen, LORIA, INRIA, France PC CHAIRS Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Renate A. Schmidt, The University of Manchester, UK From Ralph.Matthes at irit.fr Thu Jan 31 11:08:47 2013 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Thu, 31 Jan 2013 17:08:47 +0100 Subject: [TYPES/announce] Types Meeting 2013 in Toulouse, 23 - 26 April: second call for contributions Message-ID: <1359648527.4100.103.camel@coinduct> Types Meeting 2013 Toulouse, 23-26 April 2013 http://www.irit.fr/TYPES2013/ SECOND CALL FOR CONTRIBUTIONS The 19th Conference "Types for Proofs and Programs" will take place in Toulouse, France, from 23 to 26 April 2013. 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: * Steve Awodey, Department of Philosophy, Carnegie Mellon University, U.S.A. * Lars Birkedal, Department of Computer Science, Aarhus University, Denmark * Ulrich Kohlenbach, Department of Mathematics, TU Darmstadt, Germany We invite all researchers to contribute talks on subjects related to the Types area of interest. These include, but are not limited to: - Foundations of type theory and constructive mathematics; - Applications of type theory; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalizing mathematics using type theory. We would like to especially encourage talks proposing new ways of applying type theory. The talks may be based on newly published papers or work submitted for publication, but also work in progress. There are no formal pre-proceedings, but we will make available the abstract book for the conference. Meanwhile, post-proceedings are confirmed to appear in LIPIcs (Leibniz International Proceedings in Informatics), Schloss Dagstuhl, see http://www.dagstuhl.de/en/publications/lipics (the same publisher as for the last TYPES meeting in Bergen in 2011) There will be a separate call for papers, and participation in TYPES 2013 is no prerequisite for submission to the post-proceedings. TYPES 2013 is intended to be a conference in our traditional workshop style. We expect submission of short abstracts that fit on one or two pages, presenting in sufficient detail the content of the talk and its relevance for TYPES, as judged by the program committee. Submission is exclusively admitted electronically, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=types2013 Deadline for proposing a contributed talk: Monday, February 25 This means registering a submission to the EasyChair system, including a short text-only abstract, and submitting the PDF file of an abstract typeset in LaTeX that fits on one or two pages, conforming to the EasyChair LaTeX class - for technical details, see the web page. (In the first call for papers, there was a second, earlier deadline for registering the submission to EasyChair.) Notification of acceptance: Friday, March 8 Deadline for final version of LaTeX sources for inclusion of the abstract into the abstract book: Monday, April 1st The conference itself: Tuesday to Friday, April 23-26 The venue: Toulouse in the South West of France is the fourth largest city of France and a lively university center with way over 100000 students. Toulouse offers numerous inexpensive accommodations, including student residences. Thanks to our sponsors, notably Universit? Toulouse 1 Capitole, granting the lecture hall in the city center, and IRIT (Institut de Recherche en Informatique de Toulouse) with financial support (other sources pending), we will be able to keep the participation fee moderate. Moreover, we will operate a scheme of additional fee reduction for master and PhD students (details will be given later on the web site). ----------------------------------------------------------------------- Satellite event: On Monday, April 22, the twelfth international workshop Proof, Computation, Complexity (PCC 2013) will be held on the campus of Toulouse Technical University. Abstract submission deadline: February 25 Notification of acceptance: March 8 For the details, see http://www.irit.fr/TYPES2013/PCC2013/ ----------------------------------------------------------------------- Program Committee TYPES 2013 Jos? Esp?rito Santo, University of Minho, Braga, Portugal Herman Geuvers, Radboud University Nijmegen, Netherlands Silvia Ghilezan, University of Novi Sad, Serbia Hugo Herbelin, PPS, INRIA Rocquencourt-Paris, France Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany Zhaohui Luo, Royal Holloway, University of London, UK Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair) Marino Miculan, University of Udine, Italy Bengt Nordstr?m, Chalmers University of Technology, G?teborg, Sweden Erik Palmgren, Stockholm University, Sweden Andy Pitts, University of Cambridge, UK Sergei Soloviev, IRIT, Univ. de Toulouse, France (co-chair) Pawe? Urzyczyn, University of Warsaw, Poland Tarmo Uustalu, Tallinn Technical University, Estonia From wbh22 at bath.ac.uk Thu Jan 31 16:29:34 2013 From: wbh22 at bath.ac.uk (Willem Heijltjes) Date: Thu, 31 Jan 2013 21:29:34 +0000 Subject: [TYPES/announce] Ph.D. position in Mathematical Foundations of Computation in Bath Message-ID: <510AE23E.6000601@bath.ac.uk> The Mathematical Foundations group at the University of Bath is offering a Ph.D. position in foundations of computation: Computational and representational aspects of modern proof systems In developing the mathematical foundations of computation, a central insight is that formal proofs can be viewed as computer programs. In this direction, a recent discovery by members of the group, in collaboration with international colleagues, is a correspondence between modern proof methods and computation over geometric objects. The position will be part of a larger project to further develop this connection. The particular task will be to develop and investigate computational calculi arising from this correspondence. The Mathematical Foundations group is a diverse and active research community within the Department of Computer Science. The group is world-class in the area of logic and semantics, and is internationally well-connected. Its members have an excellent record of supervising Ph.D. candidates, many of whom have gone on to establish themselves as successful independent researchers. The prospective supervisor for the advertised position is Willem Heijltjes. Relevant links: Willem Heijltjes - http://www.cs.bath.ac.uk/~wbh22/ Mathematical Foundations - http://www.bath.ac.uk/comp-sci/research/mathematical-foundations/ Details: Starting date for the position is 1st of October 2013. The position is funded by a three-year Graduate School studentship. It comprises full Home/EU tuition fees and a training support grant, plus a stipend of ?13,590 per annum (2012/13 rate). How to apply: Closing date for the advertisement is 28th of February 2013. Candidates must have a bachelor's degree or higher in mathematics, computer science, or a related field, or be expected to graduate before the starting date. Non-native English speakers will be required to obtain a satisfactory TOEFL or IELTS test score before the starting date. The application process further requires the contact details of two academic referees. To apply, please go to the page below and follow the steps outlined there. http://www.bath.ac.uk/science/gradschool/applying/ On the page "Choosing your programme of study", please make sure to select "PhD Programme in Computer Science (full-time)" under "Department of Computer Science". Enquiries: Please contact Willem Heijltjes From A.Lisitsa at liverpool.ac.uk Fri Feb 1 07:34:53 2013 From: A.Lisitsa at liverpool.ac.uk (Lisitsa, Alexei) Date: Fri, 1 Feb 2013 12:34:53 +0000 Subject: [TYPES/announce] CFP: First Workshop on Verification and Program Transformation, VPT 2013 Message-ID: Call for Papers First International Workshop on Verification and Program Transformation http://refal.botik.ru/vpt/ The First International Workshop on Verification and Program Transformation (VPT-2013) aims to bring together researchers working in two different areas, Verification and Program Transformation. VPT 2013 will be a CAV 2013 Workshop and held on July 13th and 14th, 2013. The workshop will provide a forum where all interactions of the two fields can be presented and discussed. It workshop will solicit research, position, applications and system description papers with a special emphasis on case studies, demonstrating viability of the interfaces between the two research fields in a broad sense. On the one hand presentations of the methods, techniques and tools developed in program transformations and successfully applied for verification of programs, systems and protocols specified by programs are welcomed. In opposite direction, papers describing the approaches to strengthening and optimization of program transformations by model checking, automated and interactive theorem proving, SAT- and SMT-based methods are strongly welcomed too. The papers dealing with neighboring areas, such as testing and program synthesis are welcomed as well. Topics of interest for VPT 2013 include, but are not limited to: * Verification by Program Transformation * Verification Techniques in Program Transformation and Synthesis * Verification and Certification of Programs Transformations * Program Analysis and Transformation * Program Testing and Transformation * Case studies Important Dates March 20th, 2013: Visa invitation letters through CAV deadline April 2nd, 2013: Paper submission deadline May 16th, 2013: Acceptance notification June 3rd, 2013: Camera ready version July 13th and 14th, 2013: Workshop Submission Regular papers (max. 16 pages) and tool papers (max. 7 pages) must be original and unpublished. Presentations of work-in-progress and relevant but already published work are accepted. Regular and tool papers accepted for presentation at the workshop will appear in the EasyChair Proceedings in Computing (EPiC) series; they must be prepared in LaTeX using the EasyChair class style and submitted both as LaTeX-source files and PDF files by 2nd April. Submission accepted for presentation must be presented at the workshop by at least one of the authors. If the Workshop will attract sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. See additional information on the site http://refal.botik.ru/vpt/. Visa Support is provided by the CAV 2013 organizers. Please, take into account, that the preparation of the visa supporting letter (including its processing in the Russian Ministry of Foreign Affairs) might take 2 months and even more. Thus, they need to start the preparation as soon as possible. We kindly ask submission authors and potential participants to apply for a visa invitation letter as soon as possible (even if their trip plans may change later). For further details please check: http://cav2013.forsyte.at/visa/ Program Committee: Maurice Bruynooghe (Katholieke Universiteit Leuven, Belgium) Geoff W. Hamilton (Dublin City University, Republic of Ireland) Boris Konev (The University of Liverpool, UK) Alexei Lisitsa, Co-Chair (The University of Liverpool, UK) Andrei P. Nemytykh, Co-Chair (Program Systems Institute of RAS, Russia) Johan Nordlander (Lulea* University of Technology, Sweden) Sven Schewe (The University of Liverpool, UK) Peter Sestoft (The IT University of Copenhagen, Denmark) Morten H. S?rensen (Formalit, Denmark) Simon Thompson (University of Kent, UK) Contacts Email: a.lisitsa at csc.liv.ac.uk nemytykh at math.botik.ru Web: http://refal.botik.ru/vpt/ http://refal.botik.ru/vpt/cfp.html From stevez at cis.upenn.edu Fri Feb 1 17:11:22 2013 From: stevez at cis.upenn.edu (Stephan Zdancewic) Date: Fri, 01 Feb 2013 17:11:22 -0500 Subject: [TYPES/announce] Call for participation: ExCAPE 2013 Summer School on Software Synthesis Message-ID: <510C3D8A.9050508@cis.upenn.edu> Call for Participation First ExCAPE Summer School on Software Synthesis June 12-15, 2013 University of California, Berkeley https://excape.cis.upenn.edu/summer-school.html Program synthesis aims to change programming from a purely manual task to one in which a programmer and an automated program synthesis tool collaborate to generate software that meets its specification. As such, it has the potential to revolutionize computing by allowing developers to create programs from incomplete sketches, declarative specifications of high-level requirements, positive and negative examples, or domain-specific optimization criteria. The goal of the school is to expose graduate students and junior researchers to new ideas in program synthesis. The school provides a unique opportunity for students to engage with cutting-edge research in courses taught by experts in the field. Topics will be drawn from theoretical foundations (computer-aided verification, control theory, program analysis), design methodology (human-computer interaction, model-based design, programming environments), and applications (concurrent programming, network protocols, robotics, system architecture). Format: Each of three tutorial areas will be covered in three hours of lectures, plus additional hands on sessions on tools and problem solving. The tutorials will be complemented by several invited lectures on theory and applications of synthesis. Tutorials: * Ras Bodik and Emina Torlak (UC Berkeley): Synthesizing programs with constraint solvers * Paulo Tabuada (UCLA): Synthesis for cyber-physical systems * Moshe Vardi (Rice): Reactive synthesis Speakers: (partial list) 1. Rajeev Alur (U. Penn): Specifying protocols using concolic snippets 2. Sumit Gulwani (Microsoft Research): Synthesis for online education 3. St?phane Lafortune (U. Michigan): Synthesis for discrete event systems: A case study 4. Richard Murray (Caltech): Synthesis for embedded control software 5. Sanjit Seshia (UC Berkeley): Integrating induction, deduction, and structure for synthesis 6. Armando Solar-Lezama (MIT): Synthesis via numerical optimizations 7. Stavros Tripakis (UC Berkeley): Bridging the gap between reactive synthesis and supervisory control 8. Gera Weiss (Ben Gurion U.): Behavioral programming Venue: The school will be held on the campus of the University of California, Berkeley. Organizers: Ras Bodik (Berkeley) St?phane Lafortune (University of Michigan) Steve Zdancewic (University of Pennsylvania) Registration: Registration information is available from the summer school?s web page at: https://excape.cis.upenn.edu/summer-school.html Registration is free and includes lunch and coffee breaks. Limited and need-based financial assistance to cover travel/lodging costs is available. Please contact Liz Ng (wng at cis.upenn.edu) with questions regarding the logistics. From Ylies.Falcone at imag.fr Sat Feb 2 03:47:39 2013 From: Ylies.Falcone at imag.fr (=?iso-8859-1?Q?Yli=E8s_Falcone?=) Date: Sat, 2 Feb 2013 09:47:39 +0100 Subject: [TYPES/announce] ETAPS 2014: CALL FOR SATELLITE EVENTS Message-ID: [We apologise for duplicates.] *** CALL FOR SATELLITE EVENTS *** ETAPS 2014 European Joint Conferences on Theory And Practice of Software April 5th ? 13th, 2014 Grenoble, France -- 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 is an annual event which takes place in Europe each spring since 1998. The seventeenth conference, ETAPS 2014, takes place between April 5th and 13th, 2014 in Grenoble, France. Grenoble is the capital of the Alps; its history spans over two thousand years. Grenoble is located in an exceptional natural environment, surrounded by three mountain masses Vercors, Chartreuse, and Belledonne. ETAPS main conferences take place on April 7th-11th, 2014. They are: - 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 - POST: Principles of Security and Trust - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- SATELLITE EVENTS -- The ETAPS 2014 Organizing Committee invites proposals for Satellite Events (workshops, tutorials, etc.) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite Events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2014 Satellite Events will be held immediately before and after the main conferences, on April 5th-6th and April 12th-13th, 2014. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize Satellite Events are invited to submit proposals in ASCII, PDF or Postscript format by e-mail toetaps2014.satellites at imag.fr. A proposal should not exceed two pages and should include: ? Satellite Event name / acronym ? names and contact information of the organizers ? preferred period: April 5th-6th or April 12th-13th ? duration of the workshop: one-day or two-day event ? 120-word description of the workshop topic for later use in publicity material ? a brief explanation of the workshop topic and its relevance to ETAPS ? a schedule for paper submission, notification of acceptance and final versions ? expected number of participants ? any other relevant information, like event format, invited speakers, ? publication policy, demo sessions, special space requirements, etc. The proposals will be evaluated by the ETAPS 2014 organizing committee on the basis of their assessed benefit for prospective participants to ETAPS 2014. The titles and brief information about accepted Satellite Events will be included in the ETAPS 2014 web site, call for papers and call for participation. Satellite Events organizers will be responsible for: - producing the event's call for papers and call for participations - advertising the event through specialist mailing lists etc. to complement publicity for ETAPS as a whole hosting and maintaining a web site for the event - reviewing and making acceptance decisions on submitted papers producing the event proceedings, if any; facilities for printing will be made available by the ETAPS organizers - scheduling workshop activities in consultation with the local organizers. Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2013: http://www.etaps.org/2013/workshops13 ETAPS 2012: http://www.etaps.org/2012/workshops ETAPS 2011: http://www.etaps.org/2011/workshops ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/ ETAPS 2009: http://www.cs.york.ac.uk/etaps09/ ETAPS 2008: http://etaps08.mit.bme.hu/ ETAPS 2007: http://www.di.uminho.pt/etaps07/ ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/ ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/ ETAPS 2004: http://www.lsi.upc.es/etaps04/ ETAPS 2003: http://www.mimuw.edu.pl/etaps03/ -- IMPORTANT DATES -- Satellite Event Proposals Deadline: Marsh 4th, 2013 Notification of acceptance: April 4th, 2013 -- FURTHER INFORMATION AND ENQUIRIES -- Please contact Axel Legay: axel.legay at inria.fr etaps14.satellites at imag.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From francesco.tiezzi at imtlucca.it Sun Feb 3 06:32:40 2013 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Sun, 3 Feb 2013 12:32:40 +0100 Subject: [TYPES/announce] DisCoTec 2013: Last Call for Papers (EXTENDED DEADLINES) Message-ID: <528887DB-3543-4E1A-A2BE-20EC48D12D2D@imtlucca.it> [We apologize for multiple copies] ====================================================================== Call for Papers DisCoTec 2013 8th International Federated Conference on Distributed Computing Techniques http://www.discotec.org/ Firenze, Italy, June 3-6 2013 ====================================================================== Important Dates and Submissions ====================================================================== All conferences share the same deadlines: February 11, 2013 Abstract submission (*NEW DATE*) February 18, 2013 Paper submission (*NEW DATE*) March 18, 2013 Notification of acceptance March 25, 2013 Camera-ready version May 6, 2013 Early registration June 3-6 2013 Conference and workshops Each paper will undergo a thorough process of review and all conference proceedings will be published by Springer in the LNCS series. ====================================================================== DisCoTec 2013 Main Conferences ====================================================================== The DisCoTec series of federated conferences is one of the major events sponsored by the International Federation for Information processing (IFIP). The main conferences are: ---------------------------------------------------------------------- COORDINATION 15th International Conference on Coordination Models and Languages http://coordination.discotec.org/ * Co-Chairs * Rocco De Nicola (IMT Lucca, Italy) Christine Julien (Univ. of Texas, USA) * Contribution types * Research papers: 15 pages maximum Experience reports: 15 pages maximum Visions in progress papers: 8 pages maximum ---------------------------------------------------------------------- DAIS 13th IFIP International Conference on Distributed Applications and Interoperable Systems http://dais.discotec.org/ * Co-Chairs * Jim Dowling (KTH / SICS, Sweden) Francois Taiani (Univ. de Rennes 1 / IRISA, France) * Contribution types * Research papers: 14 pages maximum Practical experience reports: 14 pages maximum Work-in-progress papers: 6 pages maximum ---------------------------------------------------------------------- FORTE/FMOODS IFIP Joint International Conference on Formal Techniques for Distributed Systems 33rd Formal Techniques for Networked and Distributed Systems 15th Formal Methods for Open Object-Based Distributed Systems http://forte13.sosy-lab.org/ * Co-Chairs * Dirk Beyer (Univ. of Passau, Germany) Michele Boreale (Univ. of Firenze, Italy) * Contribution types * Research papers: 15 pages maximum Experience reports: 15 pages maximum Tool or system description papers: 15 pages maximum ====================================================================== DisCoTec 2013 Workshops ====================================================================== The three workshops co-located this year with DisCoTec are: ---------------------------------------------------------------------- CS2Bio 2013 4th International Workshop on Interactions between Computer Science and Biology http://cs2bio13.di.unito.it/ ---------------------------------------------------------------------- ICE 2013 6th Interaction and Concurrency Experience http://www.discotec.org/workshops/ice2013/ ---------------------------------------------------------------------- WWV 2013 9th International Workshop on Automated Specification and Verification of Web Systems http://users.dsic.upv.es/~jsilva/wwv2013/ ==================================================================== DisCoTec 2013 Committees ==================================================================== * General Chair * Michele Loreti (Univ. of Firenze, Italy) * Workshops Chair * Rosario Pugliese (Univ. of Firenze, Italy) * Publicity Chair * Francesco Tiezzi (IMT Lucca, Italy) * Local Organizing Committee * * Luca Cesari * Andrea Margheri * Massimiliano Masi * Simona Rinaldi * Betti Venneri * Steering Committee * * Farhad Arbab (CWI, Netherlands) * Frank de Boer (CWI, Netherlands) * Rocco De Nicola (IMT Lucca, Italy) * Jim Dowling (KTH, Sweden) * Kurt Geihs (Univ. of Kassel, Germany) * Elie Najm (Chair) (Telecom-ParisTech, France) * Rui Oliveira (Univ. of Minho, Portugal) * Marjan Sirjani (Univ. of Reykjavik, Iceland) * Jean-Bernard Stefani (INRIA, France) From pangjun at gmail.com Mon Feb 4 03:42:51 2013 From: pangjun at gmail.com (Jun PANG) Date: Mon, 4 Feb 2013 09:42:51 +0100 Subject: [TYPES/announce] ICECCS 2013 in Singapore -- deadlines extended Message-ID: =================================================== CALL FOR PAPERS The Eighteenth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2013) 17-19 July 2013 National University of Singapore, Singapore http://www.comp.nus.edu.sg/~pat/iceccs2013 =================================================== IMPORTANT DATES --------------------------- Abstract submission: February 11, 2013 (extended) Paper submission deadline: February 25, 2013 (extended) Workshop proposal submission: February 15, 2013 Notification of acceptance: March 30, 2013 Camera-ready material for publication: April 20, 2013 Checking for Production: April 30, 2013 Conference date: July 17-19, 2013 Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts, from a variety of user domains and software disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools, existing complex systems, and commercially available tools. SCOPE AND TOPICS --------------------------- Authors are invited to submit papers describing original, unpublished research results, case studies and toolset research results, case studies and tools. Papers are solicited in all areas related to complex computer-based systems, including the causes of complexity and means of avoiding, controlling, or coping with complexity. Topic areas include, but are not limited to: Requirement specification and analysis Verification and validation Security and privacy of complex systems Model-driven development Reverse engineering and refactoring Architecture software Big Data Management Ambient intelligence, pervasive computing Ubiquitous computing, context awareness, sensor networks Design by contract Agile methods Safety-critical & fault-tolerant architectures Adaptive, self-managing and multi-agent systems Real-time, hybrid and embedded systems Systems of systems Tools and tool integration Industrial case studies SUBMISSION --------------------------- Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic and culminate panels to discuss relationships between industrial and academic research. Papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and industrial experience reports should describe practical projects carried out in industry, and reflect on the lessons learnt from them. FULL PAPERS Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. POSTER PAPERS Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedings. PAPER SUBMISSION Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All submissions should be made through the Easychair Website: https://www.easychair.org/account/signin.cgi?conf=iceccs2013 ORGANIZING COMMITTEES --------------------------- General Co-Chairs Jin Song Dong, National University of Singapore, Singapore Jun Sun, Singapore University of Technology and Design, Singapore Program Committee Co-Chairs Yang Liu, Nanyang Technological University, Singapore Andrew Martin, Oxford University, UK Workshop Chair Zhenjiang Hu, National Institute of Informatics, Japan Yuan-Fang Li, Monash University, Australia Publicity Chair Jun Pang, University of Luxembourg, Luxembourg Tutorial Chair Isabelle Perseil, INSERM Research, France Local Chair Shangwei Lin, National University of Singapore, Singapore Manchun Zheng, Singapore University of Technology and Design, Singapore Doctoral Symposium Chair Zhengchang Xin, Nanyang Technological University, Singapore Registration Chair ShaoJie Zhang, Singapore University of Technology and Design, Singapore Web Chair Jianqi Shi, National University of Singapore, Singapore PROGRAMME COMMITTEES --------------------------- Marc Aiguier, Ecole Centrale Paris, France Yamine Ait Ameur, LISI/ENSMA, France Luis Almeida, da Universidade do Porto, Portugal Etienne Andre, Universit? Paris 13, France Luciano Baresi, DEI - Politecnico di Milano, Italy Karin Breitman, PUC-RJ, Brazil Phillip J Brooke, Teesside University, United Kingdom Jean-Michel Bruel, IRIT, France Radu Calinescu, University of York, United Kingdom Corina Cirstea, University of Southampton, United Kingdom Felicita Di Giandomenico, ISTI-CNR, Italy Gilles Dowek, INRIA, France Kerstin Eder, University of Bristol, United Kingdom Carlo Alberto Furia, ETH Zurich, Switzerland Sebastien Gerard, CEA LIST, France Mark Grechanik, University of Illinois at Chicago, United States Lindsay Groves, Victoria University of Wellington, New Zealand Lars Grunske, Swinburne University of Technology, Australia Esther Guerra, Universidad Aut?noma de Madrid, Spain Fei He, Tsinghua University, China Moonzoo Kim, KAIST, South Korea Joseph Kiniry, IT University of Copenhagen, Denmark Daniel Kroening, Oxford University, United Kingdom Ralf Laemmel, Universit?t Koblenz-Landau, Germany Regine Laleau, Paris Est Creteil University, France Phillip Laplante, Pennsylvania State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Yuan-Fang Li, Monash University, Australia Xiaohong Li, Tianjin University, China Peter Lindsay, The University of Queensland, Australia Yang Liu, Nanyang Technological University, Singapore Gerald Luettgen, University of Bamberg, Germany Tiziana Margaria, University of Potsdam, Germany Andrew Martin, University of Oxford, United Kingdom Julie Mccann, Imperial College, United Kingdom Dominique Mery, Universit? de Lorraine, LORIA Raffaela Mirandola, Politecnico di Milano, Italy Jun Pang, University of Luxembourg, Luxembourg Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, USA Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Cristina Seceleanu, M?lardalen University, V?ster?s, SWEDEN Janet Smart, University of Oxford, United Kingdom Volker Stolz, University of Oslo, Norway Jing Sun, University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, AIST, Japan Dalila Tamzalit LINA Laboratory, University of Nantes, France Tullio Vardanega University of Padua, Italy Xinyu Wang, Zhejiang University, China Chao Wang, Virginia Tech, United States Hai H. Wang, University of Aston, United Kingdom Bow-Yaw Wang, Academia Sinica, Taiwan Bechir Zalila, ReDCAD Laboratory, University of Sfax, Tunisia Naijun Zhan, Chinese Academy of Sciences, China Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom -------------- next part -------------- An HTML attachment was scrubbed... URL: From curien at pps.univ-paris-diderot.fr Mon Feb 4 08:30:36 2013 From: curien at pps.univ-paris-diderot.fr (Pierre-Louis Curien) Date: Mon, 04 Feb 2013 14:30:36 +0100 Subject: [TYPES/announce] website of the IHP trimester "Semantics of proofs and certified mathematics" Message-ID: We are pleased to point you to the web page http://ihp2014.pps.univ-paris-diderot.fr/ of the IHP trimester ** Semantics of proofs and certified mathematics ** which will be held in Paris from April 7 to July 11, 2014 (cf. previous pre-announcement on this forum). The webpage encourages potential participants to pre-register, so as to be kept informed of the progression of the organisation of this event, and in order to help the organisers in the advance planning of the trimester. Registration will be open some time during next spring. Best regards, The organisers (Pierre-Louis Curien, Hugo Herbelin, Paul-Andr? Melli?s) From Alex.Simpson at ed.ac.uk Tue Feb 5 05:04:39 2013 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 05 Feb 2013 10:04:39 +0000 Subject: [TYPES/announce] 7th Scottish Category Theory Seminar (now with titles) Message-ID: <20130205100439.30095j9rsv8tfio8@www.staffmail.ed.ac.uk> ******************************************************************** *** *** 7th Scottish Category Theory Seminar *** Friday 8 February 2013, 12:30-15:15 (= NEXT FRIDAY!) *** International Centre for Mathematical Sciences *** 15 South College Street, Edinburgh, UK *** *** http://www.maths.ed.ac.uk/~tl/sct130208.html *** ******************************************************************** We are pleased to announce the Seventh Scottish Category Theory Seminar. Everyone is welcome. We have three invited talks: 12:30-13:15 Martin Escardo (Dept of Computer Science, Birmingham) Sheaves in type theory: a model of uniform continuity 13:45-14:30 Danny Stevenson (School of Maths & Stats, Glasgow) A generalized Eilenberg?Zilber theorem for simplicial sets 14:30-15:15 Simon Willerton (School of Maths & Stats, Sheffield) A tale of two constructions by Isbell As an added attraction, at 16:00 there will be a colloquium (not part of the category theory seminar): Don Zagier, "Modular forms and black holes: from Ramanujan to Hawking". Our seminar will finish in time for participants to attend Zagier's talk, which is at Edinburgh's School of Maths. Locals will be there to guide you. If you wish to attend the meeting or would like to join us for dinner afterwards, please email Tom.Leinster at ed.ac.uk. Thanks to the Glasgow Mathematical Journal Trust for financial support. Best wishes, Scottish Category Theory Seminar organizers: Neil Ghani, Tom Leinster, Alex Simpson -- 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 667 7209 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Marc.Boyer at onera.fr Tue Feb 5 08:21:02 2013 From: Marc.Boyer at onera.fr (Marc Boyer) Date: Tue, 05 Feb 2013 14:21:02 +0100 Subject: [TYPES/announce] PostDoc position on certifying Network Calculus computations within Isabelle Message-ID: <5111073E.8080305@onera.fr> A PostDoc position is open for 12 month at ONERA (Toulouse, France), to work on an encoding of Network Calculus within the interactive proof assistant Isabelle. Network Calculus is a formal theory designed to compute delays and buffer usage in networks. It has been used to certify the A380 backbone. Its mathematical background is based on the (min,plus) dioid, and algorithms have been derived and implemented that allow users to ascertain bounds on network parameters, given hypotheses on the arrival of packets from the environment. The objective of the post-doctoral research will be to contribute to increasing the confidence in the results obtained by applying Network Calculus. The candidate is expected to encode the mathematical theory of Network Calculus in the theorem prover Isabelle/HOL and to derive theorems underlying the algorithms for network analysis. The results will be validated by instrumenting a Network Calculus analyzer in order to produce a trace whose correctness can be certified using Isabelle. Preliminary work has already been carried out in order to demonstrate the feasibility of the approach, and the post-doctoral researcher will extend and consolidate the existing Isabelle theory. The work will be carried out at ONERA, in partnership with SME Real-Time at Work, and INRIA Nancy (Stephan Merz). Please do not hesitate to contact Marc Boyer (Marc.Boyer at onera.fr) with any questions if you are interested in the position. -- Marc Boyer, Ingenieur de recherche ONERA Tel: (33) 5.62.25.26.36 DTIM Fax: (33) 5.62.25.26.93 2, av Edouard Belin http://www.onera.fr/staff/marc-boyer/ 31055 TOULOUSE Cedex 4 From Ylies.Falcone at ujf-grenoble.fr Tue Feb 5 09:19:12 2013 From: Ylies.Falcone at ujf-grenoble.fr (=?iso-8859-1?Q?Yli=E8s_Falcone?=) Date: Tue, 5 Feb 2013 15:19:12 +0100 Subject: [TYPES/announce] PERSYVAL-Lab Summer School on Cyber-Physical Systems, GRENOBLE (FRANCE) JULY 8-12, 2013 Message-ID: <6DCBEA3A-A0B5-4BF0-B481-D2507664E138@ujf-grenoble.fr> [~~~~~~ Please disseminate widely within your teams & contacts ~~~~~~] Dear Colleagues, IET ICT Labs and PERSYVAL-Lab (Pervasive systems and algorithms at the convergence of physical and digital worlds) Based on high-level research laboratories present at Grenoble in Mathematics, Computer Science, Automatic Control, Signal Processing, and Hardware Architecture, is organizing the 1st edition of the CPS Summer School. This school will bring together some of the best lecturers from Europe and the USA, in a one week programme, and be a fantastic opportunity for interaction. It will be held in the campus of Grenoble University- France. All details can be found at: http://www-verimag.imag.fr/PERSYVAL-Lab-Summer-School-on.html?lang=en Hard deadline for applications is May 1st 2013. Attendance is limited to 80, so we will be selecting amongst the candidates. Registration fee is ?350 for students, ?650 for non-students, which includes lunches from Monday 8th through Friday 12th. The registration fee only partially covers the costs incurred. The remaining costs are covered by the EIT ICT Labs and PERSYVAL-Lab. The programme will offer world-class courses and significant opportunities for interaction with leading researchers in the area of Cyber Physical Systems. Best Regards, Yli?s Falcone Associate Professor University of Grenoble 1 (UJF) -------------- next part -------------- An HTML attachment was scrubbed... URL: From rlazarus at bbn.com Tue Feb 5 10:15:32 2013 From: rlazarus at bbn.com (Richard Lazarus) Date: Tue, 05 Feb 2013 10:15:32 -0500 Subject: [TYPES/announce] Career opportunities at BBN -- quantum computer science Message-ID: <51112214.7030502@bbn.com> At BBN, we have job opportunities in quantum computer science related to language system development and information theory. Depending on the candidate's skill mix, they would have opportunities to work on quantum programming languages and tools as well as make information theory contributions to other research projects. We would also consider funding post-docs who would have an interest in a BBN position in the future. BBN is seeking candidates with interest and expertise in language systems and quantum information science. We are conducting research in the area of quantum programming languages, quantum compilers and circuit optimization, and quantum algorithms and error correction. This work focuses on designing a high-level programming language to describe quantum algorithms (both quantum and classical), and this language would have to be "quantum safe," in the sense that it should not allow for any non-physical quantum operations to be described. This work could include implementing compiler operations such as symbolic optimization of the algorithm implementation, synthesis to quantum circuits, and aids to support the programmer. In addition, the candidate would preferably have interest and expertise in one or more other quantum information theory topics ? including quantum algorithms, error correction, communications, and optics ? or in other exotic language/compiler systems such as those for synthetic biology. The candidate will join a highly entrepreneurial group exploiting quantum phenomena to advance computation, communications and sensing and have an opportunity to support a variety of experimental and theoretical projects. Our recent publications (www.bbn.com/technology/quantum/pubs) provide an indication of the impact of our work on the field of quantum information science. One can view the full position description here: http://careers.bbn.com/servlet/av/jd?ai=715&ji=2645162&sn=I -- Richard Lazarus Quantum Information Processing Group Raytheon BBN Technologies 10 Moulton St., Cambridge, MA 02138 www.bbn.com From Assia.Mahboubi at inria.fr Thu Feb 7 10:39:29 2013 From: Assia.Mahboubi at inria.fr (Assia Mahboubi) Date: Thu, 07 Feb 2013 16:39:29 +0100 Subject: [TYPES/announce] The 5th Coq Workshop Message-ID: <5113CAB1.2030308@inria.fr> ================================================================================ The Fifth Coq Workshop (2013) http://coq.inria.fr/coq-workshop/2013 Colocated with the 4rd International Conference on Interactive Theorem Proving (ITP 2013), Rennes, France ================================================================================ The Coq Workshop series brings together Coq users, developers, and contributors. While conferences like ITP provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, likely supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Relevant subject matter includes but is not limited to: * Language or tactic features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools and platforms built on Coq * Plugins and libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit short proposals through EasyChair. Submissions should be in portable document format (PDF). Proposals should not exceed 2 pages in length in single-column full-page style. Venue: ITP, Rennes. Important Dates: * April 7: Deadline for proposal submission * April 28: Acceptance notification * July 22: Workshop in Rennes Submission URL: https://www.easychair.org/conferences/?conf=coq5 Program committee: * Pierre Letouzey, Universit? Paris 7, France * Marco Maggesi, Universit? degli Studi di Firenze, Italy * Assia Mahboubi (co-chair), INRIA, France * David Pichardie, INRIA, France * Benjamin Pierce, University of Pennsylvania, USA * Randy Pollack, University of Edinburgh, UK * Enrico Tassi (co-chair), INRIA, France * Viktor Vafeiadis, MPI-SWS, Germany Contact: Assia Mahboubi (assia.mahboubi at inria.fr), Enrico Tassi (enrico.tassi at inria.fr) From katoen at cs.rwth-aachen.de Fri Feb 8 05:42:54 2013 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Fri, 08 Feb 2013 11:42:54 +0100 Subject: [TYPES/announce] [ETAPS 2013] Second Call for Participation Message-ID: <5114D6AE.9030408@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** SECOND CALL FOR PARTICIPATION: ETAPS 2013 European Joint Conferences on Theory And Practice of Software March 16 - March 24, 2013 Rome, Italy http://www.etaps.org/2013 Web-based registration deadline: March 8, 2013 ****************************************************************** -- 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 six main annual conferences, accompanied by satellite workshops and invited tutorials (new in 2013). ETAPS 2013 is already the sixteenth event in the series. -- MAIN CONFERENCES -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED SPEAKERS -- * Gilles Barthe (Fundaci?n IMDEA Software, Madrid, Spain) * Emily Berger (Univ. of Mussachusetts, Amherst, USA) * Krzysztof Czarnecki (Univ. of Waterloo, Canada) * Cedric Fournet (Microsoft Research, Cambridge, UK) * Orna Grumberg (Technion, Haifa, Israel) * Martin Hofmann (Univ. of Munich, Germany) * Jean-Pierre Hubaux (EPFL, Losanna, Switzerland) * Mark S. Miller (Google Research, USA) -- INVITED TUTORIAL SPEAKERS -- * John C. Mitchell (Stanford Univ., USA) * Martin Fr?nzle (Univ. of Oldenburg, Germany) * Ralf K?sters (Univ. of Trier, Germany) The tutorials take place on Sunday March 17 before ETAPS 2013. -- FRIDAY MARCH 22 EVENT -- On Friday 22, there is a special programm on the occasion of the 90th birthday of Corrado B?hm. Attendance with full ETAPS registration is free. A registration solely for Friday 22, is also possible. -- SATELLITE EVENTS -- 22 satellite workshops will take place before or after ETAPS 2013. ACCAT, AiSoS, BX, DICE, Found. Syst. Spec., HAS, HotSpot, MBT, MEALS, SR, OCCP, and VSSE will take place in the weekend on 16-17 March 2013. Bytecode, CerCo, FESCA, GT-VMT, GRAPHITE, IC1201, MLQA, PLACSE, QAPL, and TERMGRAPH are scheduled for 31 March-1 April 2012. -- REGISTRATION Web-based registration is until March 8, 2013. After that date, only on-site registration will be possible. -- ACCOMMODATION Roma has a huge hotel capacity. You can either arrange your accommodation on your own or find some reserved hotels on the registration page. Such reservations expire on February 15, but new ones will appear after this deadline during the entire registration period. -- HOST CITY -- Rome is the capital of Italy and the country's largest and most populated municipality. The city is located in the central- western portion of the Italian Peninsula, on the Tiber river. Rome's history spans over two and a half thousand years. It was the capital city of the Roman Kingdom, of the Roman Republic and of the Roman Empire, which was a major political and cultural influence in the lands bordering the Mediterranean Sea. Since the 2nd century AD, Rome has been the seat of the Papacy and, after the end of the Byzantine domination, in the eighth century it became the capital of the Papal States. In 1871, Rome became the capital of the Kingdom of Italy, and in 1946 that of the Italian Republic. Rome's influence on western Civilisation can hardly be overstated, and the city is still recognised as a centre of the arts and education. Due to this centrality on many levels, and much of the city's past power and influence, Rome has been nicknamed "Caput Mundi" (Latin for "Capital of the World") and "The Eternal City". -- ORGANIZERS -- The event is organized in Sapienza Universit? di Roma. Sapienza has a very long and prestigious history, it is the largest university in Europe and the second-largest in the world, with more than 150,000 students. * General chair: Daniele Gorla * Conferences Chair: Francesco Parisi Presicce * Workshops Chairs: Paolo Bottoni and Pietro Cenciarelli * Publicity Chair: Ivano Salvo * Finance Chairs: Enrico Tronci and Federico Mari * Web Site Chair: Igor Melatti -- FURTHER INFORMATION -- You can contact the organizers at etaps13 at di.uniroma1.it. From icfp.publicity at googlemail.com Fri Feb 8 14:07:52 2013 From: icfp.publicity at googlemail.com (David Van Horn) Date: Fri, 8 Feb 2013 14:07:52 -0500 Subject: [TYPES/announce] ICFP 2013: Call for papers Message-ID: ===================================================================== 18th ACM SIGPLAN International Conference on Functional Programming ICFP 2013 Boston, MA, USA, 25-27 September 2013 http://www.icfpconference.org/icfp2013 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Thursday, 28 March 2013 23:59 UTC-11 (Pago Pago, American Samoa, time) Author response: Wednesday, 22 May 0:00 UTC-11 Friday, 24 May 2013 23:59 UTC-11 Notification: Friday, 7 June 2013 Final copy due: Friday, 5 July 2013 Scope ~~~~~ ICFP 2013 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. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * 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; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * 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: teaching introductory programming; parallel programming; mathematical proof; algebra * 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 If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Thursday, 28 March 2013, 23:59 UTC-11 (American Samoa time), submit a full paper of at most 12 pages (6 pages 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.sigplan.org/Resources/Policies/Republication * 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 reviewer 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. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. 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:http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web athttps://www.easychair.org/conferences/?conf=icfp2013 . 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 72-hour period, starting at 0:00 UTC-11 on Wednesday, 22 May 2013, 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 2013. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. General Chair: Greg Morrisett, Harvard University Program Chair: Tarmo Uustalu, Institute of Cybernetics, Tallinn Program Committee: Thorsten Altenkirch, University of Nottingham Olaf Chitil, University of Kent Silvia Ghilezan, University of Novi Sad Michael Hanus, Christian-Albrechts-Universit?t zu Kiel Fritz Henglein, University of Copenhagen Mauro Jaskelioff, Universidad Nacional de Rosario Alan Jeffrey, Alcatel-Lucent Bell Labs Shin-ya Katsumata, Kyoto University Shriram Krishnamurthi, Brown University John Launchbury, Galois Ryan Newton, Indiana University Sungwoo Park, Pohang University of Science and Technology Sam Staton, University of Cambridge Nikhil Swamy, Microsoft Research, Redmond, WA Dimitrios Vytiniotis, Microsoft Research, Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From ardubois at gmail.com Sat Feb 9 09:46:44 2013 From: ardubois at gmail.com (Andre Rauber Du Bois) Date: Sat, 9 Feb 2013 12:46:44 -0200 Subject: [TYPES/announce] 1st CFP SBLP 2013 (17th Brazilian Symposium on Programming Languages) Message-ID: [Apologies if you receive multiple copies of this CFP] ======================================================= CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Bras?lia, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.cic.unb.br/sblp ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): April 19th Full paper submission: April 26th, 2013 Notification of acceptance: May 31st, 2013 Final papers due: June 28th, 2013 INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Bras?lia, Brazil, on September 29th to October 4th, 2013. 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 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013, http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 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. * 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 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. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer (pending approval). For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system at http://www.easychair.org/conferences/?conf=sblp2013. 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 from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonif?cio, UnB Diego Aranha, UnB PROGRAMME CHAIRS Andr? Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS Andr? Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quint?o Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho Jo?o F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel Ant?nio Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu From Jeremy.Gibbons at cs.ox.ac.uk Mon Feb 11 12:59:52 2013 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Mon, 11 Feb 2013 17:59:52 +0000 Subject: [TYPES/announce] Foundations of Health Information Engineering and Systems (FHIES 2013) - call for papers Message-ID: <201302111759.r1BHxqoN019854@linux1.cs.ox.ac.uk> CALL FOR PAPERS Third International Symposium on Foundations of Health Information Engineering and Systems http://www.cs.ox.ac.uk/FHIES2013/ International Institute for Software Technology United Nations University, Macau 21st-23rd August, 2013 BACKGROUND ICT plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world. The use of software in medical devices has caused growing concerns in relation to safety and efficacy. The increasing adoption of health information systems provides great potential benefits but also poses severe risks, both with respect to security and privacy and in regard to patient safety. Hospital and other information systems raise important issues of workflow support and interoperability. Regulators, manufacturers and clinical users have pointed out the need to research sound and science-based engineering methods that facilitate the development and certification of quality ICT systems in health care. Such methods may draw from or combine techniques from various disciplines, including but not limited to software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. AIMS The purpose of the symposium series on Foundations of Health Information Engineering and Systems is to promote a nascent research area that aims to develop and apply theories and methods from a variety of disciplines for the purpose of modeling, building and certifying software-intensive ICT systems in healthcare. A particular objective of FHIES is to explicitly include a focus on healthcare ICT applications in the developing world (in addition to systems used in the developed countries), since unique engineering challenges arise in that special setting. Because humans often play a pivotal role in the process of using such systems, theories from the human factors engineering community may need to be integrated with methods from the technology-oriented domains in order to create effective engineering methodologies for socio-technical systems in the healthcare domain. Previous FHIES symposia were held in 2011, in Mabalingwe, South Africa (with post-conference proceedings in Springer LNCS 7151, and in 2012, in Paris, France (with post-conference proceedings to appear in Springer LNCS). SCOPE FHIES seeks contributions from both the solution domain (engineering methods) and the problem domain (healthcare and health informatics). Solution-domain papers should present their methods in the context of a concrete application in healthcare, while problem-domain papers should be devised to educate the methods community about unique challenges and characteristics of the healthcare domain. Submissions should seek to inform and further the development, adaptation, evaluation and adoption of formally based and rigorous engineering methods in health care systems. Topics of interest include but are not limited to: * modelling, analysis, simulation and verification in health informatics; * design and verification techniques for software-based ICT and software-intensive medical devices; * application and integration of foundational methods from different disciplines in engineering and science to health informatics; * specific engineering challenges of ICT-based health service delivery in different settings, especially in the developing world. For a more detailed list of topics, see the symposium website. CATEGORIES We solicit high quality full submissions in the following categories: * original research contributions (16 pages max) * application experience, case studies and software prototypes (16 pages max.) * surveys, comparisons, and state-of-the-art reports (16 pages max.) * position papers identifying challenges and milestones of a research project (8 pages max.) We also invite short submissions for special sessions: * student papers on work in progress on an MSc or PhD project (4 pages max.) * tool demonstrations (2 pages max.) * proposals to organize birds-of-a-feather sessions or panels (2 pages max.) SUBMISSIONS Submissions should be in English, prepared in the LNCS format (http://www.springer.de/comp/lncs/authors.html), and all page limits are measured in this format. Full submissions (those in the first four categories above) will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the symposium; student papers will be judged on clarity of description and the promise of interesting results; tool demonstrations and BOF proposals will be judged on relevance to the symposium. All papers will be peer-reviewed by at least three program committee members. Papers should be submitted via EasyChair, at http://www.easychair.org/conferences/?conf=fhies2013 Submission constitutes a commitment for at least one author to attend the symposium and present the paper, if it is accepted. PUBLICATION All accepted submissions will be distributed in a technical report at the Symposium. After the event, postproceedings will be published in Springer LNCS. Authors of all accepted full submissions will be invited to revise their papers, in order to resolve any larger issues raised during reviewing. Authors of accepted short submissions will be invited to submit full papers for review and LNCS publication too. In addition, a special issue of a suitable journal is planned, focusing on the overall objectives of FHIES: this will have an open call for contributions. IMPORTANT DATES Intention to submit: April 29th Submission deadline: May 6th Notification of acceptance: June 12th Delivery of preproceedings version: July 17th Symposium: August 21st-23rd Submission for postproceedings review: October 4th Notification of acceptance: October 11th Camera ready version: October 18th Publication of proceedings: December 23rd ORGANIZERS General chairs: * Zhiming Liu, United Nations University, MO * Jens Weber, University of Victoria, CA Programme chairs: * Jeremy Gibbons, University of Oxford, UK * Wendy MacCaull, St. Francis Xavier University, CA For the Programme Committee, see the website. From et52 at mcs.le.ac.uk Tue Feb 12 00:06:46 2013 From: et52 at mcs.le.ac.uk (Emilio Tuosto) Date: Tue, 12 Feb 2013 05:06:46 +0000 Subject: [TYPES/announce] WS-FM 2013: First Call for Papers Message-ID: <93C80237-DA04-47C7-9E51-819E43012475@mcs.le.ac.uk> Apologies for cross-posting ============================================================== 10th International Workshop on Web Services and Formal Methods (WS-FM 2013): Formal Aspects of Service-Oriented and Cloud Computing August 29-30, 2013 Beijing, China http://www.cs.le.ac.uk/events/wsfm2013.html Important Dates: -------------------------------------------------------------- Abstract Submission: May 17, 2013 Paper Submission: May 24, 2013 Author Notification: July 10, 2013 Camera-ready copy: July 24, 2013 ============================================================== Service-Oriented Computing (SOC) provides standard mechanisms and protocols for describing, locating and invoking services over the Internet. The many existing SOC infrastructures that support specification of service interfaces, access policies, behaviors and compositions are paralleled by several active research areas such as the support and management of interactions with stateful and long-running services, large farms of services, and quality of service delivery. Cloud computing provides a new paradigm of distributed computation based on virtualization. Such paradigm promotes abstractions centred on services (Software as a Service, Platform as a Service, Infrastructure as a Service) and envisages novel distributed middlewares for service delivery. Cloud computing enables the development of services amenable to be configured according to clients' requirements and/or service level guarantee mechanisms. The convergence of SOC and cloud computing is accelerating the adoption of technologies from both areas, making the service dependability and trustworthiness a crucial and urgent problem. In this context, formal methods can play a fundamental role. They can help us to define unambiguous semantics for the languages and protocols that underpin existing Web service infrastructures, and provide a basis for checking the conformance and compliance of bundled services. They can also empower dynamic discovery and binding with compatibility checks against behavioral properties and quality of service requirements. Formal analysis of security properties and performance is essential in cloud computing and in application areas including e-science, e-commerce, workflow, business process management, etc. Moreover, the challenges raised by this new area can offer opportunities for extending the state of the art in formal techniques. The aim of the WS-FM workshop series is to bring together researchers and practitioners interested in SOC, cloud computing, and formal methods in order to catalyze fruitful collaboration. The scope of the workshop is not only limited to technological aspects. In fact, the WS-FM series has a strong tradition of attracting submissions on formal approaches to enterprise systems modeling in general, and business process modeling in particular. Potentially, this could have a significant impact on the ongoing standardization efforts for SOC and cloud computing technologies. WS-FM 2013 will be held in Beijing Xijiao Hotel on August 29-30, 2013. It will be co-located with the 11th International Conference on Business Process Management (BPM 2013) http://bpm2013.tsinghua.edu.cn/. TOPICS OF INTEREST Main topics of interest include (but are not limited to): ? Formal foundations of services and clouds ? Security, trust, QoS, dependability, and privacy in services and clouds ? Contracts, types, and logics in services and clouds ? Coordination and transactions for services and clouds ? Multi-tenancy, adaptability and evolvability in the cloud ? Verification, analysis, and testing of services/clouds ? Innovative application scenarios for services/clouds ? Standards and technologies for service-oriented and cloud computing ? Ontologies and semantic descriptions for services and clouds ? Semi-structured data management and XML technology ? Services and clouds for business process management ? Enterprise modeling and business process modeling ? Data services and data-centric process modeling ? Case studies on formal methods in service-oriented and cloud applications ? Case studies on formal methods in business process management SUBMISSION GUIDELINES Submissions must be original and should not have been published previously nor be under consideration for publication while being evaluated for this workshop. All papers must be submitted at the following submission site, handled by EasyChair, https://www.easychair.org/conferences/?conf=wsfm2013 using the Springer LNCS style. Papers should not exceed 15 pages in length. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. We expect to publish the post-workshop proceedings shortly after the workshop as a volume in Springer's Lecture Notes in Computer Science (LNCS). PROGRAM COMMITTEE Marco Aldinucci, University of Turin, Italy Massimo Bartoletti, University of Cagliari, Italy Laura Bocchi, University of Leicester, United Kingdom Mario Bravetti, University of Bologna, Italy Marlon Dumas, University of Tartu, Estonia Schahram Dustdar, TU Wien, Austria Jos? Luiz Fiadeiro, Royal Holloway (UoL), United Kingdom Roberto Guanciale, School of Computer Science and Communication, KTH, Sweden Thomas Hildebrandt, IT University of Copenhagen, Denmark Alberto Lluch-Lafuente, IMT, Lucca, Italy Niels Lohmann, Universit?t Rostock, Germany Hernan Melgratti, University of Buenos Aires, Argentina Chun Ouyang (co-chair), Queensland University of Technology, Australia Antonio Ravara, Faculdade de Ci?ncias e Tecnologia, Portugal Jianwen Su, University of California at Santa Barbara, USA Maurice ter Beek, Istituto di Scienza e Tecnologie dell'Informazione - CNR, Pisa, IT Emilio Tuosto (co-chair), University of Leicester, United Kingdom Wil van der Aalst, Eindhoven Univ. of Technology, The Netherlands Hugo Vieira, University of Lisbon, Portugal Karsten Wolf, Universit?t Rostock, Rostock, Germany Gianluigi Zavattaro, University of Bologna, Italy STEERING COMMITTEE Wil van der Aalst, Eindhoven Univ. of Technology, The Netherlands Mario Bravetti, University of Bologna, Italy Marlon Dumas, University of Tartu, Estonia Jos? Luiz Fiadeiro, University of Leicester, UK Gianluigi Zavattaro, University of Bologna, Italy eM *************************************************************** 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 *************************************************************** From michele at dsi.unive.it Tue Feb 12 06:27:51 2013 From: michele at dsi.unive.it (Bugliesi Michele) Date: Tue, 12 Feb 2013 12:27:51 +0100 Subject: [TYPES/announce] Postdoctoral Research Fellowship Message-ID: <511A2737.2040100@dsi.unive.it> An HTML attachment was scrubbed... URL: From ronchi at di.unito.it Tue Feb 12 09:18:12 2013 From: ronchi at di.unito.it (Ronchi Della Rocca Simona) Date: Tue, 12 Feb 2013 15:18:12 +0100 Subject: [TYPES/announce] CSL 2013 first call-for-papers Message-ID: ______________________________________________________________________________________________ CSL 2013 COMPUTER SCIENCE LOGIC 2013 Torino, September 2-5 2013 http://csl13.di.unito.it/ first call-for-papers _______________________________________________________________________________________________ AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. LOCATION The 22nd EACSL Annual Conference on Computer Science Logic will be held at Museo di Scienze Naturali in Torino from Monday 2nd through Thursday 5th of September 2013. LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE) automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, game semantics, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, computational proof theory, bounded arithmetic and propositional proof complexity, logic programming and constraints, lambda calculus and combinatory logic, domain theory, categorical logic and topological semantics, database theory, specification, extraction and transformation of programs, logical aspects of quantum computing, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, non-monotonic reasoning. INVITED SPEAKERS Nachum Dershovitz (Tel Aviv) Jean Yves Girard (Marseille) Isabel Oitavem (Lisboa) Lidia Tendera (Opole) PierGiorgio Odifreddi (Torino) welcome talk IMPORTANT DATES Abstract submission: April, 1st 2013 Paper Submission: April, 8th 2013 Paper Notification: June, 10th 2013 Paper final version: July, 1st 2013 Conference: September, 2nd --- 5th 2013 SUBMISSION Authors are invited to submit papers of not more than 15 pages in LIPIcs style presenting work not previously published. Papers are to be submitted through Easychair, at the address: https://www.easychair.org/conferences/?conf=csl2013. Submitted papers must be in English and must provide sufficient detail to allow the PC to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the program committee. The submission is in two stages. Abstract submissions are due before April 1st, 2013. Full paper submissions must be done before April 8th, 2013. Papers must not be submitted concurrently to another conference with refereed proceedings. The PC chair should be informed of closely related work submitted to a conference or a journal by March 24th, 2013. Papers authored or co-authored by members of the Programme Committee are not allowed. SATELLITE EVENTS - Ackermann Award 2013, for PhD dissertations in topics specified by EACSL and LICS conferences. - International summer school on ?Linear logic and related topics? (August 28 - 31). - 14th International Workshop on Logic and Computational Complexity (LCC'13) (September 6). - 9th International Workshop on Fixed Points in Computer Science (FICS'13) (September 1). PROGRAM COMMITTEE Zena Ariola (University of Oregon) Arnon Avron (Tel-Aviv University) Roberto Bagnara (University of Parma, and BUGSENG srl) Christel Baier (Technical University of Dresden) Marc Bezem (University of Bergen) Paola Bruscoli (University of Bath, Computer Science Department) Agata Ciabattoni (TU Wien) Thierry Coquand (Chalmers University) Ugo Dal Lago (Universit? di Bologna) Valeria De Paiva (Nuance Communications) Reinhard Kahle (CENTRIA and DM, UNL, Portugal) Stephan Kreutzer (Technical University Berlin) Olivier Laurent (CNRS - ENS Lyon) Carsten Lutz (Universit?t Bremen) Jean-Yves Marion (Universit? de Lorraine, LORIA) Damian Niwinski (Warsaw University) Frank Pfenning (Carnegie Mellon University) Elaine Pimentel (UFMG) Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS)) Simona Ronchi Della Rocca CHAIR (Universit? di Torino) Jan Rutten (CWI) Helmut Schwichtenberg (LMU Munich) Phil Scott (Dept. of Math & Stats, U. Ottawa) Peter Selinger (Dalhousie University) Makoto Tatsuta (National Institute of Informatics) Tachio Terauchi (Nagoya University) ORGANIZING COMMITTEE Erika De Benedetti (Dipartimento di Informatica, Torino) Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica (DISIT), Alessandria) Mauro Piccolo (Dipartimento di Informatica, Torino) Luca Padovani (Dipartimento di Informatica, Torino) Luca Paolini (Dipartimento di Informatica, Torino) Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino) Luca Roversi (Dipartimento di Informatica, Torino) Angelo Troina (Dipartimento di Informatica, Torino) _____________________ 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: From jared at cs.utexas.edu Tue Feb 12 21:07:33 2013 From: jared at cs.utexas.edu (Jared C. Davis) Date: Tue, 12 Feb 2013 20:07:33 -0600 Subject: [TYPES/announce] ACL2 2013 - Last Call For Papers - Extended Deadline Message-ID: ACL2 2013 International Workshop on the ACL2 Theorem Prover and its Applications May 30-31, 2013 in Laramie, Wyoming, USA http://www.cs.uwyo.edu/~ruben/acl2-13 LAST CALL FOR PAPERS -- EXTENDED DEADLINE IMPORTANT DATES Abstract submission (extended): February 22, 2013 Paper submission (extended): February 22, 2013 Acceptance Notification: March 15, 2013 Final Version Due: April 15, 2013 WORKSHOP SCOPE ACL2 2013 is the major technical forum for users of the ACL2 theorem proving system to present research related to the ACL2 theorem prover and its applications. ACL2 2013 is the eleventh in the series of ACL2 workshops, which occur approximately every 18 months. ACL2 is an industrial-strength automated reasoning system, the latest in the Boyer-Moore family of theorem provers. The 2005 ACM Software System Award was awarded to Boyer, Kaufmann, and Moore for their work in ACL2 and the other theorem provers in the Boyer-Moore family. ACL2 2013 is a two-day workshop to be held in Laramie, WY, USA on May 30-31, 2013. The workshop will feature technical papers, invited talks, and rump sessions discussing ongoing research. We invite submissions of papers on any topic related to ACL2 and its applications, and we strongly encourage submissions related to other theorem provers or formal methods that are of interest to the ACL2 community. Suggested topics include but are not limited to the following: * software or hardware verification with ACL2, * formalizations of mathematics in ACL2, * new libraries, tools, and interfaces for ACL2, * novel uses of ACL2, * experiences with ACL2 in the classroom, * reports of and proposals for improvements of ACL2, * comparisons with other theorem provers, * comparisons with other programming or specification languages, * challenge problems and their solutions, * foundational issues related to ACL2, and * implementations connecting ACL2 with other systems. PAPER SUBMISSIONS Submissions must be made electronically in PDF format, as directed in the ACL2 2013 website. Submissions should be prepared in the EPTCS templates, available from http://style.eptcs.org. The ACL2 Workshop accepts both long papers (up to sixteen pages) and extended abstracts (up to two pages). Both categories of papers will be fully refereed, but only long papers will be included in the final workshop proceedings. At least one author of each accepted papers must register for the workshop and give a presentation summarizing the paper's results. Authors of long papers will have more time to present their work at the workshop. One of the main advantages of the ACL2 Workshop is that attendees are already knowledgeable about ACL2, its syntax, its basic commands, and the art of writing models in it. So authors may assume that readers have this familiarity. The workshop proceedings will be published as a volume of Electronic Proceedings in Theoretical Computer Science (EPTCS). Many papers presented at the workshop will describe interactions with the theorem prover. We strongly encourage authors of such papers to provide ACL2 script files (aka "books") along with instructions for using these books in ACL2. Such supporting materials should follow the guidelines at http://www.cs.utexas.edu/users/moore/acl2/books/index.html. For accepted papers, we will ask authors to make these books available by adding them to the ACL2 books repository. The workshop will also feature ``rump sessions'', in which participants can describe ongoing research related to ACL2. Proposals for rump session presentations, including a title and short abstract, will be accepted until the workshop. ORGANIZATION Chairs * Ruben Gamboa, University of Wyoming, USA * Jared Davis, Centaur, USA Program Committee * Carl Eastlund, Northeastern University, USA * David Greve, Rockwell Collins, USA * Warren Hunt, University of Texas, USA * Matt Kaufmann, University of Texas, USA * Hanbing Liu, AMD, USA * Panagiotis Manolios, Northeastern University, USA * Magnus Myreen, University of Cambridge, UK * David Rager, Battelle Memorial Institute, USA * Sandip Ray, Intel, USA * Jose Luis Ruiz Reina, University of Seville, Spain * David Russinoff, Intel, USA * Jun Sawada, IBM, USA * Julien Schmaltz, Open University of the Netherlands, The Netherlands * Konrad Slind, Rockwell Collins, USA * Sol Swords, Centaur, USA * Laurent Thery, INRIA, France From ronchi at di.unito.it Wed Feb 13 04:30:36 2013 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Wed, 13 Feb 2013 10:30:36 +0100 Subject: [TYPES/announce] DICE 2013 - call-for partcipation Message-ID: ???????????????????????????????? DICE 2013 ?????????????????????????????????? (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL COMPLEXITY) http://dice2013.di.unito.it/ Roma, March 16,17 2013 satellite event of ETAPS 2013 call for participation IMPORTANT DATES: submission: January 10, 2013 notification: January 25, 2013 final version due: February 14, 2013 INVITED: ? Jean-Yves Marion (Loria - INPL Nancy) ? Marko van Eekelen (Open University - Radboud University Nijmegen) ? Paul-Andr? Melli?s (PPS, Paris) SCOPE: 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). POST-PROCEEDINGS: An open call for post-proceedings, as special issue of INFORMATION & COMPUTATION will follow. PROGRAM COMMITTEE: ? Roberto Amadio (Paris-Diderot) ? Harry Mairson (Brandeis) ? Virgile Mogbil (Paris 13) ? Simona Ronchi Della Rocca (Torino) (Chair) ? Luca Roversi (Torino) ? Olha Shkaravska (Nijmegen) ? Ulrich Sch?pp (LMU) ? Aleksy Shubert (Warsaw) ? Jakob G. Simonsen (DIKU) STEERING COMMITTEE: ? Patrick Baillot (ENS Lyon, CNRS) ? Ugo Dal Lago (Universit? degli Studi di Bologna) ? Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) ? Jean-Yves Marion (Loria - INPL Nancy) ? Simona Ronchi Della Rocca (Universit? degli Studi di Torino)) ---------------------------------------- Simona Ronchi Della Rocca full Professor of "Foundations of Computer Science" Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : ronchi at di.unito.it phone: +39-011-6706734 fax : +39-011-751603 mobile: +39-320-4205121 http://www.di.unito.it/~ronchi -------------- next part -------------- An HTML attachment was scrubbed... URL: From deligu at di.unito.it Wed Feb 13 12:12:25 2013 From: deligu at di.unito.it (Ugo de' Liguoro) Date: Wed, 13 Feb 2013 18:12:25 +0100 Subject: [TYPES/announce] Control Operators and their Semantics (COS'13) - Second Call for Papers Message-ID: <511BC979.1070402@di.unito.it> ============================================================================ Control Operators and their Semantics (COS'13) - Call for Papers Satellite event of RDP'13 June 24 - 25, 2013, Eindhoven, The Nederlands http://cos2013.di.unito.it/ ============================================================================ Modern programming languages provide sophisticated control mechanisms, commonly referred to as control operators which are widely used to realize a variety of applications. Since we cannot escape control features, it becomes a challenge to provide them with sound reasoning principles. There is a very active research on understanding, manipulating, representing, and reasoning about elaborated non-local control structures, in particular in declarative programming languages such as functional and logic languages. Ideas and results originating from this research area have impact in many other areas of computer science, like distributed and concurrent systems, proof theory, proof mining, web programming and linguistics. For instance, the study of the logical foundations of control operators renewed the study of the connections between proofs and programs via the so-called Curry-Howard correspondence, providing new methods to extract the computational content of classical proofs. The focus of the workshop is on the interplay between syntax and semantics, namely the central question of what a program means and how it does define the intended procedure. This is a crucial issue especially in the case of control operators, since they are as powerful as potentially obscure, and programs that use them are usually more error prone than purely declarative ones. The issue of a better understanding of control is also relevant for communicating across different research areas and communities. More abstract views can be achieved via several means, that include operational semantics of formal calculi, abstract machines, algebraic specifications and rewriting, type assignment systems, denotational semantics and game semantics, category theory and logic, to say the least. Relevant topics include, but are not limited to: - continuations and delimited continuations - categorical models of continuations - compositionality and modularity of control operators - denotational semantics of control, event structures and causality - operational semantics and abstract machines - type systems for control operators - game semantics of programming languages and of logical proofs - usage of control operators in proof search and proof mining - semantics of control operators in logic programming Invited speakers: - Mattew Flatt (Univeristy of Utah) - Thomas Streicher (Universitaet Darmstadt) Program Committee: Zena Ariola University of Oregon Stefano Berardi Turin University Hugo Herbelin INRIA and Laboratoire PPS (Paris 7) Ugo de'Liguoro (chair) Turin Univerisity Ken-etsu Fujita Gunma University Koji Nakazawa Kyoto University Alexis Saurin (co-chair) INRIA and Laboratoire PPS (Paris 7) Submission: authors of original works on the topic of the workshop are invited to submit either a FULL PAPER of up to 20 pages, which has to be unpublished nor submitted elsewhere, or an EXTENDED ABSTRACT of up to 5 pages (to which previous restrictions do not apply) for short presentation at the workshop. Only accepted full papers will appear in the proceedings; the PC might decide, on the ground of referees reports, that a full paper submission is accepted as extended abstract instead. Submission consists of a LaTex generated pdf file, prepared using EPTCS macro package, available from: http://info.eptcs.org/ Authors of extended abstracts must add: "Extended Abstract" to the title. The PC Submissions are via EasyChair COS2013 site: https://www.easychair.org/conferences/?conf=cos2013 To make reviewing faster we ask title and (short) abstract within March the 24th. The deadline for the pdf text is April the 6th. Important Dates: Abstract: March, 24 2013 Submission: April, 6 2013 Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 Contact: Ugo de'Liguoro Dipartimento di Informatica, Universita' di Torino, Corso Svizzera 185, 10149 Torino, Italy email: deliguoro at di.unito.it Web sites: COS'13: http://cos2013.di.unito.it RTD'13: http://www.win.tue.nl/rdp2013/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From kvenabl at tulane.edu Wed Feb 13 12:21:39 2013 From: kvenabl at tulane.edu (Brent Venable) Date: Wed, 13 Feb 2013 12:21:39 -0500 Subject: [TYPES/announce] TIME 2013 - International Symposium on Temporal Representation and Reasoning In-Reply-To: References: Message-ID: * * *26 - 28 September, Pensacola, FL, USA* ** *20th International Symposium on Temporal Representation and Reasoning* http://software.imdea.org/time13/ (TIME 13) aims to bring together researchers from distinct research areas involving the management of temporal data as well as the reasoning about temporal aspects of information. This unique and well-established event (see http://time.dico.unimi.it) has as its objectives to bridge theoretical and applied research, as well as to serve as an interdisciplinary forum for exchange among researchers from the areas of artificial intelligence, database management, logic and verification, and beyond. *Important Dates* Abstract submission: 27 April 2013 Paper submission: 30 April 2013 Paper Notification: 29 May 2013 Final version due: 12 June 2013 Early Registration: until 16 June 2013 Registration: 22 June - 26 August 2013 Late Registration: from 26 August 2013 TIME Symposium: 26-28 September 2011 *Submissions* Submissions of high quality papers describing research results or on-going work are solicited. Submitted papers should contain original, previously unpublished content, should be written in English, and must not be simultaneously submitted for publication elsewhere. Submitted papers will be refereed by at least three reviewers for quality, correctness, originality, and relevance. Accepted papers will be presented at the symposium and included in the proceedings, which will be published by the Conference Publishing Services (CPS). Acceptance of a paper is contingent on one author presenting the paper at the symposium. Submissions should be in PDF format (with the necessary fonts embedded). They must be formatted according to the IEEE guidelines and must not exceed 8 pages; over-length submissions may be rejected without review. Papers should be submitted electronically via the EasyChair system at: https://www.easychair.org/conferences/?conf=time13 *Topics* The symposium will encompass: - three tracks on AI, Databases, Logic and Verification and - an additional special track on Temporal Data Mining, OLAP and Data Warehouses *Temporal Representation and Reasoning* in AI includes, but is not limited to: temporal aspects of agent- and policy-based systems spatial and temporal reasoning reasoning about actions and change planning and planning languages ontologies of time and space-time belief and uncertainty in temporal knowledge temporal learning and discovery time in problem solving (e.g. diagnosis, scheduling) time in human-machine interaction temporal information extraction time in natural language processing spatio-temporal knowledge representation systems spatio-temporal ontologies for the semantic web constraint-based temporal reasoning temporal preferences *Temporal Database Management* includes, but is not limited to: temporal data models and query languages temporal query processing and indexing temporal data mining time series data management stream data management spatio-temporal data management, including moving objects data currency and expiration indeterminate and imprecise temporal data temporal constraints temporal aspects of workflow and ECA systems real-time databases time-dependent security policies privacy in temporal and spatio-temporal data temporal aspects of multimedia databases temporal aspects of e-services and web applications temporal aspects of distributed systems novel applications of temporal database management experiences with real applications *Temporal Logic and Verification in Computer Science* includes, but is not limited to: specification and verification of systems verification of web applications synthesis and execution model checking algorithms verification of infinite-state systems reasoning about transition systems temporal architectures temporal logics for distributed systems temporal logics of knowledge hybrid systems and real-time logics tools and practical systems temporal issues in security *Special Track On Temporal Data Mining, OLAP And Data Warehouses* This year, TIME has an additional special track on Temporal Data Mining, OLAP, and Data Warehouses and organized by Carlo Combi. Submissions for the special track will be primarily managed by him, though the final decision on acceptance will be taken by the whole PC. Exploring and mining huge amounts of time-oriented data is an acknowledged need in several domains; Such a need poses several challenges calling theoretical and practical research. Several research topics underly the study of solutions allowing users to explore and mine time oriented data: from the modeling of multidimensional temporal data, to the efficient storage and retrieval of time-series and temporal data, to the definition of algorithms for data mining, and so on. Moreover, several application domains could benefit from advancements of such kind of research: among them, it is worth to mention here medicine, huge amounts of time-oriented data are daily produced and need to be analyzed/mined to improve the overall quality of healthcare processes. High quality contributions for the special track are welcome in, but are not limited to, any of the following sub-areas of research: - Temporal data warehouses - Modeling and querying multidimensional temporal data - Conceptual modeling of multidimensional temporal data and processes -Indexing temporal and spatio-temporal data warehouses - Summarization of time-oriented data - Mining algorithms for temporal data - Temporal association rules - Temporal OLAP - ETL and temporal data - Reconciled temporal databases - Merging multiple and heterogeneous time-oriented databases - Design and implementation of temporal OLAP systems - Process mining and exploration - Temporal data mining in medicine - Temporal healthcare data warehouses - Time series analysis and mining - Temporal pattern discovery - Visual OLAP for temporal data - Semistructured temporal data warehouses *Symposium Chairs:* Cesar Sanchez, IMDEA Software Institute and CSIC, Spain K. Brent Venable, Tulane University and IHMC, USA Esteban Zimanyi, Universite Libre de Bruxelles, Belgium -------------- next part -------------- An HTML attachment was scrubbed... URL: From serge.autexier at dfki.de Thu Feb 14 03:55:42 2013 From: serge.autexier at dfki.de (Serge Autexier) Date: Thu, 14 Feb 2013 09:55:42 +0100 (CET) Subject: [TYPES/announce] Second Call For Papers: Conf. Intelligent Computer Mathematics (CICM 2013), July 8-12, 2013, Bath, UK Message-ID: <20130214085542.A3A8013EB8D1@mbp-autexier.informatik.uni-bremen.de> CICM 2013 - Conferences on Intelligent Computer Mathematics July 8-12, 2013 at University of Bath, Bath, UK http://www.cicm-conference.org/2013/cicm.php 2nd Call for Papers ---------------------------------------------------------------------- * Invited Talks by Patrick Ion (Mathematical Reviews, American Mathematical Society, USA) Assia Mahboubi (?cole Polytechnique and INRIA/Microsoft Research Joint Centre, France) Ursula Martin (Queen Mary, University of London, UK) * Co-Located Workshops: - MathUI'13: Mathematical User Interfaces - OpenMath Workshop 2013 - PLMMS'13: Programming Languages for Mechanized Mathematics Systems - THedu'13: TP Components for Educational Software ---------------------------------------------------------------------- As computers and communications technology advance, greater opportunities arise for intelligent mathematical computation. While computer algebra, automated deduction, mathematical publishing and novel user interfaces individually have long and successful histories, we are now seeing increasing opportunities for synergy among these areas. The Conferences on Intelligent Computer Mathematics offers a venue for discussing these areas and their synergy. The conference will take place at the University of Bath (www.bath.ac.uk), with James Davenport as the local organiser. It consists of four tracks: Calculemus Chair: Wolfgang Windsteiger Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: David Aspinall Systems and Projects Chair: Christoph Lange As in previous years, there will be a Doctoral Programme for presentations by Doctoral students. The overall programme will be organised by the General Program Chair Jacques Carette. ---------------------------------------------------------------------- Important dates ---------------------------------------------------------------------- Abstract submission: 1 March 2013 Submission deadline: 8 March 2013 Reviews sent to authors: 5 April 2013 Rebuttals due: 8 April 2013 Notification of acceptance: 14 April 2013 Camera ready copies due: 26 April 2013 Conference: 8-12 July 2013 ---------------------------------------------------------------------- Tracks ---------------------------------------------------------------------- ========== Calculemus ========== Calculemus 2013 invites the submission of original research contributions to be considered for publication and presentation at the conference. Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning like interactive proof assistants (PA) or 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 mathematical assistant systems that will be used routinely by mathematicians, computer scientists and all others who need computer-supported mathematics in their every day business. All topics in the intersection of computer algebra systems and automated reasoning systems are of interest for Calculemus. These include but are not limited to: * Automated theorem proving in computer algebra systems. * Computer algebra in theorem proving systems. * Adding reasoning capabilities to computer algebra systems. * Adding computational capabilities to theorem proving systems. * Theory, design and implementation of interdisciplinary systems for computer mathematics. * Case studies and applications that involve a mix of computation and reasoning. * Case studies in formalization of mathematical theories. * Representation of mathematics in computer algebra systems. * Theory exploration techniques. * Combining methods of symbolic computation and formal deduction. * Input languages, programming languages, types and constraint languages, and modeling languages for mathematical assistant systems. * Homotopy type theory. * Infrastructure for mathematical services. === DML === Mathematicians dream of a digital archive containing all peer-reviewed mathematical literature ever published, properly linked, validated and verified. It is estimated that the entire corpus of mathematical knowledge published over the centuries does not exceed 100,000,000 pages, an amount easily manageable by current information technologies. Track objective is to provide a forum for development of math-aware technologies, standards, algorithms and formats towards fulfillment of the dream of global digital mathematical library (DML). Computer scientists (D) and librarians of digital age (L) are especially welcome to join mathematicians (M) and discuss many aspects of DML preparation. Track topics are all topics of mathematical knowledge management and digital libraries applicable in the context of DML building -- processing of math knowledge expressed in scientific papers in natural languages, namely: * Math-aware text mining (math mining) and MSC classification * Math-aware representations of mathematical knowledge * Math-aware computational linguistics and corpora * Math-aware tools for [meta]data and fulltext processing * Math-aware OCR and document analysis * Math-aware information retrieval * Math-aware indexing and search * Authoring languages and tools * MathML, OpenMath, TeX and other mathematical content standards * Web interfaces for DML content * Mathematics on the web, math crawling and indexing * Math-aware document processing workflows * Archives of written mathematics * DML management, business models * DML rights handling, funding, sustainability * DML content acquisition, validation and curation === MKM === Mathematical Knowledge Management is an interdisciplinary field of research in the intersection of mathematics, computer science, library science, and scientific publishing. The objective of MKM is to develop new and better ways of managing sophisticated mathematical knowledge, based on innovative technology of computer science, the Internet, and intelligent knowledge processing. MKM is expected to serve mathematicians, scientists, and engineers who produce and use mathematical knowledge; educators and students who teach and learn mathematics; publishers who offer mathematical textbooks and disseminate new mathematical results; and librarians and mathematicians who catalog and organize mathematical knowledge. The conference is concerned with all aspects of mathematical knowledge management. A non-exclusive list of important topics includes: * Representations of mathematical knowledge * Authoring languages and tools * Repositories of formalized mathematics * Deduction systems * Mathematical digital libraries * Diagrammatic representations * Mathematical OCR * Mathematical search and retrieval * Math assistants, tutoring and assessment systems * 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 ==================== Systems and Projects ==================== The Systems and Projects track of the Conferences on Intelligent Computer Mathematics is a forum for presenting available systems and new and ongoing projects in all areas and topics related to the CICM conferences: * Deduction and Computer Algebra (Calculemus) * Digital Mathematical Libraries (DML) * Mathematical Knowledge Management (MKM) * Artificial Intelligence and Symbolic Computation (AISC) The track aims to provide an overview of the latest developments and trends within the CICM community as well as to exchange ideas between developers and introduce systems to an audience of potential users. ---------------------------------------------------------------------- Submission Instructions ---------------------------------------------------------------------- Submissions to the research tracks must not exceed 15 pages and will be reviewed and evaluated with respect 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. System descriptions and projects descriptions should be 2-4 pages and should present * newly developed systems, * systems that have not previously been presented to the CICM community, or * significant updates to existing systems. Systems must be available for download. Project presentations should describe * projects that are new or about to start, * ongoing projects that have not yet been presented to the CICM community. * significant new developments in ongoing previously presented projects. Presentations of new projects should mention relevant previous work and include a roadmap that outlines concrete steps. All submissions should contain links to demos, downloadable systems, or project websites. Accepted conference submissions from all tracks is intended to be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer. 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 offer authors of rejected formal submissions to publish their contributions as work-in-progress papers instead. Depending on the number of work-in-progress papers accepted, they will be presented at the conference either as short talks or as posters. The work-in-progress proceedings will be published as a technical report, as well as online with CEUR-WS.org. All papers should be prepared in LaTeX and formatted according to the requirements of 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. Electronic submission is done through easychair http://www.easychair.org/conferences/?conf=cicm2013 ---------------------------------------------------------------------- Programme Committee ---------------------------------------------------------------------- Akiko Aizawa, NII, The University of Tokyo, Japan Jesse Alama, CENTRIA, FCT, Universidade Nova de Lisboa, Portugal Rob Arthan, Queen Mary University of London, UK Andrea Asperti, University of Bologna, Italy David Aspinall, University of Edinburgh, UK Jeremy Avigad, Carnegie Mellon University, US Thierry Bouche, Universit? Joseph Fourier (Grenoble), France Jacques Carette, McMaster University, Canada John Charnley, Department of Computing, Imperial College London, UK Janka Chleb?kov?, School of Computing, University of Portsmouth, UK Simon Colton, Department of Computing, Imperial College, London, UK Leo Freitas, Newcastle University, UK Deyan Ginev, Jacobs University Bremen, Germany Gudmund Grov, Heriot-Watt University, Edinburgh, UK Thomas Hales, University of Pittsburgh, US Yannis Haralambous, T?l?com Bretagne, France J?nathan Heras, University of Dundee, UK Hoon Hong, North Carolina State University, US Predrag Jani?i?, University of Belgrade, Serbia Cezary Kaliszyk, University of Innsbruck, Austria Manfred Kerber, University of Birmingham, UK Adam Kilgarriff, Lexical Computing Ltd, UK Andrea Kohlhase, Jacobs University Bremen, Germany Michael Kohlhase, Jacobs University Bremen, Germany Temur Kutsia, RISC Institute, JKU Linz, Austria Christoph Lange, University of Birmingham, UK Paul Libbrecht, Martin Luther University Halle-Wittenberg, Germany Christoph L?th, DFKI Bremen, Germany Till Mossakowski, DFKI Bremen, Germany Magnus O. Myreen, University of Cambridge, UK Florian Rabe, Jacobs University Bremen, Germany Ji?? R?kosn?k, Institute of Mathematics, Academy of Sciences, Czech Republic Carsten Schuermann, IT University of Copenhagen, Denmark Petr Sojka, Masaryk University, Faculty of Informatics, Czech Republic Hendrik Tews, TU Dresden, Germany Frank Tompa, University of Waterloo, Canada Josef Urban, Radboud University, Netherlands Stephen Watt, University of Western Ontario, Canada Makarius Wenzel, Universit? Paris-Sud 11, France Wolfgang Windsteiger, RISC Institute, JKU Linz, Austria Richard Zanibbi, Rochester Institute of Technology, US -- Dr. Serge Autexier, serge.autexier at dfki.de, http://www.dfki.de/~serge/ Research Department Cyber-Physical Systems MZH, Room 3120 Phone: +49 421 218 59834 Bibliothekstr.1, D-28359 Bremen Fax: +49 421 218 98 59834 ---------------------------------------------------------------------- Deutsches Forschungszentrum fuer Kuenstliche Intelligenz GmbH principal office, *not* the address for mail etc.!!!: Trippstadter Str. 122, D-67663 Kaiserslautern management board: Prof. Wolfgang Wahlster (chair), Dr. Walter Olthoff supervisory board: Prof. Hans A. Aukes (chair) Amtsgericht Kaiserslautern, HRB 2313 ---------------------------------------------------------------------- From dpw at cs.princeton.edu Fri Feb 15 20:43:55 2013 From: dpw at cs.princeton.edu (David Walker) Date: Fri, 15 Feb 2013 20:43:55 -0500 (EST) Subject: [TYPES/announce] Postdoc Position at Princeton In-Reply-To: Message-ID: We invite applications for postdoctoral researchers at Princeton in the area of programming languages. The position is part of the Frenetic project (a collaboration between Princeton and Cornell), which seeks to develop new programming language technology for controlling, managing, verifying and securing networks (see the abstract below or visit http://frenetic-lang.org). Applicants should hold a PhD in Computer Science and have expertise in programming language design and semantics, a desire to work in an interdisciplinary team, strong implementation and communications skills, and an interest in learning new ideas outside their primary area of research. Some basic knowledge of networking is a plus but is not necessary -- a willingness and an enthusiasm to learn is all that is needed. Successful candidates will be provided with opportunities for professional development and for exploring ideas that expand the scope of the project. The positions are for one year initially but may be extended to additional years. To apply, please send a CV, research statement, and the names of two references to David Walker (dpw at cs.princeton.edu). Please also apply formally here: https://jobs.princeton.edu/applicants/jsp/shared/position/JobDetails_css.jsp?postingId=193793 We especially welcome applications from women and members of under-represented minority groups. David Walker Princeton University ---------------------------------------------------------------------- High-Level Language Support for Trustworthy Networks Computer networks are some of our most critical infrastructure, but today's networks are unreliable and insecure. Network devices run complicated programs written in obtuse, low-level programming languages, which makes managing networks a difficult and error-prone task. Simple mistakes can have disastrous consequences, including making the network vulnerable to denial-of-service attacks, hijackings, and outages. The goal of the Frenetic project is to transform the way that networks are built and used through research on: (i) network-wide, correct-by-construction programming abstractions; (ii) support for fault-tolerance and scalability; (iii) mechanisms for managing end-hosts; (iv) verification tools based on rigorous semantic foundations; and (v) compilers capable of generating efficient code for heterogeneous devices. From c.a.j.wingfield at bath.ac.uk Sat Feb 16 06:31:08 2013 From: c.a.j.wingfield at bath.ac.uk (Cai Wingfield) Date: Sat, 16 Feb 2013 11:31:08 +0000 Subject: [TYPES/announce] Workshop on Algebra, Coalgebra and Topology: 1 March in Bath References: <367C9EAD-570F-476B-B5CA-73837268B3A8@bath.ac.uk> Message-ID: ******************************************************************** Workshop on Algebra, Coalgebra and Topology (part of the Wessex Theory Seminar) University of Bath Friday 1 March 2013 ******************************************************************* The Technische Universitaet Dresden is one of the world's leading centres in clone theory. An abstract clone, with nullary operations, is a mild rephrasing of what category theorists call a Lawvere theory. They are also equivalent to finitary monads, but the equivalence with the latter is far more than mild rephrasing. The notions of abstract clone and Lawvere theory have been developed for several decades largely independently of each other. Much of the development of Lawvere theories has been done in the UK, in recent years primarily in association with the University of Cambridge. Duality has been studied for both, with notions such as coclone, comodel and coalgebra prominent. Both have interacted with computer science, and both have involved relationships with topology. Several of the key researchers in the two fields will meet for a workshop at the University of Bath on Friday 1 March. Sebastian Kerkhoff, Martin Schneider, Mike Behrisch and Cynthia Glodeanu will join us from Dresden, Martin Hyland will come from Cambridge, and Edmund Robinson will come from Queen Mary, University of London. Local researchers who will participate actively include Jim Laird, Guy McCusker, John Power and Cai Wingfield. We would like to invite others to participate too, and to offer talks. If you are interested in coming, perhaps also offering to give a talk, please contact Cai Wingfield (C.A.J.Wingfield at bath.ac.uk). VENUE: The meeting will be held in the (very pleasant) department lounge of the Department of Computer Science, East Building, University of Bath http://www.bath.ac.uk/about/gettinghere/maps/index.html. PROGRAMME: We will determine a programme based upon talks offered. We anticipate starting late morning and going until the end of the afternoon. REGISTRATION FEE: There is no registration fee, but the meeting will be held on a pay-your-own-everything basis. We will show you suitable places for morning and afternoon teas and for lunch, either sit-down or take-away. TRAVEL FUNDING: The workshop will be part of the Wessex Theory Seminar, so there is a (very) small amount of travel funding available to those people working at Wessex sites https://wiki.bath.ac.uk/display/wessex/Wessex+Theory+Seminar. If you would like to apply for it, please email Guy McCusker (G.A.McCuskker at bath.ac.uk). ACCOMMODATION: Few people are likely to need accommodation for a one-day meeting, but if you do and need help, please contact us, although you can probably find it as easily on the web as we can, for instance via http://visitbath.co.uk/. You are strongly advised to book accommodation soon, as the Bath Literature Festival starts that day and much of the accommodation we normally recommend is already sold out. PROCEEDINGS: We plan to publish an ENTCS post-proceedings of the workshop if we receive a reasonable number of high quality submissions of relevant articles. We can discuss details at the time. The one caveat is that Elsevier now charges $50/paper for publishing in ENTCS, which we may need to pass on to successful authors. -------------- next part -------------- An HTML attachment was scrubbed... URL: From lanese at cs.unibo.it Sat Feb 16 11:47:54 2013 From: lanese at cs.unibo.it (Ivan Lanese) Date: Sat, 16 Feb 2013 17:47:54 +0100 (CET) Subject: [TYPES/announce] ICE 2013 CfP Message-ID: [- Apologies for multiple copies -] ICE 2013 6th Interaction and Concurrency Experience June 6, 2013, Florence, Italy http://www.discotec.org/workshops/ice2013/ Satellite workshop of DisCoTec 2013 http://www.discotec.org === Highlights === - Innovative selection procedure - ICE welcomes submissions of full papers, short papers, and brief announcements - Invited talks: Davide Sangiorgi & Damien Pous - Special issue of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/) === Important Dates === 20 March 2013...................Full paper submission 21 March - 21 April 2013........Reviews, rebuttal, and PC discussion 24 April 2013...................Notification to authors 6 June 2013.....................ICE in Florence 15 Sept 2013.....................Camera-ready for post-proceedings === 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 of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. Topics of interest include, but are not limited to: - Process algebra and coordination: transformation, analysis and implementation - Models for distributed coordination and semantics - Techniques and tools for specification, analysis, verification of resilient interactions - Coinductive techniques for reactive systems - Languages, protocols and mechanisms for sound distributed coordination - Logics and types for interactions - Comparison among different coordination and/or execution models - Expressive power of coordination languages and execution models - Formal semantics of coordination languages - Formal verification of distributed coordinated architectures - Relations between different semantic models for coordination languages === Selection Procedure === Since its 1st edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum. The discussion forum can be accessed by the authors of the paper and by all the PC members not in conflict with the paper. The forum is used by reviewers to ask questions and clarifications to the authors, allowing them to better explain all the aspects of their paper. The evaluation of the paper will keep into account not only the reviews, but also the outcome of the discussion. As witnessed by the past five editions of ICE, this procedure considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. === The Public Wiki === After the notification, the accepted papers are published on a public forum, in order to initiate public discussions that will trigger and stimulate the scientific debate at the workshop. We believe that this will drive the workshop discussions and let prospective participants interact with each other much earlier than in more traditional events. === Submission Guidelines === We invite for three types of submissions: (1) Full Papers, (2) Short Papers, and (3) Brief Announcements of already Published Papers. Full and short papers to appear in the post-proceedings must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2013 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). In addition, we invite for brief announcements of already published results, should the authors be interested in discussing their published research with the ICE community and giving a talk. Brief announcements will not be part of the post-proceedings. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2013). Full papers should not exceed 15 pages while short papers and brief announcements should not exceed 5 pages with the EPTCS style (http://style.eptcs.org/). Accepted (full and short) papers and brief announcements must be presented at the workshop by one of the authors. === Special Issue === Extended versions of the best full papers selected by the PC will be invited to appear in a special issue of the journal of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. === Program Committee === Luca Aceto (Reykjavik University, Iceland) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, UK) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marcello Bonsangue (Leiden University, The Netherlands) Ornela Dardha (University of Bologna/INRIA, Italy) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (CEA Saclay, France) Ludovic Henrio (CNRS, France) Clemens Kupke (University of Strathclyde, Scotland, UK) Julien Lange (University of Leicester, UK) Antonia Lopes (University of Lisbon, Portugal) Giuliano Losa (EPFL, Switzerland) Claudio A. Mezzina (FBK Trento, Italy) Matteo Mio (University of Edinburgh, UK) Valentina Monreale (University of Pisa, Italy) Luca Mottola (Politecnico di Milano, Italy) Daniela Petrisan (University of Leicester, UK) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Valerio Senni (IMT Lucca, Italy) Alexandra Silva (Radboud University Nijmegen, The Netherlands) Josef Widder (TU Vienna, Austria) Roberto Zunino (Universit? degli Studi di Trento and COSBI, Italy) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Ana Sokolova (University of Salzburg, Austria; co-chair) === Contact === ice2013 at easychair.org === Previous editions === The previous five editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and selected papers appeared in a joint special issue of MSCS (with EXPRESS?09 and SOS?09, Vol. 22, Number 2). * June 10th, 2010 in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol.38) and selected papers appeared in a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10, Vol. XXI). * June 9th, 2011 in Reykjavik, Iceland, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and selected papers appeared in a special issue of SACS (Vol. XXII). * June 16th, 2012 in Stockholm, Sweden, co-located with DisCoTec'12. The post-proceedings were published in EPTCS (vol.104) and a special issue of SCP is now in preparation. From Didier.Galmiche at loria.fr Sun Feb 17 05:18:39 2013 From: Didier.Galmiche at loria.fr (Didier Galmiche) Date: Sun, 17 Feb 2013 11:18:39 +0100 Subject: [TYPES/announce] TABLEAUX 2013 - 2nd Call for Papers, Tutorials and Workshops Message-ID: <5120AE7F.8070204@loria.fr> SECOND CALL FOR PAPERS, TUTORIALS and WORKSHOPS TABLEAUX 2013 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods Nancy, France September 16-19, 2013 http://tableaux13.loria.fr ---------------------------------------------------------------------- IMPORTANT DATES Workshop proposal submission deadline: March 4, 2013 Notification of acceptance of workshops: March 15, 2013 Tutorial proposal submission deadline: March 23, 2013 Notification of acceptance of tutorials: April 5, 2013 Abstract submission deadline: April 8, 2013 Paper submission deadline: April 15, 2013 Notification of paper decisions: June 1, 2013 Camera-ready papers due: June 14, 2013 Conference: September 16-19, 2013 ----------------------------------------------------------------------- GENERAL INFORMATION This conference is the 22nd in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods and will be held in Nancy, France, in September 16-19, 2013. See http://tableaux13.loria.fr for more information on TABLEAUX 2013, and http://i12www.ira.uka.de/TABLEAUX for information about the TABLEAUX conference series. TABLEAUX 2013 will be co-located with the 9th International Symposium on Frontiers of Combining Systems (FroCos 2013) held September 18-20, 2013. INVITED SPEAKERS - St?phane Demri, LSV - ENS Cachan & CIMS New York - Sara Negri, University of Helsinki - Tobias Nipkow, Technische Universit?t M?nchen TOPICS Tableaux methods offer a convenient set of formalisms for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, data integration and data access, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference intends to bring together researchers interested in all aspects - theoretical foundations, implementation techniques, system developments and applications - of the mechanization of reasoning with tableaux and related methods. Topics of interest include (but are not restricted to): * proof-theory in classical and non-classical logics (modal, temporal, description, intuitionistic, substructural, ...) * 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, resolution, ...) * new calculi and methods for theorem proving and verification in classical and non-classical logics * systems, tools, implementations and applications (provers, logical frameworks, model checkers, ...) * automated deduction and formal methods applied to logic, mathematics, software development, protocol verification, security, ... TABLEAUX 2013 also welcomes applications of formal methods with automated reasoning to real world examples. Papers including such applications of tableaux and related methods in areas such as, for example, hardware and software verification, knowledge engineering, semantic web, etc. are particularly invited. They should be tailored for the tableaux community and should hence focus on the role of reasoning and logical aspects of the solution. One or more tutorials will be part of the Conference program. PUBLICATION DETAILS The proceedings of TABLEAUX 2013 will be published in the Springer LNCS/LNAI Series. SUBMISSIONS The conference will include contributed papers, tutorials, system descriptions and invited lectures. Submissions are invited in three categories: A Research papers (reporting original theoretical and/or experimental research, up to 15 pages) B System descriptions (up to 7 pages) C 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. Accepted papers in these categories will be published in the conference proceedings (within the LNAI series of Springer), which will be available at the conference. For category B submissions a working implementation must exist and be available to the referees. Tutorial submissions (Category C) 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, to be presented in a time frame of at most 3 hours. Tutorial proposals will be reviewed by members of the program committee. For each accepted paper, at least one author is required to attend the conference to present the paper. Prospective authors are required to register a title and an abstract a week before the paper submission deadline. Further information and instructions about submissions can be found on the conference website at http://tableaux13.loria.fr. CALL FOR WORKSHOPS ------------------ Workshop proposals on specialised subjects in the range of the conference topics are welcome. We can accept up to 3 proposals. They can focus on specialized or broader areas and also on theoretical and/or applied topics. The format of a workshop is left to the organizers but typically TABLEAUX workshops feature invited speakers and a number of contributed presentations and the intended schedule is for one-day workshops. The date for TABLEAUX workshops is Monday 16th September, 2013. Proposals should include: - Workshop title - Names and affiliations of the organizers - Brief scientific description of the aims and scopes of the workshop, with an emphasis on the relevance for the Tableaux community. - Presentation of the proposed format and agenda. - Procedure for selecting papers and possibly participants. . - Expected number of participants and the potential invited speakers. - Plans for dissemination (for example, special issues of journals). To submit a workshop proposal, please send a description (up to 3 pages) to the PC chairs by March 4, 2013. The proposals will be reviewed by the members of the PC committee. PROGRAM COMMITTEE Carlos Areces, National University of C?rdoba, Argentina Arnon Avron, Tel-Aviv University, Israel Matthias Baaz, University of Technology, Vienna, Austria Philippe Balbiani, IRIT - CNRS, Toulouse, France Marta Cialdea Mayer, University Roma Tre, Roma, Italy Amy Felty, University of Ottawa, Canada Ulrich Furbach, University of Koblenz-Landau, Germany Didier Galmiche, LORIA - Lorraine University, Nancy, France (Chair) Valentin Goranko, Technical University of Denmark, Denmark Rajeev Gore, Australian National University, Canberra, Australia Reiner H?hnle, Technical University of Darmstadt, Germany Dominique Larchey-Wendling, LORIA - CNRS, Nancy, France (Chair) George Metcalfe, University of Bern, Switzerland Dale Miller, INRIA Saclay - LIX, Palaiseau, France Neil Murray, State University of New York, United States of America Nicola Olivetti, University of Marseille, France Jens Otten, University of Potsdam, Germany Lawrence C Paulson, University of Cambridge, United Kingdom Nicolas Peltier, LIG - CNRS, Grenoble, France Renate Schmidt, University of Manchester, United Kingdom Alex Simpson, University of Edinburgh, Scotland, United Kingdom Viorica Sofronie-Stokkermans, University of Koblenz-Landau, Germany Luca Vigano, University of Verona, Italy Arild Waaler, University of Oslo, Norway CONFERENCE and PC CHAIRS Didier Galmiche, LORIA - Lorraine University, Nancy, France Dominique Larchey-Wendling, LORIA - CNRS, Nancy, France From jv at informatik.uni-bonn.de Sun Feb 17 17:10:19 2013 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Sun, 17 Feb 2013 23:10:19 +0100 Subject: [TYPES/announce] Workshop Haskell and Rewriting Techniques HART 2013 Message-ID: <5121554B.7040304@informatik.uni-bonn.de> Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations. There are strong connections between Haskell programming and rewriting. Therefore, we announce a new workshop, International Workshop on Haskell And Rewriting Techniques (HART 2013) http://www.imn.htwk-leipzig.de/HART2013/ to be held on June 27, in conjunction with RDP 2013, in Eindhoven. (RDP contains RTA, the main rewriting conference.) We plan a half day of discussions, in an informal setting, on how Haskell and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example, - equational reasoning and other rewriting techniques for program verification and analysis; - lambda calculi and type systems for functional programs and higher order rewriting systems; - rewriting of type expressions in the type checker; - rewriting of programs by refactoring tools, optimizers, code generators; - execution of programs as a form of graph rewriting; - template Haskell, introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. When in doubt, contact a member of the PC. Program committee: Alcino Cunha (U Minho) J?rgen Giesl (RWTH Aachen) Andy Gill (U of Kansas) Johan Jeuring (U Utrecht) Keisuke Nakano (UEC Tokyo) Kristoffer H Rose (IBM Watson) (co-chair) Christian Sternagel (JAIST) Janis Voigtl?nder (U Bonn) Johannes Waldmann (HTWK Leipzig) (co-chair) Dates: May 6: deadline for submissions May 20: notification of acceptance June 27: workshop Submission and Proceedings: Two categories of submissions are invited: - Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. - Presentation-only papers. Describing work recently published or submitted. Will not be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is handled through the EasyChair HART2013 page, https://www.easychair.org/conferences/?conf=hart2013 In line with the informal style of the workshop, the reviewing of submissions will be light. When accepting and scheduling presentations, preference will be given to original research. Proceedings will be made available electronically at the workshop. From ulrich.fahrenberg at irisa.fr Mon Feb 18 10:49:45 2013 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Mon, 18 Feb 2013 16:49:45 +0100 Subject: [TYPES/announce] Call for Papers: SMC 2013 Message-ID: <51224D99.7050605@irisa.fr> CALL FOR PAPERS SMC 2013 First Workshop on Statistical Model Checking INRIA Rennes, France 23 September 2013 Associated with RV'13 http://rv2013.gforge.inria.fr/workshop.html SMC 2013, the First Workshop on Statistical Model Checking, will take place at INRIA Rennes, France, on 23 September 2013. The workshop is associated with RV'13, the Fourth International Conference on Runtime Verification. INVITED SPEAKERS Sylvain Peyronnet, University of Caen, France Alexandre David, University of Aalborg, Denmark PROGRAM COMMITTEE CO-CHAIRS Axel Legay, INRIA Rennes, France Kim G. Larsen, Aalborg University, Denmark Serge Haddad, ENS Cachan, France ORGANIZATION CHAIR Axel Legay, INRIA Rennes, France IMPORTANT DATES Paper submission: 17 May 2013 Notification: 17 June 2013 Final version: 15 July 2013 ABOUT Statistical Model Checking has recently been proposed as an alternative to avoid an exhaustive exploration of the state space of a system under verification. The core idea of the approach is to conduct some sim- ulations of the system and then use results from the statistics area in order to decide whether the system satisfies the property with respect to a given probability. The answer is correct up to some confidence. SMC is generally much faster (but less precise) than formal verification techniques. Moreover, the approach can be used to verify properties that cannot be expressed by the classical temporal logics used in formal verification. The objective of SMC 2013 is to discuss recent advances in Statistical Model Checking. PUBLICATION The SMC 2013 proceedings will be published as a volume of EPTCS. Submission of papers to RV'13 is handled through EasyChair, at https://www.easychair.org/conferences/?conf=rv13 For more information, see http://rv2013.gforge.inria.fr/workshop.html From ulrich.fahrenberg at irisa.fr Mon Feb 18 11:06:52 2013 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Mon, 18 Feb 2013 17:06:52 +0100 Subject: [TYPES/announce] Call for Tutorials: RV'13 Message-ID: <5122519C.6080005@irisa.fr> CALL FOR TUTORIALS RV'13 Fourth International Conference on Runtime Verification INRIA Rennes, France 24-27 September 2013 http://rv2013.gforge.inria.fr/ RV'13, the Fourth International Conference on Runtime Verification, will take place at INRIA Rennes, France, from 24 to 27 September 2013. CALL FOR TUTORIALS As with previous editions, RV'13 will host a few invited tutorials. These are three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to twenty pages in the LNCS conference proceedings. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a biography of the presenter. It must be formatted according to the Springer LNCS guide- lines and not exceed 2 pages. IMPORTANT DATES Tutorial submission: 5 May 2013 Notification: 12 May 2013 Final version: 7 July 2013 SCOPE Runtime verification is concerned with monitoring and analysis of soft- ware and hardware system executions. Runtime verification techniques are crucial for system correctness and reliability; they are signif- icantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for verification and debugging purposes, and after deployment for ensuring reliability, safety and security, and for providing fault containment and recovery. TOPICS - specification languages and formalisms for traces - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization PUBLICATION The RV'13 proceedings will be published as a volume of the LNCS series at Springer. To submit a tutorial, send an email to rv2013-info at lists.gforge.inria.fr For more information, see http://rv2013.gforge.inria.fr/ From nswamy at microsoft.com Mon Feb 18 13:19:12 2013 From: nswamy at microsoft.com (Nikhil Swamy) Date: Mon, 18 Feb 2013 18:19:12 +0000 Subject: [TYPES/announce] PLAS 2013: Second call for papers Message-ID: Update: the submission site is now open. ------------------------------------------------------------------------------- ACM SIGPLAN Eighth Workshop on Programming Languages and Analysis for Security (PLAS) June 20, 2013 Seattle, USA Co-located with PLDI 2013 http://research.microsoft.com/en-us/events/plas2013/ 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. -------------------------------------------------------------------------------- Important Dates Submissions due: March 1, 2013 Notification: April 5, 2013 PLAS 2013 workshop: June 20, 2013 -------------------------------------------------------------------------------- Call for papers 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 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: to the title of the submitted paper. The submission site is open: https://www.easychair.org/conferences/?conf=plas2013 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 more 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 Aslan Askarov (Harvard University) Karthikeyan Bhargavan (INRIA) Nataliia Bielova (INRIA-Rennes) Vinod Ganapathy (Rutgers) Ana Almeida Matos (Instituto Superior T?cnico and Instituto de Telecomunica??es) Prasad Naldurg (co-chair) (MSR India) Grigore Rosu (University of Illinois at Urbana-Champaign) Nikhil Swamy (co-chair) (MSR Redmond) Ankur Taly (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ylies.Falcone at ujf-grenoble.fr Mon Feb 18 15:25:42 2013 From: Ylies.Falcone at ujf-grenoble.fr (=?windows-1252?Q?Yli=E8s_Falcone?=) Date: Mon, 18 Feb 2013 21:25:42 +0100 Subject: [TYPES/announce] ETAPS 2014: SECOND CALL FOR SATELLITE EVENTS Message-ID: [We apologise for multiple copies.] *** SECOND CALL FOR SATELLITE EVENTS *** ETAPS 2014 European Joint Conferences on Theory And Practice of Software April 5th ? 13th, 2014 Grenoble, France -- 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 is an annual event which takes place in Europe each spring since 1998. The seventeenth conference, ETAPS 2014, takes place between April 5th and 13th, 2014 in Grenoble, France. Grenoble is the capital of the Alps; its history spans over two thousand years. Grenoble is located in an exceptional natural environment, surrounded by three mountain masses Vercors, Chartreuse, and Belledonne. ETAPS main conferences take place on April 7th-11th, 2014. They are: - 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 - POST: Principles of Security and Trust - TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- SATELLITE EVENTS -- The ETAPS 2014 Organizing Committee invites proposals for Satellite Events (workshops, tutorials, etc.) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite Events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2014 Satellite Events will be held immediately before and after the main conferences, on April 5th-6th and April 12th-13th, 2014. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize Satellite Events are invited to submit proposals in ASCII, PDF or Postscript format by e-mail to etaps2014.satellites at imag.fr. A proposal should not exceed two pages and should include: ? Satellite Event name / acronym ? names and contact information of the organizers ? preferred period: April 5th-6th or April 12th-13th ? duration of the workshop: one-day or two-day event ? 120-word description of the workshop topic for later use in publicity material ? a brief explanation of the workshop topic and its relevance to ETAPS ? a schedule for paper submission, notification of acceptance and final versions ? expected number of participants ? any other relevant information, like event format, invited speakers, ? publication policy, demo sessions, special space requirements, etc. The proposals will be evaluated by the ETAPS 2014 organizing committee on the basis of their assessed benefit for prospective participants to ETAPS 2014. The titles and brief information about accepted Satellite Events will be included in the ETAPS 2014 web site, call for papers and call for participation. Satellite Events organizers will be responsible for: - producing the event's call for papers and call for participations - advertising the event through specialist mailing lists etc. to complement publicity for ETAPS as a whole hosting and maintaining a web site for the event - reviewing and making acceptance decisions on submitted papers producing the event proceedings, if any; facilities for printing will be made available by the ETAPS organizers - scheduling workshop activities in consultation with the local organizers. Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2013: http://www.etaps.org/2013/workshops13 ETAPS 2012: http://www.etaps.org/2012/workshops ETAPS 2011: http://www.etaps.org/2011/workshops ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/ ETAPS 2009: http://www.cs.york.ac.uk/etaps09/ ETAPS 2008: http://etaps08.mit.bme.hu/ ETAPS 2007: http://www.di.uminho.pt/etaps07/ ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/ ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/ ETAPS 2004: http://www.lsi.upc.es/etaps04/ ETAPS 2003: http://www.mimuw.edu.pl/etaps03/ -- IMPORTANT DATES -- Satellite Event Proposals Deadline: Marsh 4th, 2013 Notification of acceptance: April 4th, 2013 -- FURTHER INFORMATION AND ENQUIRIES -- Please contact Axel Legay: etaps2014.satellites at imag.fr axel.legay at inria.fr From bove at chalmers.se Tue Feb 19 09:21:49 2013 From: bove at chalmers.se (Ana Bove) Date: Tue, 19 Feb 2013 15:21:49 +0100 Subject: [TYPES/announce] PhD Positions in Formal Methods and Language-based Security at Chalmers Message-ID: <51238A7D.3040808@chalmers.se> 4 *PhD* Positions in Formal Methods and Language-based Security at the Dept. of Computer Science and Engineering, Chalmers University of Technology, Sweden Application deadline: March 30, 2013 ------------------------------------------------------------------------ *Job description ...* *... of the 2 PhD positions in Formal Methods* The Formal Methods group is an internationally recognized research group with a high-profile research track record and an excellent network of collaborators. The group's research focus is in the theoretical and practical aspects of formal software verification, including automated reasoning, interactive theorem proving, runtime verification, and test generation. Together with international collaborators, the group members co-developed widely recognized verification tools like KeY (www.key-project.org), Vampire (http://vprover.org), ALIGATOR (http://mtc.epfl.ch/software-tools/Aligator), and LARVA. The research of the two advertised PhD positions will be in the area of Software Verification, where - one position has a stronger focus on the creative use and development of automated reasoning techniques for software verification, - the other has a stronger focus on combining static and runtime verification of software. The selection of the specific research topic will take into account both the interests of the new PhD student and the research agenda of the group. *... of the (up to) 2 PhD positions in Language-based Security* The PhD students 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. We run a number of ambitious projects with top international partners in academia and industry, including the European project WebSand on web application security: https://www.websand.eu/ ------------------------------------------------------------------------ *Details about Employment* PhD student positions are limited to five years and 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 26,250SEK a month before tax. The positions are intended to start in spring or fall 2013. ------------------------------------------------------------------------ *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 a position in Formal Methods will have strong background in one or more of the following areas: logic, theorem proving, software verification. The ideal candidate for a position in Language-based Security 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. ------------------------------------------------------------------------ *The Department* The Department has about 70 faculty members and enrolls about 70 PhD students from more than 30 countries. The research spans the whole spectrum, from theoretical foundations to applied systems development. There is extensive national and international collaboration with academia and industry all around the world. 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 come from more than 30 different countries. ------------------------------------------------------------------------ *Gothenburg, Sweden* Gothenburg is often referred to as the "heart of Scandinavia". The videos below give an impression what it's like to live and study in Gothenburg. Live in Gothenburg: http://youtu.be/sbwVIQeGcdY Study in Gothenburg: http://youtu.be/0WrlGlSyS1c ------------------------------------------------------------------------ *How to Apply* Electronic application can be submitted following these guidelines: For the PhD positions in Formal Methods: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL=VacDetail.aspx%3FCommAdSeqNo%3D1174 For the PhD positions in Language-based Security: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx?RMURL=VacDetail%2Easpx%3FCommAdSeqNo%3D1173 _______________________________________________ Appsem mailing list Appsem at lists.tcs.ifi.lmu.de http://lists.tcs.ifi.lmu.de/mailman/listinfo/appsem From math.semantic.web at gmail.com Tue Feb 19 15:41:08 2013 From: math.semantic.web at gmail.com (Christoph LANGE) Date: Tue, 19 Feb 2013 20:41:08 +0000 Subject: [TYPES/announce] Participate: Enabling Domain Experts to use Formalised Reasoning (AISB 2013, Exeter, UK, 3-5 Apr 2013). Tutorials on Matching, Auctions, Finance. Message-ID: <5123E364.1000207@gmail.com> (How does this relate to types? Well, some submissions explicitly discuss whether or not to use types when formalising, or what types to use. Particularly the submissions on auction theory do so.) Do-Form: Enabling Domain Experts to use Formalised Reasoning http://cs.bham.ac.uk/research/projects/formare/events/aisb2013 CALL FOR PARTICIPATION Symposium at the annual convention of the AISB (Society for the Study of Artificial Intelligence and Simulation of Behaviour; http://www.aisb.org.uk) University of Exeter, UK 3-5 April 2013 http://emps.exeter.ac.uk/computer-science/research/aisb/ (early registration deadline 5 March) HANDS-ON TUTORIAL SESSIONS (details below) with * M. Utku ?nver (matching markets) * Peter Cramton (auctions) * Neels Vosloo (finance markets regulation) (http://www.cs.bham.ac.uk/research/projects/formare/events/aisb2013/invited.php) PAPER and DEMO PRESENTATIONS on * environmental models * controlled natural languages * ontologies * auction theory * software verification * formal specification * autonomous systems * self-explaining systems (http://www.cs.bham.ac.uk/research/projects/formare/events/aisb2013/proceedings.php) This symposium is motivated by the long-term VISION of making information systems dependable. In the past even mis-represented units of measurements caused fatal ENGINEERING disasters. In ECONOMICS, the subtlety of issues involved in good auction design may have led to low revenues in auctions of public goods such as the 3G radio spectra. Similarly, banks' value-at-risk (VaR) models ? the leading method of financial risk measurement ? are too large and change too quickly to be thoroughly vetted by hand, the current state of the art; in the London Whale incident of 2012, JP Morgan claimed that its exposures were $67mn under one of its VaR models, and $129 under another one. Verifying a model's properties requires formally specifying them; for VaR models, any work would have to start with this most basic step, as regulators' current desiderata are subjective and ambiguous. We believe that these problems can be addressed by representing the knowledge underlying such models and mechanisms in a formal, explicit, machine-verifiable way. Contemporary computer science offers a wide choice of knowledge representation languages well supported by verification tools. Such tools have been successfully applied, e.g., for verifying software that controls commuter rail or payment systems. Still, DOMAIN EXPERTS without a strong computer science background find it challenging to choose the right tools and to use them. This symposium aims at investigating ways to support them. Some problems can be addressed now, others will bring new challenges to computer science. THE SYMPOSIUM is designed to bring domain experts and formalisers into close and fruitful contact with each other: domain experts will be able to present their fields and problems to formalisers; formalisers will be exposed to new and challenging problem areas. We will combine talks and hands-on sessions to ensure close interaction among participants from both sides. World-class economists will offer HANDS-ON TUTORIAL SESSIONS on the following topics: * MATCHING MARKETS (M. Utku ?nver, Boston College): These include matching students to schools, interns to hospitals, and kidney donors to recipients. See the documentation for the 2012 Nobel Memorial Prize in Economic Sciences for more background information. * AUCTIONS (Peter Cramton, University of Maryland): Peter has been working on auctions for Ofcom UK (4G spectrum auction), the UK Department of the Environment and Climate Change, and others ? and most recently on the ?applicant auctions? for the new top-level Internet domains issued by the ICANN. * FINANCE MARKETS REGULATION (Neels Vosloo, Financial Services Authority, UK): It is currently impossible for regulators to properly inspect risk management models. Test portfolios are a promising tool for identifying problems with risk management models. To what extent can techniques from mechanised reasoning automate some of the inspection process? COMMENTS/QUESTIONS/ENQUIRIES to be sent to DoForm2013 at easychair.org -- Christoph Lange, School of Computer Science, University of Birmingham http://cs.bham.ac.uk/~langec/, Skype duke4701 ? SePublica Workshop @ ESWC 2013. Montpellier, France, 26-30 May. Deadline 4 Mar; http://sepublica.mywikipaper.org ? Intelligent Computer Mathematics, 7?12 Jul, Bath, UK; Deadline 8 Mar http://cicm-conference.org/2013/ ? Enabling Domain Experts to use Formalised Reasoning @ AISB 2013 3?5 April 2013, Exeter, UK. 3 Hands-on Tutorials on Economics http://cs.bham.ac.uk/research/projects/formare/events/aisb2013/ -- Christoph Lange, Universit?t Bremen (now: University of Birmingham) http://kwarc.info/clange, Skype duke4701 ? SePublica Workshop @ ESWC 2013. Montpellier, France, 26-30 May. Deadline 4 Mar; http://sepublica.mywikipaper.org ? Intelligent Computer Mathematics, 7?12 Jul, Bath, UK; Deadline 8 Mar http://cicm-conference.org/2013/ ? Enabling Domain Experts to use Formalised Reasoning @ AISB 2013 3?5 April 2013, Exeter, UK. 3 Hands-on Tutorials on Economics http://cs.bham.ac.uk/research/projects/formare/events/aisb2013/ -- Christoph Lange, School of Computer Science, University of Birmingham http://cs.bham.ac.uk/~langec/, Skype duke4701 ? SePublica Workshop @ ESWC 2013. Montpellier, France, 26-30 May. Deadline 4 Mar; http://sepublica.mywikipaper.org ? Intelligent Computer Mathematics, 7?12 Jul, Bath, UK; Deadline 8 Mar http://cicm-conference.org/2013/ ? Enabling Domain Experts to use Formalised Reasoning @ AISB 2013 3?5 April 2013, Exeter, UK. 3 Hands-on Tutorials on Economics http://cs.bham.ac.uk/research/projects/formare/events/aisb2013/ From Stephan.Merz at loria.fr Wed Feb 20 03:23:15 2013 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 20 Feb 2013 09:23:15 +0100 Subject: [TYPES/announce] 2 postdoc positions at IRIT Toulouse and INRIA Nancy Message-ID: The positions may be of interest to readers of this list who have a background in interactive theorem proving and in verification of real-world programming languages. Project "Computer-assisted checking of schedulability and resource access of concurrent Java using timed automata" funded by Fondation EADS We seek two post-doctoral researchers in computer science who have experience in at least one of the following areas: ? Formal verification using model checking and/or SMT solving ? Timed automata ? Interactive theorem proving ? Concurrent Java programming The first position will be at Universit? Paul Sabatier Toulouse (IRIT) and lasts 24 months. The second position will be at INRIA Nancy and lasts 12 months (possibly extensible). The positions will be remunerated according to French salary scale for post-doctoral researchers at approximately 2600 euros monthly. The project holders are Jan-Georg Smaus (http://www.irit.fr/~Jan-Georg.Smaus/) at IRIT and Stephan Merz (http://www.loria.fr/~merz/) at INRIA. Informal inquiries should be sent to smaus at irit.fr or Stephan.Merz at loria.fr. The working language of the project is English. Female candidates are particularly encouraged to apply. Information on the project: In safety critical systems, concurrent programs are becoming more widespread, even though their correctness is particularly difficult to ascertain. In particular, system failures due to timing problems are hard to detect with traditional quality assurance methods like tests. Untimely or badly synchronized access to resources may lead to data corruption, with catastrophic consequences. This project aims at investigating analysis and verification techniques for concurrent programs in a real-time setting, and at relating program analyses and proof methods in a demonstrably sound way. We address a major problem of concurrent programming, namely the access to shared resources by several program threads. Uncoordinated access may lead, among others, to data inconsistencies and loss of updates, and is therefore not acceptable. The standard solution is to use critical regions, access monitors or locks to prevent two threads from modifying the same resource at the same time. Unfortunately, this solution has major drawbacks: deadlocks may stall the entire program, unfair strategies may permanently exclude single threads from executing, and the execution times of threads may be difficult to predict, which is fatal for a hard real-time system. Programming frameworks for real-time systems propose instead to grant access to a resource based on temporal coordination, and not as a consequence of locking. Thus, each thread of a set of concurrent threads is equipped with a specification of when it intends to access a given set of resources. In this project, we will more specifically work with Safety Critical Java (SCJ), a real-time dialect of the Java programming language targeted at safety-critical systems. We intend to verify that the temporal annotations (minimal and maximal execution times and scheduling dates) in an SCJ program ensure that no two threads can simultaneously access a resource. The basic idea is to map timing information to timed automata and apply real-time model checking in order to prove the absence of errors. More fine-grained analysis will require the use of advanced program analysis in order to construct an appropriate timed automaton. As a methodological contribution, we are also interested in providing a formal model (in the proof assistant Isabelle) of Safety Critical Java and of timed automata and in proving the correctness of the TA abstraction of SCJ programs. From shilov at iis.nsk.su Wed Feb 20 21:06:20 2013 From: shilov at iis.nsk.su (=?koi8-r?B?7snLz8zByiD7yczP1w==?=) Date: Thu, 21 Feb 2013 09:06:20 +0700 Subject: [TYPES/announce] First call for papers "Fun With Formal Methods" (CAV affiliated workshop). Message-ID: <000601ce0fd8$0a8453c0$1f8cfb40$@nsk.su> First Call For Papers ======================= Fun With Formal Methods (FWFM2013, one day workshop Saturday, July 13, 2013, Saint Petersburg, Russia, http://www.iis.nsk.su/fwfm2013) Affiliated with the 25th International Conference on Computer Aided Verification (cav2013.forsyte.at) ======================= Motivation 45 years have passed since Robert W. Floyd published the first research that explicitly discussed formally how to assign meaning to programs. More than a decade has passed already since David A. Schmidt published an appeal On the Need for a Popular Formal Semantics. But recently David L. Parnas have called Really Rethinking "Formal Methods", to question the assumptions underlying the well-known current formal software development methods to see why they have not been widely adopted and what should be changed. So, things are right where they started decades ago? Not at all, since industrial applications of Formal Methods are not the unique measure of success. Another dimension where we can discuss utility of Formal Methods could be better education. A very popular (in Russia) aphorism of Mikhail Lomonosov (the first Russian academician) says: "Mathematics should be learned just because it disciplines and bring up the mind". We do believe that Formal Methods discipline and bring up minds in Computer Science. We would not like to say that educators should not care about industrial applications of Formal Methods (quite opposite, we must care!). At the same time Formal Methods education helps to bridge a "cultural gap" (E.W.Dijkstra) between Mathematics and Computer Science. The problem is how to overcome a stable allergy to Formal Methods: many people think Formal Methods are too pure in theory but too poor in practice. We do believe that the basic reason behind this allergy is the absence of primary, elementary level. It is not wise to start teaching arithmetic from Peano axiomatic, but it is a common sense to start from elementary problems about numbers of apples, pencils, etc. For example, nobody teaches primary school children to prove in Peano axiomatic ((x+y)+z) = (x+(y+z)) for all x, y and z, but everyone teaches to solve elementary problems like the following one: I gave 5 apples to Peter, and then he gave 2 apples to John; how many apples does Peter have after that? (If you think that he has 3 apples, you are not right, since he has 3 at least.) In our vision, a part of the reason of student's and engineer's poor attitude to Formal Methods, is very simple: FM-experts do not care about primary education in this field at the early stage of higher education. In particular, many courses on Formal Semantics start with fearful terms like state machine, logic inference, denotational semantics, etc., without elementary explanations of the basic notions. ======================= Workshop Topics and Scope The workshop is designed for 1. enjoying the art and beauty of Formal Methods, 2. discussing experience how to make Formal Methods easy, 3. presenting application of Formal Methods to puzzles, to games, etc., 4. non-standard problem solving outside programming and Computer Science, 5. everything else about Fun and Joy of Formal Methods. ======================= Inivited Speakers: 1. Yuri Karpov (Saint-Petersburg State Polytechnic University, Russia) 2. John Rushby (SRI International, California, USA) ======================= Program Committee * Paul Curzon (Queen Mary, University of London) * Victor Kuliamin (Institute for System Programming, Russia) * Dominique Mery (LORIA & Universit? de Lorraine, France) * Nikolay Nepejvoda (Program Systems Institute, Russia) * Nikolay Shilov (chair, Institute of Informatics Systems, Russia) * Rostislav Yavorsky ("Skolkovo", Russia) ======================= Submission and Proceedings * Original and published papers on topics related to FWFM are solicited. * There is no any strict limit for page number or style, but it is recommended to be in range 4-16 pages (single column, single interval, font not less than 12 for review convenience). * All submissions must be made electronically in PDF format via EasyChair conference management system (https://www.easychair.org/conferences/?conf=fwfm2013). * We plan to publish informal proceedings before the workshop and disseminate them among participants at the workshop on USB-sticks. * Publication of the post-workshop proceedings will be discussed at the workshop. ======================= Important Dates * Saturday, April 13th, 2013: Paper submission deadline * Saturday, May 11th, 2013: Acceptance notification * Saturday, May 26th, 2013: Camera ready version for preliminary proceedings * Saturday, July 13th, 2013: Workshop * Monday, July 15 - Friday, July 19, 2013: CAV Conference ======================= Registration and Fees Workshop registration fees will be collected together with CAV registration fees. From these registration fees CAV provides workshop participants with: registration, meeting facilities, lunches, coffee breaks, and proceedings on USB sticks. As usual for CAV, the workshop registration fee will be uniform and it will depend only on the number of workshop days people take part in, i.e., one day (1D) or two days (2D). Each participant registering for a workshop has the right to attend the other workshops on the same day. ======================= Visa Information The majority of foreign participants will need visas to enter Russia, this is a two step process: First, one has to obtain a visa invitation letter; Then, having the letter, one applies for a visa through the local Russian Consulate. The deadline for visa invitation letters through CAV is March 20, 2013 for non-EU citizens and April 10, 2013. After the deadline the participants will have to apply for a tourist visa invitation through the hotel. We kindly ask submission authors and potential participants to apply for a visa invitation letter as soon as possible (even if their trip/participation plans may change later). For further details please check: http://cav2013.forsyte.at/visa/. ======================= Contact person: Nikolay Shilov (shilov at iis.nsk.su) From hirokawa at jaist.ac.jp Thu Feb 21 05:47:40 2013 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Thu, 21 Feb 2013 19:47:40 +0900 Subject: [TYPES/announce] IWC 2013: 2nd Call for Papers Message-ID: <20130221194740.6f7689d692d2800d1e490ae4@jaist.ac.jp> ====================================================================== Second Call for Papers IWC 2013 2nd International Workshop on Confluence 28 June 2013, Eindhoven, The Netherlands collocated with RDP 2013 http://www.jaist.ac.jp/~hirokawa/iwc2013/ ====================================================================== Recently there is a renewed interest in confluence research, resulting in new techniques, tool support as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013). During the workshop the 2nd Confluence Competition (CoCo 2013) takes place. IMPORTANT DATES: * submission April 15, 2013 * notification May 10, 2013 * final version June 3, 2013 * workshop June 28, 2013 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Patrick Dehornoy University of Caen * Jan Willem Klop Vrije Universiteit (joint invited speaker for IWC 2013 and WIR 2013) PROGRAM COMMITTEE: * Guillem Godoy Technical University of Catalonia * Nao Hirokawa JAIST (co-chair) * Barbara Koenig Universitaet Duisburg-Essen * Vincent van Oostrom Utrecht University (co-chair) * Michio Oyamaguchi Nagoya University * Harald Zankl University of Innsbruck * Hans Zantema Eindhoven University of Technology SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2013 From Ralph.Matthes at irit.fr Thu Feb 21 11:59:50 2013 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Thu, 21 Feb 2013 17:59:50 +0100 Subject: [TYPES/announce] Types Meeting 2013 in Toulouse, 23 - 26 April: last call for contributions Message-ID: <1361465990.2755.144.camel@coinduct> Types Meeting 2013 Toulouse, 23-26 April 2013 http://www.irit.fr/TYPES2013/ LAST CALL FOR CONTRIBUTIONS The 19th Conference "Types for Proofs and Programs" will take place in Toulouse, France, from 23 to 26 April 2013. 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: * Steve Awodey, School of Mathematics, Institute for Advanced Study, Princeton, U.S.A. & Department of Philosophy, Carnegie Mellon University, U.S.A. "Higher Inductive Types in Homotopy Type Theory" * Lars Birkedal, Department of Computer Science, Aarhus University, Denmark "Charge! a framework for higher-order separation logic in Coq." * Ulrich Kohlenbach, Department of Mathematics, TU Darmstadt, Germany "Types in Proof Mining" We invite all researchers to contribute talks on subjects related to the Types area of interest. These include, but are not limited to: - Foundations of type theory and constructive mathematics; - Applications of type theory; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalizing mathematics using type theory. We would like to especially encourage talks proposing new ways of applying type theory. The talks may be based on newly published papers or work submitted for publication, but also work in progress. There are no formal pre-proceedings, but we will make available the abstract book for the conference. Meanwhile, post-proceedings are confirmed to appear in LIPIcs (Leibniz International Proceedings in Informatics), Schloss Dagstuhl, see http://www.dagstuhl.de/en/publications/lipics (the same publisher as for the last TYPES meeting in Bergen in 2011) There will be a separate call for papers, and participation in TYPES 2013 is no prerequisite for submission to the post-proceedings. TYPES 2013 is intended to be a conference in our traditional workshop style. We expect submission of short abstracts that fit on one or two pages, presenting in sufficient detail the content of the talk and its relevance for TYPES, as judged by the program committee. Submission is exclusively admitted electronically, through the EasyChair system. The submission site is https://www.easychair.org/conferences/?conf=types2013 Deadline for proposing a contributed talk: Monday, February 25 This means registering a submission to the EasyChair system, including a short text-only abstract, and submitting the PDF file of an abstract typeset in LaTeX that fits on one or two pages, conforming to the EasyChair LaTeX class - for technical details, see the web page. (In the first call for papers, there was a second, earlier deadline for registering the submission to EasyChair.) Notification of acceptance: Friday, March 8 Deadline for final version of LaTeX sources for inclusion of the abstract into the abstract book: Monday, April 1st The conference itself: Tuesday to Friday, April 23-26 The venue: Toulouse in the South West of France is the fourth largest city of France and a lively university center with way over 100000 students. Toulouse offers numerous inexpensive accommodations, including student residences. On the web site, there are links to hotels and residences - even one of the latter only 500m walking distance from the lecture hall. Thanks to our sponsors, notably Universit? Toulouse 1 Capitole, granting the lecture hall in the city center, and IRIT (Institut de Recherche en Informatique de Toulouse), the federative research structure FREMIT and Universit? Paul Sabatier (Toulouse 3) with financial support (other sources pending), we are able to keep the participation fee low. Moreover, we operate a scheme of additional fee reduction for master and PhD students. For the planned registration fees, please see the web site (a dedicated page accessible from the site). Early registration (not yet open) will be until April 2. ----------------------------------------------------------------------- Satellite event: On Monday, April 22, the twelfth international workshop Proof, Computation, Complexity (PCC 2013) will be held on the campus of Toulouse Technical University. Abstract submission deadline: February 25 Notification of acceptance: March 8 For the details, see http://www.irit.fr/TYPES2013/PCC2013/ ----------------------------------------------------------------------- Program Committee TYPES 2013 Jos? Esp?rito Santo, University of Minho, Braga, Portugal Herman Geuvers, Radboud University Nijmegen, Netherlands Silvia Ghilezan, University of Novi Sad, Serbia Hugo Herbelin, PPS, INRIA Rocquencourt-Paris, France Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany Zhaohui Luo, Royal Holloway, University of London, UK Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair) Marino Miculan, University of Udine, Italy Bengt Nordstr?m, Chalmers University of Technology, G?teborg, Sweden Erik Palmgren, Stockholm University, Sweden Andy Pitts, University of Cambridge, UK Sergei Soloviev, IRIT, Univ. de Toulouse, France (co-chair) Pawe? Urzyczyn, University of Warsaw, Poland Tarmo Uustalu, Tallinn Technical University, Estonia From damian at famaf.unc.edu.ar Thu Feb 21 17:32:00 2013 From: damian at famaf.unc.edu.ar (Damian Barsotti) Date: Thu, 21 Feb 2013 19:32:00 -0300 Subject: [TYPES/announce] QEST 2013 - Last call for papers Message-ID: <20130221223200.GA21057@mingus> [We apologise for multiple copies.] -------------------------------------------------------------------------------- Last Call for Papers 10th International Conference on Quantitative Evaluation of SysTems QEST 2013 http://www.qest.org/qest2013/ August 26th-30th, 2013 - Buenos Aires, Argentina Co-located with CONCUR, FORMATS, and TGC IMPORTANT DATES: Abstract submission 4 March 2013 Paper submission 11 March 2013 Author notification 12 May 2013 Final version 2 June 2013 INVITED SPEAKERS: Lorenzo Alvisi, University of Texas Austin, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Edmundo de Souza e Silva, Federal University of Rio de Janeiro, Brazil SCOPE AND TOPICS: QEST is the leading forum on evaluation and verification of computer systems and networks, through stochastic models and measurements. QEST has a broad range of interests - the common thread is that the evaluation be quantitative. The range of performance metrics of interest spans classical measures involving performance and reliability, as well as quantification of properties that are classically qualitative, such as safety, correctness, and security. QEST welcomes measurement-based studies as well as analytic studies. QEST welcomes diversity in the model formalisms and methodologies employed, as well as development of new formalisms and methodologies. QEST is keenly interested in case studies highlighting the role of quantitative evaluation in the design of systems, where the notion of system is broad. Systems of interest include computer hardware and software architectures, communication systems, embedded systems and biological systems. Moreover, tools for supporting the practical application of research results in all of the above areas are of special interest, and therefore tool papers are sought. In short, QEST aims to create a sound methodological basis for assessing and designing systems using quantitative means. EVALUATION OF PAPERS: All submitted papers will be thoroughly judged by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria (in no particular order): 1. Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. 2. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Process structure and the individual steps should be clearly described. If the methodology has already been evaluated with applications, a brief description of the lessons learned would be very helpful. 3. Application: describes a novel application, and compares with previous results (if any). 4. Tools: should motivate the development of the new tools and the formalisms they support. Tool papers need neither discuss their theoretical underpinnings nor their algorithms. Instead, they should focus on the software architecture and discuss its practical capabilities with particular reference to the size and type of model it can handle within reasonable time and space limits. 5. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. SUBMISSIONS: We invite submissions of original papers related to the aforementioned topics. Submissions must be in English, Springer LNCS format, and must indicate the above paper type. Papers must be prepared in LaTeX, following Springer's LNCS guidelines. Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Additional material for the aid of the reviewers (e.g., proofs) can be sent in a clearly marked appendix. Papers must be unpublished and not be submitted for publication elsewhere. PC members, except program co-chairs, may submit papers. Papers should be submitted electronically using EasyChair online submission system (https://www.easychair.org/conferences/?conf=qest2013). All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. A best-paper award will be presented at the conference. The QEST 2013 proceedings will be published by Springer in the LNCS Series. The proceedings will be available at the conference. As in previous years, we are planning to publish extended versions of selected papers in a special issue of a journal. TUTORIALS: There will be one day of tutorials at the start of the conference. Tutorial proposals (up to 4 pages Springer LNCS format) should be sent to the Tutorial Chair (Lijun Zhang, zhang at imm.dtu.dk) by 11 March 2013. GENERAL CHAIR: Pedro R. D'Argenio (AR) PC-CHAIRS: Kaustubh Joshi (US) Markus Siegle (DE) Marielle Stoelinga (NL) LOCAL ORGANIZATION CHAIR: Hern?n Melgratti (AR) TOOLS CHAIR: Kai Lampka (SE) TUTORIAL CHAIR: Lijun Zhang (DK) PROCEEDINGS CHAIR: Nicol?s Wolovick (AR) PUBLICITY CHAIR: Dami?n Barsotti (AR) PROGRAM COMMITTEE: Christel Baier (DE) Nathalie Bertrand (FR) Andrea Bobbio (IT) Peter Buchholz (DE) Hector Cancela (UY) Giuliano Casale (GB) Gianfranco Ciardo (US) Yuxin Deng (CN) Derek Eager (CA) Jane Hillston (GB) Andras Horvath (IT) David Jansen (NL) Krishna Kant (US) Peter Kemper (US) Boris Koepf (ES) Marta Kwiatkowska (GB) Kai Lampka (SE) Annabelle McIver (AU) Arif Merchant (US) Aad van Moorsel (GB) Gethin Norman (GB) Anne Remke (NL) William Sanders (US) Roberto Segala (IT) Miklos Telek (HU) Bhuvan Urgaonkar (US) Marco Vieira (PT) Verena Wolf (DE) STEERING COMMITTEE: Holger Hermanns (DE) Nathalie Bertrand (FR) Peter Buchholz (DE) Gethin Norman (UK) Andrew S. Miner (US) Susanna Donatelli (IT) William Knottenbelt (UK) Joost-Pieter Katoen (Chair, DE) Peter Kemper (US) Miklos Telek (HU) Gerardo Rubino (FR) Boudewijn Haverkort (NL) From G.Grov at hw.ac.uk Fri Feb 22 07:22:10 2013 From: G.Grov at hw.ac.uk (Grov, Gudmund) Date: Fri, 22 Feb 2013 12:22:10 -0000 Subject: [TYPES/announce] AI4FM 2013 : First Call For Papers (ITP 2013 workshop) Message-ID: <7568D4DEC64B6F429303A520377444C801A314C1@ex10.mail.win.hw.ac.uk> Apologies for multiple copies ---------------------------------------------------- ? AI4FM 2013 - the 4th International Workshop on ? ? the use of AI in Formal Methods ? ? ?? ? ? ? ?http://www.ai4fm.org/ai4fm-2013/ ? ? Rennes, France, 22nd July, 2013 ? ? ?In association with ITP 2013 ---------------------------------------------------- ? ? ? ? ? --- First Call for Papers --- General ------- This workshop will bring together researchers from formal methods and AI; it will address the? issue of how AI can be used to support the formal software development process, including modelling? and proof. Previous AI4FM workshops have included a mix of industrial and academic participants? and we anticipate attracting a similarly diverse audience.? Industrial use of formal methods is certainly increasing but, in order to make it more mainstream,? the cost of applying formal methods, in terms of mathematical skill level and development time,? must be reduced - we believe that AI can help with these issues.? Rigorous software development using formal methods allows the construction of an accurate characterisation? of a problem domain that is firmly based on mathematics; by applying standard mathematical analyses, these? methods can be used to prove that systems satisfy formal specifications. A recent ACM computing survey paper? describes over sixty industrial projects and discusses the effect formal methods have on time, cost and quality.? It shows that with tools backed by mature theory, formal methods are becoming cost effective and their use is? easier to justify, not as an academic exercise or legal requirement, but as part of a business case. Furthermore,? the use of such formal methods is no longer confined to safety critical systems: the list of industrial partners? in the EU-funded DEPLOY project is one indication of this broader use. Most methods tend to fit a ``posit-and-prove''? paradigm where the user posits a development step (expressed in terms of specifications of yet-to-be-realised components)? that has to be justified by proofs. The associated properties that must be verified are often called proof obligations (POs)? or verification conditions. In most cases, such proofs require mechanical support by theorem provers.? One can distinguish between automatic and interactive provers, where the latter are generally more expressive but require? user interaction. AI has had a large impact on the development of provers. In fact, some of the first AI applications were? in theorem proving and all theorem provers now contain heuristics to reduce the search space that can be attributed to AI.? Nevertheless, theorem proving research and (pure) AI research have diverged and theorem proving is barely considered? to be AI-related anymore.? Scope ----- We encourage submissions presenting work in progress, tools under development, and PhD projects, in order that the workshop can become a forum for active dialogue between the groups involved in ?theorem provers, formal methods and artificial intelligence. Particular areas of interest include, but are not limited to: ?* The use of machine learning to support interactive theorem proving; ?* The use of machine learning to enhance automated theorem proving; ?* The development of search heuristics; ?* The us of AI for term synthesis, invariant generation, lemma discovery and concept invention; ?* The use of AI for counter-example generation; ?* The use of AI to support and guide the formal modelling process; ?* The role of AI planning for formal systems developments, from requirements to the end product (including software and hardware); ?* The interplay between reasoning and modelling and the role of AI in this framework; ?* Ontologies in the formal engineering process. Submission ---------- The main aim for the workshop is discussion, thus submissions? do not need to be original. Extended versions of submissions may have been published previously, or submitted concurrently with? or after AI4FM 2013 to another workshop, conference or a journal. Submission is by email to: ? ai4fm2013 at ai4fm.org Please submit an abstract up to 3 pages in a PDF format. The extended abstracts will be handed out to all participants, and will be made into a technical report prior to the workshop.? Acceptance for presentation at the workshop will be made by the organisers based on relevance to the workshop. Important Dates --------------- Submission deadline: April 20, 2013 Notification of acceptance: May 01, 2013 Final version due: May 15, 2013 Workshop: July 22nd, 2013 Organisers ----------------- * Leo Freitas (Newcastle University, UK) * Gudmund Grov (Heriot-Watt University, UK) * Ewen Maclean (University of Edinburgh, UK) Contact Details ---------------- If you have any queries, please email the organisers at the following email address: ? ai4fm2013 at ai4fm.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278. From c.a.j.wingfield at bath.ac.uk Fri Feb 22 14:02:27 2013 From: c.a.j.wingfield at bath.ac.uk (Cai Wingfield) Date: Fri, 22 Feb 2013 19:02:27 +0000 Subject: [TYPES/announce] Final announcement (with programme): Workshop on Algebra, Coalgebra and Topology Message-ID: <7F0B6FA3-7ABF-4B6A-87BE-667B36D82A45@bath.ac.uk> ******************************************************************** Workshop on Algebra, Coalgebra and Topology (part of the Wessex Theory Seminar) University of Bath Friday 1 March 2013 ******************************************************************** The Technische Universitaet Dresden is one of the world's leading centres in clone theory. An abstract clone, with nullary operations, is a mild rephrasing of what category theorists call a Lawvere theory. They are also equivalent to finitary monads, but the equivalence with the latter is far more than mild rephrasing. The notions of abstract clone and Lawvere theory have been developed for several decades largely independently of each other. Much of the development of Lawvere theories has been done in the UK, in recent years primarily in association with the University of Cambridge. Duality has been studied for both, with notions such as coclone, comodel and coalgebra prominent. Both have interacted with computer science, and both have involved relationships with topology. Several of the key researchers in the two fields will meet for a workshop at the University of Bath on Friday 1 March. Before lunch, Mike Behrisch, Sebastian Kerkhoff and Martin Schneider from Dresden will speak on clone theory, explaining the background and current research, with a view towards categories. After lunch, Jiri Adamek and Martin Hyland will speak from a category theoretic perspective; and late in the afternoon, we will have talks more broadly about the topic from Nicolai Vorobjov, Uday Reddy, James Davenport and Sam Staton. We would like to invite others to participate too. If you are interested in coming, please contact Cai Wingfield (C.A.J.Wingfield at bath.ac.uk). Website: http://go.bath.ac.uk/wessex20 PROGRAMME: 10:30 - 11:00 Mike Behrisch "A gentle introduction to clones, their Galois theory, and applications" 11:00 - 11:30 Sebastian Kerkhoff "(Concrete) clones and Pol-Inv vs (Models of) Lawvere theories and ???" 11:30 - 12:00 Martin Schneider "Clones and invariant relations in categories" 1:30 - 2:15 Jiri Adamek "Nondeterministic Closure Automata" 2:15 - 3:00 Martin Hyland "Algebraic theories: a general bicategorical approach" 3:30 - 4:00 Nicolai Vorobjov "Monotone functions and maps" 4:00 - 4:30 Uday Reddy "Automata theory for program semantics" 4:30 - 5:00 James Davenport "What can algebra tell us about pedagogical correctness?" 5:00 - 5:30 Sam Staton "Abstract clones enriched in presheaf categories" Abstracts can be viewed on the website for the event (http://go.bath.ac.uk/wessex20). VENUE: The meeting will be held in the (very pleasant) department lounge of the Department of Computer Science, East Building, University of Bath http://www.bath.ac.uk/about/gettinghere/maps/index.html. By lucky coincidence, the Bath Literature Festival (http://bathlitfest.org.uk) and Bristol Jazz and Blues Festival (http://bristoljazzandbluesfest.com/) will both be happening on the 1st and the days following. REGISTRATION FEE: There is no registration fee, but the meeting will be held on a pay-your-own-everything basis. We will show you suitable places for morning and afternoon teas and for lunch, either sit-down or take-away. TRAVEL FUNDING: The workshop will be part of the Wessex Theory Seminar, so there is a (very) small amount of travel funding available to those people working at Wessex sites go.bath.ac.uk/wessex20. If you would like to apply for it, please email Guy McCusker (G.A.McCusker at bath.ac.uk). ACCOMMODATION: Few people are likely to need accommodation for a one-day meeting, but if you do and need help, please contact us, although you can probably find it as easily on the web as we can, for instance via http://visitbath.co.uk/. You are strongly advised to book accommodation soon, as the Bath Literature Festival starts that day and much of the accommodation we normally recommend is already sold out. Participants might also be interested in the Bristol Jazz Festival, which runs 1-3 May: Bristol is a short train ride from Bath. PROCEEDINGS: We plan to publish an ENTCS post-proceedings of the workshop if we receive a reasonable number of high quality submissions of relevant articles. We can discuss details at the time. The one caveat is that Elsevier now charges $50/paper for publishing in ENTCS, which we may need to pass on to successful authors. From rseba at disi.unitn.it Fri Feb 22 15:06:38 2013 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Fri, 22 Feb 2013 21:06:38 +0100 Subject: [TYPES/announce] PHD positions in SAT/SMT-based Verification available in Trento Message-ID: <20130222200638.GA2036@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 22, 2013 Doctoral Student Positions in Information and Communication Technologies on the research project "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" are 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 - Alessandro Cimatti, FBK, Trento, and - Roberto Sebastiani, DISI, University of Trento. 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 formal verification of systems. This work will be part of the "Advanced SMT Techniques for Word-level Formal Verification - (WOLF)" project, a three-year research project supported by SRC/GRC (http://www.src.org/compete/s201113/), in strict collaboration with the Formal Verification Group at Intel, Haifa, and other major HW companies. The goal of the WOLF project is to provide a comprehensive SMT package to support effective formal verification of systems ranging from RTL circuits all the way up to high-level hardware description languages (e.g. SystemC) and software. The package will be implemented on top of the MathSAT.5 SMT platform (http://mathsat.fbk.eu/), and provided as an API. Ph.D. courses will start in Autumn 2013, and the thesis must be completed in three or four years. People enrolled Ph.D. courses are expected to move to Trento, and will receive monetary support during 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 (in particular C/C++). 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 mandatory, will be considered very favorably: - Satisfiability Modulo Theory (SMT) - Propositional Satisfiability (SAT) - Model Checking - Automated Reasoning - Constraint Solving and Optimization - Embedded Systems Design Languages (e.g. Verilog, VHDL) Applications and Inquiries ========================== Interested candidates should inquire for further information and/or apply by sending email to wolf-recruit at disi.unitn.it 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 WOLF 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, various post-docs and 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 P.D.Mosses at swansea.ac.uk Fri Feb 22 19:48:50 2013 From: P.D.Mosses at swansea.ac.uk (Mosses P.D.) Date: Sat, 23 Feb 2013 00:48:50 +0000 Subject: [TYPES/announce] SLS 2013: Workshop on Scalable Language Specification - CFP Message-ID: <6CBA298C-7205-4BD4-A2F6-E5D68CCFD154@swansea.ac.uk> SLS 2013: Workshop on Scalable Language Specification * June 25?27, 2013, Cambridge, UK * Submission deadline: March 25, 2013 * http://research.microsoft.com/en-us/events/sls2013 The focus of this workshop is on formal language specification frameworks and how they scale up when applied to larger languages. The workshop provides a forum for discussing practical and theoretical issues, and aims to promote dissemination and collaboration between the developers and users of language specification frameworks. Background ========== Many hundreds of programming languages have been designed and implemented, and dozens are currently in widespread use. Older languages evolve to incorporate new features, and new programming languages are continually being developed ? especially domain-specific languages, designed for use in a particular sector. Each language needs to be precisely specified. A specification of a major language usually consists of a succinct formal grammar, determining its syntax, together with a lengthy informal explanation of its intended semantics. Unfortunately, such informal explanations are inherently imprecise, open to misinterpretation, and not amenable to validation. In the few cases where the semantics of major languages have been specified formally, the required effort appears to have been huge, which has discouraged wider adoption of formal semantics. Objectives ========== The workshop gathers together leading researchers working on the development and specification of programming and domain-specific languages. One of the objectives is to clarify which features of the various specification frameworks affect scaling up to major languages. A further objective is to raise awareness of current developments of practical relevance, including tool support for language specification, prototyping, and verification. The invited speakers will present features and applications of particular specification frameworks. The workshop programme will also include presentations of submitted papers, time for informal discussions, and a poster display. Location ======== The workshop will be held at Microsoft Research in Cambridge, UK. Accommodation for a limited number of participants has been reserved at Downing College. Invited speakers ================ ? Egon B?rger (University of Pisa) ? Mark van den Brand (Eindhoven University of Technology) ? Kevin Hammond (University of St Andrews) ? Sir Tony Hoare (Microsoft Research Cambridge) ? Paul Klint (CWI, Amsterdam) ? Shriram Krishnamurthi (Brown University) ? Jos? Meseguer (University of Illinois at Urbana-Champaign) ? Grigore Ro?u (University of Illinois at Urbana-Champaign) ? Dave Schmidt (Kansas State University) ? Peter Sewell (University of Cambridge) Important dates =============== * March 25: Submission deadline * April 15: Author notification * April 29: Registration deadline * May 31: Final versions of papers and posters due * June 25?27: Workshop Submissions =========== Authors who wish to present their research at the workshop are invited to submit an extended abstract of up to 4 pages (including references). Submissions should be in PDF (A4 format) and will be submitted using the EasyChair system by March 25th. A selection will be made by the organisers with the assistance of the invited speakers, based primarily on interest and relevance to the workshop objectives. Proceedings =========== The accepted extended abstracts (and any full papers based on them) will be made available to workshop participants electronically. The workshop proceedings will *not* be formally published; research intended for publication elsewhere (or previously published) can be submitted. Registration ============ Information about registration will be provided closer to the time of the workshop. Posters ======= Registered participants who wish to display a poster related to the workshop objectives should submit the PDF through the EasyChair website. Organisers ========== The workshop is organised and sponsored by Microsoft Research Cambridge in collaboration with the PLanCompS research project. The invited speakers are funded by EPSRC. Andrew Kennedy Programming Principles and Tools Group Microsoft Research Cambridge akenn at microsoft.com Peter Mosses Department of Computer Science Swansea University p.d.mosses at swan.ac.uk -- From Claude.Marche at inria.fr Mon Feb 25 04:24:38 2013 From: Claude.Marche at inria.fr (Claude Marche) Date: Mon, 25 Feb 2013 10:24:38 +0100 Subject: [TYPES/announce] DigiCosme Spring School 2013: call for participation Message-ID: <512B2DD6.9010108@inria.fr> ------------------------------------------------------------------------------ CALL FOR PARTICIPATION Labex DigiCosme - Spring School 2013 *Program Analysis and Verification* Sup?lec, Gif-sur-Yvette, France April 22-26, 2013 http://labex-digicosme.fr/Spring+School+2013 ------------------------------------------------------------------------------ The first spring school organized by Labex DigiCosme will take place from April 22 to April 26, 2013, at the Sup?lec campus of Gif-sur-Yvette, France. The following lectures will be given: * Jean-Christophe Filli?tre LRI, CNRS & University Paris-Sud, Orsay, France "Deductive Program Verification with Why3" * Burkhart Wolff LRI, CNRS & University Paris-Sud, Orsay, France "Model-based Testing with Isabelle-HOL-TestGen" * C?dric Fournet Microsoft Research, Cambridge, UK "Verification of protocols and of their implementations" * Sylvie Putot CEA-List & Ecole Polytechnique, Palaiseau, France "Static analysis of numerical programs and systems" * David Pichardie Inria Rennes & Harvard University, Cambridge, MA, USA "Building verified program analyzers in Coq: a tutorial" The registration to the school is free. It includes the lectures, daily coffee breaks and lunches, and social events. Costs for travel must be supported by participants. A limited number of student rooms are available at the campus. Costs for accomodation must be supported by participants, except for members of DigiCosme. The lectures are intended primarily for doctoral students, and academic or industrial researchers. We expect participants to hold a master's degree in Computer Science, or equivalent, and to have basic knowledge in logic and semantics of computer programs. The number of participants is limited to around 50. To apply, please fill the application form on the web page by *February 28th, 2013*. For more details please see the Web page of the school at http://labex-digicosme.fr/Spring+School+2013 From bruno.blanchet at inria.fr Mon Feb 25 05:32:27 2013 From: bruno.blanchet at inria.fr (Bruno Blanchet) Date: Mon, 25 Feb 2013 11:32:27 +0100 (CET) Subject: [TYPES/announce] CFP: FCS'13 Workshop on Foundations of Computer Security Message-ID: <636600563.3501727.1361788347775.JavaMail.root@inria.fr> +-------------------------------------------------------------------------+ ! ! ! FCS 2013 ! ! Workshop on Foundations of Computer Security ! ! Tulane University, New Orleans, Louisiana, USA ! ! June 29, 2013 ! ! http://prosecco.inria.fr/personal/bblanche/fcs13/ ! ! ! ! Affiliated with LICS 2013 and CSF 2013 ! ! ! +-------------------------------------------------------------------------+ Important dates =============== Submission: April 10, 2013 Notification of acceptance: April 30, 2013 Final papers: May 31, 2013 Invited speaker: Boris K?pf, IMDEA, Spain =============== Background, aim and scope ========================= The aim of the workshop FCS'13 is to provide a forum for continued activity in different areas of computer security, bringing computer security researchers in closer contact with the LICS community and giving LICS attendees an opportunity to talk to experts in computer security, on the one hand, and contribute to bridging the gap between logical methods and computer security foundations, on the other. 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 Foundations of verification Information flow analysis Language-based security Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management for Access control and resource usage control Authentication Availability and denial of service Covert channels Confidentiality Integrity and privacy Intrusion detection Malicious code Mobile code Mutual distrust Privacy 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. FCS'13 welcomes two kinds of submissions - short abstracts (1 page including references) - full papers (at most 15 pages including references) Short abstracts will receive as rigorous review as do full papers. Short abstracts may receive shorter talk slots at the workshop than do full papers, depending on the number of accepted submissions. All papers should be written 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, co-ordinates 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); please, do not send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). The only mechanism for paper submissions is via the dedicated EasyChair submission web page: https://www.easychair.org/conferences/?conf=fcs2013 Please follow the instructions given there. Informal proceedings ==================== The workshop has no published proceedings. Presenting a paper at the workshop should not preclude submission to or publication in other venues. Copies of papers presented at the workshop will be made available in electronic format, but this will not constitute an official proceedings. Program committee ================= * Myrto Arapinis (University of Birmingham, UK) * Aslan Askarov (Harvard University, USA) * Bruno Blanchet (INRIA Paris-Rocquencourt, France, co-chair) * Michael Clarkson (The George Washington University, USA, co-chair) * Sara Foresti (Universita` degli Studi di Milano, Italy) * Deepak Garg (Max Planck Institute for Software Systems, Germany) * Catalin Hritcu (University of Pennsylvania, USA) * Alan Jeffrey (Alcatel-Lucent Bell Labs, USA) * Peeter Laud (Cybernetica AS, Estonia) * Gurvan Le Guernic (DGA Ma?trise de l'Information, France) * Stephen Magill (IDA Center for Computing Sciences, USA) * David Naumann (Stevens Institute of Technology, USA) * Andrei Sabelfeld (Chalmers University of Technology, Sweden) * Santiago Zanella B?guelin (Microsoft Research Cambridge, UK) From katoen at cs.rwth-aachen.de Tue Feb 26 14:06:38 2013 From: katoen at cs.rwth-aachen.de (Joost-Pieter Katoen) Date: Tue, 26 Feb 2013 20:06:38 +0100 Subject: [TYPES/announce] [ETAPS 2013] Final Call for Participation Message-ID: <512D07BE.608@cs.rwth-aachen.de> [We apologise for multiple copies.] ****************************************************************** FINAL CALL FOR PARTICIPATION: ETAPS 2013 European Joint Conferences on Theory And Practice of Software March 16 - March 24, 2013 Rome, Italy http://www.etaps.org/2013 Web-based registration deadline: ** March 8, 2013 ** ****************************************************************** -- 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 six main annual conferences, accompanied by satellite workshops and invited tutorials (new in 2013). ETAPS 2013 is already the sixteenth event in the series. -- MAIN CONFERENCES -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED SPEAKERS -- * Gilles Barthe (Fundaci?n IMDEA Software, Madrid, Spain) * Emily Berger (Univ. of Mussachusetts, Amherst, USA) * Krzysztof Czarnecki (Univ. of Waterloo, Canada) * Cedric Fournet (Microsoft Research, Cambridge, UK) * Orna Grumberg (Technion, Haifa, Israel) * Martin Hofmann (Univ. of Munich, Germany) * Jean-Pierre Hubaux (EPFL, Losanna, Switzerland) * Mark S. Miller (Google Research, USA) -- INVITED TUTORIAL SPEAKERS -- * John C. Mitchell (Stanford Univ., USA) * Martin Fr?nzle (Univ. of Oldenburg, Germany) * Ralf K?sters (Univ. of Trier, Germany) The tutorials take place on Sunday March 17 before ETAPS 2013. -- FRIDAY MARCH 22 EVENT -- On Friday 22, there is a special programm on the occasion of the 90th birthday of Corrado B?hm. Attendance with full ETAPS registration is free. A registration solely for Friday 22, is also possible. -- SATELLITE EVENTS -- 22 satellite workshops will take place before or after ETAPS 2013. ACCAT, AiSoS, BX, DICE, Found. Syst. Spec., HAS, HotSpot, MBT, MEALS, SR, OCCP, and VSSE will take place in the weekend on 16-17 March 2013. Bytecode, CerCo, FESCA, GT-VMT, GRAPHITE, IC1201, MLQA, PLACSE, QAPL, and TERMGRAPH are scheduled for 31 March-1 April 2012. -- REGISTRATION Web-based registration is until March 8, 2013. After that date, only on-site registration will be possible. -- ACCOMMODATION Roma has a huge hotel capacity. You can either arrange your accommodation on your own or find some reserved hotels on the registration page. Such reservations expire on February 15, but new ones will appear after this deadline during the entire registration period. -- HOST CITY -- Rome is the capital of Italy and the country's largest and most populated municipality. The city is located in the central- western portion of the Italian Peninsula, on the Tiber river. Rome's history spans over two and a half thousand years. It was the capital city of the Roman Kingdom, of the Roman Republic and of the Roman Empire, which was a major political and cultural influence in the lands bordering the Mediterranean Sea. Since the 2nd century AD, Rome has been the seat of the Papacy and, after the end of the Byzantine domination, in the eighth century it became the capital of the Papal States. In 1871, Rome became the capital of the Kingdom of Italy, and in 1946 that of the Italian Republic. Rome's influence on western Civilisation can hardly be overstated, and the city is still recognised as a centre of the arts and education. Due to this centrality on many levels, and much of the city's past power and influence, Rome has been nicknamed "Caput Mundi" (Latin for "Capital of the World") and "The Eternal City". -- ORGANIZERS -- The event is organized in Sapienza Universit? di Roma. Sapienza has a very long and prestigious history, it is the largest university in Europe and the second-largest in the world, with more than 150,000 students. * General chair: Daniele Gorla * Conferences Chair: Francesco Parisi Presicce * Workshops Chairs: Paolo Bottoni and Pietro Cenciarelli * Publicity Chair: Ivano Salvo * Finance Chairs: Enrico Tronci and Federico Mari * Web Site Chair: Igor Melatti -- FURTHER INFORMATION -- You can contact the organizers at etaps13 at di.uniroma1.it. From viktor at mpi-sws.org Wed Feb 27 04:23:17 2013 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Wed, 27 Feb 2013 10:23:17 +0100 Subject: [TYPES/announce] POPL 2014: Call for workshops and co-located events Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS POPL 2014 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL: 22-24 January 2014 Events: 19-21, 25-26 January 2014 San Diego, California http://popl.mpi-sws.org/2014/ The 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014) will be held in San Diego, California. POPL provides 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 on principles and innovations are welcome, ranging from formal frameworks to reports on practical experiences. Proposals are invited for workshops and other events to be co-located with POPL 2014. Events can either be sponsored by SIGPLAN (http://acm.org/sigplan/) or supported through in-cooperation status. Workshops should be more informal and focused than POPL itself, include sessions that enable interaction among the workshop attendees, and be fairly low cost. The preference is for one-day workshops, but other schedules will also be considered. ---------------------------------------------------------------------- Submission details Deadline for submission: 26 April 2014 Notification of acceptance: 31 May 2014 A submission form is available here: http://popl.lambda-calcul.us/2014/ Sponsored workshops are required to produce a final report after the workshop has taken place that is suitable for publication in SIGPLAN Notices. Further information about SIGPLAN sponsorship and in-cooperation status of workshops is available here: http://www.sigplan.org/Resources/Proposals/Cooperated http://www.sigplan.org/Resources/Proposals/Sponsored ---------------------------------------------------------------------- Selection committee All event proposals will be evaluated by a committee comprising the following members of the POPL 2014 organising committee, together with the members of the SIGPLAN executive committee. Suresh Jagannathan Purdue University General chair Peter Sewell University of Cambridge Program chair David Van Horn Northeastern University Workshops chair Further information Any queries regarding POPL 2014 co-located event proposals should be addressed to the workshops chair, David Van Horn. From philipp.haller at a3.epfl.ch Wed Feb 27 06:24:56 2013 From: philipp.haller at a3.epfl.ch (Philipp Haller) Date: Wed, 27 Feb 2013 12:24:56 +0100 Subject: [TYPES/announce] CFP Scala 2013 Message-ID: ======================================================================== "Scala 2013" the Fourth Annual Scala Workshop co-located with ECOOP 2013 Montpellier, France July 2nd, 2013 CALL FOR PAPERS http://lamp.epfl.ch/~hmiller/scala2013 ======================================================================== 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. We seek papers on topics related to Scala, including (but not limited to): - Language design and implementation ? language extensions, optimization, and performance evaluation. - Library design and implementation patterns for extending Scala ? embedded domain-specific languages, combining language features, generic and meta-programming. - 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. - Concurrent and distributed programming ? libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. - Safety and reliability ? pluggable type systems, contracts, static analysis and verification, runtime monitoring. - Tools ? development environments, debuggers, refactoring tools, testing frameworks. - Case studies, experience reports, and pearls. 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. In general, papers should explain their original contributions, identifying what has been accomplished, explaining why it is significant, and relating it to previous work (also for other languages where appropriate). Papers in the last category of the list above need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, new Scala idioms, or programming pearls. In all cases, such a paper must make a contribution which is of interest to the Scala community, or from which other members of the Scala community can benefit. Publications at the Scala Workshop represent works-in-progress and are not intended to preclude later publication at any of the main conferences. Though, follow-up submissions do need to conform to the publication policies of the targeted conference, which typically equates to significant extension or refinement of the workshop publication. KEYWORDS: Library Design and Implementation, Language Design and Implementation, Applications, Formal Techniques, Parallelism and Concurrency, Distributed Programming, Tools, Experience Reports, Empirical Studies ## Student Talks ## In addition to regular papers and tool demos, we also solicit short student talks by PhD students. A student talk is not accompanied by a paper (it is sufficient to submit a short abstract of the talk in plain text). Student talks are about 5 minutes long, presenting ongoing or completed research related to Scala, or announcing a project that would be of interest to the Scala community. ## Proceedings ## It is planned to publish accepted papers in the ACM Digital Library, unless the authors choose not to. In case of publication in the ACM Digital Library, authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (see ACM Copyright Policy. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. ## Submission Details ## * Abstract Submission: April 12, 2013 * Paper Submission : April 19, 2013 * Author Notification: May 17, 2013 * Final Papers Due : June 1, 2013 (to be confirmed) * Early Registration : May 31, 2013 Submitted papers should be in portable document format (PDF), formatted using the standard ACM SIGPLAN two-column conference style (10pt format). Regular research papers must not exceed 10 pages, tool demonstration papers and short papers must not exceed 4 pages. "Tool Demos" and "Short Papers" should be marked as such with those words in the title at time of submission. Student talks are not accompanied by papers. Therefore, it is sufficient to only submit a plain-text abstract. "Student Talks" should be marked as such with those words in the title at time of submission. Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scala2013 ## Program Committee ## * Marius Eriksen, Twitter * Viktor Kuncak, EPFL * Mira Mezini, TU Darmstadt * Matt Might, University of Utah * Nate Nystrom, University of Lugano * Bruno Oliveira, National University of Singapore * Kunle Olukotun, Stanford University * Aleksandar Prokopec, EPFL * David Van Horn, Northeastern University * Tobias Wrigstad, Uppsala University ## Organizing Committee ## * Philipp Haller (Chair), Typesafe * Martin Odersky, EPFL * Doug Lea, SUNY Oswego * Heather Miller (Co-Chair), EPFL * Vojin Jovanovic, EPFL ## Links ## * The Scala Workshop 2013 web site: http://lamp.epfl.ch/~hmiller/scala2013 * The ECOOP/ECSA/ECMFA 2013 web site: http://www.lirmm.fr/ec-montpellier-2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From G.A.McCusker at bath.ac.uk Wed Feb 27 06:36:56 2013 From: G.A.McCusker at bath.ac.uk (Guy McCusker) Date: Wed, 27 Feb 2013 11:36:56 +0000 Subject: [TYPES/announce] BCTCS 2013: call for participation. More student bursaries now available! Message-ID: <439040E9-4918-42B7-BD70-CF8E3FB60DF4@bath.ac.uk> British Colloquium for Theoretical Computer Science Bath, UK 24th-27th March 2013 http://cs.bath.ac.uk/bctcs2013 SECOND CALL FOR PARTICIPATION AND CONTRIBUTED TALKS *** NEW!! 6 additional student bursaries available. Apply by March 7th 2013. *** *** Deadline for booking on-campus accommodation: March 5th 2013. Five rooms left! *** Deadline for abstract submission: 10th March 2013 Deadline for registration: 10th March 2013 The 29th British Colloquium for Theoretical Computer Science will be hosted by the Department of Computer Science, University of Bath, from 24th to 27th March 2013. The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. We are pleased to announce that a further 6 fully-funded PhD Student Bursaries are available, covering UK travel, accommodation at the on-campus rate, and full registration. It is easy to apply for one. Please see the website for details. The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK. The colloquium features both invited and contributed talks. This year's invited speakers are Susanne Albers, Humboldt-Universit?t zu Berlin, the LMS-sponsored keynote speaker in Discrete Mathematics Samson Abramsky, University of Oxford Assia Mahboubi, INRIA - ?cole Polytechnique Angela Wallenburg, Altran UK. Participants wishing to give 30 minute contributed talks may simply to submit a title and abstract (100--300 words) by the deadline given below. Further details are available from the Colloquium website: http://cs.bath.ac.uk/bctcs2013 Important dates: 18/1/2013: Registration open 18/1/2013: Abstract submissions open 5/3/2013: Deadline for booking on-campus accommodation 7/3/2013: EXTENDED!! Deadline for application for bursaries 10/3/2013: Deadline for registration 10/3/2013: Deadline for submission of abstracts 24 - 27/3/2013: Colloquium From seidl at in.tum.de Wed Feb 27 10:04:08 2013 From: seidl at in.tum.de (Helmut Seidl) Date: Wed, 27 Feb 2013 16:04:08 +0100 Subject: [TYPES/announce] MOD 2013 - Call for Applications Message-ID: <512E2068.3030307@in.tum.de> Hello, could you please publish the following call for applications? Thank you in advance! Helmut ============================ Our next edition of the *International Summer School Marktoberdorf 2013* on *Software Systems Safety* is ready for application from now and by *March 11, 2013* at the latest. *Lecturers* are Patrice Godefroid (USA), Orna Grumberg (IL), Sumit Gulwani (USA), Gerwin Klein (AUS), Marta Kwiatkowska (UK), Ralf K?sters (D), Rupak Majumdar (D), Sharad Malik (USA), Tobias Nipkow (D), David Sands (S), Helmut Seidl (D), Eran Yahav (IL) The "Marktoberdorf Summer School" is a two weeks' course for young computer scientists and mathematicians working in the field of formal software and systems development. Our challenge is to give in-depth presentations of state-of-the-art topics in formal Software Engineering and to promote international contacts and collaborations with leading researchers and young scientists based on our excellent networking in the Summer School Marktoberdorf series. Further information with lecturer's topics and the application form are available by http://asimod.in.tum.de/ Do you have further questions or are you interested in our poster and flyer, please don't hesitate to contact: Dr. Katharina Spies, asimod at in.tum.de From erwig at eecs.oregonstate.edu Wed Feb 27 11:22:41 2013 From: erwig at eecs.oregonstate.edu (Martin Erwig) Date: Wed, 27 Feb 2013 17:22:41 +0100 Subject: [TYPES/announce] SLE 2013 - Call for Papers Message-ID: <66CED0C6-55CF-4BB0-9DD0-58C1A7037665@eecs.oregonstate.edu> ======================================================================== CALL FOR PAPERS 6th International Conference on Software Language Engineering (SLE 2013) Oct 26-28, 2013, Indianapolis, IN, USA (Co-located with SPLASH 2013 and GPCE 2013) General chair: Eric Van Wyk, University of Minnesota, USA Program co-chairs: Martin Erwig, Oregon State University, USA Richard Paige, University of York, UK Keynote speaker: Don Batory, University of Austin, USA http://planet-sl.org/sle2013 ======================================================================== IMPORTANT DATES Deadline for abstracts: June 7, 2013 (Midnight UTC-8, Pacific Standard Time) Deadline for full papers: June 14, 2013 (Midnight UTC-8, Pacific Standard Time) Notification to authors: August 3, 2013 Camera-ready copies due: August 16, 2013 Conference: October 26 -28, 2013 TYPES OF SUBMISSIONS We solicit the following types of papers: - Research papers: These should report a substantial research contribution to SLE or successful application of SLE techniques or both. Full paper submissions must not exceed 20 pages (in LNCS format). - Industrial experience papers: These papers discuss practical applications of SLE technology with an emphasis on the advantages and disadvantages of the method, techniques, or tools used. These papers must not exceed 10 pages (in LNCS format). - Tool demonstration papers: Because of SLE's ample interest in tools, we seek papers that present software tools related to the field of SLE. These papers will accompany a tool demonstration to be given at the conference. These papers must not exceed 10 pages (in LNCS format). The selection criteria include the originality of the tool, its innovative aspects, the relevance of the tool to SLE, and the maturity of the tool. Papers are submitted via the Easychair system: https://www.easychair.org/conferences/?conf=sle2013 SCOPE The term "software language" refers to artificial languages used in software development. These include general-purpose programming languages, domain-specific languages, modeling and metamodeling languages, data models and ontologies. Examples include general purpose modeling languages such as SysML and UML, metamodeling frameworks such as Ecore, MOF or GOPRR, domain-specific modeling languages for business process modeling, such as BPMN, or embedded systems, such as Simulink or Modelica, and specialized XML-based and OWL-based languages and vocabularies. The term "software language" is intentionally broad; besides the above categories and examples, it also encompasses implicit approaches to language definition, such as APIs and collections of design patterns. Software language engineering is the application of systematic, disciplined, and measurable approaches to the development (design, implementation, testing, deployment), use, deployment, and maintenance (evolution, recovery, and retirement) of these languages. Of special interest are (1) formal descriptions of languages that are used to design or generate language-based tools and (2) methods and tools for managing such descriptions, including modularization, refactoring, refinement, composition, versioning, co-evolution, recovery, and analysis. TOPICS OF INTEREST We solicit high-quality contributions in the area of SLE ranging from theoretical and conceptual contributions to tools, techniques, and frameworks that support the aforementioned lifecycle activities. The topics of interest include, but are not limited to the following: - Formalisms used in designing and specifying languages, and tools that analyze language descriptions - Language implementation techniques: compiler generator tools, attribute grammar systems, term-rewriting systems, functional programming-based combinator libraries; metamodel-based and ontology tools implementing constraint, rule, view, transformation, and query formalisms and engines. - Transformations and transformation languages, as well as program and model transformation tools, and approaches for mapping between ontologies. - Language evolution: Included are extensible languages and type systems and their supporting tools and language conversion tools, approaches for ontology evolution, approaches for impact analysis of language evolution. - Approaches to the elicitation, specification, and verification of requirements for software languages: Examples include the use of requirements engineering techniques in domain engineering and in the development of domain-specific languages and the application of logic-based formalisms for verifying language and domain requirements. - Language development frameworks, methodologies, techniques, best practices, and tools for the broader language lifecycle covering phases such as analysis, testing, and documentation. For example, frameworks for advanced type or reasoning systems, constraint mechanisms, tools for metrics collection and language usage analysis, assessing language usability, documentation generators, visualization backends, generation of tests for language-based tools, knowledge and process management approaches, as well as IDE support for many of these activities are of interest. - Integration and interoperation between different approaches to software language engineering; for example, ways to integrate grammar-based and ontology-based approaches to language definition. - Design challenges in SLE: Example challenges include finding a balance between specificity and generality in designing domain-specific languages, between strong static typing and weaker yet more flexible type systems, or between deep and shallow embedding approaches, as, for example, in the context of adding type-safe XML and database programming support to general-purpose programming languages. - Applications of languages including innovative domain-specific languages or "little" languages: Examples include policy languages for security or service-oriented architectures, web-engineering with schema-based generators or ontology-based annotations. Of specific interest are the engineering aspects of domain-specific language support in all of these cases. The program committee chairs encourage potential contributors to contact them with questions about the scope and topics of interest of SLE. The overall principle of SLE is to be broad-minded and inclusive about relevance and scope, and to invest in community building when soliciting and selecting papers. PROGRAM COMMITTEE Emilie Balland, INRIA, France Olaf Chitil, University of Kent, UK James R. Cordy, Queen's University, Canada Davide Di Ruscio, Universit? degli Studi dell'Aquila, Italy Iavor Diatchki, Galois Inc., USA Anne Etien, LIFL - University of Lille 1, Fance Jean-Marie Favre, University of Grenoble, Fance Dragan Gasevic, Athabasca University, Canada Andy Gill, University of Kansas, USA Jeremy Gibbons, University of Oxford, UK Jeff Gray, University of Alabama, USA Giancarlo Guizzardi, Federal University of Espirito Santo, Brazil Gorel Hedin, Lund University, Sweden Markus Herrmannsdoerfer, Technische Universit?t M?nchen, Germany Zhenjiang Hu, NII, Japan Oleg Kiselyov, USA Paul Klint, Centrum Wiskunde & Informatica, The Netherlands Thomas Kuehne, Victoria University of Wellington, New Zealand Kim Mens, UC Louvain, Belgium Pierre-Etienne Moreau, Ecole des Mines Nancy, France Klaus Ostermann, Marburg University, Germany Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany Fiona Polack, Dept of Computer Science, University of York, UK Lukas Renggli, University of Bern, Switzerland Bernhard Rumpe, RWTH Aachen University, Germany Jo?o Saraiva, Universidade do Minho, Portugal Friedrich Steimann, Fernuniversit?t in Hagen, Germany Gabriele Taentzer, Marburg University, Germany Mark Van Den Brand, TU/e, The Netherlands Jurgen Vinju, Centrum Wiskunde & Informatica, The Netherlands From grlmc at urv.cat Wed Feb 27 14:55:57 2013 From: grlmc at urv.cat (URV - RESEARCH GROUP ON MATHEMATICAL LINGUISTICS) Date: Wed, 27 Feb 2013 20:55:57 +0100 Subject: [TYPES/announce] LATA 2013: call for participation Message-ID: *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ----------------------------------------------------------------------------------------------------------- 7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2013 Bilbao, Spain April 2-5, 2013 http://grammars.grlmc.com/LATA2013/ ---------------------------------------------------------------------------------------------------------- PROGRAMME Tuesday, April 2: 8:00 - 8:50 Registration 8:50 - 9:00 Opening 9:00 - 9:50 Jin-Yi Cai: Complexity Dichotomy for Counting Problems - Invited Lecture 9:50 - 10:00 Break 10:00 - 11:40 Brink Van der Merwe, Mark Farag, Jaco Geldenhuys: Counting Minimal Symmetric Difference NFAs Henning Fernau, Pinar Heggernes, Yngve Villanger: A Multivariate Analysis of Some DFA Problems Rodrigo de Souza: Uniformisation of Two-Way Transducers Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiwara: Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers 11:40 - 12:10 Coffee Break 12:10 - 13:50 Aistis Atminas, Vadim Lozin, Mikhail Moshkov: Deciding WQO for Factorial Languages Eli Shamir: Pumping, Shrinking and Pronouns: from Context Free to Indexed Grammars Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin: How to Travel Between Languages Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra: Execution Information Rate for Some Classes of Automata 13:50 - 15:30 Lunch 15:30 - 17:10 Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot: Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions Stuart Haber, William Horne, Pratyusa Manadhata, Miranda Mowbray, Prasad Rao: Efficient Submatch Extraction for Practical Regular Expression Daniel Goc, Hamoon Mousavi, Jeffrey Shallit: On the Number of Unbordered Factors J?rg Endrullis, Clemens Grabmayer, Dimitri Hendriks: Mix-Automatic Sequences 17:10 - 17:20 Break 17:20 - 18:10 Jo?l Ouaknine: Discrete Linear Dynamical Systems (I) - Invited Tutorial Wednesday, April 3: 9:00 - 9:50 Jo?l Ouaknine: Discrete Linear Dynamical Systems (II) - Invited Tutorial 9:50 - 10:00 Break 10:00 - 11:40 Giorgio Delzanno, Riccardo Traverso: Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks Tim Smith: Infiniteness and Boundedness in 0L, DT0L, and T0L Systems Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wasowski: Maximizing Entropy over Markov Processes Olga Tveretina: A Conditional Superpolynomial Lower Bound for Extended Resolution 11:40 - 12:10 Coffee Break 12:10 - 13:50 Sebastian Bala, Artur Koninski: Unambiguous Automata Denoting Finitely Sequential Functions Benedikt Bollig, Aiswarya Cyriac, Lo?c H?lou?t, Ahmet Kara, Thomas Schwentick: Dynamic Communicating Automata and Branching High-Level MSCs Parisa Babaali, Christopher Knaplund: On the Construction of a Family of Automata that are Generically Non-Minimal Sebastian Bala, Dariusz Jackowski: Limited Non-Determinism Hierarchy of Counter Automata 13:50 - 15:30 Lunch 15:30 - 16:20 Rusin? Freivalds, Thomas Zeugmann, Grant Pogosyan: On the Size Complexity of Deterministic Frequency Automata Johanna Bj?rklund, Henning Fernau, Anna Kasprzik: MAT Learning of Universal Automata 16:20 - 16:30 Break 16:30 - 17:20 Luke Ong: Recursion Schemes, Collapsible Pushdown Automata, and Higher-Order Model Checking (I) - Invited Tutorial 17:30 Visit to the City Thursday, April 4: 9:00 - 9:50 Luke Ong: Recursion Schemes, Collapsible Pushdown Automata, and Higher-Order Model Checking (II) - Invited Tutorial 9:50 - 10:00 Break 10:00 - 11:40 Victor Selivanov, Anton Konovalov: Boolean Algebras of Regular ?-Languages Angelo Montanari, Pietro Sala: Interval Logics and ?B-Regular Languages Karin Quaas: Model Checking Metric Temporal Logic over Automata with one Counter Takahito Aoto, Munehiro Iwami: Termination of Rule-Based Calculi for Uniform Semi-Unification 11:40 - 12:10 Coffee Break 12:10 - 13:50 Jurriaan Rot, Marcello Bonsangue, Jan Rutten: Coinductive Proof Techniques for Language Equivalence Xiaojie Deng, Yu Zhang, Yuxin Deng, Farong Zhong: The Buffered p-calculus: A Model for Concurrent Languages Michael Luttenberger, Maximilian Schlund: Convergence of Newton's Method over Commutative Semirings Milka Hutagalung, Martin Lange, Etienne Lozes: Revealing vs. Concealing: More Simulation Games for B?chi Inclusion 13:50 - 15:30 Lunch 15:30 - 17:10 Oscar Ibarra, Bala Ravikumar: On Bounded Languages and Reversal-Bounded Automata Katsuhiko Nakamura, Keita Imada: Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars V?ronique Bruy?re, Marc Ducobu, Olivier Gauwin: Visibly Pushdown Automata: Universality and Inclusion via Antichains Florent Jacquemard, Michael Rusinowitch: Rewrite Closure and CF Hedge Automata 17:10 - 17:20 Break 17:20 - 18:10 Thomas Schwentick: XML Schema Management: a Challenge for Automata Theory - Invited Lecture Friday, April 5: 9:00 - 9:50 Kousha Etessami: Algorithms for Analyzing and Verifying Infinite-state Recursive Probabilistic Systems - Invited Lecture 9:50 - 10:00 Break 10:00 - 11:40 Friedrich Otto: Asynchronous PC Systems of Pushdown Automata Stanislav ??k, Jir? ??ma: A Turing Machine Distance Hierarchy ?ric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi: From Regular Tree Expression to Position Tree Automaton Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan: On The Complexity of Shortest Path Problems on Discounted Cost Graphs 11:40 - 12:10 Coffee Break 12:10 - 13:50 Francine Blanchet-Sadri, Justin Lazarow: Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem Daniel Goc, Kalle Saari, Jeffrey Shallit: Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu: A Graph Polynomial Approach to Primitivity Luke Schaeffer: Ostrowski Numeration and the Local Period of Sturmian Words 13:50 - 15:30 Lunch 15:30 - 16:45 Seppo Sippu, Eljas Soisalon-Soininen: Online Matching of Multiple Regular Patterns with Gaps and Character Classes Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk: Duplication-Loss Genome Alignment: Complexity and Algorithm Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing 16:45 - 16:55 Break 16:55 - 17:45 Andrei Voronkov: The Lazy Reviewer Assignment Problem in EasyChair - Invited Lecture 17:45 Closing From jonathanheras at computing.dundee.ac.uk Thu Feb 28 07:09:11 2013 From: jonathanheras at computing.dundee.ac.uk (Jonathan Heras) Date: Thu, 28 Feb 2013 12:09:11 +0000 Subject: [TYPES/announce] Final Call for Contributions: Automated Reasoning Workshop, April 2013, Dundee Message-ID: <512F48E7.1050405@computing.dundee.ac.uk> ******************************************************** 20th Automated Reasoning Workshop (ARW'13) School of Computing, University of Dundee, UK www.computing.dundee.ac.uk/staff/katya/arw2013 FINAL CALL FOR CONTRIBUTIONS DEADLINE ********************************************************************* Reminder: submission deadline is approaching (3 March 2013), see http://www.computing.dundee.ac.uk/staff/katya/arw13/grants.html for more details. ********************************************************************* GENERAL INFORMATION The 20th Automated Reasoning Workshop (ARW 2013) will be held at the University of Dundee on 11-12 April 2013. This year, the workshop is supported by the Scottish Informatics and Computer Science Alliance (SICSA) and the British Logic Colloquium (BLC). SCOPE The workshop provides an informal forum for the automated reasoning community to discuss recent work, new ideas and applications, and current trends. It aims to bring together researchers from all areas of automated reasoning in order to foster links among researchers from various disciplines; among theoreticians, implementers and users alike. Topics include but are not limited to: - Theorem proving in classical and non-classical logics; - Interactive theorem proving, logical frameworks, proof assistants, proof planning - Reasoning methods: Saturation-based, instantiation-based, tableau, SAT Equational reasoning, unification Constraint satisfaction Decision procedures, SMT Combining reasoning systems Non-monotonic reasoning, commonsense reasoning, Abduction, induction Model checking, model generation, explanation - Formal methods to specifying, deriving, transforming and verifying computer systems, requirements and software - Logic-based knowledge representation and reasoning: Ontology engineering and reasoning Domain specific reasoning (spatial, temporal, epistemic,agents, etc) - Logic and functional programming, deductive databases - Implementation issues and empirical results, demos - Practical experience and applications of automated reasoning The workshop will be highly interactive, giving all attendees an opportunity to participate. There will be sessions for displaying posters and presenting system demonstrations, and open discussion sessions organised around specific topics: this year, the two chosen topics will be Machine Learning in Automated Reasoning and Automated Reasoning in Economics . The discussion sessions will follow the invited lectures devoted to these topics. INVITED SPEAKERS Joseph Urban, Radboud University Invited lecture "Machine Learning in Automated Reasoning", followed by the discussion session. 11 April 2012. Manfred Kerber, University of Birmingham Invited lecture "Automated Reasoning for Economics" followed by the discussion session, 12 April 2012. SUBMISSIONS We invite the submission of camera-ready, two-page extended abstracts about recent work, work in progress, or a system description. The abstract can describe work that has already been published elsewhere. The main objective of the abstracts is to spread information about recent work in our community, and we expect to accept most on-topic submissions, but we may ask for revisions. To prepare your submission, please use the ARW LaTeX style file provided from the workshop website. Each submission should include the names and complete addresses (including email) of all authors. Correspondence will be sent to the first author, unless otherwise indicated. Submissions should be sent using Easychair. For the final versions we require all sources (tex file and any input files). PUBLICATION DETAILS Abstracts will be published in informal workshop notes and will be made available on the workshop page. PRESENTATIONS Each workshop participant will be allocated a 10-15 minute slot (depending on time constraints), for a short talk to introduce their research. Each participant will also be allocated space in a poster session (poster size up to A0), where they can further present and discuss their work. Please prepare posters for the event. STUDENT GRANTS As it is a SICSA sponsored event, students from SICSA institutions do not pay registration fees. For all other PhD students, there is a limited number of grants available. The application deadline is 18 February 2013. Please refer to the workshop website for details. REGISTRATION FEES Regular registration fee - 110 Student registration fee - 80 Student from a SICSA institution - FREE Extra dinner ticket - 40 IMPORTANT DATES 18 Feb 2013 Student grant application deadline 3 Mar 2013 Abstract submission deadline 8 Mar 2013 Abstract notification 25 Mar 2013 Final version due 11-12 Apr 2013 Workshop ARW ORGANISING COMMITTEE Alexander Bolotov Simon Colton David Crocker Louise Dennis Clare Dixon Jacques Fleuriot Ullrich Hustadt Mateja Jamnik Katya Komendantskaya Alice Miller Renate Schmidt Volker Sorge LOCAL ORGANISERS Katya Komendantskaya J?nathan Heras CONTACT Please address any queries about the workshop to the organisers at arworkshop2013 at gmail.com. The University of Dundee is a Scottish Registered Charity, No. SC015096. From invitation at ira.uka.de Thu Feb 28 11:27:03 2013 From: invitation at ira.uka.de (ASE2013) Date: Thu, 28 Feb 2013 17:27:03 +0100 Subject: [TYPES/announce] Call for Papers - ASE 2013 Message-ID: <512F8557.6050703@ira.uka.de> CALL FOR PAPERS 28th IEEE/ACM International Conference on Automated Software Engineering ASE 2013 http://ase2013.org November 11th - 15th 2013, Silicon Valley, California * Conference * Tool Demos * Workshops * Tutorials * Doctoral Symposium * IMPORTANT DATES Abstract Submission: May 10, 2013 Paper Submission: May 17, 2013 Notification: July 24, 2013 Tool Demonstration Paper Submission: June 6, 2013 Workshop Proposal Submission: April 26, 2013 Workshop Paper Submission: August 9, 2013 Tutorial Proposal Submission: July 5, 2013 Doctoral Symposium Submission: July 10, 2013 GENERAL THEME The IEEE/ACM Automated Software Engineering (ASE) Conference series is the premier research forum for automating software engineering. Each year, it brings together researchers and practitioners from academia and industry to discuss foundations, techniques and tools for automating the analysis, design, implementation, testing, and maintenance of large software systems. === MAIN CONFERENCE PAPERS ============================================= [http://ase2013.org/calls.html] ASE 2013 invites high quality contributions describing significant, original, and unpublished results for submission in three categories: 1. Technical Research Papers should describe innovative research in automating software development activities or automated support to users engaged in such activities. They should describe a novel contribution to the field and should carefully support claims of novelty with citations to the relevant literature. Where a submission builds upon previous work of the author(s), the novelty of the new contribution must be clearly described with respect to the previous work. Papers should also clearly discuss how the results were validated. 2. Experience Papers should describe a significant experience in applying automated software engineering technology and should carefully identify and discuss important lessons learned so that other researchers and/or practitioners can benefit from the experience. Of special interest are experience papers that report on industrial applications of automated software engineering. 3. New Ideas Papers (new category!) should describe novel research directions in automating software development activities or automated support to users engaged in such activities. New ideas submissions are intended to describe well- defined research ideas that are at an early stage of investigation and may not be fully validated. SUBMISSION All submissions must come in PDF format and conform, at time of submission, to the IEEE Formatting Guidelines. For details and templates, see: http://www.conference-publishing.com/Instructions.php?Event=ASE13 Technical Research Papers and Experience Papers must not exceed 10 pages (including figures and appendices) plus up to 1 page that contains ONLY references. New Idea Papers must not exceed 6 pages (including figures, appendices AND references). Submissions that do not adhere to these limits or that violate the formatting guidelines will be desk-rejected without review. All submissions must be in English. The submission site will be posted on the conference website (http://ase2013.org). Papers submitted to ASE 2013 must not have been previously published and must not be under review for publication elsewhere. All papers that conform to submission guidelines will be peer-reviewed by members of the Program Committee and members of the Expert Review Panel. Submissions will be evaluated on the basis of originality, soundness, importance of contribution, evaluation, quality of presentation and appropriate comparison to related work. Note that the Program Committee may re-assign a submission into a different category than the one it is submitted to if it decides that it is a better fit for that category. All accepted papers have to be presented at the conference by one of the authors and will be published by IEEE. === TOOL DEMONSTRATIONS ================================================ [http://ase2013.org/tools.html] Automated software engineering consists of automating processes related to requirements, design, implementation, testing, and maintenance of software systems. The automated processes facilitate better productivity and improve the overall quality of software. Tool development is an integral part of automated software engineering. The tool demonstrations track provides an opportunity for researchers and practitioners to present and discuss the most recent advances, experiences, and challenges in the field of automated software engineering. The ASE conference solicits high-quality submissions for its tool demonstrations track. We invite submission on tools that are (a) early research prototypes or (b) mature tools that have not yet been commercialized. The submissions should highlight the underlying scientific contributions, engineering ingenuity, applicability to a broader software engineering community, and scalability of the tool. In contrast to a research paper which is intended to provide details of a novel automated software engineering technique, a tool demonstration paper should provide an overview of how the technique has been implemented as a functioning tool. Authors of regular research papers are thus encouraged to submit an accompanying tool demonstration paper. EVALUATION The tool demonstration program committee will review each submission to assess the relevance and quality of the proposed tool demonstration in terms of usefulness of the tool, presentation quality, and appropriate discussion of related tools. Accepted tool demonstrations will be allocated 4 pages in the conference proceedings. Demonstrators will be invited to give a presentation of the tool during the conference. There will also be an area open to attendees at scheduled times during the conference during which demonstrators can present live demonstrations. Presentation at the conference is a requirement for publication. Prizes will be given for an overall best tool demonstration and a best student tool demonstration where a student is the first author on the paper and presents the demonstration. The prizes will be decided based on the votes of the conference attendees. SUBMISSION Submissions should: * Consist of a proposal of at most 4 pages that adheres to the ASE 2013 proceedings format (IEEE proceedings style). The proposal should provide an overview of the tool, how it relates to other industrial or research tools, including references, and its potential impact to a broader software engineering community. * Provide a link to a video, not more than 5 minutes long, that demonstrates the tool being used. The goal of the video is to provide the reviewers a usage overview of the tool that enables them to evaluate the tool. A screencast of the tool demo with a voice-over can be used for the video. * Provide a URL from which the tool can be downloaded, with clear installation steps. If the tool cannot be made available, the authors must clearly state their reasons in the paper. Examples and scenarios presented in the paper should be independently replicable. * Be submitted by June 6, 2013 via EasyChair: https://www.easychair.org/conferences/?conf=ase2013tools Contact: asetools2013 at easychair.org === WORKSHOPS ========================================================= [http://ase2013.org/workshops.html] A workshop co-located with the ASE 2013 conference should provide an opportunity for exchanging views, advancing ideas, and discussing preliminary results on topics related to Automated Software Engineering. Workshops may also serve as platforms to nurture new scientific communities. Workshops should not be seen as an alternative forum for presenting full research papers. The workshops co-located with the conference will be organized before the main conference (Monday, Tuesday). The organizers will decide the exact day after the proposals have been reviewed and accepted. A workshop may last one or two days. SUBMISSION Proposals for organizing workshops should be written in English, limited to 5 pages (in IEEE format), and submitted in PDF to both workshop co-chairs, by email at ase2013workshops at easychair.org. Workshop proposals should include the following information: * Theme and goals of the workshop including its relevance to the field of Automated Software Engineering * Targeted audience and the expected number of participants (minimum and maximum) * Workshop format (e.g., paper presentations, breakout sessions, panel-like discussions, combination of formats) * The equipment, room capacity, and any other resource necessary for the organization of the workshop * Participant solicitation and selection process * Workshop publicity strategy that the workshop organizers will use * Brief description of the organizer's background, including relevant past experience on organizing workshops and contact information * Initial version of the call for papers that the workshop organizers intend to use * Preferences for workshop dates, duration (1 or 2 days), and any other scheduling constraints Note that the workshop co-chairs will consider the preference of workshop dates specified by the organizers, but the acceptance of a workshop proposal does not guarantee adherence to the requested date/time. The workshop co- chairs will assume that workshop proposers will be able to run a workshop on the dates that ASE 2013 has reserved for workshops. Review Process. Workshop proposals will be reviewed by the ASE 2013 tutorials and workshop co-chairs. Acceptance will be based on an evaluation of the workshop's potential for generating useful results, the timeliness and expected interest in the topic, the organizer's ability to lead a successful workshop, and the potential for attracting a sufficient number of participants. Accepted workshops must adhere to the common deadlines listed below for submissions of papers, acceptance of papers, and preparation of proceedings. Contact. ase2013workshops at easychair.org === TUTORIALS ========================================================== [http://ase2013.org/tutorials.html] Tutorials may address a wide range of mature topics from theoretical foundations to practical techniques and tools for automated software engineering. The tutorials will be organized before the main conference (Monday, Tuesday). The organizers will decide the exact day after the proposals have been reviewed and accepted. Tutorials are intended to provide independent instruction on a relevant theme; therefore, no commercial or sales-oriented proposals will be accepted. SUBMISSION Instructors are invited to submit proposals for half-day or full-day tutorials and, upon selection, are required to provide tutorial notes or a survey paper on the topic of presentation in PDF. Proposals for organizing tutorials should be written in English, limited to 5 pages (in IEEE format), and submitted in PDF to both tutorials co-chairs, by email at: ase2013tutorials at easychair.org. Tutorial proposals should include the following information: * Name and affiliation of the proposer/organizer (including postal address, phone number, fax number, e-mail address) * Name and affiliation of each additional instructor * Instructors' experience in the area, including other tutorials, courses, etc. * Title, objective, abstract, duration * Outline with approximate timings * Target audience, including indication of level (novice, intermediate, expert) * Assumed background of attendees * Brief biography of each instructor (for publicity materials) * Indication of whether a survey paper will be provided (max. 30 IEEE-formatted pages) * History of the tutorial (if it has been already presented; provide location, estimated attendance, etc.) * Justification for full day (if a full day is proposed) * Audio-visual and technical requirements * References including the proposers' papers on the subject * Preferences for tutorial date, duration (half-day or full-day), and any other scheduling constraints Preferences for tutorial date, duration (half-day or full-day), and any other scheduling constraints Note that the tutorial co-chairs will consider the preference of tutorial dates specified by the organizers, but the acceptance of a tutorial proposal does not guarantee adherence to the requested date/time. The tutorial co-chairs will assume that tutorial proposers will be able to run a tutorial on the dates that ASE 2013 has reserved for tutorials. Review Process. Tutorial proposals will be reviewed by the ASE 2013 tutorials and workshop co-chairs. Acceptance will be based on the timeliness and expected interest in the topic, the proposer's ability to present an interesting tutorial, and the potential for attracting a sufficient number of participants. Contact. ase2013tutorials at easychair.org === DOCTORAL SYMPOSIUM ================================================= [http://ase2013.org/ds.html] The goal of the ASE 2013 Doctoral Symposium is to provide a supportive yet questioning setting in which the PhD students have an opportunity to present and discuss their research with other researchers in the ASE community. The Symposium aims to provide students with useful guidance and feedback on their research and to facilitate their networking within the scientific community by interacting with established researchers and with their peers at a similar stage in their careers. The technical scope of the Symposium is that of ASE. Students should consider participating in the Doctoral Symposium after they have settled on a dissertation topic with some initial research results. Students should be at least a year from completion of their dissertation (at the time of the Symposium), to obtain maximum benefit from participation. The Doctoral Symposium is open to Ph.D. students at any stage of their research, whereby students at the initial stage (first or second year) will be able to challenge their ideas and current research directions, while students at a more mature stage (third or fourth year) will be able to present their thesis and get advice for improvement and for better exposition of their contributions and conclusions. Attendance is open to students of accepted research abstracts and Doctoral Symposium committee members. EVALUATION The Doctoral Symposium Committee will select participants using the following criteria: * The potential quality of the research and its relevance to ASE * Quality of the research abstract. * Diversity of background, research topics and approaches. Students should not infer that a list of prior publications is in any way expected or required; we welcome submissions from students for whom this will be their first formal submission as well as those who have previously published SUBMISSION To apply as a student participant in the Doctoral Symposium, you should prepare a submission package consisting of two parts, both of which must be submitted by the submission deadline. Part 1: Research Abstract (max. 4 pages). Your research abstract must conform to the ASE 2013 formatting and submission instructions and should cover: * Your targeted research problem with justification of its importance * Discussion why related and prior work has not solved the problem * A sketch of the proposed approach or solution * The expected contributions of your dissertation research * Progress you have made so far in solving the stated problem * The methods you are using or will use to carry out your research * A plan for evaluating your work and presenting credible evidence of your results to the research community * A list of any publications either appeared, accepted or submitted for which the student is an author. Students at the initial stage of their research might have some difficulty in addressing some of these areas, but should make their best attempt. The research abstract should include the title of your work, your name, your advisor, your email address, postal address, personal website, and a one paragraph short summary in the style of an abstract for a regular paper. Please submit your research abstract using the EasyChair submission site: https://www.easychair.org/conferences/?conf=dsase13 Part 2: Letter of Recommendation. Please ask your dissertation advisor for a letter of recommendation. This letter should include your name and a candid assessment of the current status of your dissertation research and an expected date for dissertation submission. The letter should be in Adobe Portable Document Format (PDF), and sent to: Marsha Chechik and Paul Gruenbacher at ase-org at cs.toronto.edu with the subject: ASE 2013 DOCTORAL SYMPOSIUM RECOMMENDATION. Acceptance. All accepted papers will be published by IEEE. Authors of accepted contributions will receive further instructions for preparing their camera ready versions. Authors must register for the ASE 2013 Doctoral Symposium and present their work at the Symposium. === ORGANIZATION ======================================================= General Chair Ewen Denney, SGT / NASA Ames Program Chairs Tevfik Bultan, University of California, Santa Barbara Andrease Zeller, Saarland University, Saarbruecken Program Committee Andrew Begel, Microsoft Research Myra Cohen, University of Nebraska - Lincoln Danny Dig, University of Illinois at Urbana-Champaign Bernd Fischer, Stellenbosch University / University of Southampton Gordon Fraser, University of Sheffield Harald Gall, University of Zurich Dimitra Giannakopoulou, NASA Ames Research Center Alex Groce, Oregon State University Paul Gruenbacher, Johannes Kepler University Linz Arie Gurfinkel, Carnegie Mellon University US William G.J. Halfond, University of Southern California Mark Harman, University College London Sunghun Kim, The Hong Kong University of Science and Technology David Lo, Singapore Management University Shahar Maoz, Tel Aviv University Darko Marinov, University of Illinois at Urbana Champaign Tim Menzies, West Virginia University Mira Mezini, Technische Universitaet Darmstadt Tien Nguyen, Iowa State University Corina Pasareanu, CMU, NASA Ames Lori Pollock, University of Delaware Martin Robillard, McGill University Grigore Rosu, University of Illinois at Urbana Champaign Abhik Roychoudhury, National University of Singapore Gabriele Taentzer, Philipps Universitaet Marburg Nikolai Tillmann, Microsoft Research Sebastian Uchitel, Universidad de Buenos Aires/Imperial College London Willem Visser, Stellenbosch University Lu Zhang, Peking University Charles Zhang, Hongkong University of Science and Technology Doctoral Symposium Co-Chairs Marsha Chechik, University of Toronto Paul Gruenbacher, Johannes Kepler University Linz Doctoral Symposium Committee Jamie H. Andrews, University of Western Ontario Myra B. Cohen, University of Nebraska - Lincoln Elisabetta Di Nitto, Politecnico di Milano Darko Marinov, University of Illinois at Urbana-Champaign Charles Pecheur, Universite Catholique de Louvain Andrea Zisman, City University London Workshop and Tutorial Co-Chairs Marcelo d'Amorim, Federal University of Pernambuco David Lo, Singapore Management University Tool Demonstration Chairs Andrew Ireland, Heriot-Watt University Neha Rungta, SGT / NASA Ames Finance & Local Arrangements Ganesh Pai, SGT / NASA Ames Publicity Chair Christoph Gladisch, Karlsruhe Institute of Technology Social Media Chair Tien Nguyen, Iowa State University From wadler at inf.ed.ac.uk Thu Feb 28 11:46:06 2013 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Thu, 28 Feb 2013 16:46:06 +0000 Subject: [TYPES/announce] Post-Doc and PhD positions at Edinburgh, Glasgow, and Imperial Message-ID: -------------------------------------------------------------------------- >From Data Types to Session Types: A Basis for Concurrency and Distribution -------------------------------------------------------------------------- Post-Doc and PhD positions at Edinburgh University, Glasgow University, and Imperial College London We will soon be recruiting for a number of post-doc positions and PhD studentships on a new project funded by EPSRC, the UK science funding agency. The title of the project is "From Data Types to Session Types: A Basis for Concurrency and Distribution", and its goal is to further develop the theory and practice of session types for structuring concurrent and distributed software. The project has particular emphasis on putting theory into practice, by embedding session types in a range of programming languages and applying them to realistic case studies. The research programme includes collaboration with Amazon, Cognizant, Red Hat, VMware, and the NSF-funded Ocean Observatories Initiative. A brief summary of the project is reproduced at the end of this message. The project is funded for 5 years from 1st June 2013. The following positions will be available: School of Informatics, University of Edinburgh: 1 post-doc, 1 PhD School of Computing Science, University of Glasgow: 2 post-docs, 1 PhD Department of Computing, Imperial College London: 2 post-docs, 1 PhD Post-doc positions will be for an initial period of 2 years, from 1st June or as soon as possible thereafter, with the possibility of extension. PhD studentships will be for 3.5 years from 1st October (available to UK/EU residents only). There will be a further 3 PhD studentships, one at each university, from 1st October 2014. Candidates for the post-doc positions will need to have expertise in programming language design (including formal semantics and type theory) and implementation. Different positions will be suitable for different points on the theory/practice spectrum. We will be especially interested in candidates with a combination of theoretical and practical skills. PhD candidates should have an interest in the same topics. We seek applicants at an international level of excellence. The computing departments at Edinburgh, Glasgow, and Imperial are among the strongest in the world, and Edinburgh, Glasgow, and London are known as cultural centres providing a high quality of life. The positions have not yet been set up within the universities' recruitment systems, but we are announcing them now so that interested candidates can contact us informally. We will send a second advert with full details of how to apply, deadlines, salaries, employment conditions, etc, as soon as possible. Anyone interested in either the post-doc positions or the PhD studentships is invited to contact the investigators: Philip Wadler, University of Edinburgh (wadler at inf.ed.ac.uk) Simon Gay, University of Glasgow (Simon.Gay at glasgow.ac.uk) Nobuko Yoshida, Imperial College London (N.Yoshida at imperial.ac.uk) ---------------------- Summary of the Project ---------------------- We aim to solve computing's most pressing problem - concurrency and distribution - by adapting computing's most successful solution - the data type. Data types codify the structure of data; session types codify the structure of communication. Session types will enable a revolution in the development of concurrent and distributed software, making it cheaper to construct and maintain, and more reliable. Concurrency and distribution are computing's most pressing problem: unless we discover a way to routinely and reliably build concurrent and distributed systems, a half century of unprecedented technical progress will draw to a close. We are approaching the 50th anniversary of Moore's Law, the observation that component counts and clock speeds double every 18 months. No exponential improvement can continue forever, and recently this rule has changed: clock speeds now remain fixed while the number of processors doubles, so exploitation of concurrency is essential. Meanwhile, everyone now has a computer in their pocket, and these computers depend crucially on communication to achieve their function. We inhabit a world of web applications, cloud services, and mobile apps: society increasingly depends on a technological infrastructure of concurrent and distributed systems. Programming concurrent and distributed systems is notoriously difficult. Many solutions are based on shared memory, which requires the programmer to reason about every possible interleaving by which many processors access a common resource. Shared memory scales only to a certain point; it is not appropriate for programming the server farms that drive the web or for mobile applications. The most successful solutions so far appear to be those that replace shared memory with communication as the central structuring technique. Communication usually centres around the notion of a protocol, a series of operations in a specific order. However, direct support for protocols at the language level has been lacking, as compared with data types. The data type is computing's most successful solution. Data types appear from the oldest programming language to the newest, and cover concepts ranging from a single byte to organised tables containing information on customers and orders. Types act as the fundamental unit of compositionality: the first thing a programmer writes or reads about each method is its data type, and type discipline guarantees that each call of a method matches its definition. Data types play a central role in all aspects of software, from architectural design to interactive development environments to efficient compilation. The analogue of the data type for concurrency and distribution is the session type. A session type codifies the notion of a protocol. Session types build on data types, as data types specify the lowest level of data exchange, upon which more complex protocols are built. Just as type discipline matches use and definition of a method, so session types ensure consistency between the two ends of a communication. We expect session types to play a role in all aspects of software. Today, architects discuss the high-level structure of a system in terms of its types, but must resort to informal notions of protocol to describe communication; in future, they will describe communication in terms of session types. Today, programmers use tools that let them search for methods and modules based on their type, and give immediate feedback if their program violates type discipline, but must resort to informal notions of protocol when coding communications; in future, they will search for components based on their session type, and get immediate feedback if their program violates session type discipline. Today, software tools exploit types to optimise code, but cannot exploit the informal notions of protocol to optimise communication; in future, communication middleware will exploit session types to support efficient messaging. -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: not available URL: From nswamy at microsoft.com Thu Feb 28 14:15:58 2013 From: nswamy at microsoft.com (Nikhil Swamy) Date: Thu, 28 Feb 2013 19:15:58 +0000 Subject: [TYPES/announce] CFP: PLAS 2013 (Deadline extended to March 4) Message-ID: <7a17c9fbd2814d739d4a7697e602596f@BY2PR03MB075.namprd03.prod.outlook.com> SUBMISSION DEADLINE EXTENDED TO MARCH 4, 2013 ------------------------------------------------------------------------------- ACM SIGPLAN Eighth Workshop on Programming Languages and Analysis for Security (PLAS) June 20, 2013 Seattle, USA Co-located with PLDI 2013 http://research.microsoft.com/en-us/events/plas2013/ 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. -------------------------------------------------------------------------------- Important Dates Submissions due: March 4, 2013 (anywhere on Earth) Notification: April 5, 2013 PLAS 2013 workshop: June 20, 2013 -------------------------------------------------------------------------------- Call for papers 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 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: to the title of the submitted paper. The submission site is open: https://www.easychair.org/conferences/?conf=plas2013 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 more 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 Aslan Askarov (Harvard University) Karthikeyan Bhargavan (INRIA) Nataliia Bielova (INRIA-Rennes) Vinod Ganapathy (Rutgers) Ana Almeida Matos (Instituto Superior T?cnico and Instituto de Telecomunica??es) Prasad Naldurg (co-chair) (MSR India) Grigore Rosu (University of Illinois at Urbana-Champaign) Nikhil Swamy (co-chair) (MSR Redmond) Ankur Taly (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From dargenio at famaf.unc.edu.ar Sat Mar 2 00:51:12 2013 From: dargenio at famaf.unc.edu.ar (Pedro R. D'Argenio) Date: Sat, 2 Mar 2013 02:51:12 -0300 Subject: [TYPES/announce] QEST 2013 - Deadline extended one week Message-ID: [We apologise for multiple copies.] -------------------------------------------------------------------------------- Last Call for Papers DEADLINE EXTENDED 10th International Conference on Quantitative Evaluation of SysTems QEST 2013 http://www.qest.org/qest2013/ August 26th-30th, 2013 - Buenos Aires, Argentina Co-located with CONCUR, FORMATS, and TGC IMPORTANT DATES: Abstract submission 11 March 2013 (new) Paper submission 18 March 2013 (new) Author notification 12 May 2013 Final version 2 June 2013 INVITED SPEAKERS: Lorenzo Alvisi, University of Texas Austin, USA Dimitra Giannakopoulou, NASA Ames Research Center, USA Edmundo de Souza e Silva, Federal University of Rio de Janeiro, Brazil SCOPE AND TOPICS: QEST is the leading forum on evaluation and verification of computer systems and networks, through stochastic models and measurements. QEST has a broad range of interests - the common thread is that the evaluation be quantitative. The range of performance metrics of interest spans classical measures involving performance and reliability, as well as quantification of properties that are classically qualitative, such as safety, correctness, and security. QEST welcomes measurement-based studies as well as analytic studies. QEST welcomes diversity in the model formalisms and methodologies employed, as well as development of new formalisms and methodologies. QEST is keenly interested in case studies highlighting the role of quantitative evaluation in the design of systems, where the notion of system is broad. Systems of interest include computer hardware and software architectures, communication systems, embedded systems and biological systems. Moreover, tools for supporting the practical application of research results in all of the above areas are of special interest, and therefore tool papers are sought. In short, QEST aims to create a sound methodological basis for assessing and designing systems using quantitative means. EVALUATION OF PAPERS: All submitted papers will be thoroughly judged by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. QEST considers five types of papers with additional reviewing criteria (in no particular order): 1. Theoretical: advance our understanding, apply to non-trivial problems and be mathematically rigorous. 2. Methodological and technical: describe situations that require the development and proposal of new analysis processes and techniques. Process structure and the individual steps should be clearly described. If the methodology has already been evaluated with applications, a brief description of the lessons learned would be very helpful. 3. Application: describes a novel application, and compares with previous results (if any). 4. Tools: should motivate the development of the new tools and the formalisms they support. Tool papers need neither discuss their theoretical underpinnings nor their algorithms. Instead, they should focus on the software architecture and discuss its practical capabilities with particular reference to the size and type of model it can handle within reasonable time and space limits. 5. Tool demonstration: describe a relevant tool, as well as its features, evaluation, or any other information that may demonstrate the merits of the tool. SUBMISSIONS: We invite submissions of original papers related to the aforementioned topics. Submissions must be in English, Springer LNCS format, and must indicate the above paper type. Papers must be prepared in LaTeX, following Springer's LNCS guidelines. Submitted papers should not exceed 16 pages (4 pages for tool demonstrations). Additional material for the aid of the reviewers (e.g., proofs) can be sent in a clearly marked appendix. Papers must be unpublished and not be submitted for publication elsewhere. PC members, except program co-chairs, may submit papers. Papers should be submitted electronically using EasyChair online submission system (https://www.easychair.org/conferences/?conf=qest2013). All accepted papers (including tool demonstrations) must be presented at the conference by one of the authors. A best-paper award will be presented at the conference. The QEST 2013 proceedings will be published by Springer in the LNCS Series. The proceedings will be available at the conference. As in previous years, we are planning to publish extended versions of selected papers in a special issue of a journal. TUTORIALS: There will be one day of tutorials at the start of the conference. Tutorial proposals (up to 4 pages Springer LNCS format) should be sent to the Tutorial Chair (Lijun Zhang, zhang at imm.dtu.dk) by 11 March 2013. GENERAL CHAIR: Pedro R. D'Argenio (AR) PC-CHAIRS: Kaustubh Joshi (US) Markus Siegle (DE) Marielle Stoelinga (NL) LOCAL ORGANIZATION CHAIR: Hern?n Melgratti (AR) TOOLS CHAIR: Kai Lampka (SE) TUTORIAL CHAIR: Lijun Zhang (DK) PROCEEDINGS CHAIR: Nicol?s Wolovick (AR) PUBLICITY CHAIR: Dami?n Barsotti (AR) PROGRAM COMMITTEE: Christel Baier (DE) Nathalie Bertrand (FR) Andrea Bobbio (IT) Peter Buchholz (DE) Hector Cancela (UY) Giuliano Casale (GB) Gianfranco Ciardo (US) Yuxin Deng (CN) Derek Eager (CA) Jane Hillston (GB) Andras Horvath (IT) David Jansen (NL) Krishna Kant (US) Peter Kemper (US) Boris Koepf (ES) Marta Kwiatkowska (GB) Kai Lampka (SE) Annabelle McIver (AU) Arif Merchant (US) Aad van Moorsel (GB) Gethin Norman (GB) Anne Remke (NL) William Sanders (US) Roberto Segala (IT) Miklos Telek (HU) Bhuvan Urgaonkar (US) Marco Vieira (PT) Verena Wolf (DE) STEERING COMMITTEE: Holger Hermanns (DE) Nathalie Bertrand (FR) Peter Buchholz (DE) Gethin Norman (UK) Andrew S. Miner (US) Susanna Donatelli (IT) William Knottenbelt (UK) Joost-Pieter Katoen (Chair, DE) Peter Kemper (US) Miklos Telek (HU) Gerardo Rubino (FR) Boudewijn Haverkort (NL) -------------- next part -------------- An HTML attachment was scrubbed... URL: From grlmc at urv.cat Sun Mar 3 07:10:27 2013 From: grlmc at urv.cat (GRLMC) Date: Sun, 3 Mar 2013 13:10:27 +0100 Subject: [TYPES/announce] SLSP 2013: submission deadline extended Message-ID: <1D6484B903C54731AB3918B0653DABD6@Carlos1> *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ---------------------------------------------------------------------------------------------------- SUBMISSION DEADLINE EXTENDED: March 15 !!! ---------------------------------------------------------------------------------------------------- ********************************************************************* 1st INTERNATIONAL CONFERENCE ON STATISTICAL LANGUAGE AND SPEECH PROCESSING SLSP 2013 Tarragona, Spain July 29-31, 2013 Organised by: Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Research Institute for Information and Language Processing (RIILP) University of Wolverhampton http://grammars.grlmc.com/SLSP2013/ ********************************************************************* AIMS: SLSP is the first event in a series to host and promote research on the wide spectrum of statistical methods that are currently in use in computational language or speech processing. It aims at attracting contributions from both fields. Though there exist large, well-known conferences including papers in any of these fields, SLSP is a more focused meeting where synergies between areas and people will hopefully happen. SLSP will reserve significant space for young scholars at the beginning of their careers. VENUE: SLSP 2013 will take place in Tarragona, 100 km. to the south of Barcelona. SCOPE: The conference invites submissions discussing the employment of statistical methods (including machine learning) within language and speech processing. The list below is indicative and not exhaustive: - phonology, morphology - syntax, semantics - discourse, dialogue, pragmatics - statistical models for natural language processing - supervised, unsupervised and semi-supervised machine learning methods applied to natural language, including speech - statistical methods, including biologically-inspired methods - similarity - alignment - language resources - part-of-speech tagging - parsing - semantic role labelling - natural language generation - anaphora and coreference resolution - speech recognition - speaker identification/verification - speech transcription - text-to-speech synthesis - machine translation - translation technology - text summarisation - information retrieval - text categorisation - information extraction - term extraction - spelling correction - text and web mining - opinion mining and sentiment analysis - spoken dialogue systems - author identification, plagiarism and spam filtering STRUCTURE: SLSP 2013 will consist of: ? invited talks ? invited tutorials ? peer-reviewed contributions INVITED SPEAKERS: Yoshua Bengio (Montr?al), tutorial Learning Deep Representations Christof Monz (Amsterdam), Challenges and Opportunities of Multilingual Information Access Tanja Schultz (Karlsruhe Tech), Multilingual Speech Processing with a special emphasis on Rapid Language Adaptation PROGRAMME COMMITTEE: Carlos Mart?n-Vide (Tarragona, Co-Chair) Ruslan Mitkov (Wolverhampton, Co-Chair) Jerome Bellegarda (Apple Inc., Cupertino) Robert C. Berwick (MIT) Laurent Besacier (LIG, Grenoble) Bill Byrne (Cambridge) Jen-Tzung Chien (National Chiao Tung U, Hsinchu) Kenneth Church (IBM Research) Koby Crammer (Technion) Renato De Mori (McGill & Avignon) Thierry Dutoit (U Mons) Marcello Federico (Bruno Kessler Foundation, Trento) Katherine Forbes-Riley (Pittsburgh) Sadaoki Furui (Tokyo Tech) Yuqing Gao (IBM Thomas J. Watson) Ralp Grishman (New York U) Dilek Hakkani-T?r (Microsoft Research, Mountain View) Adam Kilgarriff (Lexical Computing Ltd., Brighton) Dietrich Klakow (Saarbr?cken) Philipp Koehn (Edinburgh) Mikko Kurimo (Aalto) Lori Lamel (CNRS-LIMSI, Orsay) Philippe Langlais (Montr?al) Haizhou Li (Institute for Infocomm Research, Singapore) Qun Liu (Dublin City) Daniel Marcu (SDL) Manuel Montes-y-G?mez (INAOEP, Puebla) Masaaki Nagata (NTT, Kyoto) Joakim Nivre (Uppsala) Kemal Oflazer (Carnegie Mellon Qatar, Doha) Miles Osborne (Edinburgh) Manny Rayner (Geneva) Giuseppe Riccardi (U Trento) Jos? A. Rodr?guez Fonollosa (Technical U Catalonia, Barcelona) Paolo Rosso (Technical U Valencia) Mark Steedman (Edinburgh) Tomek Strzalkowski (Albany) G?khan T?r (Microsoft Research, Redmond) Stephan Vogel (Qatar Computing Research Institute, Doha) Kuansan Wang (Microsoft Research, Redmond) Dekai Wu (HKUST, Hong Kong) Min Zhang (Institute for Infocomm Research, Singapore) Yunxin Zhao (U Missouri, Columbia) ORGANISING COMMITTEE: Adrian Horia Dediu (Tarragona) Carlos Mart?n-Vide (Tarragona, Co-Chair) Ruslan Mitkov (Wolverhampton, 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 LNAI series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Submissions are to be uploaded to: https://www.easychair.org/conferences/?conf=slsp2013 PUBLICATIONS: A volume of proceedings published by Springer in the LNAI topical subseries of 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 will be by invitation. REGISTRATION: The period for registration is open from November 30, 2012 to July 29, 2013. The registration form can be found at: http://grammars.grlmc.com/SLSP2013/Registration DEADLINES: Paper submission: March 15, 2013 (23:59h, CET) ? EXTENDED ? Notification of paper acceptance or rejection: April 15, 2013 Final version of the paper for the LNAI proceedings: April 22, 2013 Early registration: April 24, 2013 Late registration: July 19, 2013 Submission to the post-conference journal special issue: October 31, 2013 QUESTIONS AND FURTHER INFORMATION: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SLSP 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Diputaci? de Tarragona Universitat Rovira i Virgili University of Wolverhampton From wneuper at ist.tugraz.at Mon Mar 4 03:12:56 2013 From: wneuper at ist.tugraz.at (Walther Neuper) Date: Mon, 04 Mar 2013 09:12:56 +0100 Subject: [TYPES/announce] CfP THedu at CICM, July 2013,Bath, UK Message-ID: <51345788.8040103@ist.tugraz.at> --------------------------------------------------------------------- Call for Extended Abstracts ---------------------------------------------------------------------- THedu'13 TP components for educational software (http://www.uc.pt/en/congressos/thedu) Co-located with CICM 2013 Conferences on Intelligent Computer Mathematics 8.-12. July 2013 Bath, UK http://www.cicm-conference.org/2013/cicm.php ---------------------------------------------------------------------- THedu'13 Scope -------------- THedu is a forum to gather the research communities for computer Theorem Proving (TP), Automated Theorem Proving (ATP), Interactive Theorem Proving (ITP) as well as for Computer Algebra Systems (CAS) and Dynamic Geometry Systems (DGS). The goal of this union is to combine and focus systems of these areas and to enhance existing educational software as well as studying the design of the next generation of mechanised mathematics assistants. Important Dates: --------------- * Extended Abstracts: 06 May 2013 * Author Notification: 03 Jun 2013 * Final Version: 15 Jun 2013 * Workshop Day: (still to be defined, 8-12 July) * Postproceedings(EPTCS): 15 October 2013 (https://www.easychair.org/conferences/?conf=thedu13) Elements for next-generation assistants include: * Declarative Languages for Problem Solution: education in applied sciences and in engineering is mainly concerned with problems, which are understood as operations on elementary objects to be transformed to an object representing a problem solution. Preconditions and postconditions of these operations can be used to describe the possible steps in the problem space; thus, ATP-systems can be used to check if an operation sequence given by the user does actually present a problem solution. Such "Problem Solution Languages" encompass declarative proof languages like Isabelle/Isar or Coq's Mathematical Proof Language, but also more specialized forms such as, for example, geometric problem solution languages that express a proof argument in Euclidean Geometry or languages for graph theory. * Consistent Mathematical Content Representation: libraries of existing ITP-Systems, in particular those following the LCF-prover paradigm, usually provide logically coherent and human readable knowledge. In the leading provers, mathematical knowledge is covered to an extent beyond most courses in applied sciences. However, the potential of this mechanised knowledge for education is clearly not yet recognised adequately: renewed pedagogy calls for enquiry-based learning from concrete to abstract --- and the knowledge's logical coherence supports such learning: for instance, the formula 2.Pi depends on the definition of reals and of multiplication; close to these definitions are the laws like commutativity etc. Clearly, the complexity of the knowledge's traceable interrelations poses a challenge to usability design. * User-Guidance in Stepwise Problem Solving: Such guidance is indispensable for independent learning, but costly to implement so far, because so many special cases need to be coded by hand. However, CTP technology makes automated generation of user-guidance reachable: declarative languages as mentioned above, novel programming languages combining computation and deduction, methods for automated construction with ruler and compass from specifications, etc --- all these methods 'know how to solve a problem'; so, using the methods' knowledge to generate user-guidance mechanically is an appealing challenge for ATP and ITP, and probably for compiler construction! In principle, mathematical software can be conceived as models of mathematics: The challenge addressed by this workshop is to provide appealing models for mathematics assistants which are interactive and which explain themselves such that interested students can independently learn by inquiry and experimentation. Submission ---------- We welcome submission of extended abstracts (4 pages max) presenting original unpublished work which is not been submitted for publication elsewhere. All accepted extended abstracts will be presented at the workshop, and the extended abstracts will be made available online. A publication post-proceedings (papers, 16 pages max) under EPTCS is under consideration. Extended abstracts and demo proposals should be submitted via THedu'13 easychair (https://www.easychair.org/conferences/?conf=thedu13). Extended abstracts should be no more than 4 pages in length and are to be submitted in PDF format. They must conform to the EPTCS style guidelines (http://http://style.eptcs.org/). At least one author of each accepted extended abstract/demo is expected to attend THedu'13 and presents her or his extended abstract/demo. Program Committee ----------------- Ralph-Johan Back, Abo Akademy University, Finland Francisco Botana, University of Vigo at Pontevedra, Spain Roman Ha?ek, University of South Bohemia Predrag Janicic, University of Belgrade, Serbia Julien Narboux, University of Strasbourg, France Filip Maric, University of Belgrade, Serbia Walther Neuper, Graz University of Technology, Austria Pavel Pech, University of South Bohemia Vanda Santos, CISUC, Portugal Wolfgang Schreiner, University of Linz, Austria Dusan Vallo, University of Nitra, Slovakia Makarius Wenzel, University Paris-Sud, France Burkhart Wolff, University Paris-Sud, France From stoller at cs.stonybrook.edu Mon Mar 4 09:44:54 2013 From: stoller at cs.stonybrook.edu (Scott Stoller) Date: Mon, 4 Mar 2013 14:44:54 +0000 Subject: [TYPES/announce] SPIN 2013 - Extended Deadlines Message-ID: <6F9CEB53469FAC479C4864C7DE38F14A53C262B8@mail1.cs.stonybrook.edu> International SPIN Symposium on Model Checking of Software - SPIN 2013 Stony Brook, NY, USA, July 8-9 2013 Marking the 20th Anniversary of the International SPIN Workshop http://spin2013.cs.sunysb.edu/ IMPORTANT DATES !!!!! EXTENDED !!!!! Submission of abstracts: 8 March 2013 AoE (Anywhere on Earth) Submission of full papers: 15 March 2013 AoE (Anywhere on Earth) Notification of acceptance/rejection: 15 April 2013 Final version due: 24 April 2013 Symposium: 8-9 July 2013 AIMS AND SCOPE The SPIN Symposium is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. Theoretical techniques and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker, or other tools or techniques based on the combination of explicit representations with other representations, are the focus of this symposium. We particularly welcome papers describing the development and application of state space exploration techniques in testing and verifying embedded software, security-critical software, enterprise and web applications, and other interesting software platforms. The symposium aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: Formal verification techniques for automated analysis of software Algorithms and storage methods for explicit-state model checking Theoretical and algorithmic foundations of model checking Model checking for programming languages and code analysis Directed model checking using heuristics Parallel or distributed model checking Verification of timed and probabilistic systems Model checking techniques for biological systems Formal verification techniques for concurrent software Formal verification techniques for embedded software 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 temporal logics Automated testing using state space and/or path exploration Derivation of specifications, test cases, or other useful material from state spaces Combination of model checking techniques with other analyses Modular and compositional verification techniques Case studies of interesting systems or with interesting results Engineering and implementation of software verification tools Benchmark and comparative studies for formal verification tools Insightful surveys or historical accounts on topics of relevance to the symposium BEST PAPER AWARD The Program Committee of SPIN 2013 will give this year a best paper award. The Best Paper Award recipient is given public recognition and will receive one high-end NVIDIA K20 GPU coprocessor, donated by NVIDIA. INVITED SPEAKER Dirk Beyer (University of Passau, Germany), Conditional Model Checking INVITED TUTORIAL Gerard Holzmann (NASA/JPL, USA), Automatic Model Extraction from C Code PAPER SUBMISSION AND PUBLICATION The proceedings of SPIN will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. Authors of selected papers will be invited to submit an extended version to appear in a special issue of the International Journal on Software Tools for Technology Transfer (STTT). With the exception of survey and history papers, the papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 We solicit two kinds of papers: Technical Papers: At most 18 pages in LNCS format. All accepted technical papers will be included in the proceedings. Tool Presentations: This kind of submission should consist of two parts: the first part is at most a 5 page description of the tool. If accepted, this part will be published in the symposium proceedings. The second part should describe an informal plan for an oral presentation of the tool. This part will not be included in the proceedings. For submission instructions, please see the symposium website: http://spin2013.cs.sunysb.edu/ At least one author of each accepted paper must attend the symposium and present the paper. ORGANIZATION General chair Scott A. Smolka (Stony Brook University, USA) Program chairs Ezio Bartocci (Vienna University of Technology, Austria) C. R. Ramakrishnan (Stony Brook University, USA) Publicity chair Scott D. Stoller (Stony Brook University, USA) Program Committee Gogul Balakrishnan (NEC Labs, USA) Paolo Ballarini (Ecole Centrale Paris, France) Ezio Bartocci (TU Wien, Austria) [PC co-chair] Armin Biere (Johannes Kepler University, Austria) Marsha Chechik (University of Toronto, Canada) Hana Chockler (IBM, Israel) Giorgio Delzanno (University of Genova, Italy) Alastair Donaldson (Imperial College London, UK) Dimitra Giannakopoulou (NASA Ames, USA) Patrice Godefroid (Microsoft Research, USA) Radu Grosu (TU Wien, Austria) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Madanlal Musuvathi (Microsoft Research, Redmond, USA) David Parker (University of Birmingham, UK) C. R. Ramakrishnan (Stony Brook University, USA) [PC co-chair] S Ramesh (General Motors Global R&D, India) Stefan Schwoon (ENS Cachan, France) Scott A. Smolka (Stony Brook University, USA) [General Chair] Oleg Sokolsky (University of Pennsylvania, USA) Scott D. Stoller (Stony Brook University, USA) Stravos Tripakis (UC Berkley, USA) Helmuth Veith (TU Wien, Austria) Farn Wang (National Taiwan University, Taiwan) Lenore D. Zuck (University of Illinois at Chicago, USA) Steering Committee Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Susanne Graf (CNRS/VERIMAG, France) Gerard Holzmann (chair) (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Willem Visser (University of Stellenbosch, South Africa) From danilo.ansaloni at usi.ch Mon Mar 4 14:57:09 2013 From: danilo.ansaloni at usi.ch (danilo.ansaloni at usi.ch) Date: Mon, 4 Mar 2013 19:57:09 +0000 Subject: [TYPES/announce] PPPJ'13 - Call for Papers Message-ID: CALL FOR PAPERS PPPJ'13 2013 International Conference on Principles and Practices of Programming on the Java platform: virtual machines, languages, and tools September 11-13, 2013 Stuttgart, Germany http://pppj2013.dhbw.de/ In cooperation with ACM SIGPLAN and ACM SIGAPP Sponsored by Oracle Labs The Java platform is multi-faceted, covering a rich diversity of systems, languages, tools, frameworks, and techniques. PPPJ'13 - the 10th conference in the PPPJ series - provides a forum for researchers, practitioners, and educators to present and discuss novel results on all aspects of programming on the Java platform including virtual machines, languages, tools, methods, frameworks, libraries, case studies, and experience reports. TOPICS Virtual machines for Java and Java-like language support: - JVM and similar VMs - VM design and optimization - VMs for mobile and embedded devices - Real-time VMs - Isolation and resource control Languages on the Java platform: - JVM languages (Clojure, Groovy, Java, JRuby, Kotlin, Scala, ...) - Domain-specific languages - Language design and calculi - Compilers - Language interoperability - Parallelism and concurrency - Modular and aspect-oriented programming - Model-driven development - Frameworks and applications - Teaching Techniques and tools for the Java platform: - Static and dynamic program analysis - Testing - Verification - Security and information flow - Workload characterization Do not hesitate to contact the PC Chair to clarify whether a particular topic is in the scope of PPPJ'13 or not. DATES May 27: Abstracts due (23:59 anywhere on earth) May 31: Submissions due (23:59 anywhere on earth) June 28: Author notification July 12: Camera-ready papers due Sept. 11-13: Conference SUBMISSION GUIDELINES PPPJ'13 submissions must conform to both the ACM Policy on Prior Publication and Simultaneous Submissions and to the SIGPLAN Republication Policy. http://www.acm.org/publications/policies/sim_submissions/ http://www.sigplan.org/Resources/Policies/Republication Papers will be evaluated according to their significance, originality, technical content, style, and relevance to the conference. Three types of paper submissions are accepted: Full research paper : up to 12 pages Short research paper: up to 6 pages Tool paper: up to 4 pages Clearly indicate in the paper whether it is to be evaluated as a full research paper, short research paper, or tool paper. Papers that do not meet the formatting requirements or are too long for the respective paper type will be rejected without review. All papers must conform to the ACM SIGPLAN style 'sigplanconf.cls' with a font size of 9 point (option '9pt'). http://www.sigplan.org/authorInformation.htm Submission page: http://www.easychair.org/conferences/?conf=pppj13 The conference proceedings will be published as part of the ACM International Proceedings Series and will be disseminated through the ACM Digital Library. At least one author of each accepted paper is required to attend the conference and present the paper. The authors of the best papers presented at PPPJ'13 will be invited to submit extended versions of their papers to a journal special issue. ORGANIZATION General Chair: Martin Pl?micke, Duale Hochschule Baden-W?rttemberg, Germany Program Chair: Walter Binder, University of Lugano, Switzerland Publicity Chair: Danilo Ansaloni, University of Lugano, Switzerland Program Committee: Judith Bishop, Microsoft Research, USA Steve Blackburn, Australian National University, Australia Christoph Bockisch, University of Twente, The Netherlands Eric Bodden, European Center for Security and Privacy by Design, Germany Shigeru Chiba, University of Tokyo, Japan Ferruccio Damiani, University of Torino, Italy Erik Ernst, Aarhus University, Denmark Michael Franz, University of California Irvine, USA Nicolas Geoffray, Google Inc., Denmark Samuel Z. Guyer, Tufts University, USA Michael Haupt, Oracle Labs, Germany Nigel Horspool, University of Victoria, Canada Einar Broch Johnsen, University of Oslo, Norway Stephen Kell, University of Lugano, Switzerland Andreas Krall, Vienna University of Technology, Austria Doug Lea, State University of New York at Oswego, USA Hanspeter M?ssenb?ck, Johannes Kepler University of Linz, Austria Nathaniel Nystrom, University of Lugano, Switzerland Rei Odaira, IBM Research Tokyo, Japan Jens Palsberg, University of California Los Angeles, USA Jennifer Sartor, Ghent University, Belgium Ina Schaefer, Technische Universit?t Braunschweig, Germany Martin Schoeberl, Technical University of Denmark, Denmark Bernhard Scholz, University of Sydney, Australia Andreas Sewe, Technische Universit?t Darmstadt, Germany Niranjan Suri, Florida Institute for Human & Machine Cognition, USA Eli Tilevich, Virginia Tech, USA Petr Tuma, Charles University, Czech Republic Alex Villaz?n, Universidad Privada Boliviana, Bolivia Christian Wimmer, Oracle Labs, USA Jianjun Zhao, Shanghai Jiao Tong University, China Steering committee: Markus Aleksy, ABB Corporate Research, Germany Vasco Amaral, Universidade Nova de Lisboa, Portugal Conrad Cunningham, University of Mississippi, USA Ralf Gitzel, ABB Corporate Research, Germany Christian Probst, Technical University of Denmark, Denmark From Jeremy.Gibbons at cs.ox.ac.uk Mon Mar 4 22:11:10 2013 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Tue, 05 Mar 2013 03:11:10 +0000 Subject: [TYPES/announce] Research Assistantship at Oxford on Bidirectional Transformations Message-ID: <201303050311.r253BAlW023553@linux1.cs.ox.ac.uk> Postdoctoral Research Assistant "A THEORY OF LEAST-CHANGE FOR BIDIRECTIONAL TRANSFORMATIONS" Department of Computer Science, University of Oxford Applications are invited for a Research Fellowship on an EPSRC-funded project "A Theory of Least-Change for Bidirectional Transformations". The project is a collaboration between Professor Jeremy Gibbons in the Department of Computer Science, University of Oxford, and Dr Perdita Stevens and Dr James Cheney in the School of Informatics, University of Edinburgh. The project concerns bidirectional transformations, which are a means of maintaining consistency between multiple information sources: when one source is edited, the others may need updating to restore consistency. There are applications in model-driven engineering, database design, and program development, among others. A bidirectional transformation can be implemented in terms of several unidirectional restoring functions, one per source; but this duplicates information, wasting effort and risking inconsistencies. Bidirectional transformation languages allow one to describe the consistency relationship and the restoring functions with a single declarative specification. Our aim in this project is to study the principle of least change: that a bidirectional transformation should not make unnecessary or unnecessarily large changes when it re-establishes consistency. The primary focus of the Oxford contribution is the development of a theory of alignment for bidirectional transformations on structured data, especially in the case of non-free datatypes such as associative lists and graphs. We conjecture that the mathematics of container datatypes and combinatorial species will be particularly relevant. The Fellowship will be under the supervision of Professor Jeremy Gibbons at Oxford, and is available for three years from 31st August 2013 (or any time before that). The salary is on a standard scale, from ?29,541 to ?36,298 per annum. For further details, including a job description and information on how to apply, please see the webpage (http://www.cs.ox.ac.uk/news/619-full.html). If you have any questions, please write to me (jeremy.gibbons at cs.ox.ac.uk). Please pass this advert on to anyone you think may be interested. Jeremy Jeremy.Gibbons at cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/ From bec at cs.colorado.edu Tue Mar 5 10:52:14 2013 From: bec at cs.colorado.edu (Bor-Yuh Evan Chang) Date: Tue, 5 Mar 2013 08:52:14 -0700 Subject: [TYPES/announce] Call for Analyzer Pearls: TAPAS 2013 (a SAS 2013 affiliated event and co-located with PLDI 2013) Message-ID: <8552536C61934907834A7D46701D1C68@colorado.edu> Executive Summary TAPAS 2013 invites submissions for "Analyzer Pearls" that are "polished, elegant, instructive, entertaining" presentations on the theory and practice of program analyzer design and implementation. ****************************************************************** TAPAS 2013 Call for Analyzer Pearls The 4th Tools for Automatic Program AnalysiS Workshop (a SAS 2013 satellite workshop) 19 June 2013, Seattle, Washington, USA http://pl.cs.colorado.edu/tapas2013 https://www.easychair.org/conferences/?conf=tapas2013 Important dates Submission Deadline 13 April 2013 (23:59 UTC-11 Samoa Standard Time) Notification 9 May 2013 Camera-Ready 25 May 2013 Workshop 19 June 2013 Objective In the last ten years, a wide range of static analysis tools have emerged, some of which are currently in industrial use or are well beyond the advanced prototype level. Many impressive practical results have been obtained, which allow complex properties to be proven or checked in a fully or semi-automatic way, even in the context of complex software developments. In parallel, the techniques to design and implement static analysis tools have improved significantly. This workshop is intended to promote discussions between specialists in all areas of program analysis design and implementation and static analysis tool users. Scope The technical program for TAPAS 2013 will consist of invited lectures from leading experts in analysis design and implementation and contributed presentations of Analyzer Pearls (see below). Analyzer Pearls can cover any aspect of program analysis tools including but not limited to the following: - design and implementation of static analysis tools; - components of static analysis tools (front-ends, abstract domains, etc); - integration of static analyzers (in proof assistants, test generation tools, etc); - experience reports on the use of static analyzers; - challenges, such as new properties to address or bottlenecks to overcome; or - proposals that contribute to the dissemination of static analysis techniques to a wider audience. Analyzer Pearls TAPAS 2013 will solicit submissions for Analyzer Pearls that should be distinguished from standard research or tool papers. Drawing inspiration from Functional Pearls appearing in JFP [1], Analyzer Pearls should contribute instructive essays that describe "tricks of the trade" in formalizing and constructing analyzer tools. An Analyzer Pearl may consider any aspect of the design and implementation of program analyzers--both theoretical and practical. Example Analyzer Pearls could consist of (but are not limited to): - an instructive example construction composing abstract domains; - a nifty decomposition of an analysis engine; - an effective layering of intermediate representations; - a interesting data structure design for an analysis component; or - a crisp formalization methodology for analysis algorithms. An Analyzer Pearl need not report original research results or describe a specific research tool; they may instead present a distillation or elegant new way of approaching the task of designing and implementing a program analyzer. An Analyzer Pearl could, for example, be supplemented with project files for a homework exercise. They should be "polished, elegant, instructive, entertaining." [2] We also recall Jon Bentley's quote about Programming Pearls, "Just as from grains of sand that have irritated oysters, these programming pearls have grown from real problems that have irritated programmers. The programs are fun, and they teach important programming techniques and fundamental design principles." This principle applies also to Analyzer Pearls. Our goal is to draw out the "pearls" from the community's experience in analysis design and implementation that perhaps "get lost in the details" of standard research papers. Following Functional Pearls, reviewers will be instructed to stop reading when: - they get bored; - the material gets too complicated; - too much specialist knowledge is needed; or - the writing is bad. Submissions All submitted pearls will be peer-reviewed by the program committee. Submitted pearls should be 10-12 pages in length excluding bibliography and follow the ENTCS guidelines (http://www.entcs.org/prelim.html). Pearls must 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, conference, or workshop with refereed proceedings. The TAPAS 2013 proceedings has received preliminary approval to be published electronically in a volume of the Electronic Notes in Theoretical Computer Science series. Program Chair Bor-Yuh Evan Chang University of Colorado Boulder, USA Program Committee Dino Distefano Queen Mary, University of London, UK Ben Hardekopf University of California, Santa Barbara, USA Franjo Ivancic NEC Labs America, USA Roman Manevich Ben-Gurion University of the Negev, Israel Micha? Moskal Microsoft Research, USA Steering Committee Radhia Cousot CNRS and Ecole Normale Sup?rieure, France Xavier Rival INRIA and Ecole Normale Sup?rieure, France Affiliated Events NSAD: The 5th Workshop on Numerical and Symbolic Abstract Domains 19 June 2013 SASB: The 4th Workshop on Static Analysis and Systems Biology 19 June 2013 SAS : The 20th International Static Analysis Symposium 20-22 June 2013 Venue TAPAS 2013 is an affiliated event of SAS 2013. It will be co-located with ACM PLDI 2013 and will take place at the Red Lion Hotel on 5th Ave in downtown Seattle, Washington, USA. Seattle, home to Amazon, Starbucks, Microsoft, and Boeing is famous for its coffee houses and its beautiful surroundings such as Puget Sound and its numerous islands, as well as the Olympic Peninsula and the nearby Cascade Range. ****************************************************************** [1] http://www.cs.ox.ac.uk/people/jeremy.gibbons/pearls/ [2] Richard Bird. "How to Write a Functional Pearl." http://icfp06.cs.uchicago.edu/bird-talk.pdf -------------- next part -------------- An HTML attachment was scrubbed... URL: From jay.mccarthy at gmail.com Wed Mar 6 09:23:02 2013 From: jay.mccarthy at gmail.com (Jay McCarthy) Date: Wed, 6 Mar 2013 07:23:02 -0700 Subject: [TYPES/announce] Trends in Functional Programming 2013: 3rd Call for Papers Message-ID: CALL FOR PAPERS 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 2nd, 2013 Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: Tuesday, May 14th, 2013 Camera ready for draft proceeding: Monday, April 29th, 2013 The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. http://ce.byu.edu/cw/tfp/ TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Steering Committee Secretary: Marco T. Moraz?n, Seton Hall University, New Jersey, U.S.A. Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universit?t Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Schrijvers from Ghent University Vikt?ria Zs?k from E?tv?s Lor?nd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://ce.byu.edu/cw/tfp/ -- Jay McCarthy Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93 From valeria.depaiva at gmail.com Wed Mar 6 09:51:59 2013 From: valeria.depaiva at gmail.com (Valeria de Paiva) Date: Wed, 6 Mar 2013 06:51:59 -0800 Subject: [TYPES/announce] Workshop on Natural Language and Computer Science (NLCS '13) Message-ID: Workshop on Natural Language and Computer Science (NLCS '13) http://www.indiana.edu/~iulg/nlcs.html A workshop to be held at LiCS'13: June 28, 2013 New Orleans, Louisiana Endorsed by the Association for Computational Linguistics Special Interest Group on Computational Semantics. AIMS AND SCOPE Formal tools coming from logic and category theory are important in both natural language semantics and in computational semantics. Moreover, work on these tools borrows heavily from all areas of theoretical computer science. In the other direction, applications having to do with natural language has inspired developments on the formal side. The workshop invites papers on both topics. Specific topics include, but are not limited to: * logic for semantics of lexical items, sentences, discourse and dialog * continuations in natural language semantics * formal tools in textual inference, such as logics for natural language inference * applications of category theory in semantics * linear logic in semantics * formal approaches to unifying data-driven and declarative approaches to semantics IMPORTANT DATES Paper submission: May 1, 2013 Notification: May 15, 2013 Workshop Date: 28 June 2013 Possible Extension to: 29 June 2013 LICS'13 Dates: 25-28 June 2013 INVITED SPEAKERS Ian Pratt-Hartmann, University of Manchester, UK. Wlodek Zadrozny, UNC, Charlotte, North Carolina. LENGTH OF THE WORKSHOP We plan for a one-day workshop, but with sufficient interest we have the option to extend the workshop to a second day. SUBMISSIONS Please submit extended abstracts of up to 15 pages using EasyChair: https://www.easychair.org/conferences/?conf=nlcs13 ORGANIZERS Valeria de Paiva, Nuance Communications Larry Moss, Indiana University PROGRAM COMMITTEE Valeria de Paiva, Nuance Bill MacCartney, Google and Stanford University Larry Moss, Indiana University Annie Zaenen, Stanford University -- Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ http://valeriadepaiva.org/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From damian at famaf.unc.edu.ar Wed Mar 6 10:13:52 2013 From: damian at famaf.unc.edu.ar (Damian Barsotti) Date: Wed, 6 Mar 2013 12:13:52 -0300 Subject: [TYPES/announce] CONCUR 2013 - Last Call for Papers Message-ID: <20130306151352.GA2661@mingus> [We apologise for multiple copies.] ============================================================================ CONCUR 2013 - Last Call for Papers 24th International Conference on Concurrency Theory August 27 - 30, 2013, Buenos Aires Argentina http://concur-conferences.org/concur2013 ============================================================================ The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. INVITED SPEAKERS - Lorenzo Alvisi (University of Texas Austin, USA) - Joost-Pieter Katoen (RWTH Aachen University, Germany) - Philippe Schnoebelen (LSV, CNRS & ENS de Cachan, France) - Reinhard Wilhelm (Saarland University, Germany) TOPICS Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, graph transformation systems and Petri nets; - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, and type systems; - Related programming models such as distributed, component-based, object-oriented, and web services. CO-LOCATED EVENTS 10th Intl. Conference on Quantitative Evaluation of SysTems (QEST 2013) 11th Intl. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS 2013) 8th Intl. Symposium on Trustworthy Global Computing (TGC 2013) There will be co-located workshops, which take place on August 26 and August 31, and tutorials (associated with QEST) which take place on August 26. PAPER SUBMISSION CONCUR 2013 solicits high quality papers reporting research results and/or experience reports related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. Exceptionally, however, concurrent submissions to CONCUR 2013 and TGC 2013 are allowed, and in fact encouraged for those paper that may potentially enhance both conferences. Authors of such double submissions should identify them to the Program Chairs at the time of submission (by choosing the "Regular paper submitted also to TGC" category in the EasyChair site). Reviews may be shared between CONCUR 2013 and TGC 2013. Submissions accepted by CONCUR will be considered automatically withdrawn from TGC. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Contributions must be submitted as PDF files. They should also not exceed 15 pages in length and comply the Springer LNCS style. Papers should be submitted electronically using EasyChair online submission system (https://www.easychair.org/conferences/?conf=concur2013) The CONCUR 2013 proceedings will be published by Springer in the ArCoSS subseries of LNCS. The proceedings will be available at the conference. IMPORTANT DATES Abstract Submission: 1st April 2013 (AoE) Paper Submission: 8th April 2013 (AoE) Paper Notification: 27th May, 2013 Camera Ready Copy Due: 10t June, 2013 CONCUR 2012: 27th-30th August, 2013 PROGRAM CHAIRS - Pedro R. D'Argenio (Universidad Nacional de C?rdoba, Argentina) - Hern?n Melgratti (Universidad de Buenos Aires, Argentina) PROGRAM COMMITTEE Christel Baier (Technical University of Dresden, DE) Paolo Baldan (Universit? di Padova, IT) Eike Best (Universit?t Oldenburg, DE) Patricia Bouyer (LSV, CNRS & ENS Cachan, FR) Tomas Brazdil (Masaryk University, CZ) Franck van Breugel (York University, CA) Krishnendu Chatterjee (IST, AT) Rance Cleaveland (University of Maryland, US) Wan Fokkink (Vrije Universiteit Amsterdam, NL) Daniele Gorla (University of Rome "La Sapienza", IT) Holger Hermanns (Saarland University, DE) Radha Jagadeesan (DePaul University, US) Bengt Jonsson (Uppsala University, SE) Kim G. Larsen (Aalborg University, DK) Ugo Montanari (Universit? di Pisa, IT) Prakash Panangaden (McGill University, CA) David Parker (University of Birmingham, UK) Frank Pfenning (Carnegie Mellon University, US) Nir Piterman (University of Leicester, UK) Shaz Qadeer (Microsoft Research, US) Jean-Francois Raskin (Universit Libre de Bruxelles, BE) Jan Rutten (CWI, NL) Davide Sangiorgi (University of Bologna, IT) Geoffrey Smith (Florida International University, US) P.S. Thiagarajan (National University of Singapore, SG) Frits Vaandrager (Radboud University Nijmegen, NL) Frank Valencia (CNRS, Ecole Polytechnique de Paris, FR) Rob Van Glabbeek (NICTA, AU) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Technical University of Denmark, DK) STEERING COMMITTEE Roberto Amadio (PPS, Universite Paris Diderot - Paris 7, France) Jos Baeten (Centrum Wiskunde & Informatica (CWI), The Netherlands) Eike Best (Carl von Ossietzky Universit?t Oldenburg, Germany) Kim Larsen (Aalborg University, Denmark) Ugo Montanari (Universit? di Pisa, Italy) Scott Smolka (SUNY, Stony Brook University, USA) From serge.autexier at dfki.de Wed Mar 6 11:34:16 2013 From: serge.autexier at dfki.de (Serge Autexier) Date: Wed, 6 Mar 2013 17:34:16 +0100 (CET) Subject: [TYPES/announce] Deadline Extension March 12th, 2013: Conf. Intelligent Computer Mathematics (CICM 2013), July 8-12, 2013, Bath, UK Message-ID: <20130306163416.D7AE4149EAA3@gigondas.dfki.uni-bremen.de> CICM 2013 - Conferences on Intelligent Computer Mathematics July 8-12, 2013 at University of Bath, Bath, UK http://www.cicm-conference.org/2013/cicm.php Call for Papers ------------------------------------------------------------------- * Invited Talks by Patrick Ion, Assia Mahboubi, and Ursula Martin * ------------------------------------------------------------------- As computers and communications technology advance, greater opportunities arise for intelligent mathematical computation. While computer algebra, automated deduction, mathematical publishing and novel user interfaces individually have long and successful histories, we are now seeing increasing opportunities for synergy among these areas. The Conferences on Intelligent Computer Mathematics offers a venue for discussing these areas and their synergy. The conference will take place at the University of Bath (www.bath.ac.uk), with James Davenport as the local organiser. It consists of four tracks: Calculemus Chair: Wolfgang Windsteiger Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: David Aspinall Systems and Projects Chair: Christoph Lange As in previous years, there are plans to organise a workshop for presentations by Doctoral students. The overall programme will be organised by the General Program Chair Jacques Carette. ---------------------------------------------------------------- Important dates ---------------------------------------------------------------- Submission deadline: 12 March 2013 (EXTENDED) Reviews sent to authors: 5 April 2013 Rebuttals due: 8 April 2013 Notification of acceptance: 14 April 2013 Camera ready copies due: 26 April 2013 Conference: 8-12 July 2013 ---------------------------------------------------------------- Tracks ---------------------------------------------------------------- ========== Calculemus ========== Calculemus 2013 invites the submission of original research contributions to be considered for publication and presentation at the conference. Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning like interactive proof assistants (PA) or 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 mathematical assistant systems that will be used routinely by mathematicians, computer scientists and all others who need computer-supported mathematics in their every day business. All topics in the intersection of computer algebra systems and automated reasoning systems are of interest for Calculemus. These include but are not limited to: * Automated theorem proving in computer algebra systems. * Computer algebra in theorem proving systems. * Adding reasoning capabilities to computer algebra systems. * Adding computational capabilities to theorem proving systems. * Theory, design and implementation of interdisciplinary systems for computer mathematics. * Case studies and applications that involve a mix of computation and reasoning. * Case studies in formalization of mathematical theories. * Representation of mathematics in computer algebra systems. * Theory exploration techniques. * Combining methods of symbolic computation and formal deduction. * Input languages, programming languages, types and constraint languages, and modeling languages for mathematical assistant systems. * Homotopy type theory. * Infrastructure for mathematical services. === DML === Mathematicians dream of a digital archive containing all peer-reviewed mathematical literature ever published, properly linked, validated and verified. It is estimated that the entire corpus of mathematical knowledge published over the centuries does not exceed 100,000,000 pages, an amount easily manageable by current information technologies. Track objective is to provide a forum for development of math-aware technologies, standards, algorithms and formats towards fulfillment of the dream of global digital mathematical library (DML). Computer scientists (D) and librarians of digital age (L) are especially welcome to join mathematicians (M) and discuss many aspects of DML preparation. Track topics are all topics of mathematical knowledge management and digital libraries applicable in the context of DML building -- processing of math knowledge expressed in scientific papers in natural languages, namely: * Math-aware text mining (math mining) and MSC classification * Math-aware representations of mathematical knowledge * Math-aware computational linguistics and corpora * Math-aware tools for [meta]data and fulltext processing * Math-aware OCR and document analysis * Math-aware information retrieval * Math-aware indexing and search * Authoring languages and tools * MathML, OpenMath, TeX and other mathematical content standards * Web interfaces for DML content * Mathematics on the web, math crawling and indexing * Math-aware document processing workflows * Archives of written mathematics * DML management, business models * DML rights handling, funding, sustainability * DML content acquisition, validation and curation === MKM === Mathematical Knowledge Management is an interdisciplinary field of research in the intersection of mathematics, computer science, library science, and scientific publishing. The objective of MKM is to develop new and better ways of managing sophisticated mathematical knowledge, based on innovative technology of computer science, the Internet, and intelligent knowledge processing. MKM is expected to serve mathematicians, scientists, and engineers who produce and use mathematical knowledge; educators and students who teach and learn mathematics; publishers who offer mathematical textbooks and disseminate new mathematical results; and librarians and mathematicians who catalog and organize mathematical knowledge. The conference is concerned with all aspects of mathematical knowledge management. A non-exclusive list of important topics includes: * Representations of mathematical knowledge * Authoring languages and tools * Repositories of formalized mathematics * Deduction systems * Mathematical digital libraries * Diagrammatic representations * Mathematical OCR * Mathematical search and retrieval * Math assistants, tutoring and assessment systems * 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 ==================== Systems and Projects ==================== The Systems and Projects track of the Conferences on Intelligent Computer Mathematics is a forum for presenting available systems and new and ongoing projects in all areas and topics related to the CICM conferences: * Deduction and Computer Algebra (Calculemus) * Digital Mathematical Libraries (DML) * Mathematical Knowledge Management (MKM) * Artificial Intelligence and Symbolic Computation (AISC) The track aims to provide an overview of the latest developments and trends within the CICM community as well as to exchange ideas between developers and introduce systems to an audience of potential users. ---------------------------------------------------------------- Submission Instructions ---------------------------------------------------------------- Submissions to the research tracks must not exceed 15 pages and will be reviewed and evaluated with respect 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. System descriptions and projects descriptions should be 2-4 pages and should present * newly developed systems, * systems that have not previously been presented to the CICM community, or * significant updates to existing systems. Systems must be available for download. Project presentations should describe * projects that are new or about to start, * ongoing projects that have not yet been presented to the CICM community. * significant new developments in ongoing previously presented projects. Presentations of new projects should mention relevant previous work and include a roadmap that outlines concrete steps. All submissions should contain links to demos, downloadable systems, or project websites. Accepted conference submissions from all tracks is intended to be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer. 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 offer authors of rejected formal submissions to publish their contributions as work-in-progress papers instead. Depending on the number of work-in-progress papers accepted, they will be presented at the conference either as short talks or as posters. The work-in-progress proceedings will be published as a technical report, as well as online with CEUR-WS.org. All papers should be prepared in LaTeX and formatted according to the requirements of 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. Electronic submission is done through easychair http://www.easychair.org/conferences/?conf=cicm2013 ---------------------------------------------------------------- Programme Committee ---------------------------------------------------------------- Jacques Carette, McMaster University, Canada Wolfgang Windsteiger, RISC Institute, JKU Linz, Austria Petr Sojka, Masaryk University, Faculty of Informatics, Czech Republic David Aspinall, University of Edinburgh, UK Christoph Lange, University of Birmingham, UK Till Mossakowski, DFKI Bremen, Germany J?nathan Heras, University of Dundee, UK Josef Urban, Radboud University, Netherlands Deyan Ginev, Jacobs University Bremen, Germany Rob Arthan, Queen Mary University of London, UK Makarius Wenzel, Universit? Paris-Sud 11, France Hendrik Tews, TU Dresden, Germany Simon Colton, Department of Computing, Imperial College, London, UK Paul Libbrecht, Martin Luther University Halle-Wittenberg, Germany Cezary Kaliszyk, University of Innsbruck, Austria Andrea Kohlhase, Jacobs University Bremen, Germany Yannis Haralambous, T?l?com Bretagne, France Florian Rabe, Jacobs University Bremen, Germany Akiko Aizawa, NII, The University of Tokyo, Japan Carsten Schuermann, IT University of Copenhagen, Denmark Magnus O. Myreen, University of Cambridge, UK Janka Chleb?kov?, School of Computing, University of Portsmouth, UK Richard Zanibbi, Rochester Institute of Technology, US Michael Kohlhase, Jacobs University Bremen, Germany Adam Kilgarriff, Lexical Computing Ltd, UK Leo Freitas, Newcastle University, UK Frank Tompa, University of Waterloo, Canada Gudmund Grov, Heriot-Watt University, Edinburgh, UK Jeremy Avigad, Carnegie Mellon University, US Stephen Watt, University of Western Ontario, Canada Temur Kutsia, RISC Institute, JKU Linz, Austria Manfred Kerber, University of Birmingham, UK Hoon Hong, North Carolina State University, US Christoph L?th, DFKI Bremen, Germany Thierry Bouche, Universit? Joseph Fourier (Grenoble), France Andrea Asperti, University of Bologna, Italy Jesse Alama, CENTRIA, FCT, Universidade Nova de Lisboa, Portugal Ji?? R?kosn?k, Institute of Mathematics, Academy of Sciences, Czech Republic Thomas Hales, University of Pittsburgh, US Predrag Jani?i?, University of Belgrade, Serbia David Ruddy, Cornell University Library, US Volker Sorge, University of Birmingham, UK Mark Adams, Proof Technologies Ltd, UK John Charnley, Department of Computing, Imperial College London, UK From sweirich at cis.upenn.edu Wed Mar 6 11:31:51 2013 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Wed, 6 Mar 2013 11:31:51 -0500 Subject: [TYPES/announce] Research positions at Birmingham and Imperial Message-ID: <84BEDA83-FEB8-45B0-9C5E-97FA66DE7ABC@cis.upenn.edu> [Posted on behalf of Dan Ghica.] Postdoctoral Research Positions at University of Birmingham and Imperial College We will soon advertise two postdoctoral research positions on a new EPSRC project titled "A higher-order approach to co-design", part of the "Working Together Across ICT" theme. It aims to develop semantic and type-theoretical models of high-level languages (functional, imperative, concurrent) in order to produce better compilation methods for heterogeneous architectures (CPU and FPGA). The project has two tracks. One is focussed on theoretical aspects such as types for resource management and semantic models, particularly game semantics, and will be mainly carried out in Birmingham. The other is focussed on heterogeneous design, optimisation and applications, and will be mainly carried out at Imperial. The two sites will collaborate very closely and will jointly develop the 'Geometry of Synthesis' FPGA compiler (http://www.veritygos.org). The project is funded for 3 years, starting June 2013 and one post-doc will be employed at each site. The positions will be for an initial period of 18 months with the possibility of extension. Candidates will need expertise in theory of programming languages (types and semantics) or reconfigurable computing (FPGA design and applications, EDA). We are particularly interested in candidates who are excellent thinkers and willing to learn and apply cutting-edge theory in order to solve practical problems and develop tools. A practical knowledge of functional programming language is essential. The theory group in Birmingham and the FPGA group at Imperial are world-leading so we seek applicants with an excellent track record of research. The salary in Birmingham will be in the range of =A327,854-=A336,298 and at Imperial in the range of =A330,680-=A339,130 per annum. The official advert= s will follow soon but anyone interested is welcome to contact the co-investigators: Dan R. Ghica, Birmingham http://www.cs.bham.ac.uk/~drg/ d.r.ghica at cs.bham.ac.uk George Constantinides, Imperial http://cas.ee.ic.ac.uk/people/gac1/ g.constantinides at imperial.ac.uk Also see EPSRC project summary at http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/K015214/1 From gadducci at di.unipi.it Thu Mar 7 04:42:53 2013 From: gadducci at di.unipi.it (Fabio Gadducci) Date: Thu, 7 Mar 2013 10:42:53 +0100 Subject: [TYPES/announce] ACCAT 2013: final call for participation and invitation to discussion Message-ID: [Apologies if you receive more than one copy of the following announcement] FINAL CALL FOR PARTICIPATION AND INVITATION TO DISCUSSION ========== 8th International Workshop on Applied and Computational Category Theory ACCAT 2013 http://accat2013.zib.de/ Satellite Event of ETAPS 2013, Rome, March 17 2013 ========== Deadline for online registration: March 8 *Attendees are warmly invited to join the closing discussion. Please communicate your intention to deliver a position statement to the organizers.* ========== Since the 1960s, the use of category theory in computer science has been a fruitful one, ranging form automata theory to algebraic specification to programming languages. In recent years techniques and methods from CT have been adopted as a standard research tool, and considered as such in different venues around the world. The ACCAT workshop on "Applied and Computational Category Theory" has been one of these venues. Since its inception in 2006, ACCAT provided a forum where invited contributors presented their own research on different facets of category theory applied to computer science. Despite ACCAT success, we believe that the formula should be revised. Indeed, we have the feeling that a conference is missing where all kinds of applications of category theory to computer science can be presented (like the former CTCS conference, which somehow ended in 2006). This year, we would like to use the ACCAT forum to raise this issue and to discuss it within a larger audience. Thus, we invited 8 top researched in the area of application of category theory. The list of speakers are Samson Abramsky Robin B. Cockett Barbara Koenig Ugo Montanari Till Mossakowski Dusko Pavlovic Andrzej Tarlecki Glynn Winskel We do hope that the meeting will be fruitful, providing a good exchange of ideas and planting the seed for future events. Indeed, one of the outcome of the meeting is to decide whether to push an high-level workshop/conference on the application of category theory to computer science, or at least to verify the viability of a Daghstul meeting on the issue. Therefore, after the presentations, the workshop will end up with a general discussion among the attendees. From eabonelli at gmail.com Fri Mar 8 12:04:15 2013 From: eabonelli at gmail.com (Eduardo Bonelli) Date: Fri, 8 Mar 2013 14:04:15 -0300 Subject: [TYPES/announce] Positions in Computer Science at Universidad de Buenos Aires Message-ID: ---------- Forwarded message ---------- From: "Flavia Bonomo" A quick personal note: this being a government-funded position, the process between applying and actually starting the job might take up to 2 years. So if you are not yet "on the market" but might be sometime in the future (you're finishing your PhD, or just starting a postdoc), consider applying now. The whole process looks a bit bureaucratic (and it is), but if you're interested someone from the U of Buenos Aires will help you along the way. Further, I am personally very familiar with this process, UBA and Argentina, so feel free to email me in private if you have questions. Cheers, --Flavia The Computer Science Department at the School of Sciences of the University of Buenos Aires invites applications for faculty positions at the Assistant Professor level. We expect candidates with a strong potential for research and teaching ability. The candidates should have a PhD in Computer Science or a related field. The selected candidate will be responsible for developing a research program and for teaching at the undergraduate and graduate level. Deadlines and documents required for the application are specified at http://www.dc.uba.ar/aca/concursos/faculty_positions. We have three open positions. One in the area of Modeling and Simulation and two positions in any area of Computer Science. The University of Buenos Aires is one of the most prestigious educational institutions in South America, and its School of Sciences is one of the main research institutes in Argentina, responsible for 10% of the country's publications. Buenos Aires is a vibrant, cosmopolitan city. We offer great benefits, an excellent work environment. The position is open to English speakers, with the expectation that you will learn Spanish during the first few years in this position. For more information visit http://www.dc.uba.ar/aca/concursos/faculty_positions or contact hiring at dc.uba.ar. From deligu at di.unito.it Fri Mar 8 12:09:16 2013 From: deligu at di.unito.it (Ugo de'Liguoro) Date: Fri, 08 Mar 2013 18:09:16 +0100 Subject: [TYPES/announce] Control Operators and their Semantics (COS'13) - Final Call for Papers Message-ID: <513A1B3C.8020205@di.unito.it> ============================================================================ Control Operators and their Semantics (COS'13) - Call for Papers Satellite event of RDP'13 June 24 - 25, 2013, Eindhoven, The Nederlands http://cos2013.di.unito.it/ ============================================================================ Modern programming languages provide sophisticated control mechanisms, commonly referred to as control operators which are widely used to realize a variety of applications. Since we cannot escape control features, it becomes a challenge to provide them with sound reasoning principles. There is a very active research on understanding, manipulating, representing, and reasoning about elaborated non-local control structures, in particular in declarative programming languages such as functional and logic languages. Ideas and results originating from this research area have impact in many other areas of computer science, like distributed and concurrent systems, proof theory, proof mining, web programming and linguistics. For instance, the study of the logical foundations of control operators renewed the study of the connections between proofs and programs via the so-called Curry-Howard correspondence, providing new methods to extract the computational content of classical proofs. The focus of the workshop is on the interplay between syntax and semantics, namely the central question of what a program means and how it does define the intended procedure. This is a crucial issue especially in the case of control operators, since they are as powerful as potentially obscure, and programs that use them are usually more error prone than purely declarative ones. The issue of a better understanding of control is also relevant for communicating across different research areas and communities. More abstract views can be achieved via several means, that include operational semantics of formal calculi, abstract machines, algebraic specifications and rewriting, type assignment systems, denotational semantics and game semantics, category theory and logic, to say the least. Relevant topics include, but are not limited to: - continuations and delimited continuations - categorical models of continuations - compositionality and modularity of control operators - denotational semantics of control, event structures and causality - operational semantics and abstract machines - type systems for control operators - game semantics of programming languages and of logical proofs - usage of control operators in proof search and proof mining - semantics of control operators in logic programming Invited speakers: - Mattew Flatt (Univeristy of Utah) - Thomas Streicher (Universitaet Darmstadt) Program Committee: Zena Ariola University of Oregon Stefano Berardi Turin University Hugo Herbelin INRIA and Laboratoire PPS (Paris 7) Ugo de'Liguoro (chair) Turin Univerisity Ken-etsu Fujita Gunma University Koji Nakazawa Kyoto University Alexis Saurin (co-chair) INRIA and Laboratoire PPS (Paris 7) Submission: authors of original works on the topic of the workshop are invited to submit either a FULL PAPER of up to 20 pages, which has to be unpublished nor submitted elsewhere, or an EXTENDED ABSTRACT of up to 5 pages (to which previous restrictions do not apply) for short presentation at the workshop. Only accepted full papers will appear in the proceedings; the PC might decide, on the ground of referees reports, that a full paper submission is accepted as extended abstract instead. Submission consists of a LaTex generated pdf file, prepared using EPTCS macro package, available from: http://info.eptcs.org/ Authors of extended abstracts must add: "Extended Abstract" to the title. The PC Submissions are via EasyChair COS2013 site: https://www.easychair.org/conferences/?conf=cos2013 To make reviewing faster we ask title and (short) abstract within March the 24th. The deadline for the pdf text is April the 6th. Important Dates: Abstract: March, 24 2013 Submission: April, 6 2013 Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 Contact: Ugo de'Liguoro Dipartimento di Informatica, Universita' di Torino, Corso Svizzera 185, 10149 Torino, Italy email: deliguoro at di.unito.it Web sites: COS'13: http://cos2013.di.unito.it RTD'13: http://www.win.tue.nl/rdp2013/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From stoller at cs.stonybrook.edu Fri Mar 8 19:27:37 2013 From: stoller at cs.stonybrook.edu (Scott Stoller) Date: Sat, 9 Mar 2013 00:27:37 +0000 Subject: [TYPES/announce] SPIN 2013 - Abstract submission deadline waived Message-ID: <6F9CEB53469FAC479C4864C7DE38F14A53C27308@mail1.cs.stonybrook.edu> International SPIN Symposium on Model Checking of Software - SPIN 2013 Stony Brook, NY, USA, July 8-9 2013 Marking the 20th Anniversary of the International SPIN Workshop http://spin2013.cs.sunysb.edu/ IMPORTANT DATES Submission of abstracts: !!!!! DEADLINE WAIVED !!!!! Submission of full papers: 15 March 2013 AoE (Anywhere on Earth) Notification of acceptance/rejection: 15 April 2013 Final version due: 24 April 2013 Symposium: 8-9 July 2013 AIMS AND SCOPE The SPIN Symposium is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. Theoretical techniques and empirical evaluations based on explicit representations of state spaces, as implemented in the SPIN model checker, or other tools or techniques based on the combination of explicit representations with other representations, are the focus of this symposium. We particularly welcome papers describing the development and application of state space exploration techniques in testing and verifying embedded software, security-critical software, enterprise and web applications, and other interesting software platforms. The symposium aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: Formal verification techniques for automated analysis of software Algorithms and storage methods for explicit-state model checking Theoretical and algorithmic foundations of model checking Model checking for programming languages and code analysis Directed model checking using heuristics Parallel or distributed model checking Verification of timed and probabilistic systems Model checking techniques for biological systems Formal verification techniques for concurrent software Formal verification techniques for embedded software 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 temporal logics Automated testing using state space and/or path exploration Derivation of specifications, test cases, or other useful material from state spaces Combination of model checking techniques with other analyses Modular and compositional verification techniques Case studies of interesting systems or with interesting results Engineering and implementation of software verification tools Benchmark and comparative studies for formal verification tools Insightful surveys or historical accounts on topics of relevance to the symposium BEST PAPER AWARD The Program Committee of SPIN 2013 will give this year a best paper award. The Best Paper Award recipient is given public recognition and will receive one high-end NVIDIA K20 GPU coprocessor, donated by NVIDIA. INVITED SPEAKER Dirk Beyer (University of Passau, Germany), Conditional Model Checking INVITED TUTORIAL Gerard Holzmann (NASA/JPL, USA), Automatic Model Extraction from C Code PAPER SUBMISSION AND PUBLICATION The proceedings of SPIN will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. Authors of selected papers will be invited to submit an extended version to appear in a special issue of the International Journal on Software Tools for Technology Transfer (STTT). With the exception of survey and history papers, the papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 We solicit two kinds of papers: Technical Papers: At most 18 pages in LNCS format. All accepted technical papers will be included in the proceedings. Tool Presentations: This kind of submission should consist of two parts: the first part is at most a 5 page description of the tool. If accepted, this part will be published in the symposium proceedings. The second part should describe an informal plan for an oral presentation of the tool. This part will not be included in the proceedings. For submission instructions, please see the symposium website: http://spin2013.cs.sunysb.edu/ At least one author of each accepted paper must attend the symposium and present the paper. ORGANIZATION General chair Scott A. Smolka (Stony Brook University, USA) Program chairs Ezio Bartocci (Vienna University of Technology, Austria) C. R. Ramakrishnan (Stony Brook University, USA) Publicity chair Scott D. Stoller (Stony Brook University, USA) Program Committee Gogul Balakrishnan (NEC Labs, USA) Paolo Ballarini (Ecole Centrale Paris, France) Ezio Bartocci (TU Wien, Austria) [PC co-chair] Armin Biere (Johannes Kepler University, Austria) Marsha Chechik (University of Toronto, Canada) Hana Chockler (IBM, Israel) Giorgio Delzanno (University of Genova, Italy) Alastair Donaldson (Imperial College London, UK) Dimitra Giannakopoulou (NASA Ames, USA) Patrice Godefroid (Microsoft Research, USA) Radu Grosu (TU Wien, Austria) Klaus Havelund (NASA/JPL, USA) Gerard Holzmann (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Madanlal Musuvathi (Microsoft Research, Redmond, USA) David Parker (University of Birmingham, UK) C. R. Ramakrishnan (Stony Brook University, USA) [PC co-chair] S Ramesh (General Motors Global R&D, India) Stefan Schwoon (ENS Cachan, France) Scott A. Smolka (Stony Brook University, USA) [General Chair] Oleg Sokolsky (University of Pennsylvania, USA) Scott D. Stoller (Stony Brook University, USA) Stravos Tripakis (UC Berkley, USA) Helmuth Veith (TU Wien, Austria) Farn Wang (National Taiwan University, Taiwan) Lenore D. Zuck (University of Illinois at Chicago, USA) Steering Committee Dragan Bosnacki (Eindhoven University of Technology, Netherlands) Susanne Graf (CNRS/VERIMAG, France) Gerard Holzmann (chair) (NASA/JPL, USA) Stefan Leue (University of Konstanz, Germany) Willem Visser (University of Stellenbosch, South Africa) From grlmc at urv.cat Sun Mar 10 06:04:19 2013 From: grlmc at urv.cat (GRLMC) Date: Sun, 10 Mar 2013 11:04:19 +0100 Subject: [TYPES/announce] SSTiC 2013: 2nd announcement Message-ID: <2D34812DDAD8483C950401377FE9D09E@Carlos1> *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of more than 75 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montr?al) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social Context Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Syed Ali Jafar (Irvine) [intermediate] Interference Alignment Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montr?al) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to Cyber-physical Systems Daniel Moss? (Pittsburgh) [intermediate] Asymmetric Multicore Management Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation David M. Nicol (Urbana) [intermediate] Cyber-security and Privacy in the Power Grid Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Parallel Programming with Abstractions Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure Symmetric Encryption Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Yousef Saad (Minnesota) [intermediate] Projection Methods and Their Applications Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer Security Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users in Social Computing Systems Philip Wadler (Edinburgh) [introductory] Lambda Calculus and Blame Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Ian H. Witten (Waikato) [introductory] Data Mining Using Weka Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft Computing Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists REGISTRATION: It has to be done at http://grammars.grlmc.com/SSTiC2013/Registration.php Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation will be available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputaci? de Tarragona Universitat Rovira i Virgili From emanuela.merelli at unicam.it Sun Mar 10 12:21:56 2013 From: emanuela.merelli at unicam.it (Emanuela Merelli) Date: Sun, 10 Mar 2013 17:21:56 +0100 Subject: [TYPES/announce] CS2BIO 2013: 2nd Call for Papers In-Reply-To: References: Message-ID: [We apologise for multiple copies] *NOTE THE SPECIAL ISSUES OF "THEORETICAL COMPUTER SCIENCE" JOURNAL AND FOR PAPERS CONTRIBUTING TO THE EU FP7 DyM-CS SESSION* *THE SPECIAL ISSUE OF "MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE" JOURNAL * ======================================================================== First call for papers CS2Bio'13 4th International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'13 June 6th, 2013 Florence, Italy http://cs2bio13.di.unito.it/ ======================================================================== Systems Biology is a stimulating field of application for computer scientists and a promising resource for biologists. The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science and Life Sciences. In particular, in this forth edition, we solicit the contribution of original results, from any research areas, such as Mathematics, Physics, Complex Systems, and Computational Sciences that address both theoretical aspects of modelling and applied work on the comprehension of biological behaviour. Furthermore, to facilitate the integration of different research areas we encourage the presentation of the main objectives and preliminary results of active projects on the CS2Bio topics conducted by interdisciplinary teams. *** SCOPE *** Contributions selected for presentation at CS2Bio should either present the modelling of a specific biological phenomenon using formal techniques, or a modelling, simulation, testing or verification approach in computer science that leads to a novel and promising application to a range of biological or medical systems. In the latter case, some emphasis on the scope and scalability of the approach will be required. The workshop intends to attract researchers interested in models, verification, tools, and programming primitives concerning the complex interactions encountered. Topics of interest include, but shall not be limited to: - Formal Biological Modelling - Formal methods for the representation of biological systems and their dynamics; - 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; - Prediction of biological behaviour from incomplete information; - Model checking, abstract interpretation, type systems, etc. - Novel Computational Paradigms for Understanding Biological Complex Systems - Quantum information and life sciences; - Geometry, algebraic and computational topology and biomathematics; - Information processing and biomedicine; - Statistical mechanics and biophysics. - 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 *** - Giuseppe Longo (ENS Paris, France) - Mario Rasetti (ISI Foundation, Italy) *** SUBMISSION GUIDELINES *** We solicit three kinds of contributions: - Regular papers: must report previously unpublished work and not be submitted concurrently to a journal or to another conference with refereed proceedings (limited to 14 pages). - Tool presentations: describing new tools or platforms for the modelling of biological systems (limited to 7 pages). - Dissemination of project results: concern recent or ongoing work on topics relevant to CS2Bio and are intended to provide discussion and stimulate feedback during the workshop. The focus of a dissemination should be put on the main objectives and preliminary results of active projects on topics relevant to the workshop. There are no restrictions about previous or future publication of the contents of a dissemination, it could also be based on a recently published paper or on a work which has not yet been submitted (limited to 4 pages). Authors should submit their contributions via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio13) in the form of a pdf file compiled using the ENTCS style for the workshop proceedings (http://www.entcs.org/files/cs2bio/prentcsmacro.sty). If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). *** DISSEMINATION *** The proceedings of the workshop will be published in a volume of the Elsevier series "Electronic Notes on Theoretical Computer Science". After the event, papers presented at the workshop will be invited to be furtherly extended and submitted to an open special issue of the journal "Theoretical Computer Science". A special issue of the journal "Mathematical Structures in Computer Science" will be open for papers that will contribute to the session on EU FP7 DyM-CS - Dynamics of Multi-level Complex Systems - that will be held on the 5th of June. *** IMPORTANT DATES *** - Submission deadline: 26 March 2013 - Notification to authors: 03 May 2013 - Workshop: 06 June 2013 *** PROGRAM COMMITTEE *** - Erik de Vink - Jasmin Fisher - Paola Giannini - Radu Grosu - Jean Krivine - Pietro Lio' - Daniele Manini - Emanuela Merelli (Co-chair) - Paolo Milazzo - Ion Petre - Marco Pettini - Christian Reidys - David Safranek - Luca Tesei - Angelo Troina (Co-chair) - Verena Wolf *** STEERING COMMITTEE *** - Erik de Vink - Paola Giannini - Jean Krivine - Angelo Troina -- Emanuela Merelli School of Science and Technology, Computer Science Division University of Camerino Via Madonna delle Carceri, 13 - 62032, Camerino, Italy http://www.cs.unicam.it/merelli -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrei.paskevich at lri.fr Mon Mar 11 10:38:25 2013 From: andrei.paskevich at lri.fr (Andrei Paskevich) Date: Mon, 11 Mar 2013 15:38:25 +0100 Subject: [TYPES/announce] ARiSVe 2013: submission deadline extension to April 8, 2013 Message-ID: Call For Papers 1st International Workshop on Automated Reasoning in Software Verification *** EXTENDED DEADLINE *** http://arisve2013.lri.fr Monday, June 10, 2013 Lake Placid, NY, USA Affiliated with CADE-24 Aims and Scope The focus of the workshop is application of automated reasoning in the context of software verification, and, more generally, automation in software verification. Relevant topics include but are not limited to: * specifics of verification-related automated reasoning tasks; * efficient translation of high-level verification conditions to logical languages of automated reasoning tools; * handling of the prover's feedback: proofs, models, answer terms; * logical theories of interest for program verification, decision procedures, integration into existing ATP and SMT systems; * combination of automated and user-assisted verification; * tool presentations, tool comparisons, and benchmarks; * experience reports on verification of complex algorithms and real-life software with the use of automated reasoning tools. Paper Submission and Proceedings All submissions are reviewed by the program committee. We expect that one author of every accepted paper will present their work at the workshop. Submissions are limited to 6-12 pages in the LaTeX EasyChair format easychair.cls (http://www.easychair.org/publications/easychair.zip). Technical details may be included in an appendix to be read at the reviewers' discretion. Tool presentation papers and experience reports are welcome. Papers should be submitted through EasyChair, at http://www.easychair.org/conferences/?conf=arisve2013 Submissions must be in PDF format. Electronic version of proceedings will be freely distributed from the workshop web site. Important Dates * Abstract submission deadline: April 3, 2013 (EXTENDED) * Submission deadline: April 8, 2013 (EXTENDED) * Notification: April 30, 2013 * Camera ready versions due: May 10, 2013 * Workshop: June 10, 2013 Invited Speaker K. Rustan M. Leino (Microsoft Research) Program Committee * June Andronick (NICTA) * Clark Barrett (New York University) * Ernie Cohen (Microsoft Corp.) * Lo?c Correnson (CEA) * Gidon Ernst (Ausburg University) * Jean-Christophe Filli?tre (CNRS), co-chair * Alwyn Goodloe (NASA) * Matthias Horbach (Koblenz University) * Vladimir Klebanov (Karlsruhe Institute of Technology) * Konstantin Korovin (The University of Manchester) * Rosemary Monahan (National University of Ireland) * Andrei Paskevich (Universit? Paris-Sud), co-chair * Silvio Ranise (Fondazione Bruno Kessler) From wadler at inf.ed.ac.uk Mon Mar 11 13:46:12 2013 From: wadler at inf.ed.ac.uk (Philip Wadler) Date: Mon, 11 Mar 2013 17:46:12 +0000 Subject: [TYPES/announce] Summer School on Trends in Computing, Tarragona Message-ID: ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of more than 75 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montr?al) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social Context Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Syed Ali Jafar (Irvine) [intermediate] Interference Alignment Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montr?al) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to Cyber-physical Systems Daniel Moss? (Pittsburgh) [intermediate] Asymmetric Multicore Management Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation David M. Nicol (Urbana) [intermediate] Cyber-security and Privacy in the Power Grid Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Parallel Programming with Abstractions Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure Symmetric Encryption Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Yousef Saad (Minnesota) [intermediate] Projection Methods and Their Applications Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer Security Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users in Social Computing Systems Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Ian H. Witten (Waikato) [introductory] Data Mining Using Weka Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft Computing Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists REGISTRATION: It has to be done at http://grammars.grlmc.com/SSTiC2013/Registration.php Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation will be available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputaci? de Tarragona Universitat Rovira i Virgili -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: not available URL: From i.whiteside at sms.ed.ac.uk Tue Mar 12 06:11:19 2013 From: i.whiteside at sms.ed.ac.uk (Iain Whiteside) Date: Tue, 12 Mar 2013 10:11:19 +0000 Subject: [TYPES/announce] CfP PLMMS at CICM, July 2013, Bath, UK Message-ID: (* Apologies for multiple copies *) ------------------------------------------------------------------- First CALL FOR PAPERS ------------------------------------------------------------------- The 5th International Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2013) Part of CICM-2013, at University of Bath, UK 8-12th of July 2013 ------------------------------------------------------------------- Important Dates --------------- * Abstract submission: Mon May 6 2013 * Paper submission: Mon May 13 2013 * Notification of acceptance: Mon June 3 2013 * Camera ready copy due: Mon June 10 2013 Program Committee ----------------- * David Aspinall, University of Edinburgh, UK * Serge Autexier, DKFI Bremen, Germany * Jacques Carette, McMaster University, Canada * Claudio Sacerdoti Coen, University of Bologna, Italy * Gudmund Grov, Heriot Watt University, UK * Cezar Ionescu, Potsdam Institute, Germany * Ewen Maclean, University of Edinburgh, UK * Florian Rabe (co-chair), Jacobs University, Germany * Tim Sheard, Portland State University, USA * Sergei Soloviev, IRIT, France * Stephen Watt, University of Western Ontario, Canada * Makarius Wenzel, Universit? Paris-Sud, France * Iain Whiteside (co-chair), University of Newcastle, UK * Freek Wiedijk, Radboud University, Netherlands * Wolfgang Windsteiger, RISC, Austria 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 ------------------ Papers should be submitted via the PLMMS 2013 easychair website: https://www.easychair.org/conferences/?conf=plmms2013 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 2013 and present her or his paper. We wish to be flexible with paper length and will accept papers between 4 and 15 pages in length, submitted in PDF format. We invite submissions of both work-in-progress and fully polished research. All papers should be prepared in LaTeX and formatted according to the requirements of Springer's LNCS series. The corresponding style files can be downloaded from: http://www.springer.com/computer/lncs/lncs+authors Papers will be reviewed by at least three reviewers. Informal workshop proceeding will be circulated as a technical report and on CEUR-WS. Links ----- * https://www.easychair.org/conferences/?conf=plmms2013 abstract and paper submission webpage * http://www.springer.com/computer/lncs/lncs+authors submission style guide * http://www.cicm-conference.org/2013/cicm.php?event=plmms&menu=general the PLMMS 2013 web site * http://www.cicm-conference.org/2013/cicm.php the CICM 2013 conference web site -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From j.boender at mdx.ac.uk Tue Mar 12 10:59:43 2013 From: j.boender at mdx.ac.uk (Jaap Boender) Date: Tue, 12 Mar 2013 14:59:43 +0000 Subject: [TYPES/announce] Doctoral studentships in Foundations of Computing at Middlesex University Message-ID: Middlesex University London is offering 24 fully funded doctoral research studentships, amongst others in areas that might be of interest to members of this list: software analysis, formal proofs, complexity and quantum computing. These are three-year scholarships, covering a maintenance award and fee payments. For 2012/13, the maintenance award is ?15,590 per annum for 2012/13, including London weighting and free of tax and national insurance contributions. The Foundations of Computing group, part of the School of Science and Technology, is keen to support qualified candidates (preferably with a masters degree in a relevant area) who are interested in applying for this program. Interested candidates should contact one of the group members listed below informally to discuss a possible project (candidates are asked to submit a personal research statement as part of their application). Complexity: Barnaby Martin Formal proofs: Jaap Boender The deadline for applications is 22 March. The Foundations of Computing group: http://www.cs.mdx.ac.uk/foundations/ More details on the program: http://www.mdx.ac.uk/research/applications/fees/bursaries/index.aspx Lecturer in Foundations of Computing Middlesex University, School of Science and Technology Hendon Town Hall, T120 - tel +44 (0) 208 41 13645 --------------------------------------------------------------------------- Please note that Middlesex University's preferred way of receiving all correspondence is via email in line with our Environmental Policy. All incoming post to Middlesex University is opened and scanned by our digital document handler, CDS, and then emailed to the recipient. If you do not want your correspondence to Middlesex University processed in this way please email the recipient directly. Parcels, couriered items and recorded delivery items will not be opened or scanned by CDS. There are items which are "exceptions" which will be opened by CDS but will not be scanned a full list of these can be obtained by contacting the University. From Christophe.Ringeissen at loria.fr Wed Mar 13 06:54:43 2013 From: Christophe.Ringeissen at loria.fr (Christophe Ringeissen) Date: Wed, 13 Mar 2013 11:54:43 +0100 Subject: [TYPES/announce] FroCoS 2013 Final Call for Papers Message-ID: [Apologies for multiple copies] FINAL CALL FOR PAPERS FroCoS 2013 9th International Symposium on Frontiers of Combining Systems Nancy, France September 18-20, 2013 Submission Deadlines: 15 Apr 2013 (Abs.), 22 Apr 2013 (Paper) http://frocos2013.loria.fr/ GENERAL INFORMATION The 9th International Symposium on Frontiers of Combining Systems will be held in Nancy, France, from 18-20 September 2013. The aim of the conference is to publish and promote progress in research areas requiring the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. FroCos 2013 will be co-located with the 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2013) held 16-19 September 2013. SCOPE OF CONFERENCE: In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. To be usable in practice, these specialized systems must be combined with each other, and must be integrated into general purpose systems. This has led in many research areas to the development of general techniques and methods for the combination and integration of special, formally defined systems, as well as for the analysis and modularization of complex systems. The International Symposium on Frontiers of Combining Systems (FroCoS) traditionally focusses on these types of research questions and activities. Like its predecessors, FroCoS 2013 seeks to offer a common forum for research in the general area of combination, modularization and integration of systems, with emphasis on logic-based ones, and of their practical use. Typical topics of interest include (but are not limited to): * combinations of logics such as combined higher-order, first-order, temporal, modal, description or other non-classical logics; * combinations and modularity in ontologies; * combination of decision procedures, of satisfiability procedures, of constraint solving techniques or of logical frameworks; * combination and integration methods in SAT and SMT solving; * combinations and modularity in term rewriting; * integration of equational and other theories into deductive systems; * combination of deduction systems and computer algebra; * integration of data structures into constraint logic programming and deduction; * hybrid methods for deduction, resolution and constraint propagation; * hybrid systems in knowledge representation and natural language semantics; * combined logics for distributed and multi-agent systems; * logical aspects of combining and modularizing programs and specifications. INVITED SPEAKERS: Stephane Demri LSV, CNRS & ENS de Cachan (joint invited talk with TABLEAUX 2013) Konstantin Korovin The University of Manchester Joel Ouaknine Oxford University Larry Paulson University of Cambridge PUBLICATION DETAILS: The proceedings of the conference will be published in the Springer LNAI/LNCS series. PAPER SUBMISSIONS The program committee seeks high-quality submissions describing original work, written and to be presented in English, not substantially overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://www.easychair.org/conferences/?conf=frocos2013. For each accepted paper, at least one author is required to attend the symposium to present the work. Prospective authors must register a title and an abstract a week before the paper submission deadline. Further information about paper submissions is available at the conference website. IMPORTANT DATES 15 Apr 2013 Abstract submission 22 Apr 2013 Paper submission 6 Jun 2013 Notification of paper decisions 4 Jul 2013 Camera-ready papers due 18-20 Sep 2013 FroCoS Conference PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Alessandro Artale, Free University of Bolzano-Bozen, Italy Franz Baader, TU Dresden, Germany Clark Barrett, New York University, USA Peter Baumgartner, National ICT Australia, Canberra, Australia Christoph Benzmueller, Free University Berlin, Germany Jasmin Christian Blanchette, TU Muenchen, Germany Thomas Bolander, Technical University of Denmark Clare Dixon, University of Liverpool, UK Francois Fages, INRIA Rocquencourt, France Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Vijay Ganesh, University of Waterloo, Canada Silvio Ghilardi, Universita degli Studi di Milano, Italy Guido Governatori, National ICT Australia, Queensland, Australia Bernhard Gramlich, Technische Universitaet Wien, Austria Katsumi Inoue, National Institute of Informatics, Japan Sava Krstic, Intel, USA Alessio Lomuscio, Imperial College London, UK Till Mossakowski, DFKI & University of Bremen, Germany Silvio Ranise, Fondazione Bruno Kessler, Italy Christophe Ringeissen, LORIA, INRIA, France Philipp Ruemmer, Uppsala University, Sweden Renate Schmidt, The University of Manchester, UK Roberto Sebastiani, DISI, University of Trento, Italy Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany Andrzej Szalas, Linkoepings Universitet, Sweden & University of Warsaw, Poland Rene Thiemann, University of Innsbruck, Austria Ashish Tiwari, SRI, USA Josef Urban, Radboud University, The Netherlands Christoph Weidenbach, Max-Planck-Institut fuer Informatik, Germany Frank Wolter, University of Liverpool, UK CONFERENCE CHAIR Christophe Ringeissen, LORIA, INRIA, France PC CHAIRS Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Renate A. Schmidt, The University of Manchester, UK From seasame.workshop at gmail.com Wed Mar 13 18:57:00 2013 From: seasame.workshop at gmail.com (Seasame Workshop) Date: Wed, 13 Mar 2013 18:57:00 -0400 Subject: [TYPES/announce] Call for Papers SEASAME 2013: Int'l Workshop on Software Engineering for sAfety-critical Systems and Medical dEvices Message-ID: [Apologies for multiple postings] ================================================================ SEASAME 2013: International Workshop on Software Engineering for sAfety-critical Systems and Medical dEvices http://www.mcscert.ca/seasame/ Co-located with EUSPN-2013(http://cs-conferences.acadiau.ca/euspn-13/), Niagara Falls, Ontario, Canada October 21-24, 2013 Proudly sponsored by McMaster Centre for Software Certification and IBM Canada R&D Centre ================================================================ Overview ======== This workshop provides a forum for the cutting-edge research results and practices from academia and industries on the design and development of software in safety-critical systems, in particular Software Medical Devices. Safety-critical systems (SCSs) are those systems whose failure could result in loss of life, significant property damage, or damage to the environment. Software are playing an increasingly important part in SCSs. Worldwide regulatory bodies have recognized this trend and released new standards related to the development of software in SCSs, such as ISO 26262 and IEC 61508. This trend is particularly true for Software Medical Devices (SMDs), one of the most important categories of SCSs. Regulatory bodies and industries are investing more on the safety and security issues of SMDs. For examples, Medical Devices Directive in the European Union provides definition and classification of SMDs; the international standard IEC 62304 specifies life cycle requirements for the development of SMDs. However, regardless of the importance attached to SMDs, due to the inherent complexity of software, errors in software codes have been constantly reported to cause different devices to mal-function and led to fatal consequences. Therefore, several questions are urgently presented to SMD developers: how to build robust, dependable, safe and secure SMDs? More importantly, how to make the case for certifying a SMD or a SCS? Topics of Interest ================== The workshop welcomes papers related (but not limited) to the following topics: * Requirements gathering and documentation of safety-critical systems * Architecture design of safety-critical systems * Testing and static analysis of safety-critical systems * Usage of tabular expression in safety-critical systems * Safety, dependability, and security in safety-critical systems * Formal verification of highly dependable systems * Standardization and certification of safety-critical systems * Good practices in the development of Software Medical Device (SMD) ** Challenges in documenting the requirements of Software Medical Device ** Verification and validation of Software Medical Device ** Certification of Software Medical Device ** Legal and ethical issues related to Software Medical Device Paper Submissions ================= Accepted papers will be included in the main conference proceedings published by Elsevier Science in the open-access Procedia Computer Science series. All papers in Procedia will also be indexed by DBLP, Scopus, Engineering Village and EI Compendex. All submissions should be written in English with a maximum paper length of six (6) pages and formatted according to the guidelines( http://www.elsevier.com/wps/find/journaldescription.cws_home/719435/description#description) and templates MS Word ( http://cs-conferences.acadiau.ca/euspn-13/files/PROCS_2011-(2).dotx), Latex (http://cs-conferences.acadiau.ca/euspn-13/files/ecrc-procs_1.zip) of Procedia Computer Science, Elsevier. Papers are submitted using Easychair ( https://www.easychair.org/conferences/?conf=seasame2013). Best papers of SEASAME Workshop will be invited for publication in a special issue (pending) of Journal of Software Engineering and Applications (JSEA, http://www.scirp.org/journal/jsea/). Questions and inquiries should be sent to seasame2013 at easychair.org. Important Dates =============== May.10, 2013: Deadline of Full-length Paper Submission Jun.15, 2013: Notification of Acceptance July.10, 2013: Deadline of Final Camera-ready Paper Submission Oct.21-24, 2013: SEASAME Workshop Workshop Committees =================== Steering Committees (Alphabetical order of last names) ------------------------------------------------------ Yihai Chen, Shanghai Univerisity, China Ridha Khedri, McMaster Univerisity, Canada Hao Wang, IBM Canada R&D Centre, Canada Alan Wassyng, McMaster Univerisity, Canada Workshop Chair -------------- Yihai Chen, Shanghai Univerisity, China Hao Wang, IBM Canada R&D Centre, Canada Program Committees ------------------ Yihai Chen, Shanghai Univerisity, China Zhenbang Chen, National University of Defense Technology, China Johannes Faber, United Nations University, Macau Ridha Khedri, McMaster Univerisity, Canada Yngve Lamo, Bergen University College, Norway Mark Lawford, McMaster University, Canada Wendy MacCaull, St. Francis Xavier University, Canada Tom Maibaum, McMaster University, Canada Huaikou Miao, Shanghai University, China Vera Pantelic, McMaster University, Canada Jay Parlar, General Motors, Canada Adrian Rutle, Aelsund University College, Norway Kahir Eddin Sabri, The University of Jordan, Jordan Hao Wang, IBM Canada R&D Centre, Canada Alan Wassyng, McMaster University, Canada -------------- next part -------------- An HTML attachment was scrubbed... URL: From ronchi at di.unito.it Thu Mar 14 05:07:20 2013 From: ronchi at di.unito.it (Simona Ronchi della Rocca) Date: Thu, 14 Mar 2013 10:07:20 +0100 Subject: [TYPES/announce] CSL'13, last cfp, DATES POSTPONED!! Message-ID: ______________________________________________________________________________________________ CSL 2013 COMPUTER SCIENCE LOGIC 2013 Torino, September 2-5 2013 http://csl13.di.unito.it/ last call-for-paper DATES CHANGED!!!!!!!!!!! _______________________________________________________________________________________________ AIM AND SCOPE Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. LOCATION The 22nd EACSL Annual Conference on Computer Science Logic will be held at Museo di Scienze Naturali in Torino from Monday 2nd through Thursday 5th of September 2013. LIST OF TOPICS OF INTEREST (NON EXHAUSTIVE) automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, game semantics, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, computational proof theory, bounded arithmetic and propositional proof complexity, logic programming and constraints, lambda calculus and combinatory logic, domain theory, categorical logic and topological semantics, database theory, specification, extraction and transformation of programs, logical aspects of quantum computing, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, non-monotonic reasoning. IMPORTANT DATES Abstract submission: April, 8th 2013 Paper Submission: April, 15th 2013 Paper Notification: June, 17th 2013 Paper final version: July, 8th 2013 Conference: September, 2nd --- 5th 2013 SUBMISSION Authors are invited to submit papers of not more than 15 pages in LIPIcs style presenting work not previously published. Papers are to be submitted through Easychair. Submitted papers must be in English and must provide sufficient detail to allow the PC to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the program committee. The submission is in two stages. Abstract submissions are due before April 1st, 2013. Full paper submissions must be done before April 8th, 2013. Papers must not be submitted concurrently to another conference with refereed proceedings. The PC chair should be informed of closely related work submitted to a conference or a journal by March 24th, 2013. Papers authored or co-authored by members of the Programme Committee are not allowed. SATELLITE EVENTS The 9th International Workshop on Fixed Points in Computer Science (FICS'13) will be held on 1st of September 2013 as a satellite event of CSL'13. The 14th International Workshop on Logic and Computational Complexity (LCC'13) will be held on 6th of September 2013 as a satellite event of CSL'13. An international summer school on ?Linear logic and related topics? will be held from 28th through 31st of August 2013 as a satellite event of CSL'13. Further details will appear on this page as soon as possible. PROGRAM COMMITTEE Zena Ariola (University of Oregon) Arnon Avron (Tel-Aviv University) Roberto Bagnara (University of Parma, and BUGSENG srl) Christel Baier (Technical University of Dresden) Marc Bezem (University of Bergen) Paola Bruscoli (University of Bath, Computer Science Department) Agata Ciabattoni (TU Wien) Thierry Coquand (Chalmers University) Ugo Dal Lago (Universit? di Bologna) Valeria De Paiva (Nuance Communications) Reinhard Kahle (CENTRIA and DM, UNL, Portugal) Stephan Kreutzer (Technical University Berlin) Olivier Laurent (CNRS - ENS Lyon) Carsten Lutz (Universit?t Bremen) Jean-Yves Marion (Universit? de Lorraine, LORIA) Damian Niwinski (Warsaw University) Frank Pfenning (Carnegie Mellon University) Elaine Pimentel (UFMG) Ruzica Piskac (Max Planck Institute for Software Systems (MPI-SWS)) Simona Ronchi Della Rocca CHAIR (Universit? di Torino) Jan Rutten (CWI) Helmut Schwichtenberg (LMU Munich) Phil Scott (Dept. of Math & Stats, U. Ottawa) Peter Selinger (Dalhousie University) Makoto Tatsuta (National Institute of Informatics) Tachio Terauchi (Nagoya University) ORGANIZING COMMITTEE Erika De Benedetti (Dipartimento di Informatica, Torino) Paola Giannini (Dipartimento di Scienze e Innovazione Tecnologica (DISIT), Alessandria) Mauro Piccolo (Dipartimento di Informatica, Torino) Luca Padovani (Dipartimento di Informatica, Torino) Luca Paolini (Dipartimento di Informatica, Torino) Simona Ronchi Della Rocca (Dipartimento di Informatica, Torino) Luca Roversi (Dipartimento di Informatica, Torino) Angelo Troina (Dipartimento di Informatica, Torino) ---------------------------------------- Simona Ronchi Della Rocca full Professor of "Foundations of Computer Science" Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : ronchi at di.unito.it phone: +39-011-6706734 fax : +39-011-751603 mobile: +39-320-4205121 http://www.di.unito.it/~ronchi -------------- next part -------------- An HTML attachment was scrubbed... URL: From aravara at fct.unl.pt Thu Mar 14 06:08:50 2013 From: aravara at fct.unl.pt (Antonio Ravara) Date: Thu, 14 Mar 2013 10:08:50 +0000 Subject: [TYPES/announce] 2nd Call for Papers: 9th Workshop on Automated Specification and Verification of Web Systems (WWV'13) Message-ID: <5141A1B2.4000903@fct.unl.pt> ************************************************************ * * * WWV 2013 * * * * Automated Specification and Verification of Web Systems * * 9th International Workshop * * * * June 6th, Florence (Italy) * * * * 2nd Call for Papers * * * ************************************************************ Homepage: http://users.dsic.upv.es/~jsilva/wwv2013/ IMPORTANT DATES Abstract Submission March 22, 2013 Full Paper Submission March 29, 2013 Acceptance Notification May 3, 2013 Camera Ready (pre-proceedings) May 20, 2013 Workshop June 6, 2013 Camera Ready (post-proceedings) June 26, 2013 SCOPE The Workshop on Automated Specification and Verification of Web Systems (WWV, http://users.dsic.upv.es/grupos/elp/wwv/) is a yearly workshop that aims at providing an interdisciplinary forum to facilitate the cross-fertilization and the advancement of hybrid methods that exploit concepts and tools drawn from Rule-based programming, Software engineering, Formal methods and Web-oriented research. Nowadays, many companies and institutions have diverted their Web sites into interactive, completely-automated, Web-based applications for, e.g., e-business, e-learning, e-government and e-health. The increased complexity and the explosive growth of Web systems has made their design and implementation a challenging task. Systematic, formal approaches to their specification and verification can permit to address the problems of this specific domain by means of automated and effective techniques and tools. Topics of either theoretical or applied interest include, but are not limited to: - Rule-based approaches to Web system analysis, certification, specification, verification, and optimization. - Languages and models for programming and designing Web systems. - Formal methods for describing and reasoning about Web systems. - Model-checking, synthesis and debugging of Web systems. - Analysis and verification of linked data. - Abstract interpretation and program transformation applied to the semantic Web. - Intelligent tutoring and advisory systems for Web specifications authoring. - Middleware and frameworks for composition and orchestration of Web services. - Web quality and Web metrics. - Web usability and accessibility. - Testing and evaluation of Web systems and applications. AUDIENCE Participation to WWV is open. The workshop is intended for, but not limited to, researchers from the communities of Rule-based programming, Software engineering, Formal methods and Web-oriented research. SUBMISSION Submitted papers should present original unpublished work and cannot be under review for publication elsewhere. Each paper will undergo a thorough evaluation by at least three reviewers, chosen by the Program Committee. Contributions should be submitted through the EasyChair online submission system in PDF format, and should be prepared in LaTeX using the EPTCS-style format and should not exceed 15 pages (typeset 11 points). Submission is a firm commitment that at least one of the authors will attend the workshop, if the paper is accepted. PUBLICATION Accepted papers will be included in the pre-proceedings, which will be made available in electronic form through the WWV web site. After the workshop, authors of accepted papers will be asked to prepare, by incorporating insights gathered during the event, a final version of their paper to be published in the post-proceedings. We plan to publish the workshop post-proceedings as a volume of the EPTCS series. The previous 7 editions of WWV attracted high quality papers that were published in ENTCS (WWV'05, WWV'07, WWV'08), IEEE (WWV'06) and EPTCS (WWV'11,WWV'12). After WWV'09, a special issue of the Journal of Symbolic Computation on the topics of the WWV has been organized. Similarly, a special issue of the Journal of Applied Logic has been organized after WWV'10, and a special issue of the Journal of Logic and Algebraic Programming is being organized after WWV'11 and WWV'12. STEERING COMMITTEE Maria Alpuente Technical University of Valencia, Spain (co-Chair) Demis Ballis University of Udine, Italy Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy (co-Chair) Laura Kovacs Vienna University of Technology, Austria Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Rosario Pugliese University of Florence, Italy Josep Silva Technical University of Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy WORKSHOP CO-CHAIRS Antonio Ravara New University of Lisbon, Portugal Josep Silva Technical University of Valencia, Spain PROGRAM COMMITTEE Jesus Almendros University of Almeria, Spain Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz University of Minho, Portugal Raymond Hu Imperial College London, United Kingdom Ivan Lanese University of Bologna/INRIA, Italy Anders Moller Aarhus University, Denmark Elie Najm Telecom ParisTech, France Kostis Sagonas University of Uppsala, Sweden Francesco Tiezzi IMT, Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom INVITED SPEAKERS Gerhard Friedrich University of Klagenfurt, Austria Francois Taiani University of Rennes 1, France WORKSHOP FORMAT One full day meeting, including 1 or 2 invited talks and about 8 refereed contributions. PAST WORKSHOP EDITIONS Started in 2005, the series of this workshop established itself as a lively, friendly event with many interactions and discussions. 1. WWV'05 in Valencia, Spain; March 14-15, 2005 homepage: http://users.dsic.upv.es/workshops/wwv05/ 2. WWW'06 in Paphos, Cyprus; November 19, 2006 homepage: http://users.dsic.upv.es/workshops/wwv06/ 3. WWV'07 in Venice, Italy; December 14, 2007 homepage: http://wwv07.dimi.uniud.it/ 4. WWV'08 in Siena, Italy; July 4, 2008 homepage: http://wwv08.dimi.uniud.it/ 5. WWV'09 in Castle of Hagenberg, Austria; July 17, 2009 homepage: http://www.risc.uni-linz.ac.at/about/conferences/wwv09/ 6. WWV'10 in Vienna, Austria; July 30-31, 2010 homepage: http://www.complang.tuwien.ac.at/WWV2010/ 7. WWV'11 in Reykjavik, Iceland; June 9, 2011 (as part of DisCoTec 2011) homepage: http://rap.dsi.unifi.it/wwv2011/ 8. WWV'12 in Stockholm, Sweden; June 16, 2012 (as part of DisCoTec 2012) homepage: http://users.dsic.upv.es/~jsilva/wwv2012/ From jonathanheras at computing.dundee.ac.uk Thu Mar 14 07:41:48 2013 From: jonathanheras at computing.dundee.ac.uk (Jonathan Heras) Date: Thu, 14 Mar 2013 11:41:48 +0000 Subject: [TYPES/announce] 20th Automated Reasoning Workshop, April 2013, Dundee Message-ID: <5141B77C.6010608@computing.dundee.ac.uk> ********************************************************************* 20th Automated Reasoning Workshop (ARW'13) 11-12 April 2013 School of Computing, University of Dundee, UK www.computing.dundee.ac.uk/staff/katya/arw2013 FINAL CALL FOR PARTICIPATION ********************************************************************* ARW'13 full programme is now published here: http://www.computing.dundee.ac.uk/staff/katya/arw13/timetable.html Reminder: early registration deadline is the 1st April 2013. ********************************************************************* The University of Dundee is a Scottish Registered Charity, No. SC015096. From dale at lix.polytechnique.fr Thu Mar 14 12:02:39 2013 From: dale at lix.polytechnique.fr (Dale Miller) Date: Thu, 14 Mar 2013 17:02:39 +0100 Subject: [TYPES/announce] Postdocs available in Proof Certificates Message-ID: One or two postdoctoral positions are available within the Parsifal team, a joint research team between INRIA Saclay and the Laboratoire d?Informatique (LIX) on the campus of Ecole Polytechnique. Successful candidates will help with designing, implementing, and experimentally validating the design of proof certificates for a range of theorem provers in intuitionistic and classical logic and arithmetic. These positions are for one year, with a second year extension possible. Candidates should start in Fall 2013. These positions are funded by ProofCert, an ERC Advanced Grant with the goal of designing a format for proof certificates that can capture the proof evidence within all major theorem provers while also being checkable by a simple, declarative proof checker. This format must allow treating some inference steps as (non-deterministic) computation as well as supporting (bounded) proof reconstruction. The ideal candidate should have strong backgrounds in - basic proof theory (in particular, the sequent calculus); - various automated and interactive theorem proving systems (particularly those involving induction); and - programming in logic programming (Prolog or lambda Prolog) as well as other high-level programming languages (such as ML or Haskell). *Venue* Employed postdocs will be members of the INRIA Parsifal team which is located in the Laboratoire d?Informatique (LIX) on the campus of Ecole Polytechnique. This campus is situated to the south of Paris and is an easy commute from Paris on the RER B regional train line. French proficiency is not a requirement. *Application* Candidates must have a Ph.D.; if the Ph.D. thesis is not yet defended when the application is made, the candidate should provide the planned defense date and the composition of the thesis committee. To apply, contact Dale Miller (dale.miller at inria.fr) and include a cover letter and (links to) your CV and publication list. Additional material, such as letters of recommendation, will be requested if necessary. Early expression of interest is encouraged. We plan to make a decision on this position in mid-April 2013. *More Information* Further information regarding ProofCert and the Parsifal team can be found at the following urls. - The ERC Advanced Grant ProofCert: http://team.inria.fr/parsifal/proofcert/ - The INRIA Parsifal team: http://team.inria.fr/parsifal/ - Positions offered by Parsifal in 2013: http://team.inria.fr/parsifal/positions/ - Miller's web page: http://www.lix.polytechnique.fr/Labo/Dale.Miller/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.k.f.holzenspies at utwente.nl Fri Mar 15 13:02:08 2013 From: p.k.f.holzenspies at utwente.nl (p.k.f.holzenspies at utwente.nl) Date: Fri, 15 Mar 2013 17:02:08 +0000 Subject: [TYPES/announce] Second CfP for the International Workshop on Trends in Functional Programming In Education (TFPIE) Message-ID: L.S., Apologies for any duplicates you may receive. Please find below the Second Call for Papers for the Second International Workshop on Trends in Functional Programming In Education (TFPIE). Since the first CfP, we have confirmed that the proceedings will be published in the Electronic Proceedings in Theoretical Computer Science. Moreover, we've started short-listing candidates for a key-note. Your suggestions for keynote speakers are welcome. More information will become available on the workshop's website [1]. Please forward this CfP to whatever forum you consider appropriate. Regards, Philip K.F. H?lzenspies Programme Committee Chair TFPIE 2013 [1]?http://wwwhome.ewi.utwente.nl/~holzenspiespkf/TFPIE2013.html Second Call for Papers the Second International Workshop on Trends in Functional Programming in Education TFPIE ----- The second International Workshop on Trends in Functional Programming in Education, TFPIE 2013, is co-located with Trends in Functional Programming (TFP 2013) at Brigham Young University in Utah. The goal of TFPIE is to gather researchers, teachers and all professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue were novel ideas, classroom-tested ideas and work-in-progress on the use of funcitonal programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2013 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or an article (up to 16 pages) in EPTCS style. The authors of all accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Any visitors to the TFPIE 2013 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, the presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science journal (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TFPIE 2013 welcomes submissions describing practical techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - Teaching FP to highschool, beginning CS, and graduate students - FP as a teaching tool for other (CS) topics - FP and Robotics, Music and Philosophy - Advanced FP for undergraduates - Engaging students in research using FP - FP in Programming Languages - FP as a stepping stone to other CS topics Venue ----- Brigham Young University (BYU) is the third-largest private university and the largest explicitly religious university in the United States of America. Although BYU is owned and operated by the LDS church, the workshop is independent of this affiliation. By BYU's own pen: "Brigham Young University seeks to develop students of faith, intellect and character who have the skills and the desire to continue learning and to serve others throughout their lives. Established in 1875, the university provides an outstanding education in an atmosphere consistent with the ideals and principles of its sponsor, The Church of Jesus Christ of Latter-day Saints. Known for its academically minded and internationally experienced student body, its world-class teaching and its beautiful mountain location, BYU is also recognized for its extensive language programs, talented performing arts ensembles, outstanding sports programs and devotion to combining solid scholarship with the principles of the restored gospel of Jesus Christ." See the website for submission instructions and updated information. From jewillco at osl.iu.edu Fri Mar 15 13:11:17 2013 From: jewillco at osl.iu.edu (Jeremiah Willcock) Date: Fri, 15 Mar 2013 13:11:17 -0400 (EDT) Subject: [TYPES/announce] Workshop on Generic Programming (WGP 2013) -- call for papers Message-ID: Dear sir or madam: Apologies if you receive multiple copies of this CFP. ====================================================================== CALL FOR PAPERS WGP 2013 9th ACM SIGPLAN Workshop on Generic Programming Boston, Massachusetts, USA Saturday, September 29th, 2013 http://www.wgp-sigplan.org/2013 Co-located with the International Conference on Functional Programming (ICFP 2013) ====================================================================== 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 * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- Jeremiah Willcock (co-chair), Indiana University Jacques Carette (co-chair), McMaster University Florian Rabe, Jacobs University Bremen Emilie Balland, INRIA Bordeaux Jeremy Siek, University of Colorado, Boulder Gabriel Dos Reis, Texas A&M University Christophe Raffalli, Savoie University Anya Helene Bagge, Universitetet i Bergen Tiark Rompf, Ecole Polytechnique Federale de Lausanne Andreas Abel, Ludwig-Maximilians-Universitat Munchen Edward Kmett, S&P Capital IQ William Cook, University of Texas, Austin Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy). Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Submission details ------------------ Deadline for submission: Friday 2013-06-14 Notification of acceptance: Wednesday 2013-07-11 Final submission due: Tuesday 2013-07-25 Workshop: Sunday 2013-09-28 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). The length is restricted to 12 pages. Travel Support -------------- Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://www.sigplan.org/PAC.htm). History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Copenhagen, Denmark 2012 (affiliated with ICFP12), * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * 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). WGP Steering Committee ---------------------- Marcin Zalewski (chair) Bruno Oliveira Jaako J?rvi Shin-Cheng Mu Andres L?h Ronald Garcia Magne Haveraaen Tim Sheard Stephanie Weirich From icfp.publicity at googlemail.com Sat Mar 16 16:31:00 2013 From: icfp.publicity at googlemail.com (David Van Horn) Date: Sat, 16 Mar 2013 16:31:00 -0400 Subject: [TYPES/announce] ICFP 2013: Second Call for Papers Message-ID: ===================================================================== 18th ACM SIGPLAN International Conference on Functional Programming ICFP 2013 Boston, MA, USA, 25-27 September 2013 http://www.icfpconference.org/icfp2013 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Thursday, 28 March 2013 23:59 UTC-11 (Pago Pago, American Samoa, time) Author response: Wednesday, 22 May 0:00 UTC-11 Friday, 24 May 2013 23:59 UTC-11 Notification: Friday, 7 June 2013 Final copy due: Friday, 5 July 2013 Scope ~~~~~ ICFP 2013 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. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * 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; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * 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: teaching introductory programming; parallel programming; mathematical proof; algebra * 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 If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Thursday, 28 March 2013, 23:59 UTC-11 (American Samoa time), submit a full paper of at most 12 pages (6 pages 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.sigplan.org/Resources/Policies/Republication * 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 reviewer 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. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. 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:http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web athttps://www.easychair.org/conferences/?conf=icfp2013 . 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 72-hour period, starting at 0:00 UTC-11 on Wednesday, 22 May 2013, 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 2013. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. General Chair: Greg Morrisett, Harvard University Program Chair: Tarmo Uustalu, Institute of Cybernetics, Tallinn Program Committee: Thorsten Altenkirch, University of Nottingham Olaf Chitil, University of Kent Silvia Ghilezan, University of Novi Sad Michael Hanus, Christian-Albrechts-Universit?t zu Kiel Fritz Henglein, University of Copenhagen Mauro Jaskelioff, Universidad Nacional de Rosario Alan Jeffrey, Alcatel-Lucent Bell Labs Shin-ya Katsumata, Kyoto University Shriram Krishnamurthi, Brown University John Launchbury, Galois Ryan Newton, Indiana University Sungwoo Park, Pohang University of Science and Technology Sam Staton, University of Cambridge Nikhil Swamy, Microsoft Research, Redmond, WA Dimitrios Vytiniotis, Microsoft Research, Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From francesco.tiezzi at imtlucca.it Sun Mar 17 05:35:02 2013 From: francesco.tiezzi at imtlucca.it (Francesco Tiezzi) Date: Sun, 17 Mar 2013 10:35:02 +0100 Subject: [TYPES/announce] DisCoTec 2013: Workshops CfP Message-ID: <0C33CDFB-056A-4146-9C9A-173ABBB1627A@imtlucca.it> [We apologize for multiple copies] ====================================================================== DisCoTec 2013: Workshops Call for Papers 8th Int. Federated Conference on Distributed Computing Techniques Firenze, Italy, June 6 2013 http://www.discotec.org/ ====================================================================== The DisCoTec series of federated conferences is one of the major events sponsored by the International Federation for Information processing (IFIP). The three workshops co-located this year with DisCoTec are: ---------------------------------------------------------------------- CS2Bio 2013 4th International Workshop on Interactions between Computer Science and Biology http://cs2bio13.di.unito.it/ The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science and Life Sciences. In particular, we solicit the contribution of original results, from research areas, such as Mathematics, Physics, Complex Systems, and Computational Science that address both theoretical aspects of modelling and applied work on the comprehension of biological behaviour. Furthermore, to facilitate the integration of different research areas, we encourage the presentation of main objectives and preliminary results of active projects on the CS2Bio topics conducted by interdisciplinary teams. * Co-Chairs * Emanuela Merelli (Universit? di Camerino, Italy) Angelo Troina (Universit? di Torino, Italy) * Important dates * Submission deadline: March 26, 2013 Notification to authors: May 03, 2013 ---------------------------------------------------------------------- ICE 2013 6th Interaction and Concurrency Experience http://www.discotec.org/workshops/ice2013/ 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 of the venue includes theoretical and applied aspects of interactions and the handshaking mechanisms used among components of concurrent/distributed systems, but every experience focuses on a different specific topic related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. * Co-Chairs * Marco Carbone (IT University of Copenhagen, Denmark) Ivan Lanese (Universit? di Bologna, Italy) Ana Sokolova (Eindhoven Univ. of Technology, The Netherlands) Alberto Lluch Lafuente (IMT Lucca, Italy) * Important dates * Full paper submission: March 20, 2013 Reviews, rebuttal, and PC discussion: April 1?21, 2013 Notification to authors: April 24, 2013 ---------------------------------------------------------------------- WWV 2013 9th International Workshop on Automated Specification and Verification of Web Systems http://users.dsic.upv.es/~jsilva/wwv2013/ The Workshop on Automated Specification and Verification of Web Systems (WWV) is a yearly workshop that aims at providing an interdisciplinary forum to facilitate the cross-fertilization and the advancement of hybrid methods that exploit concepts and tools drawn from Rule-based programming, Software engineering, Formal methods and Web-oriented research. Nowadays, many companies and institutions have diverted their Web sites into interactive, completely-automated, Web-based applications for, e.g., e-business, e-learning, e-government and e-health. The increased complexity and the explosive growth of Web systems has made their design and implementation a challenging task. Systematic, formal approaches to their specification and verification can permit to address the problems of this specific domain by means of automated and effective techniques and tools. * Co-Chairs * Ant?nio Ravara (New University of Lisbon, Pourtugal) Josep Silva (Universidad Polit?cnica de Valencia, Spain) * Important dates * Abstract submission: March 22, 2013 Full paper submission: March 29, 2013 Notification to authors: May 3, 2013 From alain.girault at inria.fr Sun Mar 17 18:21:28 2013 From: alain.girault at inria.fr (Alain Girault) Date: Sun, 17 Mar 2013 23:21:28 +0100 Subject: [TYPES/announce] Postdoc position at INRIA Grenoble : Foundations and programming for recoverable embedded systems Message-ID: <514641E8.8080302@inria.fr> Proposal for Post-doc Position ============================== Title ===== Foundations and programming for recoverable embedded systems Team ==== Spades, Inria Rhone-Alpes, Grenoble (http://team.inria.fr/spades) Supervisors =========== Pascal Fradet Pascal.Fradet at inria.fr Jean-Bernard Stefani Jean-Bernard.Stefani at inria.fr Starting date and length ======================== 16 months post-doc starting imperatively in 2013 ideally around September or October 2013 Abstract ======== Embedded systems are omnipresent today: automotive, electronic appliances, space, avionics, nuclear... Due to the target domains, embedded systems are critical and they must be tolerant to failures. In this project, we are interested in software solutions to implement fault-tolerance policies in such systems. Recent works by Bonakdarpour et al. have considered e.g. compositional design of real-time fault-tolerant (fault-masking) programs and initiated an analysis of fault recovery in component-based design. In parallel, other recent works(e.g., Fradet et al.) have considered how to automate the construction of real time fault-tolerant programs by means of program transformations, or the use of aspect-oriented programing techniques for fault management. Others, (e.g., Bruni et al. and Lanese et al.) have developed extensive analysis of fault recovery schemes in Web services which are based on compensations. However, we currently lack a comprehensive formal framework that handles the fault-tolerance concerns prevalent in networked embedded systems. In particular, we are lacking a theory and associated programming and verification tools dealing with non-masking forms of fault tolerance such as fault recovery. These techniques are specially important since fault masking methods such as spatial replication are often too expensive. The goal of the postdoc is twofold. First, it will strive to develop a formal theory of recoverable programs or components. Second, it will seek to develop programming techniques and tools to aid in the incremental construction of systems with fault recovery (typically exploiting program transformations or program weaving techniques). This study will be conducted at a semantic level (e.g., on labeled transition systems or formal calculi) in order to consider (and be applied to) both programs or software components. Several questions will be worth considering: - how well can one achieve a true separation of fault-recovery concerns? - can fault recovery schemes be realized efficiently and modularly as superimposed programs? - how to take into account dynamic component structures? - what is the relationship between fault recovery schemes in a component-based model and compensation studied for Web services? - can one exploit a reversible programming model as studied by Lanese et al. in the design of fault-recovery schemes for component systems? Key-Words ========= Fault-tolerance, compensation, embedded systems, weaving, program transformation References ========== B. Bonakdarpour and S. S. Kulkarni. Compositional verification of real-time fault-tolerant programs. In Proceedings of EMSOFT, 2009. B. Bonakdarpour, M. Bozga, and G. Goessler. A theory of fault recovery for component-based models. In 14th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011. LNCS 7596. T. Ayav, P. Fradet, and A. Girault. Implementing fault-tolerance in real-time programs by automatic program transformations. ACM Trans. Embedded Comput. Syst. 7(4), 2008. P. Fradet and S. Hong Tuan Ha. Aspects of availability: Enforcing timed properties to prevent denial of service. Sci. Comput. Program., 75(7), 2010. I. Lanese, C. Vaz, and C. Ferreira. On the Expressive Power of Primitives for Compensation Handling. In Proceedings ESOP, 2010. LNCS 6012. I. Lanese, M. Lienhardt, C.A. Mezzina, J.B. Stefani. A Reversible Abstract Machine and Its Space Overhead. In Proceedings FMOODS/FORTE, 2012. LNCS 7273. Required Skills =============== The candidate should have a PhD in formal methods (e.g., compilation, semantics, verification, validation, ...). He should possess a good background in programming languages, their semantics and implementation. A good knowledge of formal models for concurrent computation, real-time and/or embedded systems and/or programming techniques such as aspect-oriented programming would be a plus. Context ======= The SPADES team at INRIA Grenoble conducts research on programming dependable networked embedded systems. As part of that effort, the team develops new formal component models, programming languages and associated tools for verification, analysis or synthesis. From turon at mpi-sws.org Mon Mar 18 03:21:51 2013 From: turon at mpi-sws.org (Aaron Turon) Date: Mon, 18 Mar 2013 08:21:51 +0100 Subject: [TYPES/announce] Workshop on Languages for the Multicore Era (LaME 2013) -- call of papers Message-ID: LaME 2013 Second Workshop on Languages for the Multicore Era * 1 July, 2013, Montpellier, France * Co-located with ECOOP/ECSA/ECMFA 2013 * Submission deadline: 1 May, 2013 * http://lame2013.dei.uc.pt/ = OVERVIEW = With the shift to multicore hardware, there has been a resurgence of interest in parallel programming at every level of software systems. Extracting good parallel speedup for irregularly-structured problems without resorting to full-blown concurrent programming remains a difficult challenge. To the extent that concurrency is exposed, it poses well-known risks: unintended races, nondeterministic behavior, deadlocks, and weak memory consistency. And in any case, performance problems are often difficult to diagnose and fix: they may stem from task granularity and scheduling choices, or from false sharing and other cache coherence effects, which are often not under direct programmer control. These challenges present an opportunity for research on languages to make a significant impact on programming practice. LaME provides a venue for exploring how languages and related artifacts (e.g., abstractions implemented as libraries, compilers, analysis tools, and parallel runtimes) can make parallel programming safer and more productive, without sacrificing performance. The workshop allows researchers to present new ideas, research directions, and preliminary results in an informal atmosphere that fosters discussion and feedback. = TOPICS = LaME is an interactive venue for describing, discussing, and evaluating programming language support for parallel execution on multicore computers. We interpret ?programming language? broadly to include language-like abstractions (e.g., parallel APIs implemented as libraries or embedded DSLs) and language-support tools such as optimizers, analysis tools, and IDEs. We interpret ?multicore? broadly to include heterogeneous parallel units such as GPUs. Multicore can also include distributed computing, so long as there is a multicore component (e.g., programming a cluster of multicore nodes). = SUBMISSIONS = Authors are invited to submit original and unpublished work that exposes a new problem, advocates a specific solution, or reports on actual experience. Preliminary results and/or position papers likely to spur interesting discussions are encouraged. Papers must be submitted using the standard two-column ACM SIG proceedings or SIG alternate template in either 9-point or 10-point font. Submissions are limited to six pages including figures, tables, and references. Papers will be reviewed and selected based on relevance, interest, clarity, and technical correctness. Final papers will be made available on the workshop web site, but to facilitate resubmission to more formal venues, no archival proceedings will be published, and papers will not be sent to the ACM Digital Library. = IMPORTANT DATES = Submission: 1 May 2013 Notification: 15 May 2013 Final version: 15 June 2013 Early registration: 1 June 2013 Workshop: 1 July 2013 = ORGANIZERS = Robert Bocchino (Carnegie Mellon University) rbocchin at cs.cmu.edu Aaron Turon (Max Planck Institute for Software Systems) turon at mpi-sws.org = PROGRAM COMMITTEE = Lars Bergstrom (University of Chicago) Robert Bocchino (CMU) Sebastian Burckhardt (Microsoft Research) Bruno Cabral (University of Coimbra) Doug Lea (SUNY Oswego) Aaron Turon (MPI-SWS) From kutsia at risc.jku.at Mon Mar 18 07:55:59 2013 From: kutsia at risc.jku.at (Temur Kutsia) Date: Mon, 18 Mar 2013 12:55:59 +0100 Subject: [TYPES/announce] CFP: SCSS 2013 Message-ID: <514700CF.4050309@risc.jku.at> [Please post - apologies for multiple copies.] First Call for Papers =================================================================== SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ =================================================================== Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research Redmond, US) Adel Bouhoula (Ecole Superieure des Communications de Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University - Qatar Campus, Quatar) Horatiu Cirstea (LORIA, France) J?rgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, US) Yasuhiko Minamide (University of Tsukuba, Japan) Andr? Platzer (Carnegie Mellon University, US) Stefan Ratschan (Czech Academy of Sciences, Czech Republic) Enric Rodr?guez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) (More to be confirmed) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Important Dates --------------- April 30, 2013: Abstract submission deadline May 3, 2013: Paper submission deadline June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: SCSS 2013, Castle of Hagenberg, Austria Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing. From web.alessio.guglielmi at gmail.com Mon Mar 18 13:40:20 2013 From: web.alessio.guglielmi at gmail.com (Alessio Guglielmi) Date: Mon, 18 Mar 2013 17:40:20 +0000 Subject: [TYPES/announce] PhD Research Project: Efficient and Natural Proof Systems Message-ID: <51475188.c95fb40a.4266.ffffbb3c@mx.google.com> Hello, could you please help us advertise the following position? Ciao, -Alessio *** PhD Studentship *** Research Project: Efficient and Natural Proof Systems Institution: University of Bath - Department of Computer Science PhD Supervisors: Alessio Guglielmi and/or Guy McCusker Application Deadline: 17 April 2013 Math is growing more complex each day, to the point that the assistance of computers is becoming necessary even for the most theoretically inclined among the mathematicians (see this recent article by Natalie Wolchover on Wired: ). After centuries of producing proofs in our heads and then describing them in papers, we are moving fast towards a future of proofs conceived by humans together with computers, which in turn will guarantee their correctness and availability. But what is a proof? What could a common language between humans and computers be? A satisfying definition of mathematical proof has proved to be a very elusive concept. Suffice to say that the problem of deciding whether two formal proofs are the same has remained open since Hilbert formulated it more than one hundred years ago. Finding efficient and natural proof systems is a fascinating problem that spans from philosophy, through math, to computer science. There is growing evidence that, at its core, good solutions can be provided by geometrical ideas. Indeed, many mathematicians interested in the foundations of mathematics have recently turned to geometry. We propose a PhD in the context of the EPSRC project `Efficient and Natural Proof Systems? (see at ). In this project, we will define a new proof system which, essentially, will represent proofs as geometric shapes equivalent under continuous deformation. Three areas of mathematics and theoretical computer science concur in the definition of these proof systems: categorical semantics, proof theory and proof complexity. The result of this project will be the completion of three decades of efforts in proof theory that started with linear logic and continued with deep inference (see [beware, there are jokes in that page]). We are looking for a brilliant mathematician or theoretical computer scientist who is not afraid of working with category theory and who has a good geometric intuition. We provide a fully funded three-year PhD position in the exceptional research environment of one of the best worldwide research groups in semantics and proof theory (see at ). Your full tuition fees will be covered and you will receive a standard EPSRC maintenance payment of ?13,726/annum (13/14 rate) for three years. Funding for this project is available to citizens of a number of European countries (including the UK). In most cases this will include all EU nationals. However full funding may not be available to all applicants and you should read the full department and project details for further information. To apply, start here: . Feel free to contact Alessio Guglielmi for any question you might have about this position. From Ralph.Matthes at irit.fr Mon Mar 18 13:50:07 2013 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Mon, 18 Mar 2013 18:50:07 +0100 Subject: [TYPES/announce] Types Meeting 2013 in Toulouse, 22 - 26 April: call for participation Message-ID: <1363629007.13315.29.camel@coinduct> Types Meeting 2013 Toulouse, 22-26 April 2013 http://www.irit.fr/TYPES2013/ CALL FOR PARTICIPATION The 19th Conference "Types for Proofs and Programs" will take place in Toulouse, France, from 22 to 26 April 2013 - including the pre-conference workshop PCC on April 22 and 23 and the post-conference workshop CSPM in the afternoon of April 26. The scientific programme of the main event is from the morning of April 23 (Tuesday) until lunch time on April 26. For an overview of the whole planning, see the web site. 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 (abstracts are available on the web site): * Steve Awodey, School of Mathematics, Institute for Advanced Study, Princeton, U.S.A. & Department of Philosophy, Carnegie Mellon University, U.S.A. "Higher Inductive Types in Homotopy Type Theory" * Lars Birkedal, Department of Computer Science, Aarhus University, Denmark "Charge! a framework for higher-order separation logic in Coq." * Ulrich Kohlenbach, Department of Mathematics, TU Darmstadt, Germany "Types in Proof Mining" TYPES 2013 is intended to be a conference in our traditional workshop style. The contributed talks were selected by the program committee on the basis of abstracts of up to two pages (in EasyChair LaTeX style). 34 contributed talks were finally accepted for presentation, see their list via the web site or directly at http://www.irit.fr/TYPES2013/accepted.html The deadline for the final version of LaTeX sources for inclusion of the abstracts into the abstract book is Monday, April 1st. The abstracts will then be made available on the web site. Post-proceedings of TYPES 2013 are confirmed to appear in LIPIcs (Leibniz International Proceedings in Informatics), Schloss Dagstuhl, see http://www.dagstuhl.de/en/publications/lipics (the same publisher as for the last TYPES meeting in Bergen in 2011) There will be a separate call for papers, and participation in TYPES 2013 is no prerequisite for submission to the post-proceedings. The conference itself: Tuesday to Friday, April 23-26 (end of scientific programme on Friday planned for 12:30) The venue: Toulouse in the South West of France is the fourth largest city of France and a lively university center with way over 100000 students. Toulouse offers numerous inexpensive accommodations, including student residences. On the web site, there are links to hotels and residences - even one of the latter only 500m walking distance from the lecture hall of the main event. Thanks to our sponsors, notably Universit? Toulouse 1 Capitole, granting the lecture hall in the city center, and IRIT (Institut de Recherche en Informatique de Toulouse), the federative research structure FREMIT and Universit? Paul Sabatier (Toulouse 3) with financial support (other sources pending), we are able to keep the participation fee low. Moreover, we operate a scheme of additional fee reduction for master and PhD students. *** Early registration will be until *** *** Wednesday, April 3, 23:59 Paris time. *** Access to the online registration system is through http://www.irit.fr/TYPES2013/Registration.html where the fees can be studied offline. SATELLITE EVENTS ----------------------------------------------------------------------- The twelfth international workshop Proof, Computation, Complexity (PCC 2013) is held on Monday, April 22, and Tuesday, April 23. On Monday, this takes place on the campus of Toulouse Technical University (which is well connected by underground with the city center and the airport bus) and on Tuesday, this is on the site of TYPES 2013. The program committee of PCC 2013 selected 12 contributed talks on the basis of short abstracts. For the details, see http://www.irit.fr/TYPES2013/PCC2013/ ----------------------------------------------------------------------- Workshop CSPM "Computer Science, Philosophy, Mathematics", a workshop hosted by the Mathematical Institute, and with financial support by FREMIT. Speakers: 14:30-16:00 Steve Awodey, 16:15-17:45 Ulrich Kohlenbach, titles to be announced The workshop aims to stimulate discussions between computer scientists, philosphers and mathematicians and takes place in the Mathematical Institute, which requires approximately 20 minutes walk + 20 minutes on the subway from the main TYPES conference location. There will be no extra fee for participating in the workshop CSPM. A dedicated web page will appear soon and will be linked from the main page of TYPES 2013. ----------------------------------------------------------------------- Program Committee TYPES 2013 Jos? Esp?rito Santo, University of Minho, Braga, Portugal Herman Geuvers, Radboud University Nijmegen, Netherlands Silvia Ghilezan, University of Novi Sad, Serbia Hugo Herbelin, PPS, INRIA Rocquencourt-Paris, France Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany Zhaohui Luo, Royal Holloway, University of London, UK Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair) Marino Miculan, University of Udine, Italy Bengt Nordstr?m, Chalmers University of Technology, G?teborg, Sweden Erik Palmgren, Stockholm University, Sweden Andy Pitts, University of Cambridge, UK Sergei Soloviev, IRIT, Univ. de Toulouse, France (co-chair) Pawe? Urzyczyn, University of Warsaw, Poland Tarmo Uustalu, Tallinn Technical University, Estonia From asolar at csail.mit.edu Mon Mar 18 14:46:57 2013 From: asolar at csail.mit.edu (Armando Solar-Lezama) Date: Mon, 18 Mar 2013 14:46:57 -0400 Subject: [TYPES/announce] 1st Workshop on Programming Languages Technology for Massive Open Online Courses co-located with PLDI Message-ID: <51476121.5090709@csail.mit.edu> ================================================================= Call for Talk Proposals Programming Languages Technology for Massive Open Online Courses PLOOC 2013i Co-Located with PLDI 2013 http://people.csail.mit.edu/asolar/plooc2013/ ----------------------------------------------------------------- Massive open online courses present a broad set of challenges ranging from automated grading and feedback, automatic problem generation, plagiarism detection, as well as new issues such as how to enhance collaboration and peer tutoring across the web. The goal of this new workshop is to explore how formal methods technologies related to specification, verification, and synthesis can be applied to solve some of these problems in the context of MOOCS, and how these technologies can be leveraged and enhanced in the traditional classroom. We are interested in application of these technologies to a wide variety of subject domains including programming, logic, automata theory, math, and science. We are now accepting proposals for 30-minute talks presenting relevant work in this area. The proposal should include a brief summary of the proposed talk and any relevant references (those can be in a separate page). Proposals for accepted talks will be posted on the workshop website together with the slides for the talk. The deadline for submissions is March 22. For more information, including submission instructions, visit the workshop page: http://people.csail.mit.edu/asolar/plooc2013/ From jnfoster at cs.cornell.edu Tue Mar 19 11:20:06 2013 From: jnfoster at cs.cornell.edu (Nate Foster) Date: Tue, 19 Mar 2013 11:20:06 -0400 Subject: [TYPES/announce] Summer school on formal methods and networks Message-ID: Summer School on Formal Methods and Networks June 10-14, 2013 Cornell University Ithaca, NY, USA INTRODUCTION In many areas of computing, techniques ranging from testing to formal modeling to full-blown verification have been successfully used to help programmers create reliable systems. For example, in processor development, automated theorem proving uncovers deep bugs in designs before they become costly errors in silicon; avionics developers use program analysis to verify critical safety properties of the embedded software running on airplanes; and operating system vendors have successfully used model checking to eliminate entire classes of bugs in device drivers. But, until recently, networks have largely resisted analysis using formal techniques. The goal of this summer school is to bring together leading researchers and graduate students to study recent research results on applying formal methods to networks. The curriculum will consist of a series of lectures on topics from theoretical frameworks for modeling network behavior to practical techniques and tools. The lectures will be designed to be accessible to a general computer science audience and will not assume advanced knowledge of formal methods or networks. SPEAKERS Nikolaj Bjorner (Microsoft Research) Satisfiability Modulo Theories Solving for Network Verification Brighten Godfrey (University of Illinois at Urbana-Champaign) Verifying Networks in Real Time Timothy Griffin (University of Cambridge) Partial Automation in the Design and Implementation of Path-finding Algorithms Arjun Guha (University of Massachusetts Amherst) Network Programming With Frenetic Shriram Krishnamurthi (Brown University) Modeling and Reasoning about Network Components Ratul Mahajan (Microsoft Research) Systematically Exploring the Behavior of Control Programs Nick McKeown and Peyman Kazemian (Stanford University) Network Verification Using Header Space Analysis Pamela Zave (AT&T Research) Compositional Abstractions of Network Architectures REGISTRATION Information coming soon... SUPPORT Generous support for the summer school is provided by the National Science Foundation under grants CNS-1111698 and CNS-1111520. To encourage broad participation, registration fees will be kept low, and we expect to be able to offer a number of student travel scholarships. ORGANIZERS Nate Foster (Cornell University) Jennifer Rexford (Princeton University) David Walker (Princeton University) From gmb at microsoft.com Tue Mar 19 12:19:35 2013 From: gmb at microsoft.com (Gavin Bierman) Date: Tue, 19 Mar 2013 16:19:35 +0000 Subject: [TYPES/announce] Call for workshop proposals - SPLASH 2013 Message-ID: <0AD53F9D3615C04F9A1430B0F19D5E2403FD5AFB@DB3EX14MBXC327.europe.corp.microsoft.com> *** Call for Workshop Proposals *** for ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH) 2013 Indianapolis, Indiana, October 26-31, 2013 The reviewing process for SPLASH Workshop proposals has been changed to allow for a FIRST-COME FIRST-SERVED SCHEME using short proposals that can be submitted over an extended period of time: - March 28, 2013: START of reviewing period for submitted proposals - July 1, 2013: DEADLINE for proposal submissions Workshop proposals can be submitted STARTING from March 28, 2013, and authors will be notified about acceptance or rejection of the proposal within about a week's time. As long as there is enough space, high-quality proposals can be submitted and accepted until July 1, 2013. Please find the complete call for proposals below, also found at http://splashcon.org/2013/cfp/due-march-28-2013/644-workshops ---------------------------------------------------------------------- WORKSHOPS: Call for Proposals Following its long-standing tradition, SPLASH 2013 will host a variety of high-quality workshops, allowing their participants to meet and discuss research questions with peers, to mature new and exciting ideas, and to build up communities and start new collaborations. SPLASH workshops complement the main tracks of the conference and provide meetings in a smaller and more specialized setting. Workshops cultivate new ideas and concepts for the future, optionally recorded in formal proceedings. Note the changed submission and review procedure this year, a first-come first-serve process with lightweight proposals. The ACM International Conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) is sponsored by ACM SIGPLAN. SPLASH is the home of OOPSLA Research Papers, Onward!, and the Dynamic Languages Symposium, among other events. TOPICS We encourage proposals for workshops on any of the topics relevant to SPLASH. If there is a topic relevant to SPLASH that you feel passionate about and you want to connect with others who have similar interests, you should consider submitting a proposal to organize a workshop! The exact format of the workshop can be defined by the proposal submitters, and we more than welcome new, maybe even unconventional ideas for workshop formats. The following suggestions may serve as a starting point for possible workshop formats: * Mini-conferences provide their participants the possibility to present their work to other domain experts. The smaller and more specialized setting of the workshop allows for more extensive Q&A sessions and facilitates ample, maybe post-workshop, discussions. Typically, presentations of work-in-progress as well as of completed projects are welcome, and the workshop may result in formal proceedings. * Retreats act as a platform for domain experts to gather with the purpose of tackling the issues of a predetermined research agenda. Those gatherings are highly interactive and goal-oriented, allowing their participants to address open challenges in their domain, to explore new, uncharted ideas, and to (maybe even) uncover new, promising research domains. Other common activities include poster sessions, hands-on practical work, and focus groups. Proposal submitters can direct any open questions about workshop formats to the workshop chairs (see below). Workshops that result in research papers and that implement a SIGPLAN-approved selection process may be archived as formal proceedings in the ACM Digital Library; note that only workshops submitted before April 28th are eligible for this option. SUBMISSION SPLASH workshop proposals can be submitted either as PDF files or plain text files and include the following information: (1) Title and desired abbreviation: If the workshop is accepted, this will be used for advertising purposes. (2) Main theme and goals: the main topic and goals of the workshop, the workshop's relevance to the SPLASH community, as well as the workshop's format (e.g., mini-conference, retreat - contact workshop chairs for questions/suggestions). (3) Abstract: a 150-word abstract that summarizes the theme and goals of the workshop. If the workshop is accepted, this abstract will be used for advertising purposes. (4) Organizers: workshop organizers are responsible for advertising the workshop (e.g., creating the anchoring website for the workshop and sending CfPs to relevant mailing lists), organizing the paper reviewing process (e.g., by forming a small program committee), running the workshop, and collating any results of the workshop for dissemination. The proposal should indicate the names, affiliations, and contact details of the workshop organizers as well as a primary organizer and contact person (primary organizer and contact person do not need to be the same persons). For each organizer, the proposal should describe his/her background (expertise in the area and previous experience in running workshops) and also identify his/her responsibilities for the workshop. Once a workshop proposal is accepted, the workshop organizers are asked to provide further details, such as the anticipated attendance, planned advertisement, special requirements, etc. EVALUATION CRITERIA Workshop proposals will be selected on a first-come first-served basis. Evaluation of submitted proposals starts after March 28 2013. Proposals submitted after that date may be selected based on their quality and provided there is space available. The following questions may be helpful in devising a high-quality proposal: * Are there at least two organizers and do they represent a reasonably varied cross-section of the community close to the topic? * Does the abstract present a compelling case for the importance of the topic area? * Are the goals of the workshop expressed clearly? * Is the topic likely to be attractive to SPLASH attendees? * Does the chosen format encourage a high level of interaction between the participants? * Is a workshop the right forum to address the theme and goals or does the proposal fit better into another type of SPLASH event? FOR MORE INFORMATION For additional information, clarification, or answers to questions please contact the Workshops Chair, Stephanie Balzer and Ulrik Schultz, at workshops at splashcon.org. WORKSHOPS COMMITTEE * Stephanie Balzer, CMU, USA (chair) * Ulrik Schultz, University of Southern Denmark, Denmark (chair) * Ademar Aguiar, University of Porto, Portugal * Dave Thomas, Bedarra Research Labs, USA * Eric Van Wyk, University of Minnesota, USA * Erik Ernst, University of Aarhus, Denmark * Frank Tip, University of Waterloo, Canada * Gavin Bierman, Microsoft Research, UK * Robert Hirschfeld, University of Potsdam, Germany From akenn at microsoft.com Wed Mar 20 04:43:34 2013 From: akenn at microsoft.com (Andrew Kennedy) Date: Wed, 20 Mar 2013 08:43:34 +0000 Subject: [TYPES/announce] LOLA 2013: Call for Talk Proposals Message-ID: <7E7EFCE36627FA4BA1C0A456FECA820D094509F8@DB3EX14MBXC324.europe.corp.microsoft.com> ============================================================ *** CALL FOR TALK PROPOSALS *** LOLA 2013 Syntax and Semantics of Low Level Languages Saturday 29th June 2013, New Orleans, Louisiana, USA A LICS 2013-affiliated workshop http://research.microsoft.com/events/lola2013/ ============================================================ IMPORTANT DATES Submission deadline Friday 12th April 2013 Author notification Tuesday 30th April 2013 Workshop Saturday 29th June 2013 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2013 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 some of the most advanced contemporary research 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 many 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 assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: 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 two page abstract or of a longer (published or unpublished) paper describing completed work. INVITED SPEAKERS: Steve Zdancewic (University of Pennsylvania) Magnus Myreen (University of Cambridge) PROGRAM CO-CHAIRS: Dan Ghica (University of Birmingham) Andrew Kennedy (Microsoft Research Cambridge) PROGRAM COMMITTEE: Thomas Braibant (INRIA) Karl Crary (Carnegie Mellon University) Ugo Dal Lago (Universit? di Bologna) Xinyu Feng (Toyota Technological Institute at Chicago) Scott Owens (University of Kent) Sam Staton (University of Cambridge) Nikos Tzevelekos (Queen Mary, University of London) Nobuko Yoshida (Imperial College London) -------------- next part -------------- An HTML attachment was scrubbed... URL: From lanese at cs.unibo.it Wed Mar 20 05:59:34 2013 From: lanese at cs.unibo.it (Ivan Lanese) Date: Wed, 20 Mar 2013 10:59:34 +0100 (CET) Subject: [TYPES/announce] ICE 2013: Deadline extended until Sunday 24th March Message-ID: [- Apologies for multiple copies -] ICE 2013 6th Interaction and Concurrency Experience June 6, 2013, Florence, Italy http://www.discotec.org/workshops/ice2013/ Satellite workshop of DisCoTec 2013 http://www.discotec.org Deadline extended till sunday === Highlights === - Innovative selection procedure - ICE welcomes submissions of full papers, short papers, and brief announcements - Invited talks: Davide Sangiorgi & Damien Pous - Special issue of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/) === Important Dates === 24 March 2013...................Full paper submission 25 March - 21 April 2013....Reviews, rebuttal, and PC discussion 24 April 2013......................Notification to authors 6 June 2013.......................ICE in Florence 15 Sept 2013.....................Camera-ready for post-proceedings === 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 of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. Topics of interest include, but are not limited to: - Process algebra and coordination: transformation, analysis and implementation - Models for distributed coordination and semantics - Techniques and tools for specification, analysis, verification of resilient interactions - Coinductive techniques for reactive systems - Languages, protocols and mechanisms for sound distributed coordination - Logics and types for interactions - Comparison among different coordination and/or execution models - Expressive power of coordination languages and execution models - Formal semantics of coordination languages - Formal verification of distributed coordinated architectures - Relations between different semantic models for coordination languages === Selection Procedure === Since its 1st edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum. The discussion forum can be accessed by the authors of the paper and by all the PC members not in conflict with the paper. The forum is used by reviewers to ask questions and clarifications to the authors, allowing them to better explain all the aspects of their paper. The evaluation of the paper will keep into account not only the reviews, but also the outcome of the discussion. As witnessed by the past five editions of ICE, this procedure considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. === The Public Wiki === After the notification, the accepted papers are published on a public forum, in order to initiate public discussions that will trigger and stimulate the scientific debate at the workshop. We believe that this will drive the workshop discussions and let prospective participants interact with each other much earlier than in more traditional events. === Submission Guidelines === We invite for three types of submissions: (1) Full Papers, (2) Short Papers, and (3) Brief Announcements of already Published Papers. Full and short papers to appear in the post-proceedings must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2013 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). In addition, we invite for brief announcements of already published results, should the authors be interested in discussing their published research with the ICE community and giving a talk. Brief announcements will not be part of the post-proceedings. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2013). Full papers should not exceed 15 pages while short papers and brief announcements should not exceed 5 pages with the EPTCS style (http://style.eptcs.org/). Accepted (full and short) papers and brief announcements must be presented at the workshop by one of the authors. === Special Issue === Extended versions of the best full papers selected by the PC will be invited to appear in a special issue of the journal of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/ ). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. === Program Committee === Luca Aceto (Reykjavik University, Iceland) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, UK) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marcello Bonsangue (Leiden University, The Netherlands) Ornela Dardha (University of Bologna/INRIA, Italy) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (CEA Saclay, France) Ludovic Henrio (CNRS, France) Clemens Kupke (University of Strathclyde, Scotland, UK) Julien Lange (University of Leicester, UK) Antonia Lopes (University of Lisbon, Portugal) Giuliano Losa (EPFL, Switzerland) Claudio A. Mezzina (FBK Trento, Italy) Matteo Mio (?cole Polytechnique, France) Valentina Monreale (University of Pisa, Italy) Luca Mottola (Politecnico di Milano, Italy) Daniela Petrisan (University of Leicester, UK) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Valerio Senni (IMT Lucca, Italy) Alexandra Silva (Radboud University Nijmegen, The Netherlands) Josef Widder (TU Vienna, Austria) Roberto Zunino (Universit? degli Studi di Trento and COSBI, Italy) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Ana Sokolova (University of Salzburg, Austria; co-chair) === Contact === ice2013 at easychair.org === Previous editions === The previous five editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and selected papers appeared in a joint special issue of MSCS (with EXPRESS?09 and SOS?09, Vol. 22, Number 2). * June 10th, 2010 in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol.38) and selected papers appeared in a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10, Vol. XXI). * June 9th, 2011 in Reykjavik, Iceland, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and selected papers appeared in a special issue of SACS (Vol. XXII). * June 16th, 2012 in Stockholm, Sweden, co-located with DisCoTec'12. The post-proceedings were published in EPTCS (vol.104) and a special issue of SCP is now in preparation. _______________________________________________ Sensoria mailing list Sensoria at lists.tcs.ifi.lmu.de http://lists.tcs.ifi.lmu.de/mailman/listinfo/sensoria _______________________________________________ FMxSOCandBPM mailing list FMxSOCandBPM at cs.unibo.it http://www.cs.unibo.it/cgi-bin/mailman/listinfo/fmxsocandbpm From alastair.donaldson at imperial.ac.uk Wed Mar 20 06:36:35 2013 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Wed, 20 Mar 2013 10:36:35 +0000 Subject: [TYPES/announce] Two PhD studentships available at Imperial College London on Automatic Verification and Synthesis of Device Drivers In-Reply-To: <507447BC.9040000@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> <507447BC.9040000@imperial.ac.uk> Message-ID: <51499133.8010402@imperial.ac.uk> Dear all I'd be grateful if you could circulate this advert to any students you think might be interested. Best wishes Ally Donaldson * * * * *Two PhD studentships available at Imperial College London on Automatic Verification and Synthesis of Device Drivers* The Multicore Programming Group in the Department of Computing at Imperial College London are looking to recruit two PhD students to work on an exciting new project, ?Automatic Synthesis of High-Assurance Device Drivers?.The project is funded by a gift from Intel Corporation, and is a collaboration between Imperial, NICTA (Australia), University of Colorado Boulder (USA) and University of Toronto (Canada). Each position is for three years, and the positions are fully funded for candidates whose country of origin is within the European Union.The start dates for these positions are flexible, until October 2013.The closing date for applications is: *30 April 2013* The broad topics of the studentships are as follows (though there is room for flexibility and overlap): -Programming language support and verification methods to aid in the development of complex, concurrent device drivers -Automatic proof generation techniques for device driver synthesis Further details about the project, topics and desired skill sets are provided below. The successful candidates will join the Multicore Programming Group at Imperial, led by Dr Alastair Donaldson.The Department of Computing at Imperial is among the strongest in the world, and London is a vibrant and exciting city in which to be based.The project will feature a strong industrial collaboration with Intel Corporation, and the team at Imperial will interact frequently with the teams at NICTA, Boulder and Toronto. If you are interested in applying for one of these positions then please contact the Principal Investigator, Alastair Donaldson (alastair.donaldson at imperial.ac.uk). *Background and aims of the project:* Device drivers are hard to develop and are notoriously unreliable. While constant innovation in the area of electronic design automation has led to dramatic improvements in the IC design process, device driver development practices have not changed much since the days of mainframe computers. As a result, it is common nowadays for product releases to be determined by driver development and validation schedules rather than those of silicon. To address this long-standing problem, we propose a new driver development methodology that will allow faster creation of device drivers with fewer defects. The innovation at the heart of our methodology is the automatic synthesis of correct-by-construction device drivers from a formal model of the hardware device and a specification of the driver/OS interface.For complex, concurrent device drivers for which full synthesis is not possible, we plan to investigate programming language support and automated verification technology to aid in the manual construction of reliable drivers.Here the goal is to achieve full functional verification of driver behaviour, not simply to find bugs in the driver implementation. *PhD topics in the Imperial team* The above is a brief overview of the whole project.At Imperial, we are looking for a PhD student to work on each of the following areas.However, as noted above, there is scope for flexibility in the PhD topics undertaken, within the overall aims of the project. /Programming language support and verification methods to aid in the development of complex, concurrent device drivers:/A PhD student working on this topic will investigate language and tool support for writing verifiable drivers. This could, for example, involve identifying a restricted subset of C that allows full driver functionality to be expressed, but which features a conservative type system, limited pointer arithmetic (which together guarantee type safety), and specially managed dynamic memory allocation. These restrictions will allow the verifier to make stronger assumptions when reasoning about access to shared data, simplifying the process of reasoning about correct concurrency.Verification could be using theorem provers (e.g., building on the success of the GPUVerify project at Imperial), or through model checking.As well as developing new techniques that are theoretically sound, there will be an emphasis on building prototype tools that realise these techniques, which can be used by the other project partners.For instance, counterexamples generated by the verification technique for concurrent programs can be used as input to the synthesis algorithm to allow automatic placement of inter-thread synchronization primitives. /Automatic proof generation techniques for device driver synthesis/: During the project, and led by other project partners, we will develop novel synthesis techniques for generating device driver implementations that are correct by construction.As well as collaborating on this effort, a PhD student in the Imperial team will investigate a proof generation approach whereby the synthesis technique will generate both a driver implementation and an associated proof of correctness. This proof will be produced by capturing decisions made by the synthesis algorithm using formal logic. Capturing this proof as a script to be checked by a theorem prover such as Isabelle or Coq will yield a very high degree of assurance that the synthesized driver is correct, as well as flagging up incorrect proofs arising due to bugs in the synthesis algorithm implementation. *Desired skill set* ** We are looking for candidates with a strong grounding in Computer Science or a related discipline, holding a Master?s degree or equivalent, and with a mixture of theoretical and practical skills.Because the project has a practical focus, is relevant to system-level software, requires rigorous reasoning, and involves multiple partners, the following are essential: -Strong programming skills, and an interest in low-level programming -Basic knowledge of operating systems and compilers -Logical reasoning skills -A keenness to collaborate with other academic and industrial partners We are particularly keen to recruit a candidate who has some experience in a subset of the following areas (we do /not/ expect to recruit a candidate who has experience in all these areas!): -System-level implementation (e.g., writing device drivers, or hacking on the Linux kernel) -Programming language implementation (e.g., compiler-writing, or building static analysers) -Formal verification techniques such as model checking or theorem proving -Concurrent programming -Using mechanical theorem provers such as Coq or Isabelle -------------- next part -------------- An HTML attachment was scrubbed... URL: From lionel.vaux at univ-amu.fr Wed Mar 20 17:43:53 2013 From: lionel.vaux at univ-amu.fr (Lionel Vaux) Date: Wed, 20 Mar 2013 22:43:53 +0100 Subject: [TYPES/announce] International summer school on linear logic and geometry of interaction Message-ID: <20130320214353.GN12280@garbure.info> INTERNATIONAL SUMMER SCHOOL ON LINEAR LOGIC AND GEOMETRY OF INTERACTION Turin, 27-31 August 2013 http://www.logoi.fr/events/school/ The summer school on Linear Logic and Geometry of Interaction will be held in Turin from August 27th to August 31st, 2013, as satellite event to CSL 2013. The aim of the school is to offer a comprehensive view of the research topics surrounding linear logic, with attention to its main applications to proof theory and computer science. The intended audience are graduate students (master, PhD), post-doctoral researchers and academics working in Computer Science or Mathematics. The school lasts 5 days and will consist of: * introductory tutorials covering basic material; * technical lectures on advanced issues, perspectives, and state-of-the-art research. The introductory tutorials are concentrated primarily on the first 2 days. The aim is to offer a thorough initiation to the subject, which will be supported each day by a session of supervised exercises, to allow understanding and familiarization with the technical material via an hands-on approach. A series of lectures by Jean-Yves Girard will present the most recent developments of the Geometry of Interaction programme. The new approach to Geometry of Interaction and to the treatment of Proof Nets is denominated ``Transcendental Syntax''; the presentation of the technical development will shed light on methodological issues and perspectives for Proof Theory. COURSES * Introduction to Linear Logic * Proof Nets * Geometry of Interaction * Game Semantics * Polarities in Proof Theory and Programming * Denotational and Quantitative Semantics * Light Logics and Implicit Computational Complexity SUPPORT The school is able to offer financial support to students and early career researchers; the support covers the registration fee with full board accommodation in double room. Travel to Turin remains at the charge of the participants (but could also be covered in special cases, please specify).To apply for a grant, please send an email with some details on your status and cursus to logoi-school at pps.univ-paris-diderot.fr SCIENTIFIC ORGANIZERS Claudia Faggian (CNRS-Paris7, Paris) Myriam Quatrini (IML, Marseille) Olivier Laurent (CNRS-ENS, Lyon) Damiano Mazza (CNRS-Paris13, Paris) Alexis Saurin (CNRS-Paris7, Paris) Contact: logoi-school at pps.univ-paris-diderot.fr Information on programme, registration, grants: http://www.logoi.fr/events/school/ IMPORTANT DATES Students and early career researchers, application deadline: May 18, 2013 Students and early career researchers, notification of acceptance: June 4, 2013 Registration deadline: June 15, 2013 School: August 27?August 31, 2013 From ulrich.fahrenberg at irisa.fr Thu Mar 21 04:21:08 2013 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Thu, 21 Mar 2013 09:21:08 +0100 Subject: [TYPES/announce] Runtime Verification 2013: 2nd CfP Message-ID: <514AC2F4.5080209@irisa.fr> CALL FOR PAPERS RV'13 Fourth International Conference on Runtime Verification INRIA Rennes, France 24-27 September 2013 http://rv2013.gforge.inria.fr/ RV'13, the Fourth International Conference on Runtime Verification, will take place at INRIA Rennes, France, from 24 to 27 September 2013. INVITED SPEAKERS Klaus Ostermann, University of Marburg, Germany Viktor Kuncak, EPFL, Lausanne, Switzerland Martin Leucker, University of Lubeck, Germany PROGRAM COMMITTEE CO-CHAIRS Saddek Bensalem, VERIMAG, Grenoble, France Axel Legay, INRIA Rennes, France ASSOCIATED WORKSHOP: SMC 2013 SMC 2013, the First Workshop on Statistical Model Checking, will take place at INRIA Rennes, France, on 23 September 2013. The workshop is associated with RV'13. CALL FOR TUTORIALS As with previous editions, RV'13 will host a few invited tutorials. These are three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to twenty pages in the LNCS conference proceedings. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a biography of the presenter. It must be formatted according to the Springer LNCS guidelines and not exceed 2 pages. To submit a tutorial, send an email to rv2013-info at lists.gforge.inria.fr CALL FOR PAPERS RV'13 will have two paper categories: regular and tool demonstration papers. Papers in both categories will be reviewed by the program committee. - Regular papers (page limit 15 pages) must present original, unpublished results. Applications of runtime verification are particularly welcome. - Tool demonstration papers (page limit 5 pages) should briefly introduce the problem solved by the tool and give the outline of the demonstration. The RV'13 proceedings will be published as a volume of the LNCS series at Springer. Submissions must be formatted according to Springer LNCS guidelines. If necessary, the submission may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Submission of papers to RV'13 is handled through EasyChair. The submission link is https://www.easychair.org/conferences/?conf=rv13 IMPORTANT DATES Abstract submission: 28 April 2013 Paper submission: 5 May 2013 Tutorial submission: 5 May 2013 Tutorial notification: 12 May 2013 Paper notification: 17 June 2013 Final version: 15 July 2013 SCOPE Runtime verification is concerned with monitoring and analysis of soft- ware and hardware system executions. Runtime verification techniques are crucial for system correctness and reliability; they are signif- icantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for verification and debugging purposes, and after deployment for ensuring reliability, safety and security, and for providing fault containment and recovery. TOPICS - specification languages and formalisms for traces - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization ORGANIZATION CHAIR Axel Legay, INRIA Rennes, France CONTACT For more information, see http://rv2013.gforge.inria.fr/ From rensink at cs.utwente.nl Thu Mar 21 11:27:26 2013 From: rensink at cs.utwente.nl (Arend Rensink) Date: Thu, 21 Mar 2013 16:27:26 +0100 Subject: [TYPES/announce] =?iso-8859-1?q?The_EAPLS_2012_PhD_Award_goes_to_?= =?iso-8859-1?q?=2E=2E=2E_Delphine_D=E9mange?= Message-ID: <514B26DE.7070305@cs.utwente.nl> ... for her thesis on "Semantic Foundations of Intermediate Program Representations". It is with great pleasure that we can announce Delphine as the winner of the PhD Award over 2012 of the European Association for Programming Languages and Systems. Our heartfelt congratulations! The thesis, carried out at INRIA and supervised by Thomas Jensen, was selected as the best among those submitted by a panel of 30 experts from all across Europe, and lauded for its innovation, impact and writing, and for its combination of theory and practice. The submission and selection procedure can be found at http://eapls.org/pages/phd_award. Some quotes from the experts' reports: "This outstanding thesis is written in an accurate and friendly way, it is a real pleasure to read. It shows that Delphine Demange excels both in foundational research and in engineering design." "The thesis has not only a solid theoretic base, but also an important practical significance" "This is an outstanding thesis in the very innovative and forward-pointing area of formal modelling of compilation and intermediate languages." "This foundational thesis reports on excellent scientific work which is of great importance for computer science." On behalf of the EAPLS, Arend Rensink From wasowski at itu.dk Thu Mar 21 11:49:37 2013 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Thu, 21 Mar 2013 16:49:37 +0100 Subject: [TYPES/announce] PhD scholarships in verification at IT University of Copenhagen Message-ID: <514B2C11.9010307@itu.dk> Two projects, VARIES and VARIETE at IT University of Copenhagen, seek excellent PhD students to work on analysis methods for code and models found in highly configurable software systems (software product lines). The objectives are to work on extensions of model checking and static analysis techniques for verification of software systems implemented using model transformations. An ideal candidate has a solid background in semantics of programming languages and in algorithmic verification techniques (model checking, type checking, static analysis, satisfiability solving), combined with appreciation for solving problems stemming from practice of software development. Both projects develop theories as well as tools. VARIETE is a highly prestigious research project awarded by the Danish Independent Research Council, within the Sapere Aude program. VARIES is a consortium of about 20 European partners, a mixture of high profile academic partners, research labs and companies developing safety-critical embedded or modeling tools. VARIES is funded by the European Commission and national governments via the ARTEMIS Joint Undertaking. The enrollment will be at IT University of Copenhagen, includes salary and budget for executing the project. Contact Person: Andrzej Wasowski (wasowski at itu.dk). Early contact is highly recommended. Information how to apply: http://www.itu.dk/en/Forskning/Phd-uddannelsen/Spring%20call%202013 -- associate prof. Andrzej W?sowski, http://www.itu.dk/~wasowski IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark room 4D10 phone +45 7218 5086 fax *5001 skype wasowski_andrzej From ardubois at gmail.com Thu Mar 21 13:52:21 2013 From: ardubois at gmail.com (Andre Rauber Du Bois) Date: Thu, 21 Mar 2013 14:52:21 -0300 Subject: [TYPES/announce] 2nd CFP: SBLP 2013 (17th Brazilian Symposium on Programming Languages) Message-ID: [Apologies if you receive multiple copies of this CFP] ======================================================= 2nd CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Bras?lia, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.cic.unb.br/sblp ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): April 19th Full paper submission: April 26th, 2013 Notification of acceptance: May 31st, 2013 Final papers due: June 28th, 2013 INVITED SPEAKERS * Tim Harris, Oracle Labs * More TBA INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Bras?lia, Brazil, on September 29th to October 4th, 2013. 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 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013, http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 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. * 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 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. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer (pending approval). For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system at http://www.easychair.org/conferences/?conf=sblp2013. 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 from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonif?cio, UnB Diego Aranha, UnB PROGRAMME CHAIRS Andr? Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS Andr? Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quint?o Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho Jo?o F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel Ant?nio Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu From jonathanheras at computing.dundee.ac.uk Fri Mar 22 06:45:37 2013 From: jonathanheras at computing.dundee.ac.uk (jonathanheras) Date: Fri, 22 Mar 2013 10:45:37 -0000 Subject: [TYPES/announce] Final Call: Automated Reasoning Workshop, April 2013, Dundee Message-ID: <3021ED39783FBC4A86673C741F7A5ED905917A09@mailex2.computing.dundee.ac.uk> ******************************************************** 20th Automated Reasoning Workshop (ARW'13) 11-12 April 2013 School of Computing, University of Dundee, UK www.computing.dundee.ac.uk/staff/katya/arw2013 FINAL CALL FOR PARTICIPATION ********************************************************************* Reminder: early registration deadline is the 1st April 2013. ARW'13 full programme is now available here: http://www.computing.dundee.ac.uk/staff/katya/arw13/timetable.html ********************************************************************* The University of Dundee is a Scottish Registered Charity, No. SC015096. -------------- next part -------------- An HTML attachment was scrubbed... URL: From morawska at tcs.inf.tu-dresden.de Fri Mar 22 09:07:21 2013 From: morawska at tcs.inf.tu-dresden.de (Barbara Morawska) Date: Fri, 22 Mar 2013 14:07:21 +0100 Subject: [TYPES/announce] UNIF 2013 -- call for papers Message-ID: Call for Papers UNIF 2013 The 27th International Workshop on Unification http://lat.inf.tu-dresden.de/UNIF2013/ June 27th, 2013, Eindhoven, The Netherlands Satellite event of RTA-24, part of RDP 2013 UNIF 2013 is the 27th event in a series of international meetings devoted to unification theory and its applications. The aim of UNIF 2013, as that of the previous meetings, is to bring together researchers interested in unification theory and related topics, to present recent (even unfinished) work, and discuss new ideas and trends in this and related fields. A non-exhaustive list of topics of interest includes: * unification algorithms, calculi and implementations * equational unification and unification modulo theories * unification in modal, temporal and description logics * admissibility of inference rules * narrowing matching algorithms * constraint solving * combination problems * disunification * higher-order unification, * type checking and reconstruction * typed unification * complexity issues * query answering * implementation techniques * applications of unification Submission: ========== Submissions should not exceed 5 pages in LNCS style, as PDF files through the EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=unif2013 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop and also in the electronic form at the UNIF web page: http://www.pps.jussieu.fr/~treinen/unif/ Important Dates: ================ Submission: April 14 Notification: May 25 Final version: June 8 Workshop: June 27 Programme Committee: =================== # Franz Baader, TU Dresden, Germany # Benzmueller, Free University Berlin, Germany # Santiago Escobar, Universitat Politecnica de Valencia, Spain # Silvio Ghilardi, Universita di Milano, Italy # Konstantin Korovin, University of Manchester, UK # Jordi Levy, IIIA - CSIC, Spain # Christopher Lynch, Clarkson University, USA # George Metcalfe, University of Bern, Switzerland # Barbara Morawska, TU Dresden, Germany # Paliath Narendran, University at Albany, USA # Christophe Ringeissen, LORIA-INRIA, France # Vladimir Rybakov, Manchester Metropolitan University # Laurent Vigneron, LORIA-Nancy University, France For more information, please contact any of the chairs: Barbara Morawska and Konstantin Korovin. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ylies.Falcone at ujf-grenoble.fr Fri Mar 22 10:00:44 2013 From: Ylies.Falcone at ujf-grenoble.fr (=?iso-8859-1?Q?Yli=E8s_Falcone?=) Date: Fri, 22 Mar 2013 15:00:44 +0100 Subject: [TYPES/announce] Summer School on Cyber-Physical Systems, GRENOBLE (FRANCE) JULY 8-12, 2013 Message-ID: <65073F91-6E94-47E9-A9D2-6959D9FD969C@ujf-grenoble.fr> [~~~~~~ Please disseminate widely within your teams & contacts ~~~~~~] Dear Colleagues, EIT ICT Labs and PERSYVAL-Lab are organizing the first edition of the CPS Summer School. The CPS Summer School will explore the manifold relationship between networked embedded systems and humans as their creators, users, and subjects. The format of the Summer School will be a five days meeting, organized around different aspects of rigorous engineering of Cyber Physical Systems. The CPS Summer School will bring together some of the best lecturers from Europe and the USA, in a one week programme. The programme will offer world-class courses and significant opportunities for interaction with leading researchers in the area of Cyber Physical Systems. Topics: Computer security and cryptography. System modelling. Medical devices. Sensor networks. Confirmed Speakers: Prof. Manfred Broy - TU Munich (Germany). Dr. Olivier Coutelou - Schneider Electric Grenoble (France). Dr. Julien Francq - Cassidian (France). Prof. Kim G Larsen - Aalborg University (Denmark). Dr. David Lesens - Astrium Space Transportation (France). Prof. Peter Marwedel - TU Dortmund (Germany). Dr. Emmanuel Prouff - ANSSI (France). Prof. Joseph Sifakis - EPFL (Switzerland) and Verimag (France). Prof. Oleg Sokolsky - University of Pennsylvania (USA). Dr. Jocelyne Troccaz - TIMC/CNRS, Grenoble (France). Dr. Thomas Watteyne - Dust Networks, Inc., Hayward (USA). Registration fee is ?350 for students, ?500 for non-students, which includes lunches and coffee breaks from Monday 8th through Friday 12th, and a party. The registration fee only partially covers the costs incurred. The remaining costs are covered by the EIT ICT Labs and PERSYVAL-Lab. The local organization committee has arranged university accommodations for students. The accommodation student-fee for the week is 200 euros. Application Procedure and Important Dates (please refer to the Website for the full procedure): Deadline for Application: May 1, 2013. Response to Applicants: May 10, 2013. Online Registration and Fee payment: May 20, 2013. Since attendance is limited, priority will be given to Ph.D. students and companies' staff. More details can be found at: https://persyval-lab.org/en/summer-school/cps. Applications can be submitted at: https://persyval-calls.imag.fr/en/project/6. Enquiries can be sent to cps-school.organization at imag.fr. Best Regards, Yli?s Falcone Associate Professor University of Grenoble 1 (UJF) -------------- next part -------------- An HTML attachment was scrubbed... URL: From amal at ccs.neu.edu Fri Mar 22 11:53:31 2013 From: amal at ccs.neu.edu (Amal Ahmed) Date: Fri, 22 Mar 2013 11:53:31 -0400 Subject: [TYPES/announce] Oregon Programming Languages Summer School - call for participation Message-ID: This year's Oregon PL Summer School will take place from July 22nd to August 3rd. The registration deadline is April 16th. Full information on registration and scholarships an be found here: http://www.cs.uoregon.edu/Activities/summerschool The school has a long and successful tradition (sponsored by the NSF, ACM SIGPLAN, and industry). It covers current research in the theory and practice of programming languages. Material is presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. Prerequisites are an elementary knowledge of logic and mathematics, as covered in undergraduate classes on discrete mathematics, and some knowledge of programming languages at the level of an undergraduate survey course. A new feature this year is a Coq boot camp session, to be held on July 21st -- one day before the summer school officially begins. The boot camp will provide a one-day, intensive, hands-on introduction to the practical mechanics of the Coq proof assistant. More information is available at the above website. This year's program is titled Types, Logic, and Verification. The speakers and topics include: Amal Ahmed -- Logical Relations Northeastern University Robert Harper -- Type Theory Foundations Carnegie Mellon University Dan Licata -- Dependently-Typed Programming in Agda Carnegie Mellon University and Institute for Advanced Study Greg Morrisett -- Coq as a Programming Language Harvard University Simon Peyton-Jones -- Adventures with Types in Haskell Microsoft Research Frank Pfenning -- Linear Logic and Session-based Concurrency Carnegie Mellon University Andrew Tolmach -- Software Foundations in Coq Portland State University Stephanie Weirich -- Designing Dependently-Typed Programming Languages University of Pennsylvania Steve Zdancewic -- Verifying LLVM Optimizations in Coq University of Pennsylvania We hope you can join us for this excellent program. Amal Ahmed Zena Ariola Bob Constable Frank Pfenning Benjamin Pierce OPLSS 2013 organizers -------------- next part -------------- An HTML attachment was scrubbed... URL: From sandra at dcc.fc.up.pt Fri Mar 22 19:40:56 2013 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Fri, 22 Mar 2013 23:40:56 +0000 Subject: [TYPES/announce] LOGIC COLLOQUIUM 2013 Message-ID: The Logic Colloquium 2013 (ASL European Summer Meeting) will take place for the first time in Portugal, in ?vora, one of Portugal?s most beautifully preserved medieval towns, which was declared World Heritage by the UNESCO in 1986, on July 22-27, 2013. The Logic Colloquium is the annual European conference on Logic, organised under the auspices of the Association for Symbolic Logic (ASL) and provides a forum for presenting and discussing the new developments in the area of Logic, including Mathematical logic, Computer science logic and Philosophical logic. The scientific program of the Logic Colloquium 2013 is composed of very important invited speakers including a Fields Medalist (Mathematics Nobel prize) and a CNRS Silver Medalist. Submission for Contributed talks is now open (deadline March 29); the call for ASL travel grants and ASL-NSF travel grants is open (deadline March 25). Registration is now also open (deadline May 31). For further details see the meeting web page: http://ptmat.fc.ul.pt/LC2013. Please forward this message to everyone you know. Don't forget anyone! The organizing committee. -------------- next part -------------- An HTML attachment was scrubbed... URL: From maribel.fernandez at kcl.ac.uk Sat Mar 23 14:26:30 2013 From: maribel.fernandez at kcl.ac.uk (Maribel Fernandez) Date: Sat, 23 Mar 2013 18:26:30 +0000 Subject: [TYPES/announce] LSFA 2013 - Call for papers Message-ID: LSFA 2013 --- CALL FOR PAPERS 8th Workshop on Logical and Semantic Frameworks, with Applications 2-3 September 2013, Sao Paulo, Brazil http://lsfa.ime.usp.br/lsfa2013 *** Submission deadline: 12 May *** 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 workshop is to bring together theoreticians and practitioners to promote new techniques and results, and to facilitate feedback on the implementation and application of such techniques and results in practice. 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 2013 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. The proceedings are produced after the meeting, so that authors can incorporate this feedback in the published papers. LSFA 2013 will take place on the 2nd and 3rd September 2013 in Sao Paulo, Brazil. Previous editions took place in Rio de Janeiro (2012), Belo Horizonte (2011), Natal (2010), Brasilia (2009), Salvador (2008), Ouro Preto (2007), Natal (2006). SUBMISSION AND PUBLICATION: Contributions should be written in English and submitted in the form of full papers (with a maximum of 16 pages) or short papers (with a maximum of 6 pages). They must be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in latex using ENTCS style. The submission should be in the form of a PDF file uploaded to Easychair: https://www.easychair.org/conferences/?conf=lsfa2013 The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. After the workshop the authors will be invited to submit full versions of their works for the ENTCS post-proceedings. At least one of the authors should register for the conference. Presentations should be in English. IMPORTANT DATES: # Submission: Sunday 12 May # Notification: Friday 28 June # Preliminary proceedings version due: Sunday 14 July # Submission for final proceedings: Sunday 27 October INVITED SPEAKERS: Carlos Areces (U. Cordoba, Argentina) Marcello D'Agostino (U. Ferrara, Italy) Jose Meseguer (U. Illinois, USA) PROGRAMME COMMITTEE Elvira Albert, Mauricio Ayala Rincon, Eduardo Bonelli, Ana Bove, Carlos Castro, Adriana Compagnoni, Amy Felty, Maribel Fernandez (co-chair), Marcelo Finger (co-chair), Hermann Haeusler, Delia Kesner, Joao Marcos, Luca Paolini, Elaine Pimentel, Femke van Raamsdonk, Simona Ronchi Della Rocca, Torsten Schaub, Alvaro Tasistro, Daniel Ventura, Renata Wassermann. ORGANISING COMMITTEE Mauricio Ayala Rincon, Eduardo Ferme, Marcelo Finger, Renata Wassermann CONTACT: lsfa2013 at easychair.org From grlmc at urv.cat Sun Mar 24 13:17:14 2013 From: grlmc at urv.cat (GRLMC) Date: Sun, 24 Mar 2013 18:17:14 +0100 Subject: [TYPES/announce] SSTiC 2013: 2nd registration deadline 26 March Message-ID: <839F869B74244E27B8F82D5BF7B5E77E@Carlos1> *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* +++ 2nd registration deadline: March 26 +++ AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of 74 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montr?al) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social Context Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Syed Ali Jafar (Irvine) [intermediate] Interference Alignment Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montr?al) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to Cyber-physical Systems Daniel Moss? (Pittsburgh) [intermediate] Asymmetric Multicore Management Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Parallel Programming with Abstractions Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure Symmetric Encryption Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer Security Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users in Social Computing Systems Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Ian H. Witten (Waikato) [introductory] Data Mining Using Weka Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft Computing Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists REGISTRATION: It has to be done at http://grammars.grlmc.com/SSTiC2013/Registration.php Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputaci? de Tarragona Universitat Rovira i Virgili From alessandra.viale at polimi.it Mon Mar 25 05:47:52 2013 From: alessandra.viale at polimi.it (Alessandra Viale) Date: Mon, 25 Mar 2013 10:47:52 +0100 Subject: [TYPES/announce] 2013 Best Practices in Education Award - " Informatics Education in School" Message-ID: <51501D48.8030604@polimi.it> 2013 BEST PRACTICES IN EDUCATION AWARD "INFORMATICS EDUCATION IN SCHOOL" EUR 5,000.00 PRIZE Funded by Microsoft Informatics Europe proudly announces its 2013 Best Practices in Education Award devoted to curriculum initiatives for promoting the informatics education in primary and secondary schools. The Informatics Europe Best Practices in Education Award recognizes outstanding European educational initiatives that improve the quality of informatics teaching and the attractiveness of the discipline, and can be applied and extended beyond their institutions of origin. The Award will reward a successful teaching effort in Europe that: - has made a measurable difference in informatics education in schools - is widely applicable and useful for the teaching community - has made a measurable impact in its original institution and beyond it The 2013 Award is devoted to curriculum initiatives for promoting informatics in schools as a mandatory subject for all students. The Award will honor original contributions who emphasize successful initiatives for teaching of informatics fundamentals in schools. Experiences and reports showing how to use software or hardware tools in order to improve learning in other disciplines than informatics will not be considered. Examples of impact include course results, student projects, textbooks, influence on the curriculum of other schools. The 2013 Award is devoted to curriculum initiatives promoting informatics education in primary and secondary schools and funded through a generous grant from Microsoft. The Award carries a prize of EUR 5,000.00 The Award can be given to an individual or to a group. To be eligible, participants must be located in one of the member or candidate member countries of the Council of Europe (www.coe.int), or Israel. Members of the Informatics Europe Board and of the Award Committee are not eligible. The Award Committee will review and evaluate each proposal. It reserves the right to split the prize between at most two di fferent proposals (individuals or teams). The proposal should include: * Names and addresses of the applicant or applicants; * Indication of whether the submission is on behalf of an individual or a group; * Description of the achievements (max 5 pages); * Evidence of availability of the curriculum materials to the teaching community (max 2 pages); * Evidence of impact (max 5 pages); * A reference list (which may include URLs of supporting material); * One or two letters of support. The letters of support may come for example from school management or colleagues in the same or another institution. Proposals should be submitted only at: https://www.easychair.org/account/signin.cgi?conf=iebpea2013 Deadlines: Abstract: May 1, 2013 Full proposal: June 1, 2013 Notification of winner(s): August 1, 2013 The Award will be presented at the 9th European Computer Science Summit, in Amsterdam, 8-9 October 2013, where the winner or winners (one representative in the case of an institution) will be invited to give a talk on their achievements. Award Committee: Walter Gander (chair) Avi Mendelson Barbara Demo Jan Vahrenhold Juraj Hromkovic Alexander Repenning G?rard Berry (More names to be announced) For up to date information see the Award website: http://informatics-europe.org/services/curriculum-award.html Further inquires: curriculum-award at informatics-europe.org From akenn at microsoft.com Mon Mar 25 10:04:21 2013 From: akenn at microsoft.com (Andrew Kennedy) Date: Mon, 25 Mar 2013 14:04:21 +0000 Subject: [TYPES/announce] Deadline extension (2 Apr): SLS 2013: Workshop on Scalable Language Specification Message-ID: <7E7EFCE36627FA4BA1C0A456FECA820D0945E64D@DB3EX14MBXC324.europe.corp.microsoft.com> SLS 2013: Workshop on Scalable Language Specification * June 25-27, 2013, Cambridge, UK * Submission deadline: April 2, 2013 (EXTENDED) * http://research.microsoft.com/en-us/events/sls2013 The focus of this workshop is on formal language specification frameworks and how they scale up when applied to larger languages. The workshop provides a forum for discussing practical and theoretical issues, and aims to promote dissemination and collaboration between the developers and users of language specification frameworks. Background ========== Many hundreds of programming languages have been designed and implemented, and dozens are currently in widespread use. Older languages evolve to incorporate new features, and new programming languages are continually being developed - especially domain-specific languages, designed for use in a particular sector. Each language needs to be precisely specified. A specification of a major language usually consists of a succinct formal grammar, determining its syntax, together with a lengthy informal explanation of its intended semantics. Unfortunately, such informal explanations are inherently imprecise, open to misinterpretation, and not amenable to validation. In the few cases where the semantics of major languages have been specified formally, the required effort appears to have been huge, which has discouraged wider adoption of formal semantics. Objectives ========== The workshop gathers together leading researchers working on the development and specification of programming and domain-specific languages. One of the objectives is to clarify which features of the various specification frameworks affect scaling up to major languages. A further objective is to raise awareness of current developments of practical relevance, including tool support for language specification, prototyping, and verification. The invited speakers will present features and applications of particular specification frameworks. The workshop programme will also include presentations of submitted papers, time for informal discussions, and a poster display. Location ======== The workshop will be held at Microsoft Research in Cambridge, UK. Accommodation for a limited number of participants has been reserved at Downing College. Invited speakers ================ * Egon B?rger (University of Pisa) * Mark van den Brand (Eindhoven University of Technology) * Kevin Hammond (University of St Andrews) * Sir Tony Hoare (Microsoft Research Cambridge) * Paul Klint (CWI, Amsterdam) * Shriram Krishnamurthi (Brown University) * Jos? Meseguer (University of Illinois at Urbana-Champaign) * Grigore Ro?u (University of Illinois at Urbana-Champaign) * Dave Schmidt (Kansas State University) * Peter Sewell (University of Cambridge) Important dates =============== * April 2: Submission deadline (EXTENDED) * April 15: Author notification * April 29: Registration deadline * May 31: Final versions of papers and posters due * June 25-27: Workshop Submissions =========== Authors who wish to present their research at the workshop are invited to submit an extended abstract of up to 4 pages (including references). Submissions should be in PDF (A4 format) and will be submitted using the EasyChair system by April 2nd. A selection will be made by the organisers with the assistance of the invited speakers, based primarily on interest and relevance to the workshop objectives. Proceedings =========== The accepted extended abstracts (and any full papers based on them) will be made available to workshop participants electronically. The workshop proceedings will *not* be formally published; research intended for publication elsewhere (or previously published) can be submitted. Registration ============ Information about registration will be provided closer to the time of the workshop. Posters ======= Registered participants who wish to display a poster related to the workshop objectives should submit the PDF through the EasyChair website. Organisers ========== The workshop is organised and sponsored by Microsoft Research Cambridge in collaboration with the PLanCompS research project. The invited speakers are funded by EPSRC. Andrew Kennedy Programming Principles and Tools Group Microsoft Research Cambridge akenn at microsoft.com Peter Mosses Department of Computer Science Swansea University p.d.mosses at swan.ac.uk -- -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Tue Mar 26 02:09:53 2013 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Tue, 26 Mar 2013 07:09:53 +0100 Subject: [TYPES/announce] WFLP 2013: First CfP Message-ID: <51513BB1.9050400@informatik.uni-bonn.de> ====================================================================== CALL FOR PAPERS WFLP 2013 22nd International Workshop on Functional and (Constraint) Logic Programming 27th Workshop on Logic Programming part of the Kiel Declarative Programming Days 2013 September 11-13, 2013, Kiel, Germany http://www-ps.informatik.uni-kiel.de/wflp2013/ ====================================================================== GENERAL WFLP 2013 is the combination of two workshops of a successful series of annual workshops on declarative programming. The international workshops on functional and logic programming aim at bringing together researchers interested in functional programming, logic programming, as well as their integration. The workshops on (constraint) logic programming serve as the scientific forum of the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence, and operations research. In this year both workshops will be jointly organized and co-located with the 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) under the umbrella of the Kiel Declarative Programming Days in order to promote the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. The technical program of the workshop will include invited talks, presentations of refereed papers and demo presentations. ---------------------------------------------------------------------- TOPICS The topics of interest include (but are not limited to): * Functional programming * Logic programming * Constraint programming * Deductive databases, data mining * Extensions of declarative languages, objects * Multi-paradigm declarative programming * Foundations, semantics, nonmonotonic reasoning, dynamics * Parallelism, concurrency * Program analysis, abstract interpretation * Program transformation, partial evaluation, meta-programming * Specification, verification, declarative debugging * Knowledge representation, machine learning * Interaction of declarative programming with other formalisms (e.g., agents, XML, Java) * Implementation of declarative languages * Advanced programming environments and tools * Software technique for declarative programming * Applications The primary focus is on new and original research results but submissions describing innovative products, prototypes under development, application systems, or interesting experiments (e.g., benchmarks) are also encouraged. ---------------------------------------------------------------------- IMPORTANT DATES Submission of papers: June 16, 2013 Notification of acceptance: July 18, 2013 Camera-ready papers: August 18, 2013 Workshop: September 11-13, 2013 ---------------------------------------------------------------------- SUBMISSION GUIDELINES 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, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Papers can be submitted as technical papers or system descriptions. Technical papers should consist of up to 15 pages, system descriptions should be no longer than 6 pages. Formatting should follow the LNCS guidelines. The details about the procedure to submit papers electronically are described on the conference website. 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. ---------------------------------------------------------------------- BEST NEWCOMER AWARD An award will be given to the best paper exclusively written by one or several young researchers who have not yet obtained their PhD degrees. Papers written in this category should be clearly marked as a *Student paper* in the submission. ---------------------------------------------------------------------- PROCEEDINGS All accepted papers will be published as a technical report. As for previous events, it is planned to publish selected papers as post-conference proceedings in the Springer LNCS series. Previous proceedings appeared as Springer LNCS volumes 6816 (WFLP 2011), 6559 (WFLP 2010), 5979 (WFLP 2009), 5437 (WLP 2007), and 3392 (WLP 2004). ---------------------------------------------------------------------- PROGRAM COMMITTEE Elvira Albert Universidad Complutense de Madrid, Spain Sergio Antoy Portland State University, USA Francois Bry University of Munich, Germany Juergen Dix University of Clausthal, Germany Rachid Echahed CNRS, University of Grenoble, France Moreno Falaschi Universita di Siena, Italy Sebastian Fischer Kiel, Germany Thom Fruehwirth University of Ulm, Germany Michael Hanus University of Kiel, Germany (Chair) Oleg Kiselyov Monterey (CA), USA Herbert Kuchen University of Muenster, Germany Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Torsten Schaub University of Potsdam, Germany Peter Schneider-Kamp University of Southern Denmark, Denmark Dietmar Seipel University of Wuerzburg, Germany Hans Tompits Vienna University of Technology, Austria German Vidal Universidad Politecnica de Valencia, Spain Janis Voigtlaender University of Bonn, Germany ---------------------------------------------------------------------- CONTACT Michael Hanus University of Kiel, Germany Email: mh at informatik.uni-kiel.de ---------------------------------------------------------------------- From paolini at di.unito.it Tue Mar 26 04:43:32 2013 From: paolini at di.unito.it (Luca Paolini) Date: Tue, 26 Mar 2013 09:43:32 +0100 Subject: [TYPES/announce] Postdoc position in "Foundation of Computing" Message-ID: <51515FB4.1070306@di.unito.it> ----------------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK MIGHT BE INTERESTED. ----------------------------------------------------------------------- One post-doc position on the research project "Linear Techniques for the analysis of Languages (LINTEL)" is available at the Universit? di Torino, Dip. di Informatica funded by the project LINTEL headed by Luca Paolini. The research activity will be carried out within the Lambda-Group Research Unit of the Dipartimento di Informatica. The Lambda-Group in Torino is one of the biggest worldwide research groups in Formal Methods, see http://www.unito.it/unitoWAR/page/dipartimenti1/D004_en/D004_EN_sections2?path=/BEA%20Repository/358161 Aim and Scope ============= Linearity is a key notion, togheter with interaction and non-determinism, of a modern reductionist trend which looks for a finer analysis of the meaning of computation and logic. The envisaged research is the linchpin of the next generation foundational tools for computing and logic languages, especially in presence of innovative and unconventional features as quantum, reversible, quantitative facets. Tackling complex problems in the relatively simple settings that a linear core of computation can supply, increases the chance of success. Sometimes, the solution can be extended to unrestricted non-linear settings. A non exhaustive list of topics of interest includes: calculi and languages for resource interaction, quantitative analysis of interaction via logics, programming languages with linearity, implicit computational complexity, definition of quantum programming languages, deductive systems for quantum computation, and so on. Candidate Profile ================= The ideal candidate should have a PhD in computer science, mathematics or related disciplines, with expertises around Linear Logic and Lambda-Calculus. We are particularly interested in candidates with strong interest on innovative computing, as Reversible Computing, Probabilistic Computing, Analog Computing, Quantum Computing. Applicants should be excellent thinkers and willing to tackle complex issues. They should be able to work in a collaborative environment, with a strong commitment to reaching research excellence and achieving assigned objectives. Terms and dates =============== The position is for 18 months and will start as soon as possible. The expected salary will range from about 1500 net income per month, will include previdential (social security) contributions. Contact Persons =============== In case of interest, please contact Dr. Luca Paolini, Prof. Ronchi Della Rocca, Prof. Luca Roversi stating your interest, with a Curriculum Vitae, and the names of reference persons. PDF format is strongly encouraged. It should also indicate a preferred starting date. Location ======== Turin is a major business and cultural centre in northern Italy, surrounded by the western Alpine arch, near to France and Switzerland. The population of the urban area is estimated to be 1.7 million inhabitants. The city has a rich culture and history, and is known for its numerous art galleries, restaurants, churches, palaces, opera houses, piazzas, parks, gardens, theatres, libraries, museums and other venues. Turin is well known for its baroque, rococo, neo-classical, and Art Nouveau architecture. Much of the city's public squares, castles, gardens and elegant palazzi such as Palazzo Madama, were built in the 16th and 18th century, after the capital of the Duchy of Savoy (later Kingdom of Sardinia) was moved to Turin from Chambery (nowadays France) as part of the urban expansion. Prestigious and important museums, such as the Museo Egizio and the Mole Antonelliana are also found in the city. Turin's several monuments and sights make it one of the world's top 250 tourist destinations, and the tenth most visited city in Italy in 2008. -- ----- http://www.di.unito.it/~paolini/ -- DipInfo Spam Engine -- Visit the following link if you are sure that this message IS SPAM https://mailscanner.di.unito.it/SpamEngine/this_is_spam.php?id=r2Q8hWIv008018 From m.huisman at utwente.nl Tue Mar 26 09:15:01 2013 From: m.huisman at utwente.nl (Marieke Huisman) Date: Tue, 26 Mar 2013 14:15:01 +0100 Subject: [TYPES/announce] PhD position on "Semantics and Verification of Accelerator Programming" Message-ID: <51519F55.60609@utwente.nl> [[Apologies for multiple copies]] PhD position for four years on "Semantics and Verification of Accelerator Programming" in the Formal Methods and Tools group, University of Twente, Netherlands Deadline for application: 1st of May More information and applications via: http://utwente.nl/vacatures/ The research group Formal Methods and Tools at the University of Twente (Enschede, The Netherlands) is looking for *a PhD researcher (4 years) * to work on the EU Strep project CARP (Correct and Efficient Accelerator Programming), funded by the European Union. Within the context of the CARP project, you will collaborate with the other partners in the project: Imperial College, UK; Realeyes, Estonia; ARM, UK; RTWH Aachen, Germany, Monoidics, UK, ENS, France and Rightware, Finland. * **The CARP Project:* In recent years, massively parallel accelerator processors, primarily GPUs, have become widely available to end-users. Accelerators offer tremendous compute power at a low cost, and tasks such as media processing, simulation, medical imaging and eye-tracking can be accelerated to beat CPU performance by orders of magnitude. Performance is gained in energy efficiency and execution speed, allowing intensive media processing software to run in low-power consumer devices. Accelerators present a serious challenge for software developers. A system may contain one or more of the plethora of accelerators on the market, with many more products anticipated in the immediate future. Applications must exhibit portable correctness, operating correctly on any configuration of accelerators, and portable performance, exploiting processing power and energy efficiency offered by a wide range of devices. The overall aims of CARP are to design techniques and tools for correct and efficient accelerator programming: - Novel & attractive methods for constructing system-independent accelerator programs - Advanced code generation techniques to produce highly optimised system-specific code from system-independent programs - Scalable static techniques for analysing system-independent and system-specific accelerator programs, both qualitatively and quantitatively *This Project: * The PhD candidate we are looking for is expected to work on the development of tools and techniques for correct accelerator programming. We have developed a verification technique for low-level GPU programming (for OpenCL), ba, and want to extend this to verify also the functional behaviour of applications. Moreover, the verifications should be done automatically, which requires the development of dedicated verification algorithms. Within the consortium an intermediate programming language for accelerator programming is developed. In this programming language, the developer can give compiler hints on where to parallellise. The PhD candidate is expected to develop automatic verification techniques to check whether the compiler hints are indeed applicable, or if they could lead to errors in the code. *We seek:* An enthusiastic PhD student with an MSc degree in Computer Science (or an equivalent qualification). The candidate should have a thorough theoretical background, a demonstrable interest in program semantics and 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, and contributes to the expected deliverables for the project. 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 a PhD thesis. Starting date of the position: June 1st, 2013, or as soon as possible thereafter. *We offer:* - A PhD position for four years (38 hrs/week) - A stimulating scientific environment - Gross salary ranging from EUR 2042 tot E 2612 (4th yr) per month - Holiday allowance (8%), end-of-year bonus (8.3%) - Good secondary conditions, in accordance with the collective labour agreement CAO-NU for Dutch universities - A green Campus with lots of sports facilities You 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) - The CARP project: http://fmt.ewi.utwente.nl/files/projects/CARP.d1.pdf *Application: * Please submit your application before 1st of May, 2013 via http://www.utwente.nl/vacatures/en/. 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, including a list of all courses + marks, and a short description of your MSc thesis; and - references (contact information) of two scientific staff members. -------------- next part -------------- An HTML attachment was scrubbed... URL: From michael.norrish at nicta.com.au Tue Mar 26 19:52:34 2013 From: michael.norrish at nicta.com.au (Michael Norrish) Date: Wed, 27 Mar 2013 10:52:34 +1100 Subject: [TYPES/announce] (CFP) Certified Programs and Proofs 2013 - First Call for Papers Message-ID: <515234C2.1080500@nicta.com.au> PRELIMINARY CALL FOR PAPERS =========================== Third International Conference on Certified Programs and Proofs (CPP 2013) -------------------------------------------------------------------------- December 2013, Australia (co-located with APLAS 2013) CPP is an international forum on theoretical and practical topics in all areas, including computer science, mathematics, and education, that consider certification as an essential paradigm for their work. Certification here means formal, mechanized verification of some sort, preferably with production of independently checkable certificates. We invite submissions on topics that fit under this rubric. The first two CPP conferences were held in Kenting, Taiwan, and Kyoto, Japan, in December 2011 and 2012, respectively. As with the first meetings, the proceedings will be published in Springer-Verlag?s Lecture Notes in Computer Science series. Suggested, but not exclusive, specific topics of interest for submissions include: certified or certifying programming, compilation, linking, OS kernels, runtime systems, and security monitors; program logics, type systems, and semantics for certified code; certified decision procedures, mathematical libraries, and mathematical theorems; proof assistants and proof theory; new languages and tools for certified programming; program analysis, program verification, and proof-carrying code; certified secure protocols and transactions; certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; certificates for program termination; logics for certifying concurrent and distributed programs; higher-order logics, logical systems, separation logics, and logics for security; teaching mathematics and computer science with proof assistants; and ?Proof Pearls? (elegant, concise, and instructive examples). Important Dates: ++++++++++++++++ Authors are required to submit a paper title and a short abstract before submitting the full paper. The submission should include when necessary a URL where to find the formal development assessing the essential aspects of the work. All submissions will be electronic. All deadlines are at midnight (GMT). ============================ ========================== **Abstract Deadline:** Friday, May 30, 2013 **Submission Deadline:** Friday, June 7, 2013 **Author Notification:** Monday, August 19, 2013 **Camera-ready Papers Due:** Monday, September 16, 2013 ============================ ========================== Submission Instructions: ++++++++++++++++++++++++ Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2013 Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submissions should not exceed 16 pages in LNCS format, including bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. The proceedings of the symposium will be published as a volume in Springer-Verlag?s Lecture Notes in Computer Science series. Submission instructions including LaTeX style files are available from the CPP 2013 website. Each submission must be written in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference, all phrased for the non-specialist. Technical and formal developments directed to the specialist should follow. Whenever appropriate, the submission should come along with a formal development, using whatever prover, e.g., Agda, Coq, Elf, HOL, HOL-Light, Isabelle, Matita, Mizar, NQTHM, PVS, Vampire, etc. References and comparisons with related work should be included. *Papers not conforming to the above requirements concerning format and length may be rejected without further consideration.* The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other published conferences or workshops. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. Original formal proofs of known results in mathematics or computer science are among the targets. One author of each accepted paper is expected to present it at the conference. Organisation ++++++++++++ :Program Co-Chairs: Georges Gonthier (Microsoft Research Cambridge) & Michael Norrish (NICTA) :General Chair: Peter Schachte, University of Melbourne Program Committee ^^^^^^^^^^^^^^^^^ ========================= ======================================= Derek Dreyer MPI-SWS William Farmer McMaster University Jean-Christophe Filli?tre INRIA C?dric Fournet Microsoft Research Cambridge Benjamin Gr?goire INRIA Reiner H?hnle Technische Universit?t Darmstadt Aquinas Hobor National University of Singapore Gyesik Lee Seoul University Cesar Mu?oz NASA Langley Toby Murray NICTA Gopalan Nadathur University of Minnesota Claudio Sacerdoti Coen University of Bologna Peter Sewell University of Cambridge Bas Spitters University of Nijmegen Gang Tan Lehigh University Alwen Tiu Australian National University Yih-Kuen Tsay Taiwan National Technical University Lihong Zhi Academica Sinica ========================= ======================================= -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 555 bytes Desc: OpenPGP digital signature URL: From deligu at di.unito.it Wed Mar 27 07:30:43 2013 From: deligu at di.unito.it (Ugo de'Liguoro) Date: Wed, 27 Mar 2013 12:30:43 +0100 Subject: [TYPES/announce] Control Operators and their Semantics (COS'13) - change of dates Message-ID: This is the COS'13 cfp with some changes of dates. While keeping the deadline of submissions on April the 6th, we do not require previous abstract submission, and postpone to April the 15th the deadline for contributed talks only (called EXTENDED ABSTRACTS below): Submission: April, 6 2013 (no previous abstract submission required) Extended abstract: April, 15 2013 (new) Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 ============================================================================ Control Operators and their Semantics (COS'13) - Call for Papers Satellite event of RDP'13 June 24 - 25, 2013, Eindhoven, The Nederlands http://cos2013.di.unito.it/ (modified on April, 25th) ============================================================================ Modern programming languages provide sophisticated control mechanisms, commonly referred to as control operators which are widely used to realize a variety of applications. Since we cannot escape control features, it becomes a challenge to provide them with sound reasoning principles. There is a very active research on understanding, manipulating, representing, and reasoning about elaborated non-local control structures, in particular in declarative programming languages such as functional and logic languages. Ideas and results originating from this research area have impact in many other areas of computer science, like distributed and concurrent systems, proof theory, proof mining, web programming and linguistics. For instance, the study of the logical foundations of control operators renewed the study of the connections between proofs and programs via the so-called Curry-Howard correspondence, providing new methods to extract the computational content of classical proofs. The focus of the workshop is on the interplay between syntax and semantics, namely the central question of what a program means and how it does define the intended procedure. This is a crucial issue especially in the case of control operators, since they are as powerful as potentially obscure, and programs that use them are usually more error prone than purely declarative ones. The issue of a better understanding of control is also relevant for communicating across different research areas and communities. More abstract views can be achieved via several means, that include operational semantics of formal calculi, abstract machines, algebraic specifications and rewriting, type assignment systems, denotational semantics and game semantics, category theory and logic, to say the least. Relevant topics include, but are not limited to: - continuations and delimited continuations - categorical models of continuations - compositionality and modularity of control operators - denotational semantics of control, event structures and causality - operational semantics and abstract machines - type systems for control operators - game semantics of programming languages and of logical proofs - usage of control operators in proof search and proof mining - semantics of control operators in logic programming Invited speakers: - Mattew Flatt (Univeristy of Utah) - Thomas Streicher (Universitaet Darmstadt) Program Committee: Zena Ariola University of Oregon Stefano Berardi Turin University Hugo Herbelin INRIA and Laboratoire PPS (Paris 7) Ugo de'Liguoro (chair) Turin Univerisity Ken-etsu Fujita Gunma University Koji Nakazawa Kyoto University Alexis Saurin (co-chair) INRIA and Laboratoire PPS (Paris 7) Submission: authors of original works on the topic of the workshop are invited to submit either a FULL PAPER of up to 20 pages, which has to be unpublished nor submitted elsewhere, or an EXTENDED ABSTRACT of up to 5 pages (to which previous restrictions do not apply) for short presentation at the workshop. Only accepted full papers will appear in the proceedings; the PC might decide, on the ground of referees reports, that a full paper submission is accepted as extended abstract instead. Submission consists of a LaTex generated pdf file, prepared using EPTCS macro package, available from: http://info.eptcs.org/ Authors of extended abstracts must add: "Extended Abstract" to the title. The PC Submissions are via EasyChair COS2013 site: https://www.easychair.org/conferences/?conf=cos2013 Important Dates: Submission: April, 6 2013 (no previous abstract submission required) Extended abstract: April, 15 2013 (new) Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 Contact: Ugo de'Liguoro Dipartimento di Informatica, Universita' di Torino, Corso Svizzera 185, 10149 Torino, Italy email: deliguoro at di.unito.it Web sites: COS'13: http://cos2013.di.unito.it RTD'13: http://www.win.tue.nl/rdp2013/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From albertolluch at gmail.com Wed Mar 27 13:11:13 2013 From: albertolluch at gmail.com (Alberto Lluch Lafuente) Date: Wed, 27 Mar 2013 18:11:13 +0100 Subject: [TYPES/announce] 2nd CFP: 8th International Symposium on Trustworthy Global Computing (TGC 2013) Message-ID: == CALL FOR PAPERS =================================================== 8th International Symposium on Trustworthy Global Computing (TGC 2013) Buenos Aires, 30-31 August 2013 (co-located with CONCUR, QEST & FORMATS 2013) http://sysma.lab.imtlucca.it/tgc2013/ Call for Papers ====================================================================== Important dates =============== 15 April 2013 Deadline for abstract submission 22 April 2013 Deadline for paper submission 10 June 2013 Notification to authors 30-31 August 2013 Symposium Scope ===== The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in the so-called global computers, i.e., those computational abstractions emerging in large-scale infrastructures such as service-oriented architectures, autonomic systems and cloud computing. The TGC series focuses on providing frameworks, tools, algorithms and protocols for designing open-ended, large-scaled applications and for reasoning about their behaviour and properties in a rigorous way. The related models of computation incorporate code and data mobility over distributed networks that connect heterogeneous devices and have dynamically changing topologies. Topics ====== We solicit papers in all areas of global computing, including (but not limited to): * theories, languages, models and algorithms; * language concepts and abstraction mechanisms; * security, trust, privacy and reliability; * resource usage and information flow policies; * software development and software principles; * model checkers, theorem provers and static analyzers. Submission details ================== Papers are to be submitted through EasyChair. Contributions must be in PDF format 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. Collaboration with CONCUR ========================= Exceptionally, however, concurrent submissions to CONCUR 2013 and TGC 2013 are allowed, and in fact encouraged for those paper that may potentially enhance both conferences. Authors of such double submissions should identify them to the Program Chairs at the time of submission (by choosing the ?Regular Paper submitted to CONCUR? paper category). Reviews may be shared between CONCUR 2013 and TGC 2013. CONCUR?s timeline is ahead of TGC?s; submissions accepted by CONCUR will be considered automatically withdrawn from TGC. Proceedings =========== As in previous editions 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. Invited speakers ================ Luca de Alfaro (UC Santa Cruz, USA) Nobuko Yoshida (Imperial College London, UK) Steering committee ================== Gilles Barthe (IMDEA Software, Madrid, Spain) Rocco De Nicola (IMT Institute for Advanced Studies Lucca, Italy) Christos Kaklamanis (University of Patras, Greece) Ugo Montanari(University of Pisa, Italy) Davide Sangiorgi (University of Bologna, Italy) Don Sannella (University of Edinburgh, Scotland) Vladimiro Sassone (University of Southampton, UK) Martin Wirsing (LMU University of Munich, Germany) Programme chairs ================ Mart?n Abadi (Microsoft Research and UC Santa Cruz, USA) Alberto Lluch Lafuente (IMT Institute for Advanced Studies Lucca, Italy) Programme committee =================== Gul Agha (University of Illinois at Urbana-Champaign, USA) Myrto Arapinis (University of Birmingham, UK) Rocco De Nicola (IMT Lucca, Italy) Luis Caires (Universidade Nova de Lisboa, Portugal) Jos? Luiz Fiadeiro (Royal Holloway University of London, UK) Andrew D. Gordon (Microsoft Research and University of Edinburgh, UK) Radha Jagadeesan (DePaul University, USA) Sergio Maffeis (Imperial College London, UK) Matteo Maffei (Saarland University, Germany) Davide Sangiorgi (University of Bologna, Italy) Catuscia Palamidessi (INRIA & ?cole Polytechnique, France) Frank Pfenning (Carnegie Mellon University, USA) Sriram Rajamani (Microsoft Research, India) Tamara Rezk (INRIA, France) Alejandro Russo (Chalmers University of Technology, Sweden) Carolyn Talcott (SRI International, USA) Emilio Tuosto (University of Leicester, UK) Sebasti?n Uchitel (University of Buenos Aires, Argentina and Imperial College London, UK) Martin Wirsing (LMU University of Munich, Germany) Contact information =============== tgc2013 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From george.cherevichenko at gmail.com Wed Mar 27 14:38:31 2013 From: george.cherevichenko at gmail.com (George Cherevichenko) Date: Wed, 27 Mar 2013 22:38:31 +0400 Subject: [TYPES/announce] New definitions of contexts and free variables for lambda-calculi with explicit substitutions Message-ID: http://arxiv.org/abs/1303.5039 Abstract. Contexts (environments) are not sets or lists without multiplicity, but have a more complicated structure. There is a natural order on the set of contexts. A "set" of free variables is not a set, but a context in the new sense. New definitions simplify working with explicit substitutions. It is desirable to see this article (Lang and Lescanne) before http://lara.inist.fr/handle/2332/734 -------------- next part -------------- An HTML attachment was scrubbed... URL: From dallago at cs.unibo.it Thu Mar 28 05:14:07 2013 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Thu, 28 Mar 2013 10:14:07 +0100 Subject: [TYPES/announce] FOPARA 2013 - First Call for Papers Message-ID: <515409DF.1070509@cs.unibo.it> --------------- CALL FOR PAPERS --------------- Third International Workshop on FOUNDATIONAL AND PRACTICAL ASPECTS OF RESOURCE ANALYSIS (FOPARA 2013) August 29th to 31st, 2013, Bertinoro, Italy Co-located with WST 2013 http://fopara2013.cs.unibo.it SCOPE The workshop will serve as a forum for presenting original research results that are relevant to the analysis of resource (time, space, and others) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. The following list of topics is non-exhaustive: ? resource static analysis for embedded or/and critical systems; ? logical and machine-independent characterisations of complexity classes; ? logics closely related to complexity classes; ? type systems for controlling/inferring/checking complexity; ? semantic methods to analyse resources, including quasi-interpretations; ? practical applications of resource analysis; ? complexity analysis by term and graph rewriting. SUBMISSIONS FOPARA 2013 is a two-phase workshop. All participants are invited to submit a draft paper describing the work to be presented at the workshop. These submissions will be screened by the program committee chair to make sure they are within the scope of FOPARA and will appear in the draft proceedings distributed at the workshop. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the workshop, authors will be given the opportunity to incorporate the feedback from discussions at the workshop and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles that will appear in the formal proceedings. All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The papers selected after the reviewing process will be published as a volume of the Springer LNCS series (Springer?s approval is pending). IMPORTANT DATES The following deadlines are strict. ? Draft Submission: June 3rd, 2013; ? Noti?cation (Draft): June 21st, 2013; ? Final Version: July 5th, 2013; ? Paper Submission: September 30th, 2013; ? Noti?cation (Paper): December 2nd, 2013; ? Camera Ready: December 23rd, 2013. PROGRAM COMMITTEE Roberto Amadio, Universit? Denis-Diderot Ugo Dal Lago, Universit? di Bologna (co-chair) Marko van Eekelen, Radboud University Nijmegen Marco Gaboardi Universit? di Bologna & UPenn Miguel Gomez-Zamalloa, Complutense University of Madrid Ste?en Jost, LMU, Munich Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh Georg Moser, University of Innsbruck Damiano Mazza, CNRS & Universit?e Paris Nord Ricardo Pena, Complutense University of Madrid (co-chair) Ulrich Schoepp, LMU, Munich Pedro Vasconcelos, Universidade do Porto From jeroen.ketema at yahoo.com Thu Mar 28 11:35:46 2013 From: jeroen.ketema at yahoo.com (Jeroen Ketema) Date: Thu, 28 Mar 2013 16:35:46 +0100 Subject: [TYPES/announce] WRS 2013 - Call for Papers Message-ID: <51546352.5050404@yahoo.com> ------------------------- WRS 2013: CALL FOR PAPERS ------------------------- 11th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2013) http://multicore.doc.ic.ac.uk/events/wrs2013/ 27 June 2013, Eindhoven, the Netherlands IMPORTANT DATES * Paper submission deadline: 24 April 2013 * Notification of acceptance: 22 May 2013 * Preliminary proceedings version due: 5 June 2013 * Workshop: 27 June 2013 * Paper submission for final proceedings: TBA * Notification of acceptance: TBA * Final version due: TBA AIMS AND SCOPE The WRS workshop promotes research and collaboration in the area of reduction strategies in rewriting and programming. It encourages the presentation of new directions, developments, and results as well as surveys and tutorials on existing knowledge in this area. Reduction strategies define which (sub)expression(s) should be selected for evaluation and which rule(s) should be applied. These choices affect fundamental properties of computations such as laziness, strictness, completeness, and efficiency, to name a few. For this reason programming languages such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit definition of the evaluation strategy, whereas languages such as Clean, Curry, and Haskell allow its modification. In addition to strategies in rewriting and programming, WRS also covers the use of strategies and tactics in other areas such as theorem and termination proving. Previous editions of the workshop were held in Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), Edinburgh (2010), Novi Sad (2011), and Manchester (2012); the 2010 and 2012 editions were joint with the STRATEGIES workshop. Further information can be found at the permanent site for WRS (http://users.dsic.upv.es/~wrs/). WRS 2013 will be co-located with RTA 2013 (24th International Conference on Rewriting Techniques and Applications), as a satellite event of RDP, the Federated Conference on Rewriting, Deduction, and Programming. WRS 2013 will be held on 27 June in Eindhoven, the Netherlands. PAPER SUBMISSION AND PUBLICATION The submission process is in two stages. * Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style through the EasyChair submission site: https://www.easychair.org/conferences/?conf=wrs2013 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. * 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 an electronic journal, such as Electronic Proceedings in Theoretical Computer Science. 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 SPEAKER * Eelco Visser, Delft Univerity of Technology, the Netherlands PROGRAM COMMITTEE * Sandra Alves, University of Porto * Isabelle Gnaedig, LORIA and INRIA Nancy * Bernhard Gramlich, Technische Universit?t Wien * J?rgen Giesl, RWTH Aachen * Jeroen Ketema, Imperial College Londen (co-chair) * Dorel Lucanu, "Alexandru Ioan Cuza" University * Hans Zantema, Eindhoven University of Technology (co-chair) From M.Roggenbach at swansea.ac.uk Thu Mar 28 18:51:46 2013 From: M.Roggenbach at swansea.ac.uk (Markus Roggenbach) Date: Thu, 28 Mar 2013 22:51:46 +0000 Subject: [TYPES/announce] CALL FOR PAPERS - FM-RAIL-BOK WORKSHOP 2013 Message-ID: <6FD5C277-F304-4952-9073-088BE78C35FD@swansea.ac.uk> CALL FOR PAPERS FM-RAIL-BOK WORKSHOP 2013 -- Workshop on a -- Formal Methods Body of Knowledge for -- Railway Control and Safety Systems 23-24 September 2013, 2013, Madrid, Spain http://ssfmgroup.wordpress.com A workshop in SEFM'13 September 25-27, 2013, Madrid, Spain http://antares.sip.ucm.es/sefm2013/ MOTIVATION AND SCIENCE-PHILOSOPHICAL BACKGROUND Formal methods in software science and software engineering have existed at least as long as the term ?software engineering? (NATO Science Conference, Garmisch, 1968) itself. In many engineering-based application areas, such as in the railway domain, formal methods have reached a level of maturity that already enables the compilation of a so-called body of knowledge (abbreviated as ?BOK?). Its various methods and techniques include algebraic specification, process-algebraic modelling and verification, Petri nets, fuzzy logics, etc. For example, the B-method has been used successfully to verify the most relevant parts of a model of the Metro underground railway system of the city of Paris (France). Software tool support is already available for a number of those formal methods; for example in the form of various model checker or SAT solver programs. In this context, our workshop shall bring together scientists, researchers and practitioners, from academia, the industry, professional guildes and engineering associations, national or international standardisation committees, as well as governmental or administrative regulators to re-collect and discuss the ?state of the art? in the application of formal methods within the railway domain (including inner-city tram lines, urban mono-rail systems, etc., too). Thereby we shall adopt a methodological viewpoint based on Vincenti?s book "What Engineers know and how they know it: Analytical Studies from Aeronautical History, John Hopkins University Press, 1990". This book contains a science-historical and science-philosophical analysis of what it is that constitutes engineering knowledge (and the related practice) specifically, in other words: an epistemology of engineering. The development of the above-mentioned handbooks as an explicit recording of such knowledge is part of Vincenti?s epistemology. SUBMISSION Our workshop calls for short position papers with strong emphasis on methodologically sound ?BOK? contents and case-based ?best practice? knowledge in the spirit of classical engineering handbooks. Such papers, which will be reviewed and moderated by the workshop?s programme committee, must not exceed 6 pages in the IEEE double-column conference format http://www.ieee.org/conferences_events/conferences/publishing/templates.html and must be submitted via our EasyChair Submission Website http://www.easychair.org/account/signin.cgi?conf=fmrailbok2013 no later than the stipulated submission deadline. Submissions which do not meet these requirements will be rejected without review. IMPORTANT DATES: Paper submission deadline: 14 June 2013 Author notification: 5 July 2013 Re-submission of revised accepted papers: 16 August 2013 Distribution of revised papers amongst registered participants: 2 September 2013 Workshop in Madrid: 23-24 September 2013 Thereafter: post-discussions and further work towards the planned book release WORKSHOP CO-CHAIRS Anne Haxthausen, Technical University of Denmark Markus Roggenbach, University of Swansea, Great Britain Stefan Gruner, University of Pretoria, South Africa Tom Maibaum, McMaster University, Canada PROGRAMME COMMITTEE (confirmation status: 21 March 2013) Martin Brennan, British Rail Safety Standards Board Simon Chadwick, Invensys Rail, Great Britain Lars-Henrik Eriksson, Uppsala University, Sweden Alessandro Fantechi, University of Firenze, Italy Michaela Huhn, Technical University of Clausthal, Germany Hoang Nga Nguyen, University of Swansea, Great Britain Jan Peleska, University of Bremen, Germany Holger Schlingloff, Humboldt-University of Berlin, Germany Kenji Taguchi, AIST, Japan Helen Treharne, University of Surrey, Great Britain Laurent Voisin, Systerel, France Kirsten Winter, University of Queensland, Australia WORKSHOP FORMAT Our workshop is planned as a workshop in the proper sense of the word, i.e.: it will be work-oriented, not presentation-oriented. During the workshop, smaller sub-groups will work on various sub-topics, whereas plenum sessions will bring the sub-groups and their sub-results together again. For the sake of effective working during the event, all accepted papers will be distributed amongst the registered participants already before the event. Participants are expected to study these papers before the workshop, such that the discussions and sub-groups can commence effectively from the first hour of the meeting onwards. Soon after the workshop, its work results (proceedings) shall be published first in the form of an institutional technical report. Thereafter the technical report shall be further ?polished? and consolidated, with the goal of publishing an authoritative BOK book on the chosen topic, with a reputable publisher, in the not-too-far future. In case of good success, similar BOK preparation workshops are planned for the future on other (yet similar) topics, for example: formal methods for aviation software, or formal methods for automobile applications, etc. In the long term, this could lead to a multi-volume series of such BOK books on various topics. PUBLICATION According to our workshop?s goal and format we follow a 3-phase publication plan with informal distribution of accepted papers amongst registered workshop participants before the workshop, official release of an institutional technical report soon after the workshop, publication of a refined and consolidated BOK book in the not-too-far future, after the technical report, with a reputable scientific publisher. From Assia.Mahboubi at inria.fr Fri Mar 29 06:03:23 2013 From: Assia.Mahboubi at inria.fr (Assia Mahboubi) Date: Fri, 29 Mar 2013 11:03:23 +0100 Subject: [TYPES/announce] The 5th Coq Workshop Message-ID: <515566EB.5060502@inria.fr> ================================================================================ The Fifth Coq Workshop (2013) http://coq.inria.fr/coq-workshop/2013 Colocated with the 4rd International Conference on Interactive Theorem Proving (ITP 2013), Rennes, France ================================================================================ The Coq Workshop series brings together Coq users, developers, and contributors. While conferences like ITP provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, likely supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Relevant subject matter includes but is not limited to: * Language or tactic features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools and platforms built on Coq * Plugins and libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit short proposals through EasyChair. Submissions should be in portable document format (PDF). Proposals should not exceed 2 pages in length in single-column full-page style. Venue: ITP, Rennes. Important Dates: * April 7: Deadline for proposal submission * April 28: Acceptance notification * July 22: Workshop in Rennes Submission URL: https://www.easychair.org/conferences/?conf=coq5 Program committee: * Pierre Letouzey, Universit? Paris 7, France * Marco Maggesi, Universit? degli Studi di Firenze, Italy * Assia Mahboubi (co-chair), INRIA, France * David Pichardie, INRIA, France * Benjamin Pierce, University of Pennsylvania, USA * Randy Pollack, University of Edinburgh, UK * Enrico Tassi (co-chair), INRIA, France * Viktor Vafeiadis, MPI-SWS, Germany Contact: Assia Mahboubi (assia.mahboubi at inria.fr), Enrico Tassi (enrico.tassi at inria.fr) From shankar at csl.sri.com Sat Mar 30 01:28:58 2013 From: shankar at csl.sri.com (Natarajan Shankar) Date: Fri, 29 Mar 2013 22:28:58 -0700 Subject: [TYPES/announce] Third Summer School on Formal Techniques, May 20-24, 2013, Atherton, California Message-ID: <5156781A.1070508@csl.sri.com> Third Summer School on Formal Techniques May 20 - May 24, 2013 Menlo College, Atherton, CA http://fm.csl.sri.com/SSFT13 Follows VSTTE May 17-19 in the same location: https://sites.google.com/site/vstte2013/ Formal verification techniques such as model checking, satisfiability, and static analysis have matured rapidly in recent years. This school, the third in the series, will focus on the principles and practice of formal verification, with a strong emphasis on the hands-on use and development of this technology. It primarily targets graduate students and young researchers who are interested in using verification technology in their own research in computing as well as engineering, biology, and mathematics. Students at the school will have the opportunity to experiment with the tools and techniques presented in the lectures. The first Summer Formal school (SSFT11;http://fm.csl.sri.com/SSFT11) was held in May 2011 and the second (SSFT12;http://fm.csl.sri.com/SSFT12) was held in May 2012. We have NSF support for the travel and accommodation for students from US universities, but welcome applications from graduate students at non-US universities as well. Non-US students will have to cover their travel and lodging expenses (around $500). The deadline for applications is April 30. Non-US students requiring US visas are requested to apply early (by April 15). Interested students can submit their application at http://fm.csl.sri.com/SSFT13 The lectures at the school include: ================================================================== Title: Decision Methods for Arithmetic Lecturer: Leonardo de Moura, Microsoft Research Abstract: Decision methods for arithmetic are extensively used in the formal verification and analysis of software and cyber-physical systems, computer algebra, and formalized mathematics. In these talks, we will cover several decision methods for fragments of arithmetic such as the elementary theories of algebra and geometry over the Real and Complex numbers. We will also describe the general techniques used in the design of these procedures: saturation, model-based methods, abstract/refine loop, infinitesimals, etc. We assume only a basic grounding in first-order logic. ================================================================== Title: Advanced Theorem Proving Techniques in PVS with Applications Lecturer: Cesar Munoz, NASA Langley Research Center Hampton, VA 23681-2199, USA Abstract: The Prototype Verification System (PVS) [http://pvs.csl.sri.com] is an interactive environment for the specification and verification of systems. PVS provides a strongly typed specification language, which is based on Higher-Order Logic. The type system of PVS supports: sub-typing, dependent-types, abstract data types, parametric types, records, unions, and tuples. The PVS theorem prover includes decision procedures for a variety of theories such as linear arithmetic, propositional logic, and temporal logic. This seminar will provide a gentle introduction to advanced PVS features, including types for specifications, implicit induction, iterations, rapid prototyping, strategy writing, and computational reflection. ================================================================== Title: Static and Dynamic Verification of Concurrent Programs Lecturer: Aarti Gupta, NEC Labs Abstract: The need to harness the computing power of modern multi-core platforms has driven a resurgence of interest in concurrent programs. However, it is very challenging to develop correct concurrent programs, and in practice programs often exhibit bugs related to subtle synchronization effects. These lectures will describe various static and dynamic techniques underlying automatic verification and debugging of concurrent programs. The emphasis will be on main ideas to reason about synchronizations and interleavings between interacting threads or processes. On the static side, we first review some theoretical results on model checking based on interacting pushdown system (PDS) models. Decidability results here limit the patterns of synchronization allowed. Next, we consider the practice of model checking concurrent programs, where the main challenge is in managing the explosion in interleavings. We consider both explicit and symbolic state space exploration, where various techniques are inspired by successful verification of finite state systems on one hand, and sequential programs on the other. Due to scalability limitations of static verification, there has been increased interest in dynamic techniques for systematically exploring (parts of) concurrent programs. We discuss preemptive context bounding techniques that control the scheduler to dynamically explore other interleavings. We also consider predictive analysis techniques, where a trace-based model derived from dynamic executions is used to predict concurrency bugs. ================================================================== Title: Program verification and synthesis as Horn-like constraint solving Lecturer: Andrey Rybalchenko, TU Munich Abstract: First, we review how proving reachability and termination properties of transition systems, procedural programs, multi-threaded programs, and higher- order functional programs can be reduced to constraint solving for Horn-like constraints. This step will cover properties over program variables of scalar and array data types. Second, we show how universal and existential temporal properties can be proved using contraint-based setting equipped with existential quantification. Third, we present a reduction from reactive program synthesis to existentially quantified Horn-like constraints. Finally, we discuss adequate solving algorithms and tools. The material would cover/export syntax and semantics of Horn clauses over theory literals, basics of temporal proof rules for reasoning about programs, basics of CTL and synthesis together with deductive proof rules, bottom-up inference/ resolution of Horn clauses, Skolemization, abstraction, interpolation. ================================================================== Title: Verified Programming with VCC Speaker: Ernie Cohen Abstract: In the last few years it has become practical to write real-world code and prove that it meets its specifications. This course provides an introduction to the joys of verified programming using VCC, a deductive verifier for concurrent C code. ================================================================== Title: Speaking Logic Speaker: Natarajan Shankar, SRI International Abstract: Formal logic has become the lingua franca of computing. It is used for specifying digital systems, annotating programs with assertions, defining the semantics of programming languages, and proving or refuting claims about software or hardware systems. Familiarity with the language and methods of logic is a foundation for research into formal aspects of computing. This course covers the basics of logic focusing on the use of logic as a medium for formalization and proof. From Ralph.Matthes at irit.fr Sun Mar 31 06:56:26 2013 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Sun, 31 Mar 2013 12:56:26 +0200 Subject: [TYPES/announce] Types Meeting 2013 in Toulouse, 22 - 26 April: 2nd call for participation Message-ID: <6cb1-51581680-5-782dba00@49508342> Types Meeting 2013 Toulouse, 22-26 April 2013 http://www.irit.fr/TYPES2013/ SECOND CALL FOR PARTICIPATION [new: tutorial by Lars Birkedal on April 22, abstracts of contributed talks are available, a remark that there are several payment options, titles and abstracts of talks by Steve Awodey and Ulrich Kohlenbach in the CSPM workshop on April 26 are available, and also a dedicated CSPM web page] The 19th Conference "Types for Proofs and Programs" will take place in Toulouse, France, from 22 to 26 April 2013 - including the pre-conference workshop PCC on April 22 and 23, a tutorial in the late afternoon of April 22 and the post-conference workshop CSPM in the afternoon of April 26. The scientific programme of the main event is from the morning of April 23 (Tuesday) until lunch time on April 26. For an overview of the whole planning, see the web site. 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 (abstracts are available on the web site): * Steve Awodey, School of Mathematics, Institute for Advanced Study, Princeton, U.S.A. & Department of Philosophy, Carnegie Mellon University, U.S.A. "Higher Inductive Types in Homotopy Type Theory" * Lars Birkedal, Department of Computer Science, Aarhus University, Denmark "Charge! a framework for higher-order separation logic in Coq." * Ulrich Kohlenbach, Department of Mathematics, TU Darmstadt, Germany "Types in Proof Mining" TYPES 2013 is intended to be a conference in our traditional workshop style. The contributed talks were selected by the program committee on the basis of abstracts of up to two pages (in EasyChair LaTeX style). 34 contributed talks were selected by the program committee, see their list together with short (text-only) abstracts via the web site or directly at http://www.irit.fr/TYPES2013/acceptedWithAbstracts.html (To the authors: the deadline for the final version of LaTeX sources for inclusion of the abstracts into the abstract book is Monday, April 1st. The abstracts will then be made available on the web site.) Post-proceedings of TYPES 2013 are confirmed to appear in LIPIcs (Leibniz International Proceedings in Informatics), Schloss Dagstuhl, see http://www.dagstuhl.de/en/publications/lipics (the same publisher as for the last TYPES meeting in Bergen in 2011) There will be a separate call for papers, and participation in TYPES 2013 is no prerequisite for submission to the post-proceedings. The conference itself: Tuesday to Friday, April 23-26 (end of scientific programme on Friday planned for 12:30) The venue: Toulouse in the South West of France is the fourth largest city of France and a lively university center with way over 100000 students. Toulouse offers numerous inexpensive accommodations, including student residences. On the web site, there are links to hotels and residences - even one of the latter only 500m walking distance from the lecture hall of the main event. Thanks to our sponsors, notably Universit? Toulouse 1 Capitole, granting the lecture hall in the city center, and IRIT (Institut de Recherche en Informatique de Toulouse), the federative research structure FREMIT and Universit? Paul Sabatier (Toulouse 3) with financial support (other sources pending), we are able to keep the participation fee low. Moreover, we operate a scheme of additional fee reduction for master and PhD students. *** Early registration will be until *** *** Wednesday, April 3, 23:59 Paris time. *** Access to the online registration system is through http://www.irit.fr/TYPES2013/Registration.html where the fees can be studied offline (several payment options are available, in particular safe payment by credit card). SATELLITE EVENTS ----------------------------------------------------------------------- The twelfth international workshop Proof, Computation, Complexity (PCC 2013) is held on Monday, April 22, and Tuesday, April 23. On Monday, this takes place on the campus of Toulouse Technical University (which is well connected by underground with the city center and the airport bus) and on Tuesday, this is on the site of TYPES 2013. The program committee of PCC 2013 selected 12 contributed talks on the basis of short abstracts. For the details, see http://www.irit.fr/TYPES2013/PCC2013/ ----------------------------------------------------------------------- A tutorial on separation logic by Lars Birkedal, 17:30 - 18:45 on April 22: "An introduction to separation logic, and the benefits of going higher-order", within the seminar series 2013 "Logics and analyses for verifying graph transformation" of the IRIT. ----------------------------------------------------------------------- Workshop CSPM "Computer Science, Philosophy, Mathematics", Friday, April 26, a workshop hosted by the Mathematical Institute, and with financial support by FREMIT, with invited contributions as follows: 14:30-16:00 Steve Awodey: "Structuralism, Invariance, and Univalence" 16:15-17:45 Ulrich Kohlenbach: "Proof Theory : From the Foundations of Mathematics to Applications in Core Mathematics" The workshop aims to stimulate discussions between computer scientists, philosphers and mathematicians and takes place in the Mathematical Institute, which requires approximately 20 minutes walk + 20 minutes on the subway from the main TYPES conference location. There will be no extra fee for participating in the workshop CSPM. For more details (e.g., abstracts and registration information for non-TYPES-participants), see the dedicated web page at http://www.math.univ-toulouse.fr/spip.php?article346 ----------------------------------------------------------------------- Program Committee TYPES 2013 Jos? Esp?rito Santo, University of Minho, Braga, Portugal Herman Geuvers, Radboud University Nijmegen, Netherlands Silvia Ghilezan, University of Novi Sad, Serbia Hugo Herbelin, PPS, INRIA Rocquencourt-Paris, France Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany Zhaohui Luo, Royal Holloway, University of London, UK Ralph Matthes, IRIT, CNRS and Univ. de Toulouse, France (co-chair) Marino Miculan, University of Udine, Italy Bengt Nordstr?m, Chalmers University of Technology, G?teborg, Sweden Erik Palmgren, Stockholm University, Sweden Andy Pitts, University of Cambridge, UK Sergei Soloviev, IRIT, Univ. de Toulouse, France (co-chair) Pawe? Urzyczyn, University of Warsaw, Poland Tarmo Uustalu, Tallinn Technical University, Estonia From A.Murawski at warwick.ac.uk Mon Apr 1 18:40:12 2013 From: A.Murawski at warwick.ac.uk (Andrzej Murawski) Date: Tue, 2 Apr 2013 00:40:12 +0200 Subject: [TYPES/announce] LICS 2013 - Call for Short Presentations In-Reply-To: References: Message-ID: ********************************************************** 28th ACM/IEEE Symposium on Logic In Computer Science (LICS 2013) June 25?28, 2013 New Orleans, USA Call for Short Presentations http://lii.rwth-aachen.de/lics/lics13/lics13-short.html ********************************************************** As in the past, there will be a short-presentation session during LICS 2013, which is intended for descriptions of works in progress, student projects, trailers for longer presentations at affiliated workshops, and relevant research being published elsewhere; other brief communications may be acceptable. Talks can be on any topic related to logic in computer science as summarized in the LICS call for papers. Proceedings of these sessions will not be published. SUBMISSION INSTRUCTIONS Proposals for short (10-minute) presentations must be submitted in the IEEE (2-column; 10pt) proceedings format and must be 1 page long, including references. Please refer to a longer version, should one be available. Style files and instructions for using them can be found here. (The file bare_conf.tex may be used as a template.) The URL for submitting papers is http://www.easychair.org/conferences/?conf=licsshort2013. This link will bring you to the ?Login Page for LICS 2013?. Either sign in using your existing EasyChair account, or sign up for a new account. You'll reach the ?LICS 2013 (author)? page. The page should be self-explanatory. To submit a paper, click ?New Submission? on top and follow instructions. IMPORTANT DATES Submission Deadline: 20 April 2013 Author Notification: 6 May 2013 Final Version Deadline: 30 May 2013 The submission server is open. CONTACT Program Chair Orna Kupferman orna at cs.huji.ac.il From ccshan at indiana.edu Tue Apr 2 17:52:44 2013 From: ccshan at indiana.edu (Chung-chieh Shan) Date: Tue, 2 Apr 2013 17:52:44 -0400 Subject: [TYPES/announce] Haskell 2013 call for submissions Message-ID: <20130402215244.GA22308@mantle.bostoncoop.net> =================================================================== ACM SIGPLAN HASKELL SYMPOSIUM 2013 CALL FOR SUBMISSIONS Boston, MA, USA, 23-24 September 2013, directly before ICFP http://www.haskell.org/haskell-symposium/2013/ haskell2013 at easychair.org =================================================================== The ACM SIGPLAN Haskell Symposium 2013 will be colocated with the 2013 International Conference on Functional Programming (ICFP) in Boston, MA, USA. This year, the symposium will last 2 days rather than 1 as in the past. Thanks to broader participation from a growing community, we will be able to include more regular papers as well as system demonstrations and a new category of panel discussions, while upholding the scientific quality of the symposium. The Haskell Symposium seeks to present original research on Haskell, to discuss practical experience and future development of the language, as well as to promote other forms of denotative programming. Topics of interest include * 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 semantics of the present language or future extensions, type systems, effects, metatheory, 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, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts. Papers in the latter three categories need not necessarily report original research results. They may report instead, for example, reusable programming idioms, elegant ways to approach a problem, or practical experience that will be useful to other users, implementors, or researchers. (Links with more advice appear on the symposium web page.) 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! Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work (also for other languages where appropriate). In addition, we solicit proposals for * System Demonstrations (no longer than a regular paper talk), based on running (perhaps prototype) software rather than necessarily on novel research results. * Panel Discussions (no shorter than a regular paper talk), submitted by a moderator who proposes to bring together specific panelists who have agreed to address a specific pressing issue in the Haskell community. Panels will subsume past "Future of Haskell" discussions. These proposals should summarize the system capabilities that would be demonstrated or the panelist positions that would be discussed. The proposals should explain (and will be judged on) whether the ensuing session is likely to be important and interesting to the Haskell community at large, whether on grounds academic or industrial, theoretical or practical, technical or social. Please contact the program chair with any questions about the relevance of a proposal. Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm). Proceedings: ============ There will be formal proceedings published by ACM Press. Accepted papers will be included in the ACM Digital Library. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy). Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Accepted demo and panel proposals will be posted on the symposium web page, but not formally published in the proceedings. Submission Details: =================== * Abstract submission: Wed 12th June 2013, anywhere on earth * Paper submission : Fri 14th June 2013, anywhere on earth * Demo submission : Fri 14th June 2013, anywhere on earth (prior abstract submission unnecessary) * Panel submission : Fri 28th June 2013, anywhere on earth (prior abstract submission unnecessary) * Author notification: Thu 11th July 2013 * Final papers due : Thu 25th July 2013 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 9-point font in two columns. The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Papers need not fill the page limit -- for example, a Functional Pearl may be much shorter than 12 pages. Each paper submission must adhere to SIGPLAN's republication policy, as explained on the web. Demo and panel proposals are limited to 2-page abstracts, in the same ACM format as papers. "Functional Pearls", "Experience Reports", "Demo Proposals", and "Panel Proposals" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Submission is via EasyChair: https://www.easychair.org/conferences/?conf=haskell2013 Programme Committee: ==================== * Andreas Abel, Ludwig-Maximilians-Universit?t M?nchen * Lennart Augustsson, Standard Chartered Bank * Jean-Philippe Bernardy, Chalmers University of Technology * Olaf Chitil, University of Kent * Neil Ghani, University of Strathclyde * Hans-Wolfgang Loidl, Heriot-Watt University * Ian Lynagh, Well-Typed LLP * David Mazi?res, Stanford University * Akimasa Morihata, Tohoku University * Takayuki Muranushi, Kyoto University * Keiko Nakata, Tallinn University of Technology * Alberto Pardo, Universidad de la Rep?blica * Norman Ramsey, Tufts University * Neil Sculthorpe, University of Kansas * Chung-chieh Shan (chair), Indiana University * Christina Unger, Universit?t Bielefeld * Dana N. Xu, INRIA From ccshan at indiana.edu Tue Apr 2 17:53:26 2013 From: ccshan at indiana.edu (Chung-chieh Shan) Date: Tue, 2 Apr 2013 17:53:26 -0400 Subject: [TYPES/announce] APLAS 2013 call for papers Message-ID: <20130402215326.GA22443@mantle.bostoncoop.net> =============================================================== APLAS 2013 11th Asian Symposium on Programming Languages and Systems 9-11 December 2013 Melbourne, Australia (colocated with CPP 2013) CALL FOR PAPERS =============================================================== ========== BACKGROUND ========== APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in 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. Past APLAS symposiums were successfully held in Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. ====== TOPICS ====== The symposium is devoted to foundational and practical issues in programming languages and systems. Papers are solicited on topics such as * semantics, logics, foundational theory; * design of languages, type systems and foundational calculi; * domain-specific languages; * compilers, interpreters, abstract machines; * program derivation, synthesis and transformation; * program analysis, verification, model-checking; * logic, constraint, probabilistic and quantum programming; * software security; * concurrency and parallelism; * tools and environments for programming and implementation. Topics are not limited to those 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 ========== We solicit submissions in two categories: *Regular research papers* describing original scientific research results, including tool development and case studies. 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 an appendix or a link to a web page, but reviewers are not obliged to read them. *System and Tool presentations* describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are 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 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 described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page: https://www.easychair.org/conferences/?conf=aplas2013 Acceptable formats are PostScript or PDF. 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's LNCS series. Accepted papers must be presented at the conference. (While the general chair and the program chair cannot submit papers, other members of the program committee can.) ===== DATES ===== Abstract due: 10 June 2013 (Monday), 23:59 UTC Submission due: 14 June 2013 (Friday), 23:59 UTC Notification: 26 August 2013 (Monday) Final paper due: 19 September 2013 (Thursday) Conference: 9-11 December 2013 (Monday-Wednesday) ========== ORGANIZERS ========== General chair: Peter Schachte (University of Melbourne) Program chair: Chung-chieh Shan (Indiana University) Program committee: Filippo Bonchi (CNRS, ENS-Lyon, France) Yu-Fang Chen (Academia Sinica, Taiwan) Shigeru Chiba (The University of Tokyo, Japan) Jacques Garrigue (Nagoya University, Japan) Robert Gl?ck (University of Copenhagen, Denmark) R. Govindarajan (Indian Institute of Science, India) Kazuhiro Inaba (Google, Inc., Japan) Jie-Hong Roland Jiang (National Taiwan University, Taiwan) Shin-ya Katsumata (Kyoto University, Japan) Gabriele Keller (University of New South Wales, Australia) Ana Milanova (Rensselaer Polytechnic Institute, USA) Keisuke Nakano (The University of Electro-Communications, Japan) Hakjoo Oh (Seoul National University, Korea) Bruno C. d. S. Oliveira (National University of Singapore, Singapore) Kaushik Rajan (Microsoft Research, India) Max Sch?fer (Nanyang Technological University, Singapore) Ulrich Sch?pp (Ludwig-Maximilians-Universit?t M?nchen, Germany) Paula Severi (University of Leicester, UK) Gang Tan (Lehigh University, USA) Hiroshi Unno (University of Tsukuba, Japan) Meng Wang (Chalmers University of Technology, Sweden) Jingling Xue (University of New South Wales, Australia) Mingsheng Ying (University of Technology, Sydney, Australia) Kenny Q. Zhu (Shanghai Jiao Tong University, China) ======= CONTACT ======= http://aplas2013.soic.indiana.edu/ aplas2013 at easychair.org From jay.mccarthy at gmail.com Wed Apr 3 09:51:43 2013 From: jay.mccarthy at gmail.com (Jay McCarthy) Date: Wed, 3 Apr 2013 07:51:43 -0600 Subject: [TYPES/announce] Final CfP (extension): Trends in Functional Programming 2013 Message-ID: FINAL CALL FOR PAPERS (DEADLINE EXTENSION) 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ [The deadline has been extended two weeks from April 2nd to April 16th.] The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 16th, 2013 (extended) Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: Tuesday, May 14th, 2013 Camera ready for draft proceeding: Tuesday, May 7th, 2013 (extended) The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. http://ce.byu.edu/cw/tfp/ TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Steering Committee Secretary: Marco T. Moraz?n, Seton Hall University, New Jersey, U.S.A. Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universit?t Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Schrijvers from Ghent University Vikt?ria Zs?k from E?tv?s Lor?nd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://ce.byu.edu/cw/tfp/ -- Jay McCarthy Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93 From j.endrullis at vu.nl Wed Apr 3 15:31:23 2013 From: j.endrullis at vu.nl (Joerg Endrullis) Date: Wed, 3 Apr 2013 21:31:23 +0200 Subject: [TYPES/announce] Call for Papers :: WIR 2013 :: Workshop on Infinitary Rewriting Message-ID: <718A85EC-1D5C-462A-BC72-47779F4012F1@vu.nl> ---------------------------------------------------------------------- 1st Workshop on Infinitary Rewriting Affiliated with RTA 2013 June 28, Eindhoven, The Netherlands http://infinity.few.vu.nl/wir.html ---------------------------------------------------------------------- TOPICS The Workshop on Infinitary Rewriting is venue for presentation and discussion of all topics around infinitary rewriting. We particularly welcome contributions on the following topics: * infinitary term rewriting * infinitary lambda calculus * infinitary equational reasoning * graph rewriting * applications of rewriting to infinite objects like streams * well-definedness and productivity of definitions of infinite objects * connection of infinitary rewriting to other paradigms * functional programming on infinite data SUBMISSIONS Submissions are short papers/extended abstract which should not exceed 5 pages. There will be no formal reviewing. Papers should be submitted electronically via the submission page: https://www.easychair.org/conferences/?conf=wir2013 Final versions should be created using LaTeX and the style file easychair.cls (http://www.easychair.org/coolnews.cgi). IMPORTANT DATES Paper submission: April 15, 2013 Notification: May 10, 2013 Final version: June 3, 2013 Workshop date: June 28, 2013 INVITED SPEAKER The keynote will be given by Jan Willem Klop (joint invited speaker with the International Workshop on Confluence). PROGRAM COMMITTEE Patrick Bahr J?rg Endrullis (chair) Hans Zantema -------------- next part -------------- An HTML attachment was scrubbed... URL: From hongseok00 at gmail.com Thu Apr 4 06:00:12 2013 From: hongseok00 at gmail.com (Hongseok Yang) Date: Thu, 4 Apr 2013 11:00:12 +0100 Subject: [TYPES/announce] Call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13) Message-ID: ---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2013 AT mpi-sws.org. Deadline for talk proposals: June 14, 2013 (Friday) Notification of acceptance: July 28, 2013 (Sunday) Workshop: September 28, 2013 (Saturday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2013 --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter M?ller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale) -------------- next part -------------- An HTML attachment was scrubbed... URL: From hirokawa at jaist.ac.jp Fri Apr 5 04:40:37 2013 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Fri, 5 Apr 2013 17:40:37 +0900 Subject: [TYPES/announce] IWC 2013 & CoCo 2013: Call for Participation and Provers Message-ID: <20130405174037.4655360e6430556c73270266@jaist.ac.jp> This is a joint call for papers and provers for IWC 2013 and CoCo 2013. The confluence competition (CoCo) will run on StarExec during IWC 2013. ====================================================================== Third Call for Papers IWC 2013 2nd International Workshop on Confluence 28 June 2013, Eindhoven, The Netherlands collocated with RDP 2013 http://www.jaist.ac.jp/~hirokawa/iwc2013/ ====================================================================== Recently there is a renewed interest in confluence research, resulting in new techniques, tool support as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013). During the workshop the 2nd Confluence Competition (CoCo 2013) takes place. IMPORTANT DATES: * submission April 15, 2013 * notification May 10, 2013 * final version June 3, 2013 * workshop June 28, 2013 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Patrick Dehornoy University of Caen * Jan Willem Klop Vrije Universiteit (joint invited speaker for IWC 2013 and WIR 2013) PROGRAM COMMITTEE: * Guillem Godoy Technical University of Catalonia * Nao Hirokawa JAIST (co-chair) * Barbara Koenig Universitaet Duisburg-Essen * Vincent van Oostrom Utrecht University (co-chair) * Michio Oyamaguchi Nagoya University * Harald Zankl University of Innsbruck * Hans Zantema Eindhoven University of Technology SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2013 ====================================================================== Second Call for Provers CoCo 2013 2nd Confluence Competition http://coco.nue.riec.tohoku.ac.jp/2013/ ====================================================================== Recently, several new implementations of confluence tools are reported and interest for proving/disproving confluence "automatically" has been grown. The confluence competition aims to foster the development of techniques for proving/disproving confluence automatically by a dedicated competition among such tools. The 2nd Confluence Competition (CoCo 2013) will run ***live*** during the 2nd International Workshop on Confluence (IWC 2013), which is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013) in Eindhoven, The Netherlands. In this competition categories for * first-order term rewrite systems * certification will be run. The problems considered for CoCo 2013 are selected from Cops, a collection of confluence problems. Problems submitted after the problem selection deadline will not be considered for the competition. IMPORTANT DATES: * requests for new categories March 1, 2013 (passed) * announcement of execution platform April 1, 2013 (passed) * tool registration June 10, 2013 * tool submission June 20, 2013 * problem selection June 25, 2013 * competition June 28, 2013 EXECUTION PLATFORM: CoCo 2013 will run on StarExec (http://starexec.org) a high-end cross-community competition platform. Tool submission is via this platform. REGISTRATION: Registration will be via the email address: coco-sc [AT] jaist.ac.jp Every tool registration should also contain a one page system description highlighting the distinctive features of the prover. For more information including competition rules and confluence problems, see http://coco.nue.riec.tohoku.ac.jp/ ORGANISING COMMITTEE: * Takahito Aoto Tohoku University * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck (chair) From Assia.Mahboubi at inria.fr Fri Apr 5 15:20:36 2013 From: Assia.Mahboubi at inria.fr (Assia Mahboubi) Date: Fri, 05 Apr 2013 21:20:36 +0200 Subject: [TYPES/announce] The 5th Coq Workshop: last call! Message-ID: <515F2404.6050207@inria.fr> ================================================================================ The Fifth Coq Workshop (2013) http://coq.inria.fr/coq-workshop/2013 Colocated with the 4th International Conference on Interactive Theorem Proving (ITP 2013), Rennes, France ================================================================================ The Coq Workshop series brings together Coq users, developers, and contributors. While conferences like ITP provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, likely supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Relevant subject matter includes but is not limited to: * Language or tactic features * Theory and implementation of the Calculus of Inductive Constructions * Applications and experience in education and industry * Tools and platforms built on Coq * Plugins and libraries for Coq * Interfacing with Coq * Formalization tricks and Coq pearls Authors should submit short proposals through EasyChair. Submissions should be in portable document format (PDF). Proposals should not exceed 2 pages in length in single-column full-page style. Venue: ITP, Rennes. Important Dates: * April 7: Deadline for proposal submission * April 28: Acceptance notification * July 22: Workshop in Rennes Submission URL: https://www.easychair.org/conferences/?conf=coq5 Program committee: * Pierre Letouzey, Universit? Paris 7, France * Marco Maggesi, Universit? degli Studi di Firenze, Italy * Assia Mahboubi (co-chair), INRIA, France * David Pichardie, INRIA, France * Benjamin Pierce, University of Pennsylvania, USA * Randy Pollack, University of Edinburgh, UK * Enrico Tassi (co-chair), INRIA, France * Viktor Vafeiadis, MPI-SWS, Germany Invited speaker: Guillaume Melquiond (Inria) Contact: Assia Mahboubi (assia.mahboubi at inria.fr), Enrico Tassi (enrico.tassi at inria.fr) From sweirich at cis.upenn.edu Fri Apr 5 15:57:36 2013 From: sweirich at cis.upenn.edu (Stephanie Weirich) Date: Fri, 5 Apr 2013 15:57:36 -0400 Subject: [TYPES/announce] DTP 2013 Call for Papers Message-ID: <341CBFEF-9A46-417F-BF25-A10FE1A29E45@cis.upenn.edu> ======================================================================== DTP 2013 ACM SIGPLAN Workshop on Dependently-Typed Programming SEPTEMBER 2013 Boston, Massachusetts, USA (co-located with ICFP 2013) CALL FOR PAPERS http://www.seas.upenn.edu/~sweirich/dtp13 ======================================================================== The ACM SIGPLAN Workshop on Dependently-Typed Programming 2013 will be co-located with the [2013 International Conference on Functional Programming (ICFP), in Boston, Massachusetts, USA](http://icfpconference.org/icfp2013/). The purpose of DTP is to discuss experiences with dependent types in programming and future developments for dependently-typed languages. Recent years have seen increasing overlap between the dependent type theory and functional programming languages communities. Co-locating this workshop with ICFP will promote that cross fertilization. Topics of interest include, but are not limited to: * Language Design, both in the context of possible extensions and modifications of existing languages and the development of new languages with dependent types; * Theory, such as formal treatments of semantics and type systems; * Compilation, including implementations and optimization of dependently-typed languages; * Tools, in the form of IDEs, profilers, tracers, debuggers, and testing tools; * Functional Pearls, being elegant, instructive examples of using dependent types; * Experience Reports, general practice and experience with dependently-typed languages, e.g., in an education or industry context. Workshop Format --------------- The workshop program will be composed of regular papers (formally reviewed and published by ACM, see below) and informal presentations. A separate call for informal presentations will be issued during Summer 2013. Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work. Functional Pearls and Experience reports 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. The key criterion for such a paper is that it makes a contribution from which other programmers can benefit. It is not enough simply to describe a (dependently-typed) program! Proceedings ----------- Regular papers will appear in a formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Authors must abide by the [ACM policy](http://www.acm.org/news/featured/author-rights-management) for rights and permissions. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they always retain copyright of auxiliary material. Submission Details ------------------ * Paper Submission : Thursday, 14th June 2013 anywhere on Earth * Author Notification: Thursday, 11th July 2013 * Final Papers Due : Thursday, 25th July 2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (9pt format, more details appear on the symposium web page). The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Each paper submission must adhere to SIGPLAN's republication policy, as explained on the web. "Functional Pearls", and "Experience Reports" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Submission is via [EasyChair](https://www.easychair.org/conferences/?conf=dtp2013). Program Committee ----------------- * Thorsten Altenkirch, University of Nottingham * Edwin Brady, University of St. Andrews * Nils Anders Danielsson, University of Gothenburg * Ranjit Jhala, UC San Diego * Conor McBride, University of Strathclyde * Brigitte Pientka, McGill University * Tim Sheard, Portland State University * Matthieu Sozeau, INRIA Paris * Aaron Stump, University of Iowa * Nikhil Swamy, Microsoft Research * Stephanie Weirich, University of Pennsylvania (chair) History ------- This workshop follows a series of workshops on dependently-typed programming. Past meetings include [DTP 2011 in Nijmegen](http://www.cs.ru.nl/dtp11/), [DTP 2010 in Edinburgh](http://sneezy.cs.nott.ac.uk/darcs/dtp10/), and [DTP 2008 in Nottingham](http://sneezy.cs.nott.ac.uk/darcs/DTP08/), as well as seminars organized in 2011 at [Shonan Village, Japan](http://www.nii.ac.jp/shonan/seminar007/) and in 2005 at [Dagstuhl, Germany](http://drops.dagstuhl.de/opus/volltexte/2005/186/). This is the first time that DTP has co-located with ICFP and has been sponsored by SIGPLAN. From shankar at csl.sri.com Sat Apr 6 22:42:31 2013 From: shankar at csl.sri.com (Natarajan Shankar) Date: Sat, 06 Apr 2013 19:42:31 -0700 Subject: [TYPES/announce] Verified Software Competition Message-ID: <5160DD17.801@csl.sri.com> VSTTE Competition 2013 20-22 April 2013 Organizers: Joseph Kiniry, Hannes Mehnert, Dan Zimmerman This edition of the VSTTE programming contest is an experiment of a different kind, as it is more about software engineering than programming. It is not a contest to see who can write and verify small problems as quickly as possible, but instead how can a team create a quality piece of code, using any tools and techniques (not just verification), in a short period of time. Quality software is about more than just verified data types and algorithms at the source code level. Unlike previous competitions [1], this year's VSComp will focus on a rigorously engineered software system. Contestants will be evaluated for all of the software engineering artifacts that they produce, not just for verifying their implementations. Consequently, teams that competed in previous competitions are encouraged to recruit new team members whose skills complement those of the existing team members. For example, perhaps the current team is great at low-level design and verification, but is weak in writing requirements or in rigorous validation/testing. The aims of the competition are: - to bring together those interested in rigorous software engineering and formal verification, and to provide an engaging, hands-on, and fun opportunity for competition and mutual-learning, - to evaluate the usability of a variety of software engineering tools, not the least of which are logic-based program verification tools, in a controlled experiment that could be easily repeated by others. The contest takes place over a two-day period. The system that contestants must develop is secret until the moment the contest starts. The system will be decomposed for the contestants into an architecture, whose constituent pieces are the sub-problems of the contest. Thus, by solving all sub-problems, one writes the entire application. What's more, the architecture is specified in such a way that independent solutions to sub-problems submitted by competing teams should compose into the final system. The kinds of software engineering concepts mentioned in the contest include: requirements, domain analysis, design, architecture, formal specifications, implementation, validation, verification, and traceablity. A well-prepared team will have a methodology prepared for each of these facets. The submission of a solution for a sub-problem need not include any of these facets in particular---i.e., running, verified code is neither necessary nor sufficient to win the contest. There are no restrictions on concepts, tools, and technologies used. Teams whose focus in on "early" (i.e., requirements or domain analysis) or "late" (validation/testing or evolution) phases of the software engineering process are very welcome. There is no limit on team size, but the results will be normalized by team size. We particularly encourage participation of: - student teams (this includes PhD students), - non-developer teams using a tool someone else developed, and - several teams using the same tool A panel of judges will evaluate contest entries to score sub-problems and determine the winner. Solutions will be judged for correctness, completeness and elegance. All submitted artifacts will be made public immediately after the contest ends so that contestants can comment upon each other's submissions. We expect that a paper will be co-authored by all interested contestants about the contest's results, as in several previous contests. The contest begins at 9:00 GMT on Sat 20 April and ends at 9:00 GMT on Mon 22 April. Prizes will be awarded in the following categories: - best team - best student team - tool used most effectively by the most teams Questions or comments about the contest should be sent to Joe Kiniry (kiniry at acm.org). --- [1] Past VSComp Competitions Summary The first edition of the competition was a half-day live contest that took place at VSTTE in August 2010 and was organized by Shankar and Peter Mueller. Small teams focused on simple algorithms specified via natural language and pseudo-code. The algorithms were sum & max, inverting an injection, searching a linked list, the N-Queens problem, and an amortized queue. http://www.macs.hw.ac.uk/vstte10/Competition.html The 2011 competition was organized by Marieke Huisman, Vladimir Klebanov, and Rosemary Monaghan. It was a live competition that took place over a half day in October 2011 at FoVeOSS 2011. Small teams focused on simple algorithms specified using Java code. The algorithms were max of an array, max of a tree, finding two duplets in an array, and deciding on the cyclicity of a list. http://foveoos2011.cost-ic0701.org/verification-competition The 2012 VSTTE competition was organized by Jean-Christophe Filliatre, Andrei Paskevich, and Aaron Stump and was an online competition that took place over a 48 hour period in November 2011. It focused on somewhat more advanced algorithms than earlier competitions including two-way sort, an S & K combinator interpreter, a queue implemented with a ring buffer, tree reconstruction, and breadth-first search. https://sites.google.com/site/vstte2012/compet The VerifyThis competition was a two day affair that took place at FM 2012. It was organized by Marieke, Vladimir, and Rosemary. Teams of up to two people focused on three problems: longest common prefix of two arrays, prefix sum of an array, and iterative deletion in a binary search tree. http://fm2012.verifythis.org/ From grlmc at urv.cat Sun Apr 7 06:40:16 2013 From: grlmc at urv.cat (GRLMC) Date: Sun, 7 Apr 2013 12:40:16 +0200 Subject: [TYPES/announce] SSTiC 2013: 3rd registration deadline 26 April Message-ID: *To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject* ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* +++ 3rd registration deadline: April 26 +++ AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of 74 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: 8 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montr?al) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy John M. Carroll (Penn State) [introductory] Usability Engineering and Scenario-based Design Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social Context Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Mark Guzdial (Georgia Tech) [introductory] Computing Education Research: What We Know about Learning and Teaching Computer Science Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Syed Ali Jafar (Irvine) [intermediate] Interference Alignment Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montr?al) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Nadia Magnenat-Thalmann (Nanyang Tech) [introductory] Modelling and Animating Virtual Humans Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to Cyber-physical Systems Daniel Moss? (Pittsburgh) [intermediate] Asymmetric Multicore Management Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation Cathleen A. Norris (North Texas) & Elliot Soloway (Ann Arbor) [introductory] Primary & Secondary Educational Computing in the Age of Mobilism Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Parallel Programming with Abstractions Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Jian Pei (Simon Fraser) [intermediate/advanced] Mining Uncertain and Probabilistic Data Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure Symmetric Encryption Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Micha Sharir (Tel Aviv) [introductory/intermediate] Geometric Arrangements and Incidences: Algorithms, Combinatorics, and Algebra Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer Security Daniel Thalmann (Nanyang Tech) [intermediate] Simulation of Individuals, Groups and Crowds and Their Interaction with the User Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users in Social Computing Systems Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Ian H. Witten (Waikato) [introductory] Data Mining Using Weka Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft Computing Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data Justin Zobel (Melbourne) [introductory/intermediate] Writing and Research Skills for Computer Scientists REGISTRATION: It has to be done at http://grammars.grlmc.com/SSTiC2013/Registration.php Since a large number of attendees are expected and the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu at urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputaci? de Tarragona Universitat Rovira i Virgili From birkedal at cs.au.dk Mon Apr 8 05:45:20 2013 From: birkedal at cs.au.dk (Lars Birkedal) Date: Mon, 8 Apr 2013 09:45:20 +0000 Subject: [TYPES/announce] Associate Professors in Computer Science at Aarhus University Message-ID: <3BC57D3F-C515-437E-BB36-B43E876703A6@cs.au.dk> Please circulate the announcement below for tenured faculty positions here in Aarhus. Best wishes, Lars Birkedal (cs.au.dk/~birke) Professor, Head of Logic and Semantics Group Associate Professors in Computer Science at Aarhus University One or more positions as associate professor are available at the Department of Computer Science, Aarhus University (www.cs.au.dk) starting January 1, 2014. The department has research groups within ?Algorithms and Data Structures?, ?Data-Intensive Systems?, ?Cryptography and Security?, ?Mathematical Computer Science?, ?Logics and Semantics?, ?Ubiquitous Computing and Interaction?, ?Computer-Mediated Activity?, ?Use, Design and Innovation?, ?Programming Languages?, ?Computer Graphics and Image Processing? and ?Bioinformatics?. In addition, we want to build competences within ?Software Engineering / Multicore/ Systems?, ?Machine Learning / Data Mining? and ?Quantum Informatics?. Applicants are expected to have several years of experience at the assistant professor level. They must document a strong record of original research and have teaching experience at undergraduate/graduate level. The department has a staff of 140 people including 28 full and associate professors, 5 assistant professors, 25 PostDocs and 65 PhD students. The number of students is approximately 1,000. Further information can be obtained from head of department Kurt Jensen (kjensen at cs.au.dk) or vice head of research Mogens Nielsen (mn at cs.au.dk). Please apply online at http://www.au.dk/en/job/nat/academicpositions/ before August 15, 2013. -------------- next part -------------- An HTML attachment was scrubbed... URL: From matthew.hague at rhul.ac.uk Mon Apr 8 08:35:43 2013 From: matthew.hague at rhul.ac.uk (Matthew Hague) Date: Mon, 8 Apr 2013 13:35:43 +0100 Subject: [TYPES/announce] Announcement of HOPA: A Workshop on Higher-Order Program Analysis Message-ID: <20130408123543.GC29139@chilon.net> Please find below the call for submissions for HOPA, a workshop on higher-order program analysis. Best regards, Matthew Hague HOPA Workshop on Higher-Order Program Analysis Tulane University, New Orleans, USA 28th-29th June, hosted by LiCS 2013 http://hopa.cs.rhul.ac.uk Call for Submissions The HOPA workshop aims to bring together the various growing communities involved in the analysis of higher-order programs. The focus of the workshop is both on tools and techniques for practical analysis, and on the dissemination of new theoretical results. Important Dates Submission deadline: 10th May, 2013. Notification: 15th May, 2013. Main event: 28th (afternoon) -- 29th (morning) June, 2013. Invited Speakers Suresh Jagannathan, Purdue University, USA Neil Jones, University of Copenhagen, Denmark Scope Submissions are encouraged in the form of tool presentations, exposition of best results, and topic tutorials or surveys. The emphasis is on building bridges between communities. Areas include but are by no means limited to the theory and practice of k-CFA, CFA2 and its variants, Higher-order and collapsible pushdown systems Higher-order recursion schemes, Liquid types, Refinement types, Static analysis of higher-order programs, Symbolic execution of higher-order programs, and Verification of higher-order programs. Publication There will be no formal proceedings of the workshop. Work presented may be submitted elsewhere for formal publication, or, indeed, may have already been formally published. Abstracts will be made available online via this website and ArXiv.org. We encourage participants with analysis tools to make these tools available on our website. This can be done either by providing us with source tarballs or zip files, or by providing us with links to the tool homepage as part of the submission. Submission Submissions may range from 1 page abstracts through to 15 page tutorials or surveys in the llncs format. Please indicate on your submission how long you would like to talk for. This may range from 10 minutes for cool new ideas, or 45-60 minutes for full tutorials or surveys. Submission will be via easychair, via the following link: https://www.easychair.org/conferences/?conf=hopa2013 . Program and Organising Committee Christopher Broadbent, University of Tokyo, Japan Arnaud Carayol, LIGM, Marne-la-Vallée, France Matthew Hague, Royal Holloway University of London, UK Ranjit Jhala, University of California, USA Naoki Kobayashi, University of Tokyo, Japan Matthew Might, University of Utah, USA Luke Ong, University of Oxford, UK Hiroshi Unno, University of Tsukuba, Japan David Van Horn, Northeastern University, USA Contact Details All enquires can be directed at: matthew.hague at rhul.ac.uk From philipp.haller at a3.epfl.ch Mon Apr 8 08:44:44 2013 From: philipp.haller at a3.epfl.ch (Philipp Haller) Date: Mon, 8 Apr 2013 13:44:44 +0100 Subject: [TYPES/announce] Scala 2013 - Second Call for Papers Message-ID: ======================================================================== "Scala 2013" the Fourth Annual Scala Workshop co-located with ECOOP 2013 Montpellier, France July 2nd, 2013 SECOND CALL FOR PAPERS http://lamp.epfl.ch/~hmiller/scala2013 ======================================================================== Abstract Submission: April 12, 2013 Paper Submission : April 19, 2013 Author Notification: May 17, 2013 Final Papers Due : June 1, 2013 (to be confirmed) Early Registration : May 31, 2013 ======================================================================== We're happy to announce that, thanks to our sponsors, a limited number of accepted student talks will be awarded full ECOOP conference registrations! ======================================================================== 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. We seek papers on topics related to Scala, including (but not limited to): - Language design and implementation ? language extensions, optimization, and performance evaluation. - Library design and implementation patterns for extending Scala ? embedded domain-specific languages, combining language features, generic and meta-programming. - 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. - Concurrent and distributed programming ? libraries, frameworks, language extensions, programming paradigms: (Actors, STM, ...), performance evaluation, experimental results. - Safety and reliability ? pluggable type systems, contracts, static analysis and verification, runtime monitoring. - Tools ? development environments, debuggers, refactoring tools, testing frameworks. - Case studies, experience reports, and pearls. 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. In general, papers should explain their original contributions, identifying what has been accomplished, explaining why it is significant, and relating it to previous work (also for other languages where appropriate). Papers in the last category of the list above need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, new Scala idioms, or programming pearls. In all cases, such a paper must make a contribution which is of interest to the Scala community, or from which other members of the Scala community can benefit. Publications at the Scala Workshop represent works-in-progress and are not intended to preclude later publication at any of the main conferences. Though, follow-up submissions do need to conform to the publication policies of the targeted conference, which typically equates to significant extension or refinement of the workshop publication. KEYWORDS: Library Design and Implementation, Language Design and Implementation, Applications, Formal Techniques, Parallelism and Concurrency, Distributed Programming, Tools, Experience Reports, Empirical Studies ## Student Talks ## In addition to regular papers and tool demos, we also solicit short student talks by PhD students. A student talk is not accompanied by a paper (it is sufficient to submit a short abstract of the talk in plain text). Student talks are about 5 minutes long, presenting ongoing or completed research related to Scala, or announcing a project that would be of interest to the Scala community. ## Proceedings ## It is planned to publish accepted papers in the ACM Digital Library, unless the authors choose not to. In case of publication in the ACM Digital Library, authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (see ACM Copyright Policy. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. ## Submission Details ## * Abstract Submission: April 12, 2013 * Paper Submission : April 19, 2013 * Author Notification: May 17, 2013 * Final Papers Due : June 1, 2013 (to be confirmed) * Early Registration : May 31, 2013 Submitted papers should be in portable document format (PDF), formatted using the standard ACM SIGPLAN two-column conference style (10pt format). Regular research papers must not exceed 10 pages, tool demonstration papers and short papers must not exceed 4 pages. "Tool Demos" and "Short Papers" should be marked as such with those words in the title at time of submission. Student talks are not accompanied by papers. Therefore, it is sufficient to only submit a plain-text abstract. "Student Talks" should be marked as such with those words in the title at time of submission. Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scala2013 ## Program Committee ## * Marius Eriksen, Twitter * Viktor Kuncak, EPFL * Mira Mezini, TU Darmstadt * Matt Might, University of Utah * Nate Nystrom, University of Lugano * Bruno Oliveira, National University of Singapore * Kunle Olukotun, Stanford University * Aleksandar Prokopec, EPFL * David Van Horn, Northeastern University * Tobias Wrigstad, Uppsala University ## Organizing Committee ## * Philipp Haller (Chair), Typesafe * Martin Odersky, EPFL * Doug Lea, SUNY Oswego * Heather Miller (Co-Chair), EPFL * Vojin Jovanovic, EPFL ## Links ## * The Scala Workshop 2013 web site: http://lamp.epfl.ch/~hmiller/scala2013 * The ECOOP/ECSA/ECMFA 2013 web site: http://www.lirmm.fr/ec-montpellier-2013 -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.k.f.holzenspies at utwente.nl Mon Apr 8 11:03:05 2013 From: p.k.f.holzenspies at utwente.nl (p.k.f.holzenspies at utwente.nl) Date: Mon, 8 Apr 2013 15:03:05 +0000 Subject: [TYPES/announce] Third CfP for the International Workshop on Trends in Functional Programming In Education (TFPIE) Message-ID: L.S., Apologies for any duplicates you may receive. EasyChair now open! [3] Please find below the Third Call for Papers for the Second International Workshop on Trends in Functional Programming In Education (TFPIE). As an addendum to previous CfPs for this event, I would like you to consider the following: May FP researchers also teach FP or use an FP language to teach something else. Even though many of these teachers are very enthusiastic about what they do, they typically don't consider it something to write up. I believe that having a serious forum specifically for the education of or with FP will help promote the use of FP as a teaching tool and will benefit the field of computer science as a whole. Previous CfPs for the event were sent out in PDF form. Many mailing-lists reject this. Therefore, below, is the plain textual form of the CfP. For more information, refer to the website [1]. For inspiration, see last year's proceedings (like this year, published in the Electronic Proceedings in Theoretical Computer Science) [2]. Submissions are welcome via EasyChair [3]. Please forward this CfP to whatever forum you consider appropriate. Regards, Philip K.F. H?lzenspies Programme Committee Chair TFPIE 2013 [1]?http://wwwhome.ewi.utwente.nl/~holzenspiespkf/TFPIE2013.html [2] http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?TFPIE2012 [3] https://www.easychair.org/conferences/?conf=tfpie2013 Third Call for Papers the Second International Workshop on Trends in Functional Programming in Education TFPIE ----- The second International Workshop on Trends in Functional Programming in Education, TFPIE 2013, is co-located with Trends in Functional Programming (TFP 2013) at Brigham Young University in Utah. The goal of TFPIE is to gather researchers, teachers and all professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue were novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2013 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or an article (up to 16 pages) in EPTCS style. The authors of all accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Any visitors to the TFPIE 2013 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, the presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science journal (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TFPIE 2013 welcomes submissions describing practical techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - Teaching FP to highschool, beginning CS, and graduate students - FP as a teaching tool for other (CS) topics - FP and Robotics, Music and Philosophy - Advanced FP for undergraduates - Engaging students in research using FP - FP in Programming Languages - FP as a stepping stone to other CS topics Important dates & Submission ---------------------------- Submission for presentation: Apr 20 Notification of acceptance: Apr 25 Submission formal paper: Jun 9 Notification of acceptance: Aug 16 Camera-ready version: Sep 8 Submission (pre-conference) through EasyChair: https://www.easychair.org/conferences/?conf=tfpie2013 Submission and review for publication occur after the meeting in Utah. This allows authors to revise their articles, to include comments received at the meeting. After submission, we aim to provide four reviews per paper. Contact ------- You can direct any questions you might have to the program chair, through tfpie2013 at easychair.org. Discussion, both of the workshop itself and of the work presented there, is hosted on the TFPIE-wiki. Venue ----- Brigham Young University (BYU) is the third-largest private university and the largest explicitly religious university in the United States of America. Although BYU is owned and operated by the LDS church, the workshop is independent of this affiliation. By BYU's own pen: "Brigham Young University seeks to develop students of faith, intellect and character who have the skills and the desire to continue learning and to serve others throughout their lives. Established in 1875, the university provides an outstanding education in an atmosphere consistent with the ideals and principles of its sponsor, The Church of Jesus Christ of Latter-day Saints. Known for its academically minded and internationally experienced student body, its world-class teaching and its beautiful mountain location, BYU is also recognized for its extensive language programs, talented performing arts ensembles, outstanding sports programs and devotion to combining solid scholarship with the principles of the restored gospel of Jesus Christ." It should be noted that BYU's "Honor Code" applies only to students & staff. It does *not* apply to visitors. Programme Committee ------------------- Peter Achten (General co-chair), Radboud Universiteit Nijmegen, The Netherlands Edwin Brady, University of St. Andrews, Scotland Marc Feeley, Universit? de Montr?al, Canada Matthew Flatt, University of Utah, USA Philip K.F. H?lzenspies (PC chair), Universiteit Twente, The Netherlands Gabriele Keller, University of New South Wales, Australia Jan Kuper, Universiteit Twente, The Netherlands Marco T. Moraz?n (General co-chair), Seton Hall University, USA Stephanie Weirich, University of Pennsylvania, USA Vikt?ria Zs?k, E?tv?s Lor?nd Tudom?nyegyetem, Hungary See the website for updated information: http://wwwhome.ewi.utwente.nl/~holzenspiespkf/TFPIE2013.html From jv at informatik.uni-bonn.de Mon Apr 8 14:24:16 2013 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Mon, 08 Apr 2013 20:24:16 +0200 Subject: [TYPES/announce] CfP: Workshop Haskell and Rewriting Techniques HART 2013 Message-ID: <51630B50.6010400@informatik.uni-bonn.de> Haskell is an advanced purely-functional programming language. Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations. There are strong connections between Haskell programming and rewriting. Therefore, we announce a new workshop, International Workshop on Haskell And Rewriting Techniques (HART 2013) http://www.imn.htwk-leipzig.de/HART2013/ to be held on June 27, in conjunction with RDP 2013, in Eindhoven. (RDP contains RTA, the main rewriting conference.) We plan a half day of discussions, in an informal setting, on how Haskell and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example, equational reasoning and other rewriting techniques for program verification and analysis; lambda calculi and type systems for functional programs and higher order rewriting systems; rewriting of type expressions in the type checker; rewriting of programs by refactoring tools, optimizers, code generators; execution of programs as a form of graph rewriting; template Haskell, introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. When in doubt, contact a member of the PC. Program committee: Alcino Cunha (U Minho) J?rgen Giesl (RWTH Aachen) Andy Gill (U of Kansas) Johan Jeuring (U Utrecht) Keisuke Nakano (UEC Tokyo) Kristoffer H Rose (IBM Watson) (co-chair) Christian Sternagel (JAIST) Janis Voigtl?nder (U Bonn) Johannes Waldmann (HTWK Leipzig) (co-chair) Dates: May 6: deadline for submissions May 20: notification of acceptance June 27: workshop Submission and Proceedings: Two categories of submissions are invited: Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. Presentation-only papers. Describing work recently published or submitted. Will not be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is handled through the EasyChair HART2013 page, https://www.easychair.org/conferences/?conf=hart2013 In line with the informal style of the workshop, the reviewing of submissions will be light. When accepting and scheduling presentations, preference will be given to original research. Proceedings will be made available electronically at the workshop. From thomas.ehrhard at pps.univ-paris-diderot.fr Tue Apr 9 01:37:41 2013 From: thomas.ehrhard at pps.univ-paris-diderot.fr (Thomas Ehrhard) Date: Tue, 09 Apr 2013 13:37:41 +0800 Subject: [TYPES/announce] A meeting in honor of Pierre-Louis Curien Message-ID: <5163A925.7060403@pps.univ-paris-diderot.fr> A scientific meeting in honor of Pierre-Louis Curien Venice, 9th - 11th September 2013 Don Orione Artigianelli Cultural Center On the occasion of Pierre-Louis Curien's 60th birthday, we organize an informal scientific and friendly meeting. This meeting is open, but registration is required for practical reasons. All information on the meeting and on the (very simple) registration procedure are available on the following web page: http://www.pps.univ-paris-diderot.fr/PLC-meeting Thomas Ehrhard on behalf of the organizing committee From m.r.mousavi at hh.se Tue Apr 9 02:50:25 2013 From: m.r.mousavi at hh.se (M.R. Mousavi) Date: Tue, 9 Apr 2013 08:50:25 +0200 Subject: [TYPES/announce] Halmstad Summer School on Testing (June 3 - June 5) Message-ID: The Third Halmstad Summer School on Testing Halmstad University, Halmstad, Sweden June 3 - June 5, 2013 http://blog.accurate-programming.org/ Scope ======== Software testing accounts for a major part of software development cost and effort, yet the current practice of software testing is often insufficiently structured and disciplined. There have been various attempts in the past decades to bring more rigor and structure into this field, resulting in several industrial-strength processes, techniques and tools for different levels of testing. The 3rd Halmstad Summer School on Testing provides an overview of the state of the art in testing, including theory, industrial cases, tools and hands-on tutorials by internationally-renowned researchers. Tutorials ======== Test-Driven Software Development in Java Including Concurrency (Robert Cartwright, Rice) Industrial-Strength Model-Based Testing and its Methodology (Wen-Ling Huang and Jan Peleska, Verified Systems and Bremen) Property-based testing with QuickCheck (John Hughes, QuviQ and Chalmers) Closing the V - by going from V to DEL (Tony Larsson, Halmstad) Testing and Verifying Software Properties with ACL2 and ProofPad, and Dracula (Rex Page, Oklahoma) Introduction to Model-Based Testing (Mohammad Mousavi, Halmstad) Hands on ScalaCheck (Rickard Nilsson, Lund) Accurate Programming Using ScalaCheck (Walid Taha, Halmstad) Registration ========== The registration deadline is May 1, 2013. The registration fee is 1000 SEK (approx. 120 EUR) and covers lunches and coffee breaks. To apply to the summer school, please send an email to Veronica.Gaspes at hh.se with "Halmstad Summer School on Testing" in the title. Venue ====== The summer school will be held on the campus of Halmstad University in Halmstad, Sweden. Halmstad is a popular summer destination located on the Swedish west coast. Just a few minutes by bicycle or bus takes you from campus to city centre, sandy beaches or forested Galgberget Hill. Trains take you directly to G?teborg in 75 minutes, to the Malm?-Copenhagen area in about 2 hours and to Stockholm in 4.5 hours. There are also daily flights from Halmstad Airport to Stockholm. Directions for getting to campus can be found here: http://www.hh.se/english/abouttheuniversity/visitus.307_en.html The campus map, with a link to a printable pdf version can be found here: http://hh.se/english/discover/visitus/campusmap.1252_en.html If you are flying in internationally it is generally easiest to fly into Copenhagen (CPH) airport (also known as Kastrup). The best thing about flying into CPH is that you just buy a train ticket when you arrive at the airport and simply take a train from the airport directly to Halmstad. The train leaves from the airport itself approximately once an hour on weekdays. We recommend that you check the time-table here: http://www.sj.se/start/startpage/index.form?l=en and allow one hour from touchdown to getting to the train station (just outside customs). In Halmstad, everything is either in walking distance or a short taxi ride away. Usually there are taxis at the station. If there are none there is a phone that connects directly to the local taxi company. For the eventuality that the phone is not working, it is good to have a cell phone handy. The number for the taxi company is written on the phone. Note that CPH is in Denmark (and not in Sweden). So, if you need visas for European countries, make sure you get one that works for both. If for some reason you cannot or do not want to use CPH, the next best international airport is in Gothenburg (GOT), locally known as Landvetter. The tricky thing about using that airport is that you would first have to take a 45 minute shuttle from the airport to the Gothenburg train station, and then take the train to Halmstad. That is one transfer and one wait. Accommodation ============= Here are some suggestions for the accommodation, with an indication of their price range, (obtained from booking.com) and their distance to the summer school venue: Hotel Continental (~140-160 EUR / night, 1.5km) Scandic Hallandia (~160-200 EUR / night, 2km) Hotel Amadeus (~100-120 EUR / night, 2.5km) First Hotel Martenson (~130-150 EUR / night, 2km) Quality Hotel Halmstad (~80-100 EUR / night, 3 km) STF Halmstads Hostel Kaptenshamn (~80-100 EUR / night, 2km) Organizers ======== Veronica Gaspes (Organization Chair, veronica.gaspes at hh.se) Mohammad Mousavi (Program Co-Chair, m.r.mousavi at hh.se) Eva Nestius (Local Organization) Walid Taha (Program Co-Chair, walid.taha at hh.se) The abstracts of the tutorials and the biographies of the speakers can be found at: http://blog.accurate-programming.org/ For more information, contact one of the organizers. -------------- next part -------------- An HTML attachment was scrubbed... URL: From M.Seisenberger at swansea.ac.uk Wed Apr 10 05:20:07 2013 From: M.Seisenberger at swansea.ac.uk (Seisenberger M.) Date: Wed, 10 Apr 2013 09:20:07 +0000 Subject: [TYPES/announce] CFC: CALCO Early Ideas 2013 Message-ID: <66471F753ADEEB4A975D1788A60578322A2CB414@ISS-MBX1.tawe.swan.ac.uk> ********************************************************** CALL FOR CONTRIBUTIONS: CALCO Early Ideas 2013 *********************************************************** 5th International Conference on Algebra and Coalgebra in Computer Science CALCO Early Ideas Workshop September 2, 2013 Warsaw, Poland http://coalg.org/calco13/workshops.html#ei Submission deadline for short contributions: 27 May 2013 ************************************************************ CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO Early Ideas workshop (and vice versa). The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. The list of topics of particular interest is shown on the main CALCO 2013 page: http://coalg.org/calco13/. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calcoearlyideas2013 The use of LNCS style is strongly encouraged. After the workshop, authors will have the opportunity to submit a full 10-15 page paper on the same topic. The reviewing will be carried out by the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of selected papers will be made available in the arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. http://coalg.org/calco13/workshops.html#ei There will be a number of student grants available for the CALCO conference - details shortly to be announced on the webpage. -- CALCO Early Ideas Dates -- 2-page short contribution submission: May 27, 2013 Notification for short contribution: June 24, 2013 Final short contribution due: July 15, 2013 CALCO Early Ideas Workshop: September 2, 2013 10-15 page paper submission: October 15, 2013 Notification for paper: December 15, 2013 Final paper version due: January 15, 2014 -- CALCO Early Ideas Programme Committee -- Bartek Klin, University of Warsaw, Poland John Power, University of Bath, UK Narciso Marti-Oliet, UCM, Spain Till Mossakowski, DFKI, Germany Monika Seisenberger, Swansea University, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From sylvain.salvati at labri.fr Wed Apr 10 09:30:23 2013 From: sylvain.salvati at labri.fr (Salvati Sylvain) Date: Wed, 10 Apr 2013 15:30:23 +0200 Subject: [TYPES/announce] E. W. Beth Dissertation Prize: 2013 call for nominations Message-ID: <5165696F.4080402@labri.fr> E. W. Beth Dissertation Prize: 2013 call for nominations Since 2002, FoLLI (the Association for Logic, Language, and Information, http://institucional.us.es/folliweb/) 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 2012. 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, 2012 and December 31st, 2012. 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 2012 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (for dissertations defended in 2013). The present call for nominations for the E.W. Beth Disertation Award 2013 will also accept nominations of full English translations of theses originally written in another language than English and defended in 2011 or 2012. 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 format (ps/doc/rtf not accepted); 2. A ten page abstract of the dissertation in 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 (preferably as a zip file) 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: May 12, 2013. Notification of Decision: July 14, 2013. Committee : Chris Barker (New York) Wojciech Buszkowski (chair) (Poznan) Michael Kaminski (Haifa) Dale Miller (Palaiseau) Larry Moss (Bloomington) Ian Pratt-Hartmann (Manchester) Ruy de Queiroz (Recife) Giovanni Sambin (Padua) Rob van der Sandt (Nijmegen) Rineke Verbrugge (Groningen) Heinrich Wansing (Bochum) From bruno.blanchet at inria.fr Wed Apr 10 09:38:36 2013 From: bruno.blanchet at inria.fr (Bruno Blanchet) Date: Wed, 10 Apr 2013 15:38:36 +0200 (CEST) Subject: [TYPES/announce] (Extended deadline: April 17) CFP: FCS'13 Workshop on Foundations of Computer Security In-Reply-To: <196103867.2309990.1365601079165.JavaMail.root@inria.fr> Message-ID: <1292146303.2310133.1365601116179.JavaMail.root@inria.fr> EXTENDED DEADLINE: April 17 +-------------------------------------------------------------------------+ ! ! ! FCS 2013 ! ! Workshop on Foundations of Computer Security ! ! Tulane University, New Orleans, Louisiana, USA ! ! June 29, 2013 ! ! http://prosecco.inria.fr/personal/bblanche/fcs13/ ! ! ! ! Affiliated with LICS 2013 and CSF 2013 ! ! ! +-------------------------------------------------------------------------+ Important dates =============== Extended deadline: April 17, 2013 Notification of acceptance: May 15, 2013 (updated) Final papers: June 6, 2013 (updated) Invited speaker: Boris Koepf, IMDEA, Spain =============== Background, aim and scope ========================= The aim of the workshop FCS'13 is to provide a forum for continued activity in different areas of computer security, bringing computer security researchers in closer contact with the LICS community and giving LICS attendees an opportunity to talk to experts in computer security, on the one hand, and contribute to bridging the gap between logical methods and computer security foundations, on the other. 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 Foundations of verification Information flow analysis Language-based security Logic-based design Program transformation Security models Static analysis Statistical methods Tools Trust management for Access control and resource usage control Authentication Availability and denial of service Covert channels Confidentiality Integrity and privacy Intrusion detection Malicious code Mobile code Mutual distrust Privacy 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. FCS'13 welcomes two kinds of submissions - short abstracts (1 page including references) - full papers (at most 15 pages including references) Short abstracts will receive as rigorous review as do full papers. Short abstracts may receive shorter talk slots at the workshop than do full papers, depending on the number of accepted submissions. All papers should be written 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, co-ordinates 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); please, do not send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). The only mechanism for paper submissions is via the dedicated EasyChair submission web page: https://www.easychair.org/conferences/?conf=fcs2013 Please follow the instructions given there. Informal proceedings ==================== The workshop has no published proceedings. Presenting a paper at the workshop should not preclude submission to or publication in other venues. Copies of papers presented at the workshop will be made available in electronic format, but this will not constitute an official proceedings. Program committee ================= * Myrto Arapinis (University of Birmingham, UK) * Aslan Askarov (Harvard University, USA) * Bruno Blanchet (INRIA Paris-Rocquencourt, France, co-chair) * Michael Clarkson (The George Washington University, USA, co-chair) * Sara Foresti (Universita` degli Studi di Milano, Italy) * Deepak Garg (Max Planck Institute for Software Systems, Germany) * Catalin Hritcu (University of Pennsylvania, USA) * Alan Jeffrey (Alcatel-Lucent Bell Labs, USA) * Peeter Laud (Cybernetica AS, Estonia) * Gurvan Le Guernic (DGA Ma?trise de l'Information, France) * Stephen Magill (IDA Center for Computing Sciences, USA) * David Naumann (Stevens Institute of Technology, USA) * Andrei Sabelfeld (Chalmers University of Technology, Sweden) * Santiago Zanella B?guelin (Microsoft Research Cambridge, UK) From ardubois at gmail.com Wed Apr 10 11:36:39 2013 From: ardubois at gmail.com (Andre Rauber Du Bois) Date: Wed, 10 Apr 2013 12:36:39 -0300 Subject: [TYPES/announce] SBLP 2013: Final CFP, deadline for Abstracs 19/4 Message-ID: [Apologies if you receive multiple copies of this CFP] ======================================================= CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Bras?lia, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.unb.br/en/sblp-en ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): April 19th Full paper submission: April 26th, 2013 Notification of acceptance: May 31st, 2013 Final papers due: June 28th, 2013 INVITED SPEAKERS * Tim Harris, Oracle Labs * More TBA INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Bras?lia, Brazil, on September 29th to October 4th, 2013. 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 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013, http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 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. * 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 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. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer. For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system at http://www.easychair.org/conferences/?conf=sblp2013. 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 from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonif?cio, UnB Diego Aranha, UnB PROGRAMME CHAIRS Andr? Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS Andr? Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quint?o Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho Jo?o F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel Ant?nio Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.B.Levy at cs.bham.ac.uk Thu Apr 11 11:45:15 2013 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Thu, 11 Apr 2013 16:45:15 +0100 Subject: [TYPES/announce] PhD opportunities in the Computer Science theory group at Birmingham Message-ID: <93BF987E-880A-4579-A122-2A0AFA8B34E8@cs.bham.ac.uk> Dear all, We invite applications for PhD study at the University of Birmingham. We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation and programming language semantics. This often involves profound and surprising connections between different areas of computer science and mathematics. From category theory to ?-calculus and computational effects, from topology to constructive mathematics, from game semantics to program compilation, this is a diverse field of research that continues to provide new insight and underlying structure. See our webpage, with links to individual researchers, here: http://www.cs.bham.ac.uk/research/groupings/theory/ Information about PhD applications may be found here: http://www.cs.bham.ac.uk/admissions/postgraduate-research/ If you are considering applying, please contact any of us. We will be very happy to discuss the opportunities available. Best regards, The Birmingham CS theory group Martin Escardo (topology, computation with infinite objects, constructive mathematics, intuitionistic type theory) Dan Ghica (game semantics, heterogeneous computing, model checking) Achim Jung (mathematical structures in the foundations of computing: logic, topology, order) Paul Levy (denotational semantics, lambda-calculus with effects, nondeterminism, category theory, game semantics) Uday Reddy (semantics of state, separation logic) Eike Ritter (security protocol verification) Hayo Thielecke (abstract machines, concurrent and functional programming, software security) Steve Vickers (constructive mathematics and topology, category theory and toposes) -- Paul Blain Levy School of Computer Science, University of Birmingham +44 121 414 4792 http://www.cs.bham.ac.uk/~pbl From corina.s.pasareanu at nasa.gov Thu Apr 11 20:05:58 2013 From: corina.s.pasareanu at nasa.gov (Corina Pasareanu) Date: Thu, 11 Apr 2013 17:05:58 -0700 Subject: [TYPES/announce] PASTE 2013: CALL FOR PARTICIPATION Message-ID: <51674FE6.4080604@nasa.gov> ********************************************************************** PASTE 2013: CALL FOR PARTICIPATION and CALL FOR LIGHTNING TALKS 11th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering http://www.cs.williams.edu/PASTE2013/index.html June 20, 2013, Seattle, WA Co-located with PLDI'13 ********************************************************************** PASTE 2013 is the eleventh workshop in a series that brings together the program analysis, software tools, and software engineering communities to focus on applications of program analysis techniques in software tools. This year, PASTE will include technical papers, a keynote presentation, and a lightning talks session open to all attendees; see the call at the bottom of this message for more details. ------- KEYNOTE "Rebooting Type Systems with SMT" Ranjit Jhala, University of California, San Diego ------- ACCEPTED PAPERS "Automated Inference of Atomic Sets for Safe Concurrent Execution" P. Dinges, M. Charalambides, G. Agha "Automatically Mining Program Build Information via Signature Matching" C. Lu "A Comprehensive Toolchain for Workload Characterization Across JVM Languages" A. Sarimbekov, S. Kell, L. Bulej, A. Sewe, Y. Zheng, D. Ansaloni, W. Binder "Exploring Program Phases for Statistical Bug Localization" V. Modi, S. Roy, S. Aggarwal "Increasing Human-Tool Interaction via the Web" T. Ball, J. De Halleux, D. Leijen, N. Swamy "A Proper Performance Evaluation System That Summarizes Code Placement Effects" M. Yasugi, Y. Matsuda, T. Ugawa "ShadowData -- Shadowing Heap Objects in Java" M. Vitasek, W. Binder, M. Hauswirth ------- CALL FOR LIGHTNING TALKS Lightning talks can describe early research ideas or results, research perspectives or positions, and other topics of interest to the PASTE community. Tool demonstrations are also welcome. Lightning talks will be allocated 10 minute slots, which will consist of 5 minutes for presentation and 5 minutes for discussion. Researchers who would like to present a lightning talk should send the following information to paste13 at cs.williams.edu by 5pm EST, Friday, May 10, 2013: * Presenter name, affiliation, and email address * Proposed title * A short paragraph describing the talk * Please include "PASTE lightning talk submission" in the email subject Lightning talks will be accepted based on relevance to the workshop. Selected presenters will be notified via email by May 14, 2013. -- Corina Pasareanu CMU SV, NASA Ames http://ti.arc.nasa.gov/profile/pcorina From gabriel at info.uaic.ro Fri Apr 12 05:25:31 2013 From: gabriel at info.uaic.ro (Gabriel Ciobanu) Date: Fri, 12 Apr 2013 12:25:31 +0300 (EEST) Subject: [TYPES/announce] MeCBIC 2013 - The submission deadline is approaching! Message-ID: ---------------------------------------------------------------- 2nd Call for Papers MeCBIC 2013 7th Workshop on Membrane Computing and Biologically Inspired Process Calculi 7th July 2013, Riga, Latvia http://www.info.uaic.ro/~mecbic/mecbic2013/ ================================================================ *** Paper Submission: 22nd April, 2013 The 7th Workshop on Membrane Computing and Biologically Inspired Process Calculi (MeCBIC 2013) will take place in Riga on 7th July 2013 as a related event of ICALP 2013, the 40th International Colloquium on Automata, Languages and Programming. (http://www.icalp2013.lu.lv/) If your work is related to MeCBIC topics, it is now a good opportunity to submit a paper (of about 16 pages), using the web page http://www.easychair.org/conferences/?conf=mecbic2013. The modeling and the analysis of biological systems has attracted the interest of several research communities. The main aim of the workshop is to bring together researchers in concurrency theory, formal methods, and related fields that are interested to present recent results and to discuss new ideas concerning such formalisms, their properties and relationships. We welcome contributions that address both theoretical and applied contributions related to the relevance and potential of formal methods in biology. Topics of interest include (but not limited to): - Biologically inspired models and calculi (rewrite systems, process calculi, Petri nets, etc.); - Theoretical links and comparison of different biological inspired formal models; - Qualitative biological modeling; - Quantitative formal methods; - Modelling, analysis and simulation tools for biologically inspired systems. The workshop proceedings will be published in the Electronic Proceedings in Theoretical Computer Science. After the event, some papers presented at the workshop will be invited to be extended and submitted to a special issue of a visible journal. More details at http://www.info.uaic.ro/~mecbic/mecbic2013/ Program Committee ----------------- Bogdan Aman (co-chair) - Romanian Academy, Iasi, RO Roberto Barbuti - University of Pisa, Italy Luca Cardelli - Microsoft, Cambridge, UK Gabriel Ciobanu (co-chair) - Romanian Academy, Iasi, RO Erik de Vink - TU Eindhoven, NL Marian Gheorghe - Sheffield, UK Paola Giannini - University Piemonte Orientale, Italy Jean-Louis Giavitto - IRCAM CNRS, Paris, France Jane Hillston - University of Edinburgh, UK Jetty Kleijn - Leiden University, NL Maciej Koutny - Newcastle University, UK Emanuela Merelli - University of Camerino, Italy Paolo Milazzo - University of Pisa, Italy Gethin Norman - University of Glasgow, UK Anna Philippou - University of Cyprus, Cyprus Franck Pommereau - University of Evry, France Jason Steggles - Newcastle University, UK Angelo Troina - University of Torino, Italy From morawska at tcs.inf.tu-dresden.de Fri Apr 12 05:37:05 2013 From: morawska at tcs.inf.tu-dresden.de (Barbara Morawska) Date: Fri, 12 Apr 2013 11:37:05 +0200 Subject: [TYPES/announce] UNIF 2013: extended deadline Message-ID: Please notice the deadline extended to 22nd April. ------------------------------------------------------------------------ Call for Papers UNIF 2013 The 27th International Workshop on Unification http://lat.inf.tu-dresden.de/UNIF2013/ June 27th, 2013, Eindhoven, The Netherlands Satellite event of RTA-24, part of RDP 2013 UNIF 2013 is the 27th event in a series of international meetings devoted to unification theory and its applications. The aim of UNIF 2013, as that of the previous meetings, is to bring together researchers interested in unification theory and related topics, to present recent (even unfinished) work, and discuss new ideas and trends in this and related fields. A non-exhaustive list of topics of interest includes: * unification algorithms, calculi and implementations * equational unification and unification modulo theories * unification in modal, temporal and description logics * admissibility of inference rules * narrowing matching algorithms * constraint solving * combination problems * disunification * higher-order unification, * type checking and reconstruction * typed unification * complexity issues * query answering * implementation techniques * applications of unification Submission: ========== Submissions should not exceed 5 pages in LNCS style, as PDF files through the EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=unif2013 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop and also in the electronic form at the UNIF web page: http://www.pps.jussieu.fr/~treinen/unif/ Important Dates: ================ Submission: April 22 (extended) Notification: May 25 Final version: June 8 Workshop: June 27 Programme Committee: =================== # Franz Baader, TU Dresden, Germany # Benzmueller, Free University Berlin, Germany # Santiago Escobar, Universitat Politecnica de Valencia, Spain # Silvio Ghilardi, Universita di Milano, Italy # Konstantin Korovin, University of Manchester, UK # Jordi Levy, IIIA - CSIC, Spain # Christopher Lynch, Clarkson University, USA # George Metcalfe, University of Bern, Switzerland # Barbara Morawska, TU Dresden, Germany # Paliath Narendran, University at Albany, USA # Christophe Ringeissen, LORIA-INRIA, France # Vladimir Rybakov, Manchester Metropolitan University # Laurent Vigneron, LORIA-Nancy University, France For more information, please contact any of the chairs: Barbara Morawska and Konstantin Korovin. -------------- next part -------------- An HTML attachment was scrubbed... URL: From alan.schmitt at polytechnique.org Fri Apr 12 05:58:30 2013 From: alan.schmitt at polytechnique.org (Alan Schmitt) Date: Fri, 12 Apr 2013 11:58:30 +0200 Subject: [TYPES/announce] DBPL 2013 - Call for Papers Message-ID: The 14th International Symposium on Database Programming Languages http://dbpl2013.inria.fr Riva del Garda, Trento, Italy August 30, 2013 co-located with VLDB 2013 Call for Papers For over 25 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, and semistructured data, as well as fundamental ideas in types for query languages, were first announced at DBPL. Today, the emergence of new data management applications such as cloud computing and ?big data,? social network analysis, bidirectional programming, and data privacy has lead to a new flurry of creative research in this area, as well as a tremendous amount of activity in industry. DBPL is an established destination for such new ideas. Scope ----- DBPL solicits practical and theoretical papers in all topics at the intersection of databases and programming languages. Papers emphasizing new topics or emerging areas are especially welcome. Suggested, but not exclusive, topics of interest for submissions include: - Bidirectional programming languages - Data exchange and data integration - Data privacy - Data provenance - Databases and the semantic web - Databases and social networking - Databases and cloud computing - Databases in electronic commerce - Deductive databases and logic programming - Information-flow type systems - Language-integrated query mechanisms - Managing uncertain and imprecise information - Programming language support for databases - Streaming data processing - Schema mappings and metadata management - Security in data management - Semi-structured data and XML - Validation and type-checking - Web services Author Guidelines ----------------- Prospective authors are invited to submit papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 10 pages long in the [ACM SIGPLAN] format. Each submission should begin with a succinct statement of the problem and a summary of the main results. If the authors believe more details are necessary to substantiate the main claims of the paper, they may include a clearly marked appendix to be read at the discretion of the committee. At least one author of each accepted paper must attend the symposium to present their work. Papers must be submitted online at the following URL: https://www.easychair.org/conferences/?conf=dbpl13 [ACM SIGPLAN] http://www.sigplan.org/authorinformation.htm Important Dates --------------- - Submission: June 7, 2013 (midnight GMT) - Notification: July 12, 2013 - Final versions due: August 2, 2013 - Symposium: August 30, 2013 Proceedings ----------- Accepted papers will appear in a formal electronic proceedings, using the Computing Research Repository (CoRR). Program Committee ----------------- *Program Co-Chairs* Todd J. Green LogicBlox, USA Alan Schmitt Inria-Rennes, France *Program Committee* Yanif Ahmed Johns Hopkins University, USA William Cook University of Texas-Austin, USA Ezra Cooper Google, USA John Field Google, USA Torsten Grust Universit?t T?bingen, Germany Dan Olteanu University of Oxford, UK Dan Suciu University of Washington, USA Philip Wadler University of Edinburgh, UK Geoffrey Washburn LogicBlox, USA Till Westmann 28msec, USA History ------- The 14th Symposium on Data Base Programming Languages (DBPL 2013) continues the tradition of excellence initiated by its predecessors in Roscoff, Finistere (1987), Salishan, Oregon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), Kinloch Rannoch, Scotland (1999), Marino, Rome (2001), Potsdam, Germany (2003), Trondheim, Norway (2005), Vienna, Austria (2007), Lyon, France (2009), and Seattle, Washington (2011). DBPL has been affiliated with VLDB since 1999. From David.Pichardie at irisa.fr Fri Apr 12 09:27:59 2013 From: David.Pichardie at irisa.fr (David Pichardie) Date: Fri, 12 Apr 2013 09:27:59 -0400 Subject: [TYPES/announce] ITP 2013: Call for Participation Message-ID: CALL FOR PARTICIPATION ITP 2013: 4th International Conference on Interactive Theorem Proving 22-26 July 2013, Rennes, France http://itp2013.inria.fr ----- Important dates: _____________ Early registration deadline:17 June 2013 Conference: 23-26 July 2013 Affiliated workshops: 22 July 2013 ----- Registration and Hotel ____________________ Registration is open, visit: http://itp2013.inria.fr/registration.html For hotel reservation, visit: http://itp2013.inria.fr/accomodations.html ----- Conference __________ ITP brings together researchers working in all areas of interactive theorem proving. It combines the communities of two venerable meetings: the TPHOLs conference and the ACL2 workshop. 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). 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 final programme will include 26 regular paper presentations and 7 rough diamonds presentations. It will also include 3 invited talks by renown speakers from industry and academia and 2 tutorials. ITP 2013 has 2 affiliated workshops. Submission to these workshops is still open. Invited Speakers _______________ Applying formal methods in the large by Dominique Bolignano (Prove & Run, France) Automating theorem proving with SMT by Rustan Leino (Microsoft Research, USA) Certifying Voting Protocols by Carsten Sch?rmann (IT University of Copenhagen, Denmark) Invited tutorials _______________ The Mathematical Components library: principles and design choices by Assia Mahboubi and Enrico Tassi (Inria, France) Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities by Pete Manolios (Northeastern University, USA) Affiliated Workshops ___________________ The 5th Coq workshop http://coq.inria.fr/coq-workshop/2013 Workshop day: July 22 AI4FM Workshop http://www.ai4fm.org/ai4fm-2013/ Workshop day: July 22 Submission deadline: April 20 Notification to authors: May 01 From i.whiteside at sms.ed.ac.uk Fri Apr 12 10:10:41 2013 From: i.whiteside at sms.ed.ac.uk (Iain Whiteside) Date: Fri, 12 Apr 2013 15:10:41 +0100 Subject: [TYPES/announce] CfP PLMMS at CICM, July 2013, Bath, UK Message-ID: <36DA7EB0-E944-431B-B457-EE2AE2BDFFB9@sms.ed.ac.uk> (* Apologies for multiple copies *) ------------------------------------------------------------------- CALL FOR PAPERS ------------------------------------------------------------------- The 5th International Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2013) Part of CICM-2013, at University of Bath, UK 8-12th of July 2013 ------------------------------------------------------------------- Important Dates --------------- * Abstract submission: Mon May 6 2013 * Paper submission: Mon May 13 2013 * Notification of acceptance: Mon June 3 2013 * Camera ready copy due: Mon June 10 2013 Program Committee ----------------- * David Aspinall, University of Edinburgh, UK * Serge Autexier, DKFI Bremen, Germany * Jacques Carette, McMaster University, Canada * Claudio Sacerdoti Coen, University of Bologna, Italy * Gudmund Grov, Heriot Watt University, UK * Cezar Ionescu, Potsdam Institute, Germany * Ewen Maclean, University of Edinburgh, UK * Florian Rabe (co-chair), Jacobs University, Germany * Tim Sheard, Portland State University, USA * Sergei Soloviev, IRIT, France * Stephen Watt, University of Western Ontario, Canada * Makarius Wenzel, Universit? Paris-Sud, France * Iain Whiteside (co-chair), University of Newcastle, UK * Freek Wiedijk, Radboud University, Netherlands * Wolfgang Windsteiger, RISC, Austria 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 ------------------ Papers should be submitted via the PLMMS 2013 easychair website: https://www.easychair.org/conferences/?conf=plmms2013 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 2013 and present her or his paper. We wish to be flexible with paper length and will accept papers between 4 and 15 pages in length, submitted in PDF format. We invite submissions of both work-in-progress and fully polished research. All papers should be prepared in LaTeX and formatted according to the requirements of Springer's LNCS series. The corresponding style files can be downloaded from: http://www.springer.com/computer/lncs/lncs+authors Papers will be reviewed by at least three reviewers. Informal workshop proceeding will be circulated as a technical report and on CEUR-WS. Links ----- * https://www.easychair.org/conferences/?conf=plmms2013 abstract and paper submission webpage * http://www.springer.com/computer/lncs/lncs+authors submission style guide * http://www.cicm-conference.org/2013/cicm.php?event=plmms&menu=general the PLMMS 2013 web site * http://www.cicm-conference.org/2013/cicm.php the CICM 2013 conference web site -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From hirokawa at jaist.ac.jp Fri Apr 12 10:28:03 2013 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Fri, 12 Apr 2013 23:28:03 +0900 Subject: [TYPES/announce] IWC 2013: deadline extended Message-ID: <20130412232803.032c4dbac173f45592bcfc2a@jaist.ac.jp> ====================================================================== Last Call for Papers (extended deadline) IWC 2013 2nd International Workshop on Confluence 28 June 2013, Eindhoven, The Netherlands collocated with RDP 2013 http://www.jaist.ac.jp/~hirokawa/iwc2013/ ====================================================================== Recently there is a renewed interest in confluence research, resulting in new techniques, tool support as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013). During the workshop the 2nd Confluence Competition (CoCo 2013) takes place. IMPORTANT DATES: * submission April 25, 2013 (extended) * notification May 10, 2013 * final version June 3, 2013 * workshop June 28, 2013 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Patrick Dehornoy University of Caen * Jan Willem Klop Vrije Universiteit (joint invited speaker for IWC 2013 and WIR 2013) PROGRAM COMMITTEE: * Guillem Godoy Technical University of Catalonia * Nao Hirokawa JAIST (co-chair) * Barbara Koenig Universitaet Duisburg-Essen * Vincent van Oostrom Utrecht University (co-chair) * Michio Oyamaguchi Nagoya University * Harald Zankl University of Innsbruck * Hans Zantema Eindhoven University of Technology SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2013 From Jeremy.Gibbons at cs.ox.ac.uk Fri Apr 12 14:38:37 2013 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Fri, 12 Apr 2013 19:38:37 +0100 Subject: [TYPES/announce] Foundations of Health Information Engineering and Systems (FHIES 2013) - final call for papers Message-ID: <201304121838.r3CIcb8m022051@linux1.cs.ox.ac.uk> CALL FOR PAPERS Third International Symposium on Foundations of Health Information Engineering and Systems http://www.cs.ox.ac.uk/FHIES2013/ International Institute for Software Technology United Nations University, Macau 21st-23rd August, 2013 BACKGROUND ICT plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world. The use of software in medical devices has caused growing concerns in relation to safety and efficacy. The increasing adoption of health information systems provides great potential benefits but also poses severe risks, both with respect to security and privacy and in regard to patient safety. Hospital and other information systems raise important issues of workflow support and interoperability. Regulators, manufacturers and clinical users have pointed out the need to research sound and science-based engineering methods that facilitate the development and certification of quality ICT systems in health care. Such methods may draw from or combine techniques from various disciplines, including but not limited to software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. AIMS The purpose of the symposium series on Foundations of Health Information Engineering and Systems is to promote a nascent research area that aims to develop and apply theories and methods from a variety of disciplines for the purpose of modeling, building and certifying software-intensive ICT systems in healthcare. A particular objective of FHIES is to explicitly include a focus on healthcare ICT applications in the developing world (in addition to systems used in the developed countries), since unique engineering challenges arise in that special setting. Because humans often play a pivotal role in the process of using such systems, theories from the human factors engineering community may need to be integrated with methods from the technology-oriented domains in order to create effective engineering methodologies for socio-technical systems in the healthcare domain. Previous FHIES symposia were held in 2011, in Mabalingwe, South Africa (with post-conference proceedings in Springer LNCS 7151, and in 2012, in Paris, France (with post-conference proceedings to appear in Springer LNCS). SCOPE FHIES seeks contributions from both the solution domain (engineering methods) and the problem domain (healthcare and health informatics). Solution-domain papers should present their methods in the context of a concrete application in healthcare, while problem-domain papers should be devised to educate the methods community about unique challenges and characteristics of the healthcare domain. Submissions should seek to inform and further the development, adaptation, evaluation and adoption of formally based and rigorous engineering methods in health care systems. Topics of interest include but are not limited to: * modelling, analysis, simulation and verification in health informatics; * design and verification techniques for software-based ICT and software-intensive medical devices; * application and integration of foundational methods from different disci