From jmarino at fi.upm.es Tue Jan 3 09:18:36 2012 From: jmarino at fi.upm.es (=?UTF-8?Q?Julio_Mari=C3=B1o?=) Date: Tue, 3 Jan 2012 15:18:36 +0100 Subject: [TYPES/announce] Ph.D. position at Universidad Politecnica de Madrid Message-ID: The Babel research group at Universidad Politecnica de Madrid (UPM) is seeking a predoctoral researcher to work in verification of concurrent software. The position is attached to the PROMETIDOS-CM project, which investigates languages, methods and tools for reliable software development. We seek applicants with a strong background in at least one of the following fields: * concurrent programming * formal logic * program analysis and program verification * process calculi Previous research experience or having a master's degree in computational logic or related areas will be highly considered. Successful applicants are expected to contribute to the development of logics and tools for the validation of concurrent systems modeled in terms of abstract process descriptions and shared resource specifications, as well as the verification of the code obtained from these models. Random keywords for the research work can be: Java, Ada, JML, KeY, TLA, CSP, model driven engineering, separation logic, dynamic frames, modular verification. The position is for two years, with the possibility of renewal for up to four years subject to satisfactory progress. For further information, please contact Julio Mari?o (jmarino at fi.upm.es). Applications including CV and cover letter must be sent to empleo at madrimasd.org including the reference PROMETIDOS-UPM-BABEL-PD1 in the "Subject" field. Applications must be received by January 20, 2012 to receive full consideration. However, applications will continue to be accepted until the position is filled. Salaries Salaries at Madrid public universities are competitive at national level. Employees have access to an excellent public healthcare system. Work Environment The group is located in the School of Computer Science, which is part of the Montegancedo Campus, recently awarded the "International Excellence" label by the Spanish government. UPM is an equal opportunity employer and complies with the European Charter for Researchers. -- Julio Mari?o Babel research group Universidad Politecnica de Madrid From maffeis at doc.ic.ac.uk Tue Jan 3 11:39:41 2012 From: maffeis at doc.ic.ac.uk (Sergio Maffeis) Date: Tue, 03 Jan 2012 16:39:41 +0000 Subject: [TYPES/announce] PLAS 2012: Call for Papers Message-ID: <4F032F4D.6050702@doc.ic.ac.uk> *********************************************************************** Call for Papers Seventh ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2012) http://www.doc.ic.ac.uk/PLAS2012 June 15, 2012 Co-located with PLDI 2012, Beijing, China *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols and algorithms * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: March 2, 2012. Author notification: April 4, 2012. PLAS 2010 workshop: June 15, 2012. SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. PROGRAM COMMITTEE Sruthi Bandhakavi (Google Inc.) Avik Chaudhuri (Adobe Systems) Stephen Chong (Harvard University) Yuxin Deng (Shanghai Jiao Tong University) Feng Dengguo (Chinese Academy of Sciences) Marieke Huisman (University of Twente) Sergio Maffeis (Imperial College London) [co-chair] Prasad Naldurg (Microsoft Research India) Marco Pistoia (IBM T. J. Watson Research Center) Tamara Rezk (INRIA) [co-chair] David Sands (Chalmers University) Zhong Shao (Yale University) From stephan.kreutzer at tu-berlin.de Wed Jan 4 04:19:05 2012 From: stephan.kreutzer at tu-berlin.de (Kreutzer, Stephan) Date: Wed, 4 Jan 2012 09:19:05 +0000 Subject: [TYPES/announce] LICS 2012 - Final Call for Papers Message-ID: CALL FOR PAPERS Twenty-Seventh Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2012) June 25--28, 2012, Dubrovnik, Croatia http://informatik.hu-berlin.de/lics/lics12 LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012. The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification. Important Dates: ------------ January 6, 2012: Titles & Short Abstracts Due January 13, 2012: Extended Abstracts Due March 25, 2012: Author Notification (approximate) April 29, 2012: Final Versions Due for Proceedings: Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. At committee discretion, authors will be asked to respond to inquiries in February or March. Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2012. Submission Instructions: ------------ Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may not be longer than 10 pages, including references. LaTeX style files are available on the conference website. The extended abstract must be 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 and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Extended abstracts not conforming to the above requirements will be rejected without further consideration. There is no a priori limit on acceptances; all quality papers will be published, regardless of popularity of topic. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference. Short Presentations: ------------ A session of short presentations, intended for descriptions of student research, works in progress, and other brief communications, is planned. These abstracts will not be published. Dates and guidelines are posted on the LICS website. Special Events: ------------ - Invited plenary lecture by Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences. - Two plenary sessions in honor of Alan Turing on the occasion of his centenary, featuring talks by Robert L. Constable, E. Allen Emerson, Joan Feigenbaum, and Leonid Levin. - Pre-conference tutorials on Sunday, June 24, by * Jan Willem Klop (rewriting systems) and * Andr? Platzer (logic of dynamical systems). - Associated workshops on Sunday, June 24, and on Friday, June 29. Kleene Award for Best Student Paper: ------------ An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. Special Issues: ------------ Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. Program Chair: ----------- Nachum Dershowitz, Tel Aviv University Program Committee: ------------ Christel Baier, Dresden Univ. of Technology Lev Beklemishev, Steklov Inst of Mathematics Andreas Blass, Univ. of Michigan Manuel Bodirsky, ?cole Polytechnique Mikolaj Bojanczyk, Warsaw Univ. Ahmed Bouajjani, Univ. Paris Diderot Patricia Bouyer-Decitre, CNRS Andrei Bulatov, Simon Fraser Univ. Hubert Comon-Lundh, ENS Cachan Anuj Dawar, Univ. of Cambridge Gilles Dowek, INRIA Mart?n Escard?, Univ. of Birmingham Maribel Fern?ndez, King's College London Rob van Glabbeek, NICTA Rosalie Iemhoff, Utrecht Univ. Neil Immerman, UMass, Amherst Max Kanovich, Queen Mary, Univ. of London Naoki Kobayashi, Tohoku Univ. Orna Kupferman, Hebrew Univ. Marta Kwiatkowska, Univ. of Oxford Olivier Laurent, CNRS -- ENS Lyon Richard Mayr, Univ. of Edinburgh Andrzej Murawski, Univ. of Leicester David Plaisted, Univ. North Carolina, Chapel Hill Davide Sangiorgi, Univ. of Bologna Conference Chairs: ------------ Vlatko Lipovac, Univ. of Dubrovnik Andre Scedrov, Univ. of Pennsylvania Workshop Chairs: ------------ Adriana Compagnoni, Stevens Inst. of Technology Maribel Fern?andez, King's College London Publicity Chairs: ------------- Stephan Kreutzer, Berlin Univ. of Technology Andrzej Murawski, Univ. of Leicester Treasurer: -------- Mart?n Escard?, Univ. of Birmingham General Chair: ----------- Rajeev Alur, Univ. of Pennsylvania Organizing Committee: ------------ M. Abadi, R. Alur (chair), F. Baader, P. Beame, S. Buss, E. Clarke, A. Compagnoni, N. Dershowitz, M. Escard'o, M. Fern'andez, L. Fortnow, J. Giesl, M. Grohe, J.-P. Jouannaud, P. Kolaitis, S. Kreutzer, B. Larose, V. Lipovac, J. Makowsky, B. Monien, A. Murawski, A. Scedrov, P. Scott, M. Valeriote Advisory Board: ------------ M. Abadi, S. Abramsky, Y. Gurevich, T. Henzinger, C. Kirchner, P. Kolaitis, D. Kozen, U. Martin, J. Mitchell, L. Ong, L. Pacholski, P. Panangaden, G. Plotkin, A. Scedrov, M. Vardi, G. Winskel Sponsorship: ---------- The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing and by ACM SIGACT, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science. Please see the LICS website url{http://informatik.hu-berlin.de/lics/lics12 for further information. From mtf at cs.rit.edu Wed Jan 4 10:02:05 2012 From: mtf at cs.rit.edu (Matthew Fluet) Date: Wed, 4 Jan 2012 10:02:05 -0500 (EST) Subject: [TYPES/announce] PhD and PostDoc positions in parallel FP at Rochester Institute of Technology Message-ID: The Manticore project at the Rochester Institute of Technology (Rochester, NY, USA) is seeking applicants for both a PhD student position and a 2-year post-doctoral research position. The Manticore project (joint with the University of Chicago) is exploring the design and implementation of a functional programming language with a rich collection of explicitly- and implicitly-parallel programming features. Our research thus far has delivered a compiler and runtime system capable of demonstrating good parallel speedups on our 16- and 48-core test systems. See http://www.cs.rit.edu/~mtf/manticore for papers and more information. The goal of our next stage of research is to develop declarative language mechanisms for the controlled use of shared state and nondeterminism in implicitly-threaded parallel programs in order to increase their parallel efficiency. The successful applicants will be expected to contribute to this research effort, which will include both semantic foundations and efficient implementations. PhD application: * Requirements: B.S. in Computer Science, Mathematics, or related field * Apply to the RIT Golisano College of Computing and Information Sciences PhD Program: http://phd.gccis.rit.edu/academics/admissions * Please also send via e-mail to Prof. Matthew Fluet copies of the following RIT Graduate Admissions materials: - Resume or CV - personal statement * Priority deadline: January 15, 2012 (but rolling admissions process) PostDoc application: * Requirements: Ph.D. in Computer Science (completed or near completion) * Apply via e-mail to Prof. Matthew Fluet with: - a CV - a brief research statement - arrange to have two letters of recommendation sent to the same * Full consideration deadline: March 1, 2012 (position will remain open until filled) * Start date: April 1, 2012 (or later) * Duration: 2 years -- ============================================ Matthew Fluet Assistant Professor Department of Computer Science Rochester Institute of Technology 102 Lomb Memorial Drive Rochester, NY 14623-5608 Tel: +1.585.475.2854 ; Fax: +1.585.475.4935 mtf at cs.rit.edu ; http://www.cs.rit.edu/~mtf ============================================ CONFIDENTIALITY NOTE: The information transmitted, including attachments, is intended only for the person(s) or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender (mtf at cs.rit.edu) and destroy any copies of this information. From alastair.donaldson at imperial.ac.uk Thu Jan 5 05:39:13 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Thu, 05 Jan 2012 10:39:13 +0000 Subject: [TYPES/announce] CfP: SPIN 2012 - 19th International Workshop on Model Checking Software Message-ID: <4F057DD1.5090601@imperial.ac.uk> Apologies for multiple copies; I believe the SPIN workshop may be of interest to a good portion of the Types community. Best wishes Alastair *** SPIN 2012: CALL FOR PAPERS *** 19th International Workshop on Model Checking Software - SPIN 2012 Oxford, July 23-24 2012 http://qav.cs.ox.ac.uk/spin2012/ IMPORTANT DATES - Submission of abstracts: 26 March AoE (Anywhere on Earth) - Submission of full papers: 30 March AoE (Anywhere on Earth) - Notification of acceptance/rejection: 7 May - Final version due: 14 May - Workshop: July 23-24 AIMS AND SCOPE The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. 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 workshop. 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 workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: - 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 modelling 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 workshop INVITED SPEAKERS - Tom Ball Microsoft Research - Andrey Rybalchenko TU Munich - Andreas Zeller Saarland University INVITED TUTORIAL - Cristian Cadar Imperial College London 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 an international journal (journal to be confirmed). 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 workshop 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 workshop website: http://qav.cs.ox.ac.uk/spin2012/ At least one author of each accepted paper must attend the workshop and present the paper. ORGANISATION Programme Chairs: - Alastair F. Donaldson, Imperial College London, UK - David Parker, University of Oxford, UK Local Arrangements Chair: - Michael Tautschnig, University of Oxford, UK Programme Committee: - Christel Baier (University of Dresden, Germany) - Dirk Beyer (University of Passau, Germany) - Dragan Bosnacki (Eindhoven University of Technology, Netherlands) - Alessandro Cimatti (Fondazione Bruno Kessler, IRST, Italy) - Alastair Donaldson (Imperial College London, UK) - Stefan Edelkamp (TZI University Bremen, Germany) - Alex Groce (Oregon State University, USA) - Gerard Holzmann (NASA/JPL, USA) - Radu Iosif (VERIMAG, CNRS, France) - Stefan Leue (University of Konstanz, Germany) - Eric Mercer (Brigham Young University, USA) - Alice Miller (University of Glasgow, UK) - Madanlal Musuvathi (Microsoft Research, Redmond, USA) - David Parker (University of Oxford, UK) - Corina Pasareanu (NASA Ames, USA) - Doron Peled (Bar Ilan University, Israel) - Jaco van de Pol (University of Twente, Netherlands) - Kees Pronk (Delft University of Technology, Netherlands) - Shaz Qadeer (Microsoft Research, Redmond, USA) - Alastair Reid (ARM, UK) - Tayssir Touili (LIAFA, CNRS, France) - Helmut Veith (Vienna University of Technology, Austria) - Thomas Wahl (Northeastern University, 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) SPONSORSHIP The SPIN 2012 workshop is generously sponsored by: - ARM (http://www.arm.com) - Codeplay (http://www.codeplay.com) - Microsoft Research (http://research.microsoft.com/en-us) - Monoidics (http://www.monoidics.com) From georg.moser at uibk.ac.at Fri Jan 6 02:30:22 2012 From: georg.moser at uibk.ac.at (Georg Moser) Date: Fri, 06 Jan 2012 08:30:22 +0100 Subject: [TYPES/announce] Deadline Extension RTA 2012 Message-ID: <4F06A30E.6050800@uibk.ac.at> ******************************************************** * DEADLINE EXTENSION * * RTA 2012 * * Rewriting Techniques and Applications * * 23rd International Conference * * * * May 28 - Jun 2, 2012, Nagoya, Japan * * http://rta2012.trs.cm.is.nagoya-u.ac.jp/ * * * ******************************************************** The deadline for submission to RTA 2012 is being extended by a week. The new dates are: Abstract: Jan 11, 2012 (extended by a week) Paper Submission: Jan 16, 2012 (extended by a week) Notification: Mar 02, 2012 (unchanged) Final version: Mar 26, 2012 (unchanged) SUBMISSIONS: Abstracts and papers must be submitted electronically through the EasyChair system at: http://www.easychair.org/conferences/?conf=rta2012 Submissions are accepted in either Postscript or PDF format. LaTeX template for LIPIcs is available at: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz LaTeX template specialized for RTA 2012 is available at: http://www.csl.sri.com/users/tiwari/lipics-authors-rta2012.tgz Authors can use either one for preparing their submission. For other details, please see the Call for Papers at: http://rta2012.trs.cm.is.nagoya-u.ac.jp/CFP3-text.html Questions concerning submissions may be addressed to the PC chair, Ashish Tiwari by emailing ashish_dot_tiwari_at_sri_dot_com From J.T.Jeuring at uu.nl Mon Jan 9 05:07:08 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Mon, 9 Jan 2012 11:07:08 +0100 Subject: [TYPES/announce] CICM 2012: Second call for papers Message-ID: <95825CFB-D357-40E9-80CD-4494B22586EA@uu.nl> CICM 2012 - Conference on Intelligent Computer Mathematics July 9-13, 2012 at Jacobs University, Bremen, Germany http://www.informatik.uni-bremen.de/cicm2012/ Call for Papers ---------------------------------------------------------------- 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 Conference on Intelligent Computer Mathematics offers a venue for discussing these areas and their synergy. The conference will be organized by Serge Autexier and Michael Kohlhase at Jacobs University in Bremen and consist of five tracks: Artificial Intelligence and Symbolic Computation (AISC) Co-Chairs: John A. Campbell, Jacques Carette Calculemus Chair: Gabriel Dos Reis Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: Makarius Wenzel Systems and Projects Chair: Volker Sorge The overall programme will be organized by the General Program Chair Johan Jeuring. Invited talks will be given by: Yannis Haralambous, D?partement Informatique, T?l?com Bretagne Conor McBride, Department of Computer and Information Sciences, University of Strathclyde Cezar Ionescu, Potsdam Institute for Climate Impact Research ---------------------------------------------------------------- Important dates ---------------------------------------------------------------- Abstract submission: 20 February 2012 Submission deadline: 26 February 2012 Reviews sent to authors: 23 March 2012 Rebuttals due: 30 March 2012 Notification of acceptance: 6 April 2012 Camera ready copies due: 20 April 2012 Conference: 9-13 July 2012 ---------------------------------------------------------------- Tracks ---------------------------------------------------------------- *** AISC *** Symbolic computation can be roughly described as the study of algorithms which operate on expression trees. Another way to phrase this is to say that the denotational semantics of expressions trees is not fixed, but is rather context dependent. Expression simplification is probably the archetypal symbolic computation. Mathematically oriented software (such as the so-called computer algebra systems) have been doing this for decades, but not long thereafter, systems doing proof planning and theorem discovery also started doing the same; some attempts at knowledge management and 'expert systems' were also symbolic, but less successfully so. More recently, many different kinds of program analyses have gotten `symbolic', as well as some of the automated theorem proving (SMT, CAV, etc). But a large number of the underlying problems solved by symbolic techniques are well known to be undecidable (never mind the many that are EXP-time complete, etc). Artificial Intelligence has been attacking many of these different sub-problems for quite some time, and has also built up a solid body of knowledge. In fact, most symbolic computation systems grew out of AI projects. These two fields definitely intersect. One could say that in the intersection lies all those problems for which we have no decision procedures. In other words, decision procedures mark a definite phase shift in our understanding, but are not always possible. Yet we still want to solve certain problems, and must find 'other' means of (partial) solution. This is the fertile land which comprises the core of AISC. Rather than try to exhaustively list topics of interest, it is simplest to say that AISC seeks work which advances the understanding of Solving problems which fundamentally involve the manipulation of expressions, but for which decision procedures are unlikely to ever exist. *** Calculemus *** Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. The topics of interest of Calculemus include but are not limited to: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Theory exploration techniques * Input languages, programming languages, types and constraint languages, and modeling languages for mechanised mathematics systems (PA, CAS, and ATP). * Infrastructure for mathematical services *** 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. Following success of DML 2008, DML 2009 DML 2010, and DML 2011 track objectives are to formulate the strategy and goals of a global mathematical digital library and to summarize the current successes and failures of ongoing technologies and related projects as EuDML, asking such questions as: * What technologies, standards, algorithms and formats should be used and what metadata should be shared? * What business models are suitable for publishers of mathematical literature, authors and funders of their projects and institutions? * Is there a model of sustainable, interoperable, and extensible mathematical library that mathematicians can use in their everyday work? * What is the best practice for * retrodigitized mathematics (from images via OCR to MathML or TeX); * retro-born-digital mathematics (from existing electronic copy in DVI, PS or PDF to MathML or TeX); * born-digital mathematics (how to make needed metadata and file formats available as a side effect of publishing workflow [CEDRAM/Euclid model])? DML is an opportunity to share experience and best practices between projects in any area (MKM, NLP, OCR, pattern recognition, whatever) that could change the paradigm for searching, accessing, and interacting with the mathematical corpus. The track is trans/interdisciplinary and contributions from any kind of people on any aspect of the DML building are welcome. *** 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 presentation of systems and new and ongoing projects in all areas and topics related to the CICM conferences: * AI and Symbolic Computation * Deduction and Computer Algebra * Mathematical Knowledge Management * Digital Mathematical Libraries 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. We solicit submissions for two page abstracts in the categories of system descriptions and project presentations. System description should present * newly developed systems, * systems that have not previously been presented to the CICM community, or * significant updates to existing systems. Project presentation 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. All submissions should contain links to demos, downloadable systems, or project pages. Availability of such accompanying material will be a strong prerequisite for acceptance. Accepted abstracts will be published in the CICM proceedings in Springer's LNAI series. Author's are expected to present their abstracts in 5-10 minute teaser talks followed by an open demo/poster session. System papers must be accompanied by a system demonstration, while project papers must be accompanied by a poster presentation. ---------------------------------------------------------------- Submitting ---------------------------------------------------------------- Submissions to tracks A to D 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. Submissions to the Systems & Projects track must not exceed four pages. The accepted abstracts will be presented at CICM in a fast presentation session, followed by an open demo/poster session. System papers must be accompanied by a system demonstration, and project papers must be accompanied by a poster presentation. The four pages of the abstract should be new material, accompanied by links to demos/downloads/project-pages and [existing] system descriptions. Availability of such accompanying material will be a strong prerequisite for acceptance. Accepted conference submissions from all tracks will 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. 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=cicm2012). ---------------------------------------------------------------- Program Committees ---------------------------------------------------------------- General chair: Johan Jeuring (Utrecht University and Open Universiteit the Netherlands) AISC track John A. Campbell; University College London, UK; Co-chair Jacques Carette; McMaster University, Canada; Co-chair Serge Autexier; DFKI Bremen, Germany Jacques Calmet; University of Karlsruhe, Germany Jacques Fleuriot; University of Edinburgh, UK Andrea Kohlhase; International University Bremen, Germany Erik Postma; Maplesoft Inc., Canada Alan Sexton; University of Birmingham, UK Chung-chieh Shan; Cornell University, USA. Stephen Watt; University of Western Ontario, Canada Calculemus track Gabriel Dos Reis; Texas A&M University, USA; Chair Andrea Asperti; University of Bologna, Italy Laurent Bernardin; Maplesoft, Canada James Davenport; University of Bath, UK Ruben Gamboa; University of Wyoming, USA Mark Giesbrecht; University of Waterloo, Canada Sumit Gulwani; Microsoft Research, USA John Harrison; Intel, USA Joris van der Hoeven; ?cole Polytechnique, France Hoon Hong; North Carolina State University, USA Lo?c Pottier; INRIA, France Wolfgang Windsteiger; RISC, Austria DML track Petr Sojka; Masaryk University, Brno, CZ; Chair Jos? Borbinha; Technical University of Lisbon, PT Thierry Bouche; University Grenoble, FR Michael Doob; University of Manitoba, Winnipeg, CA Thomas Fischer; Goettingen University, DE Yannis Haralambous; T?l?com Bretagne, FR V?clav Hlav??; Czech Technical University, Prague, CZ Michael Kohlhase; Jacobs University Bremen, DE Janka Chleb?kov?; Portsmouth University, UK Enrique Maci?s-Virg?s; University of Santiago de Compostela, ES Bruce Miller; NIST, USA Ji?? R?kosn?k; Academy of Sciences, Prague, CZ Eugenio Rocha; University of Aveiro, PT David Ruddy; Cornell University, US Volker Sorge; University of Birmingham, UK Masakazu Suzuki; Kyushu University, JP MKM track Makarius Wenzel; University of Paris-South, France; Chair David Aspinall; University of Edinburgh, Scotland Jeremy Avigad; Carnegie Mellon University, USA Mateja Jamnik; University of Cambridge, UK Cezary Kaliszyk; University of Tsukuba, Japan Manfred Kerber; University of Birmingham, UK Christoph L?th; DFKI Bremen, Germany Adam Naumowicz; University of Bia?ystok, Poland Jim Pitman; University of California, Berkeley, USA Pedro Quaresma; Universidade de Coimbra, Portugal Florian Rabe; Jacobs University Bremen, Germany Claudio Sacerdoti Coen; University of Bologna, Italy Enrico Tassi; INRIA Saclay, France Freek Wiedijk; Radboud University Nijmegen, The Netherlands Systems & Projects track Volker Sorge; University of Birmingham, UK; Chair Josef Baker; University of Birmingham, UK John Charnley; Imperial College, UK Manuel Kauers; RISC, Austria Koji Nakagawa; Kyushu University, Japan Piotr Rudnicki; University of Alberta, Canada Josef Urban; Radboud University Nijmegen, The Netherlands Richard Zanibbi; Rochester Institute of Technologies, USA From maffei at cs.uni-saarland.de Tue Jan 10 03:39:12 2012 From: maffei at cs.uni-saarland.de (Matteo Maffei) Date: Tue, 10 Jan 2012 09:39:12 +0100 Subject: [TYPES/announce] CFP: 25th IEEE Computer Security Foundations Symposium (CSF 2012) Message-ID: ***************************************************** CSF 2012 Call for Papers and Panels 25th IEEE Computer Security Foundations Symposium http://csf2012.seas.harvard.edu/ June 25 - 27, 2012 Harvard University, Cambridge MA, USA ***************************************************** The Computer Security Foundations Symposium is an annual conference for researchers in computer security, to examine current theories of security, the formal models that provide a context for those theories, and techniques for verifying security. Topics New theoretical results in computer security are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories. Panel proposals are sought as well as papers. Possible topics include, but are not limited to: Access control, 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, Information flow, Intrusion detection, Hardware-based security, Language-based security, Network security, Resource usage control, Security for mobile computing, Security models, Security protocols, Trust and trust management. While CSF welcomes submissions beyond these topics, note that the main focus of CSF is foundational security: submissions that lack foundational aspects risk rejection. 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 Workshop proposal: November 15th, 2011 Papers due: February 9, 2012, 11:59pm Eastern Standard Time Panel proposals due: March 14, 2012 Notification: March 29, 2012 Symposium: June 25 - 27, 2012 ***************************************************** INVITED SPEAKERS William Guenther (Mass Insight Global Partnerships) Butler Lampson (Microsoft Research) ***************************************************** PROGRAM COMMITTEE Mart?n Abadi, Microsoft Research & Univ. of Santa Cruz, USA Michael Clarkson, The George Washington Univ., USA V?ronique Cortier (co-chair), CNRS Nancy, France Anupam Datta, Carnegie Mellon Univ., USA Joan Feigenbaum, Yale Univ., USA Riccardo Focardi, Univ. of Venice, Italy Cedric Fournet, Microsoft Research, UK Deepak Garg, MPI-SWS, Germany Steve Kremer, INRIA Nancy, France Ralf K?sters, Univ. of Trier, Germany Matteo Maffei, Univ. of Saarland, Germany Catuscia Palamidessi, INRIA Saclay, France Pierangela Samarati, Univ. of Milano, Italy Vitaly Shmatikov, Univ. of Texas, USA Nikhil Swamy, Microsoft Research, USA Alwen Tiu, Australian National Univ., Australia Dominique Unruh, Univ. of Tartu, Estonia Steve Zdancewic (co-chair), Univ. of Penn, USA ***************************************************** 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 may be submitted using the two-column IEEE Proceedings style available for various document preparation systems at the IEEE Conference Publishing Services page. Papers should be at most 12 pages long, not counting bibliography and well-marked appendices. 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 2012 submission site: http://csf2012.seas.upenn.edu/ ***************************************************** 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 V?ronique Cortier, CNRS Nancy, France Steve Zdancewic, Univ. of Penn, USA General Chair Stephen Chong, Harvard University, USA Publications Chair Deepak Garg, Max Planck Institute for Software Systems, Germany From wasowski at itu.dk Tue Jan 10 05:08:23 2012 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Tue, 10 Jan 2012 11:08:23 +0100 Subject: [TYPES/announce] 2nd International PhD School on Quantitative Model Checking Message-ID: <4F0C0E17.2070509@itu.dk> Second Call for Participation: 2nd International PhD School on Quantitative Model Checking Copenhagen 27 Feb - 1 Mar http://itu.dk/qmc2012/ Registration Deadline: February 5th, 2012 This is the second call for participation in the 2nd International PhD school on Quantitative Model Checking organized by the European Network of Excellence ARTIST Design and MT-LAB Centre of Excellence. Please distribute to interested parties. The European Network of Excellence ARTIST Design is organizing a PhD school on Quantitative Model Checking to take place at IT University of Copenhagen from 27 February to 1 March 2012. The School will feature lectures by world-renowned experts within the areas of discrete, real-time and probabilistic model checking. As of today, the list of confirmed speakers is as follows: Jan Tretmans - model-based testing Wolfgang Thomas - games in model checking Javier Esparza - verification of infinite state systems Patrice Godefroid - software model checking Holger Hermans - compositional stochastic modeling and verification Axel Legay - statistical model checking Joel Ouaknine - metric temporal logics Andrzej Wasowski - compositional design & verification of real time systems PhD students and others interested in this school can pre-register by sending an e-mail to Louis-Marie Traonouez (lmtr at itu.dk). This will help us in planning the budget. Formal registration should be available soon. The number of seats is limited. Registration cost: 1200 DKK There will be a fee for participating in the PhD school to cover some of our expenses; the precise amount will be announced once our budget is in place. We may also have a small number of scholarships available to support PhD students without or with only limited funding. Kim G. Larsen Axel Legay Andrzej Wasowski -- Andrzej W?sowski, PhD, http://www.itu.dk/~wasowski/ Associate prof., head of MSc Programme on Software Development IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark office 2M27, phone +45 7218 5086, fax +45 7218 5001 From gerardo at ifi.uio.no Tue Jan 10 10:43:25 2012 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Tue, 10 Jan 2012 16:43:25 +0100 Subject: [TYPES/announce] PhD positions in Data Mining and Security at Chalmers, Sweden Message-ID: [Please accept our apologies if you receive multiple copies of this announcement] ------------------------------------------------------ PhD student position at Chalmers University of Technology, Sweden Privacy and Security Issues in Data Mining Application deadline: 29 Feb 2012 ----------------------------------------------------- We are seeking a total of three positions (see also "Algorithmics for Network dynamics" and "Mechanisms for Crowdsourcing" listed below), supported by a grant funded by the Swedish Foundation for Strategic Research (SSF,www.stratresearch.se), and will be conducted in close collaboration with our industrial partners, in particular Recorded Future (https://www.recordedfuture.com/). For more information on the grant please see: http://www.chalmers.se/cse/SV/aktuellt/nyhetsarkiv/internet-as-crystal-ball The research objective for this position is to provide reliable and robust privacy guarantees when mining potentially sensitive data without significantly compromising accuracy. The students involved in the project will be working in close collaboration and under the supervision of one or more of the following senior researchers: David Sands, Peter Damaschke, Devdatt Dubhashi, Andrei Sabelfeld, and Gerardo Schneider. A PhD student is a paid employee for a maximum of 5 years, with excellent pay and benefits. The majority of your working time is devoted to your own research studies. A PhD student is also expected to develop own ideas and communicate scientific results orally as well as in written form. In addition, the position will normally include 20% departmental work, mostly teaching duties. The employment is limited to a maximum of five years. For more information please refer to the official online descriptions: http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx Direct links: PhD student position in Privacy and Security Issues in Data Mining https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=336 PhD student position in Mechanisms for crowdsourcing https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=335 PhD student position in Algorithmics for Network Dynamics https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=333 Other links: * Live and Study in Gothenburg: http://www.youtube.com/watch?v=0WrlGlSyS1c https://site1.reachmee.com/I003/chalmers/ENG/vacdetail.aspx?commadseqno=338 ------------------------------------------ --- Gerardo Schneider Dept. of Computer Science and Engineering Chalmers | University of Gothenburg SE 412 96 G?teborg, Sweden http://www.cse.chalmers.se/~gersch/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pmt6sbc at maths.leeds.ac.uk Tue Jan 10 11:27:51 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 10 Jan 2012 16:27:51 GMT Subject: [TYPES/announce] Turing Centenary Conference in Cambridge - Submission Deadline Jan. 20, 2012 Message-ID: <201201101627.q0AGRpGX025972@maths.leeds.ac.uk> ********************************************************************** FINAL CALL FOR PAPERS: TURING CENTENARY CONFERENCE http://www.cie2012.eu Computability in Europe 2012: How the World Computes University of Cambridge Cambridge, 18-23 June 2012 The deadline for SUBMISSION OF PAPERS and informal presentations for this historic event is JANUARY 20, 2012. For submission details, see: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12 IMPORTANT DATES: Submission Deadline for LNCS: Jan. 20, 2012 Notification of authors: Mar. 16, 2012 Deadline for final revisions: Apr. 6, 2012 Submission Deadline for Informal Presentations: May 11, 2012 The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag. Post-conference publications include special issues of APAL and LMCS. We encourage all researchers presenting papers of the highest research quality at CiE 2012 to submit their full papers to the CiE journal COMPUTABILITY where they will be handled as regular submissions. CiE 2012 will have a special relationship to the scientific legacy of Alan Turing, reflected in the broad theme: How the World Computes, with all its different layers of meaning. Contributions which are directly related to the visionary and seminal work of Turing will be particularly welcome. CiE 2012 CONFERENCE TOPICS include, but not exclusively - * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. CiE 2012 is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, artificial intelligence, philosophy and computational aspects of physics, biology, linguistics, connectionist models, economics and the wider scientific world. CiE 2012 is planned to be an event worthy of the remarkable scientific career it commemorates. PLENARY SPEAKERS include: Andrew Hodges (Oxford, Special Invited Lecture), Ian Stewart (Warwick, Special Public Lecture), Dorit Aharonov (Jerusalem), Veronica Becher (Buenos Aires), Lenore Blum (Carnegie Mellon), Rodney Downey (Wellington), Yuri Gurevich (Microsoft), Juris Hartmanis (Cornell), Richard Jozsa (Cambridge), Stuart Kauffman (Vermont/ Santa Fe), James Murray (Oxford/ Princeton, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College). SPECIAL SESSIONS include: * The Universal Turing Machine, and History of the Computer Chairs: Jack Copeland and John Tucker Speakers so far: Ivor Grattan-Guinness, Robert I. Soare * Cryptography, Complexity, and Randomness Chairs: Rod Downey and Jack Lutz Speakers so far: Eric Allender, Lance Fortnow, Omer Reingold, Alexander Shen * The Turing Test and Thinking Machines Chairs: Mark Bishop and Rineke Verbrugge Speakers: Bruce Edmonds, John Preston, Susan Sterrett, Kevin Warwick, Jiri Wiedermann * Computational Models After Turing: The Church-Turing Thesis and Beyond Chairs: Martin Davis and Wilfried Sieg Speakers: Giuseppe Longo, Peter Nemeti, Stewart Shapiro (tbc), Matthew Szudzik, Philip Welch, Michiel van Lambalgen * Morphogenesis/Emergence as a Computability Theoretic Phenomenon Chairs: Philip Maini and Peter Sloot Speakers: Jaap Kaandorp, Shigeru Kondo, Nick Monk, John Reinitz, James Sharpe, Jonathan Sherratt * Open Problems in the Philosophy of Information Chairs: Pieter Adriaans and Benedikt Loewe Speakers: Patrick Allo, Luis Antunes, Mark Finlayson, Amos Golan, Ruth Millikan Information of funding for students (including ASL grants) and the attendance of female researchers is to follow. There will be the annual Women in Computability Workshop, supported by a grant from the Elsevier Foundation. CiE 2012 will be associated/co-located with a number of other Turing centenary events, including: * ACE 2012, June 15-16, 2012 * Computability and Complexity in Analysis (CCA 2012), June 24-27, 2012 http://cca-net.de/cca2012/ * Developments in Computational Models (DCM 2012), June 17, 2012 http://www.math.uni-hamburg.de/home/loewe/DCM2012/ * THE INCOMPUTABLE at Kavli Royal Society International Centre Chicheley Hall, June 12-15, 2012 http://www.mathcomp.leeds.ac.uk/turing2012/inc/ Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: * Samson Abramsky (Oxford) * Pieter Adriaans (Amsterdam) * Franz Baader (Dresden) * Arnold Beckmann (Swansea) * Mark Bishop (London) * Paola Bonizzoni (Milan) * Luca Cardelli (Cambridge) * Douglas Cenzer (Gainesville) * S Barry Cooper (Leeds, Co-chair) * Ann Copestake (Cambridge) * Anuj Dawar (Cambridge, Co-chair) * Solomon Feferman (Stanford) * Bernold Fiedler (Berlin) * Luciano Floridi (Hertfordshire) * Martin Hyland (Cambridge) * Marcus Hutter (Canberra) * Viv Kendon (Leeds) * Stephan Kreutzer (Oxford) * Ming Li (Waterloo) * Benedikt Loewe (Amsterdam) * Angus MacIntyre (London) * Philip Maini (Oxford) * Larry Moss (Bloomington) * Amitabha Mukerjee (Kanpur) * Damian Niwinski (Warsaw) * Dag Normann (Oslo) * Prakash Panangaden (Montreal) * Jeff Paris (Manchester) * Brigitte Pientka (Montreal) * Helmut Schwichtenberg (Munich) * Wilfried Sieg (Carnegie Mellon) * Mariya Soskova (Sofia) * Bettina Speckmann (Eindhoven) * Christof Teuscher (Portland) * Peter van Emde Boas (Amsterdam) * Jan van Leeuwen (Utrecht) * Rineke Verbrugge (Groningen) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF-format, max 10 pages) for presentation at CiE 2012. We particularly invite papers that build bridges between different parts of the research community. ORGANISING COMMITTEE: Arnold Beckmann (Swansea), Luca Cardelli (Cambridge), S Barry Cooper (Leeds), Ann Copestake (Cambridge), Anuj Dawar (Cambridge, Chair), Bjarki Holm (Cambridge), Martin Hyland (Cambridge), Benedikt Loewe (Amsterdam), Arno Pauly (Cambridge), Andrew Pitts (Cambridge) The conference is sponsored by the ASL, EACSL, EATCS, Elsevier Foundation, IFCoLog, King's College Cambridge, The University of Cambridge and Microsoft Research. For a small poster to download and display: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/Images/cie12.poster.1000x1400.png Contact: Anuj Dawar - anuj.dawar(at)cl.cam.ac.uk ********************************************************************** From cav2012.publicity.chair at gmail.com Thu Jan 12 08:02:22 2012 From: cav2012.publicity.chair at gmail.com (CAV 2012 CFP) Date: Thu, 12 Jan 2012 08:02:22 -0500 Subject: [TYPES/announce] CAV 2012: Final Call For Papers Message-ID: ====== CALL FOR PAPERS ====== 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia Website: http://cav12.cs.illinois.edu/ Aims and Scope ------------------- The conference on Computer Aided Verification (CAV), 2012, is the 24th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. Topics of interest include: - Algorithms and tools for verifying models and implementations - Hardware verification techniques - Hybrid systems and embedded systems verification - Deductive, compositional, and abstraction techniques for verification - Program analysis and software verification - Testing and runtime analysis based on verification technology - Verification methods for parallel and concurrent hardware/software systems - Applications and case studies in verification - Verification in industrial practice - Algorithms and tools for system synthesis - Verification techniques for security - Formal models and methods for biological systems ** NEW in 2012 ** CAV will have *special tracks* in the following four areas: 1. Hardware Verification (track chair: Andreas Kuehlmann) 2. Computer Security (track chair: Somesh Jha) 3. Embedded Systems (track chair: Stavros Tripakis) 4. SAT and SMT (track chair: Daniel Kroening) Submissions in these four topics are especially encouraged. Papers in these areas will be subject to the same rigorous review process as other papers. Accepted special track papers will be organized into special sessions that are highlighted in the program. Events --------- The conference will include the following events: * Pre-conference workshops on July 7-8. * The main conference will take place July 9th-13th: -- Invited tutorials on July 9th. -- Technical sessions on July 10-13. Please see the conference website for further details. Paper Submission -------------------- There are two categories of submissions: A. Regular Papers: Submissions, not exceeding sixteen (16) pages using Springer's LNCS format, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data available with their submission. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses, and strengths in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. B. Tool Presentations: Submissions, not exceeding six (6) pages using Springer's LNCS format, should describe the implemented tool and its novel features. An appendix that will not be part of the published presentation may be added for use in the program committee selection process. A demonstration, in a separate demonstration session, is expected to accompany a tool presentation. Papers describing tools that have already been presented (in any conference) will be accepted only if significant and clear enhancements to the tool are reported and implemented. Papers exceeding the stated maximum length run the risk of rejection without review. Note that the page limit for submissions has been increased to 16 pages. For regular papers, an appendix can be joined to the submissions providing additional material such as details on proofs or experiments. The appendix is not guaranteed to be read or taken into account by the reviewers and it should not contain information necessary to the understanding and the evaluation of the presented work. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. Papers must be submitted in PDF format. Submission is done with EasyChair. Information about the submission procedure will be available at: http://cav12.cs.illinois.edu/ Important Dates - Abstract submission: January 15, 2012 - Paper submission (firm): January 22, 2012 at 23:59 Samoa time (UTC/GMT-11) - Author feedback/rebuttal period: March 7-9, 2012 - Notification of acceptance/rejection: March 22, 2012 - Final version due: April 20, 2012 Program Chairs ------------------ Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USA Sanjit A. Seshia, University of California at Berkeley, USA Program Committee --------------------- Rajeev Alur (Univ. Pennsylvania) Roderick Bloem (TU Graz) Supratik Chakraborty (IIT Bombay) Swarat Chaudhuri (Rice Univ.) Adam Chlipala (MIT) Vincent Danos (University of Edinburgh) Thomas Dillig (College of William and Mary) Andy Gordon (Microsoft Research) Mike Gordon (Cambridge Univ.) Orna Grumberg (Technion) Aarti Gupta (NEC Labs) William Hung (Synopsys) Somesh Jha (Univ. Wisconsin) Ranjit Jhala (UCSD) Bengt Jonsson (Uppsala Univ.) Rajeev Joshi (NASA JPL) Daniel Kroening (Oxford Univ.) Andreas Kuehlmann (Coverity) Viktor Kuncak (EPFL) Shuvendu Lahiri (Microsoft Research) Rupak Majumdar (MPI-SWS) Ken Mcmillan (Microsoft Research) David Molnar (Microsoft Research) Kedar Namjoshi (Bell Labs) Albert Oliveras (TU Catalonia, Barcelona) Joel Ouaknine (Oxford Univ.) Gennaro Parlato (Univ. of Southampton) Madhusudan Parthasarathy (UIUC) Nir Piterman (Univ. of Leicester) Andreas Podelski (Univ. of Freiburg) Shaz Qadeer (Microsoft Research) Zvonimir Rakamaric (Univ. of Utah) Sriram Sankaranarayanan (Univ. of Colorado) Sanjit A. Seshia (UC Berkeley) Natasha Sharygina (Univ. of Lugano) Stavros Tripakis (UC Berkeley) Helmut Veith (TU Vienna) Mahesh Viswanathan (UIUC) Jin Yang (Intel) Karen Yorav (IBM) Steering Committee ---------------------- Michael Gordon, University of Cambridge, UK Orna Grumberg, Technion, Israel Robert Kurshan, Cadence Design Systems, USA Kenneth McMillan, Microsoft Research, USA CAV Award ------------ The annual CAV Award has been established for a specific fundamental contribution or a series of outstanding contributions to the field of Computer Aided Verification. The award of $10,000 will be granted to an individual or a group of individuals chosen by the Award Committee from a list of nominations. The Award Committee may choose to make no award. The CAV Award shall be presented in an award ceremony at CAV and a citation will be published in a Journal of Record (currently, Formal Methods in System Design). Call for Nominations for the CAV Award ------------------------------------------ Anyone can submit a nomination. The Award Committee can originate a nomination. Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. The nominee may have received such an award for other contributions. The 2012 CAV Award Committee consists of Thomas A. Henzinger (Chair) Rajeev Alur Marta Kwiatkowska Aarti Gupta The nominations should be sent to Thomas Henzinger at tah at ist.ac.at. Nominations must be received by January 22, 2012. -------------- next part -------------- An HTML attachment was scrubbed... URL: From apt at cs.pdx.edu Thu Jan 12 09:54:03 2012 From: apt at cs.pdx.edu (Andrew Tolmach) Date: Thu, 12 Jan 2012 06:54:03 -0800 Subject: [TYPES/announce] Post-doctoral position in Formal Verification at Portland State University Message-ID: <2B4AA903-C1E0-49CC-B64C-24836D4A84D4@cs.pdx.edu> ---------------------------------- Post-doctoral position in Formal Verification Portland State University ---------------------------------- Applications are invited for a post-doctoral research position at Portland State University in the area of formal verification and its applications to network and systems software. The hosting project, SOUND (Safety on Untrusted Network Devices), is a new joint effort with researchers at the University of Pennsylvania (UPenn) and BAE Systems, funded as part of the DARPA MRC (Mission-Oriented Resilient Clouds) program. The goal of SOUND is to construct distributed systems that are highly resilient against cyber-attack, using new ideas in protocols, authentication, and auditing. SOUND is also closely integrated with the existing SAFE (Semantically Aware Foundation Environment) project, hosted at UPenn, Harvard, Northeastern, and BAE. SAFE is designing a highly secure host architecture, taking a completely clean-slate approach to the processor, programming language, and operating system. SAFE hosts will be used as reliable components within SOUND networks. At Portland State, we will apply formal verification at multiple levels---specification, algorithms and protocols, and implementation---to increase assurance of both SAFE and SOUND. Our initial efforts will build on our experience producing verified implementations of runtime-system components using the Coq proof assistant in the context of the HASP/HARTS project. This post-doc position offers an opportunity to put formal methods to work to attack critical problems in the security of our cyber-infrastructure, in collaboration with leading researchers in secure systems and languages, and within a highly visible program. The ideal candidate will have a Ph.D. in Computer Science with expertise in formal verification (for example, using Coq, Isabelle, or similar tools) and in one or more of the following areas: security, networking, and systems software. This position initially runs through September 2012 with the possibility of renewal for up to three years total duration. Review of applications will begin immediately. The position will remain open until finalists are identified. Start date is negotiable, but ideally within a few months. Starting salary is $60,000 per year, plus generous health and vacation benefits. Background on this research effort can be found at: - On SOUND: http://www.cs.pdx.edu/~apt/MRCprop_technical.pdf - On SAFE: http://www.crash-safe.org/papers - On HASP/HARTS: http://web.cecs.pdx.edu/~apt/icfp10.pdf To apply, please send a CV together with a brief description of your research accomplishments and interests, including the names of three references, to sound-adm 'at' cs.pdx.edu. Please include the phrase "SOUND Postdoc" in the subject line. Questions about the position may be sent directly to Andrew Tolmach (apt 'at' cs.pdx.edu). Portland State University is an Affirmative Action, Equal Opportunity institution and welcomes applications from candidates who support diversity. -------------- next part -------------- An HTML attachment was scrubbed... URL: From georg.moser at uibk.ac.at Sun Jan 15 18:51:29 2012 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 16 Jan 2012 00:51:29 +0100 Subject: [TYPES/announce] WST 2012: Last Call for Papers and Deadline Extension Message-ID: <4F136681.8050504@uibk.ac.at> ====================================================================== Last Call for Papers and Deadline Extension WST 2012 12th International Workshop on Termination Feb 19 - 23, 2012, Obergurgl, Innsbruck http://cl-informatik.uibk.ac.at/events/wst-2012 ====================================================================== The goal of the Workshop on Termination is to be a venue for presentation and discussion of all topics in and around termination. In this way, the workshop tries to bridge the gaps between different communities interested and active in research in and around termination. The deadline for submission to WST 2012 is being extended by a week IMPORTANT DATES (NEW): * submission January 22, 2012 (extended by a week) * notification January 29, 2012 (extended by a week) * final version February 5, 2012 (unchanged) * early registration January 31, 2012 (new) * workshop February 19 - 23, 2012 SUBMISSION: Submissions are short papers/extended abstract which should not exceed 5 pages. There will be no formal reviewing. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: http://www.easychair.org/conferences/?conf=wst2012 Final versions should be created using LaTeX and the style file LIPIcs (http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz). For other details, please see previous Call for Papers at: http://cl-informatik.uibk.ac.at/events/wst-2012 Questions concerning submissions may be addressed to the PC chair, Georg Moser: georg (dot) moser (at) uibk (dot) ac (dot) at From lbauer at cmu.edu Mon Jan 16 08:53:23 2012 From: lbauer at cmu.edu (Lujo Bauer) Date: Mon, 16 Jan 2012 08:53:23 -0500 Subject: [TYPES/announce] CFP -- deadline extension -- 17th ACM SACMAT Message-ID: SACMAT welcomes submissions that address the topics listed below through the use of programming languages, logics, and other formal approaches relevant to types-announce readers. (Apologies if you receive this message multiple times!) The submission deadlines have been extended by one week, to January 20 for paper abstracts, and January 27 for papers and panels. CALL FOR PAPERS 17th ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES (SACMAT 2012) URL: http://www.sacmat.org Newark, June 20-22, 2012 Abstract Submission: Jan 13, 2012 Paper Submission : Jan 20, 2012 SCOPE ====== Papers offering novel research contributions in all aspects of access control are solicited for submission to the ACM Symposium on Access Control Models and Technologies (SACMAT). SACMAT 2012 is the seventeenth of a successful series of symposiums that continue the tradition, first established by the ACM Workshop on Role-Based Access Control, of being the premier forum for presentation of research results and experience reports on leading edge issues of access control, including models, systems, applications, and theory. The missions of the symposium are to share novel access control solutions that fulfill the needs of heterogeneous applications and environments and to identify new directions for future research and development. SACMAT gives researchers and practitioners a unique opportunity to share their perspectives with others interested in the various aspects of access control. Accepted papers will be presented at the symposium and published by the ACM in the symposium proceedings. Best Paper Award will be presented to the authors of the most outstanding paper at the conference. Topics of interest include but are not limited to: - Access control models and extensions - Access control requirements - Access control design methodology - Access control mechanisms, systems, and tools - Access control in distributed and mobile systems - Access control for innovative applications - Administration of access control policies - Delegation - Identity management - Policy/Role Engineering - Safety analysis and enforcement - Standards for access control- Trust management - Trust and risk models in access control - Theoretical foundations for access control models - Usability in access control systems - Usage control PAPER SUBMISSION ================= Authors are required to submit an abstract of their submission at least a week before the deadline for submission of papers, in order to expedite the appointment of reviewers. Abstracts and papers are to be submitted electronically using the EasyChair conference management system (http://www.easychair.org/conferences/?conf=sacmat2012). Papers must be submitted as a single PDF file, formatted for 8.5" X 11" paper, and be no more than 5MB in size. It is the responsibility of the authors to ensure that their submission will print easily on simple default configurations. Papers must be written in English. Authors are required to use the ACM format for papers, using one of the ACM SIG Proceedings Templates (http://www.acm.org/sigs/pubs/proceed/template.html). The length of the paper (in the proceedings format) must not exceed ten US letter pages, excluding well-marked appendices, and no more than twelve pages in total. Committee members are not required to read the appendices, so papers must be intelligible without them. The submission must be anonymous, so information that might identify the authors - including author names, affiliations, acknowledgements, or obvious self-citations - must be excluded. It is the authors? responsibility to ensure that their anonymity is preserved when citing their own work. All submissions must contain a significant original contribution. That is, submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal, conference or workshop. In particular, simultaneous submission of the same work is not allowed. Where appropriate, relevant related work, including that of the authors, must be cited. PANEL PROPOSAL SUBMISSION ========================= Panel proposals should be no longer than two pages, and should identify potential panelists, indicating those who have confirmed their willingness to participate. We especially solicit panels with participants from industry and/or government. Proposals can be e-mailed to the Panels Chairs, Jorge Lobo (jlobo at us.ibm.com) and Mahesh Tripunitara (tripunit at uwaterloo.ca). SYSTEM DEMO SUBMISSION ====================== This year we are planning to include a demonstration session in the symposium. To be considered for presentation, a proposal describing the demonstration should be emailed to the Demonstrations Chair, Andreas Schaad (andreas.schaad at sap.com). The demonstration proposal should clearly describe (1) the overall architecture of the system or technology demonstrated, and (2) one or more demonstration scenarios that describes how the audience, interacting with the demonstration system or the demonstrator, will gain an understanding of the underlying technology. Submissions will be evaluated based on the motivation of the work behind the use of the system or technology to be demonstrated and its novelty. Demonstration proposals should be no longer than four pages and should use the formatting guidelines described above for regular papers. However, demonstration proposals are not subject to double-blind reviewing, hence the author(s) name and affiliation(s) should be included in the submission. A two-page description of the demonstration will be included in the final proceedings. IMPORTANT DATES ================ - Abstract submission due: January 20, 2012 - Paper submission due: January 27, 2012 - Demo proposal submission due: January 20, 2012 - Panel proposal submission due: January 27, 2012 - Notification to authors: March 2, 2012 - Camera-ready submission due: March 23, 2012 From Patricia.Johann at cis.strath.ac.uk Mon Jan 16 10:18:58 2012 From: Patricia.Johann at cis.strath.ac.uk (Patricia.Johann at cis.strath.ac.uk) Date: Mon, 16 Jan 2012 15:18:58 -0000 (GMT) Subject: [TYPES/announce] Second CfP --- 75 Years of the Lambda Calculus Message-ID: <2117.130.159.185.39.1326727138.squirrel@webmail.cis.strath.ac.uk> [Please note that the submission deadline is 27 January. Flyer attached below. -patty] International Workshop on 75 Years of Lambda-Calculus University of St Andrews, Scotland 15th June, 2012 Call for papers http://msp.cis.strath.ac.uk/lambda2012 Sponsored by Scottish Informatics & Computer Science Alliance (SICSA) Overview -------- In 1936, Alonzo Church?s foundational 'An unsolvable problem of elementary number theory' introduced the Lambda-calculus which, with Turing machines, now underpins contemporary theoretical and practical Computer Science. To celebrate the 75th anniversary of the publication of this seminal work, papers are invited for presentation at a one day International Workshop, to be held in St Andrews on 15th June 2012, immediately following the International Symposium on Trends in Functional Programming (TFP). Topics ------ Church's life & work Origins/history Computability Programming language design & implementation Logic, proof & reasoning Guest Speakers -------------- Henk Barendregt, University of Nijmegen Chris Hankin, Imperial College Roger Hindley, University of Swansea Fairouz Kamareddine, Heriot-Watt University Workshop Chairs --------------- Greg Michaelson, Heriot-Watt University Patricia Johann, University of Strathclyde Programme Committee ------------------- Robert Atkey, University of Strathclyde Dan Dougherty, WPI Maribel Fernandez, Kings College London Philip Scott, University of Ottawa Dates (2012) ------------ 27th January: submission 2nd March: notification of acceptance for Workshop 18th May: deadline for draft proceedings 15th June: Workshop 31st August: deadline for HOSC special issue 30th November: notification of acceptance for HOSC Submissions ----------- Submissions will be 'light touch' refereed for relevance before the Workshop, and will appear in the draft proceedings, with full refereeing thereafter for publication in a special issue of Higher Order and Symbolic Computation. Submissions should be of 16 pages maximum length in the Springer format from http://cs.au.dk/~hosc/ Submission ---------- https://www.easychair.org/conferences/?conf=75ylc Registration ------------ There will be an attendance charge of around ?50 for refreshments, lunch, and proceedings. There will be no charge for PhD students from SICSA affiliated Universities. Registration will be through TFP: http://www.cs.st-andrews.ac.uk/~kh/TFP2012/TFP_2012/Home.html -------------- next part -------------- A non-text attachment was scrubbed... Name: International Workshop on 75 Years of _ Calculus.pdf Type: application/pdf Size: 82078 bytes Desc: not available URL: From icfp.publicity at googlemail.com Mon Jan 16 13:10:08 2012 From: icfp.publicity at googlemail.com (Wouter Swierstra) Date: Mon, 16 Jan 2012 19:10:08 +0100 Subject: [TYPES/announce] ICFP 2012 Call for papers Message-ID: ===================================================================== ICFP 2012: International Conference on Functional Programming Copenhagen, Denmark, September 9 - 15, 2012 http://www.icfpconference.org/icfp2012 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Monday Mar 12, 2012 14:00 UTC Author response: Monday May 07, 2012 14:00 UTC - May 9 14:00 UTC Notification: Monday May 28, 2012 Final copy due: Monday Jul 02, 2012 Scope ~~~~~ ICFP 2012 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 March 12 2012, 14:00 UTC, 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.acm.org/sigplan/republicationpolicy.htm * 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. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available: http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted only online via the ICFP website. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on Monday May 7th 2012, 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 2012. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Conference Chair: Peter Thiemann, University of Freiburg Program Chair: Robby Findler, Northwestern University Program Committee: Andreas Rossberg, Google Andrew Tolmach, Portland State University Brigitte Pientka, McGill University Colin Runciman, University of York Eijiro Sumii, Tohoku University Jan Midtgaard, Aarhus University John Hughes, Chalmers University of Technology and Quviq AB Lars Birkedal, IT University of Copenhagen Manuel F?hndrich, Microsoft Research Mariangiola Dezani-Ciancaglini, University of Turin Matthias Blume, Google R. Kent Dybvig, Cisco and Indiana University Sam Tobin-Hochstadt, Northeastern University Satnam Singh, Google Research Simon Marlow, Microsoft Research Zena M. Ariola, University of Oregon From rseba at disi.unitn.it Mon Jan 16 14:57:38 2012 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Mon, 16 Jan 2012 20:57:38 +0100 Subject: [TYPES/announce] SAT 2012: Call for Papers Message-ID: <20120116195738.GA14532@disi.unitn.it> [ We apologize if you receive multiple copies of this CFP. ] ------------------------------------------------------------------------- 15th International Conference on THEORY AND APPLICATIONS OF SATISFIABILITY TESTING --- SAT 2012 --- Trento, Italy, June 17-20th, 2012 http://sat2012.fbk.eu/ ------------------------------------------------------------------------- AIM and SCOPE ============= The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers studying the propositional satisfiability problem. Importantly, here SAT is interpreted in a rather broad sense: besides plain propositional satisfiability, it includes the domains of MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraints Programming (CSP) techniques for word-level problems and their propositional encoding. To this extent, many hard combinatorial problems can be encoded as SAT instances, in the broad sense mentioned above, including problems that arise in hardware and software verification, AI planning and scheduling, OR resource allocation, etc. The theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in these domains. SAT 2012 will take place in Trento, Italy, a cosmopolitan city set in a spectacular mountain scenery, and home to a world-class university and research centres. RELEVANT TOPICS =============== The topics of the conference span practical and theoretical research on SAT (in the broader sense above) and its applications, and include, but are not limited to: * Theoretical issues - Combinatorial Theory of SAT - Proof Systems and Proof Complexity in SAT - Analysis of SAT Algorithms * Solving: - Improvements of current solving procedures - Novel solving procedures, techniques and heuristics - Incremental solving * Beyond solving: - Functionalities (e.g., proofs, unsat-cores, interpolants,...) - Optimization * Applications - SAT techniques for other domains - Novel Problem Encodings - Novel Industrial Applications of SAT A more detailed description can be found on the web site. INVITED SPEAKERS ================ We are honored to announce the following invited speakers at SAT 2012: * Aaron Bradley, Boulder, USA. "SAT-based Verification with IC3: Foundations and Demands" * Donald Knuth, Stanford, USA. "Satisfiability and The Art of Computer Programming" The presence of both speakers has been confirmed, although the titles of the talks may be provisional. AFFILIATED EVENTS ================= SAT 2012 is co-located with the 2nd International SAT/SMT Summer School (June 12-15), http://satsmtschool2012.fbk.eu/. SAT 2012 will also host related events like workshops (June 16) and various competitive events. PAPER SUBMISSION ================ Papers must be edited in LATEX using the LNCS format and be submitted electronically as PDF files via EasyChair. We envisage three categories of submissions: REGULAR PAPERS. Submissions, not exceeding fourteen (14) pages, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data available with their submission. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses and strength in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. TOOL PRESENTATIONS. Submissions, not exceeding six (6) pages, should describe the implemented tool and its novel features. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented in other conferences before will be accepted only if significant and clear enhancements to the tool are reported and implemented. EXTENDED ABSTRACTS/POSTERS. Submissions, not exceeding two (2) pages, briefly introducing work in progress, student work, or preliminary results. These papers are expected to be presented as posters at the conference. Further information about paper submission, including a more detailed description of the scope and specification of the three submission categories, will be made available at SAT 2012 web page. The review process will be subject to a rebuttal phase. IMPORTANT DATES: ================ Abstract Submission: 05/02/2012 Paper Submission: 12/02/2012 Rebuttal phase: 28-30/03/2012 Final Notification: 12/04/2012 Final Version Due: 04/05/2012 SAT/SMT School: 12-15/06/2012 Workshops: 16/06/2012 Conference: 17-20/06/2012 PROCEEDINGS =========== The proceedings of SAT 2012 will be published by Springer-Verlag in the LNCS series. PROGRAM CHAIRS ============== Alessandro Cimatti -- FBK-Irst, Trento, Italy Roberto Sebastiani -- DISI, University of Trento, Italy PROGRAM COMMITTEE ================= Dimitris Achlioptas -- UC Santa Cruz, USA Fahiem Bacchus -- University of Toronto, Canada Paul Beame -- University of Washington, USA Armin Biere -- Johannes Kepler University, Austria Randal Bryant -- Carnegie Mellon University, USA Uwe Bubeck -- University of Paderborn, Germany Nadia Creignou -- Aix-Marseille Universit?, France Leonardo DeMoura -- Microsoft Research, USA John Franco -- University of Cincinnati, USA Malay Ganai -- NEC, USA Enrico Giunchiglia -- Universit? di Genova, Italy Youssef Hamadi -- Microsoft Research, UK Zyiad Hanna -- Jasper, USA Holger Hoos -- University of British Columbia, Canada Marijn Heule -- Johannes Kepler University, Austria Kazuo Iwama -- Kyoto University, Japan Oliver Kullmann -- Swansean University, UK Daniel Le Berre -- Universit? d?Artois, France Ines Lynce -- Instituto Superior Te?cnico, Portugal Panagiotis Manolios -- Northeastern University, USA Joao Marques-Silva -- University College Dublin, Ireland David Mitchell -- Simon Fraser University, Canada Alexander Nadel -- Intel, Israel Jussi Rintanen -- The Austrailan National University, Australia Lakhdar Sais -- Universite? d?Artois, France Karem Sakallah -- University of Michigan, USA Bart Selman -- Cornell University, USA Laurent Simon -- Universit? Paris 11, France Carsten Sinz -- Karlsruhe Institute of Technology, Germany Niklas Sorensson -- Chalmers University, Sweden Ofer Strichman -- Technion, Israel Stefan Szeider -- Vienna University of Technology, Austria Allen Van Gelder -- University of California, Santa Cruz, USA Toby Walsh -- University of New South Wales, Australia Xishun Zhao -- Sun Yat-Sen University, China From E.Ritter at cs.bham.ac.uk Tue Jan 17 03:45:16 2012 From: E.Ritter at cs.bham.ac.uk (Eike Ritter) Date: Tue, 17 Jan 2012 08:45:16 +0000 Subject: [TYPES/announce] Call for Participation: Midlands Graduate School 2012 Message-ID: <4F15351C.5000204@cs.bham.ac.uk> Call for Participation Midlands Graduate School in Computer Science 23-27 April 2012 School of Computer Science, University of Birmingham, UK The Midlands Graduate School (MGS) in the Foundations of Computing Science provides an intensive course of lectures on the Mathematical Foundations of Computing. It has run annually since 1999, and is hosted by the Universites of Birmingham, Leicester, and Nottingham in rotation. The lectures are aimed at PhD students, typically in their first or second year of study. However, the school is open to anyone who is interested in learning more about the mathematical foundations of computing, and all such participants are warmly welcomed. We also very much welcome students from abroad. The following courses will be offered: Introductory Courses: * Category Theory Graham Hutton (University of Nottingham) * Advanced Functional Programming Henrik Nilsson (University of Nottingham) * Typed Lambda Calculus Paul Levy (University of Birmingham) Advanced Courses: * Constructive Mathematics and Type Theory Thierry Coquand (University of Gothenburg) * Categories and Functors Uday Reddy (University of Birmingham) * Computing with Infinite Objects Martin Escardo (University of Birmingham) * Logical Relations Andrzej Murawski (University of Leicester) * Provability, fixed points and clock ticks Tadeusz Litak (University of Leicester) * Kleene Algebras Georg Struth (University of Sheffield) LOCATION The school will be held in the School of Computer Science, University of Birmingham. Birmingham is centrally located in the UK, and is easily reachable by road, rail and air (Birmingham International Airport). REGISTRATION The deadline for registration is 15 March 2012. The registration fee is ?230. ACCOMMODATION We have reserved accommodation in the ETAP-hotel for five nights for ?170. Please indicate during registration whether you would like us to reserve accommodation for you. FURTHER DETAILS Google search - MGS 2012 Web page - http://events.cs.bham.ac.uk/mgs2012 -- ------------------------------------ Dr Eike Ritter Tel.: (+44) 121 41 44772 School of Computer Science Sec.: (+44) 121 41 43711 The University of Birmingham Fax.: (+44) 121 41 44281 Edgbaston Email: E.Ritter at cs.bham.ac.uk BIRMINGHAM, B15 2TT Web: http://www.cs.bham.ac.uk England ------------------------------------ From Davide.Sangiorgi at cs.unibo.it Tue Jan 17 07:31:06 2012 From: Davide.Sangiorgi at cs.unibo.it (Davide Sangiorgi) Date: Tue, 17 Jan 2012 13:31:06 +0100 Subject: [TYPES/announce] two books on bisimulation and coinduction Message-ID: <4F156A0A.2040907@cs.unibo.it> I am pleased to announce the books: ------------------------------------------------------- Introduction to Bisimulation and Coinduction Davide Sangiorgi Cambridge University Press,260pp,ISBN:9781107003637 ------------------------------------------------------- Advanced Topics in Bisimulation and Coinduction Davide Sangiorgi and Jan Rutten (eds) Cambridge University Press,340pp,ISBN:9781107004979 ------------------------------------------------------- The first book is an introduction to bisimulation and coinduction and a precursor to the companion book on more advanced topics. Throughout the two volumes, a special emphasis is given bisimulation and processes. This because bisimulation is by far the most studied coinductive concept, and because bisimulation was discovered in Concurrency Theory and processes remain the main application area. Below are blurbs and tables of contents. For more details, including order information, see: http://www.cs.unibo.it/~sangio/IntroBook.html http://www.cs.unibo.it/~sangio/AdvancedBook.html Best regards, Davide INTRODUCTION TO BISIMULATION AND COINDUCTION ======================================================= BLURB (from the cover page) Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction, and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best-known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, and so on. This book presents bisimulation and coinduction: the fundamental concepts and techniques, and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis. CONTENTS List of Illustrations ix List of Tables xi 1 General introduction 1 1.1 Why bisimulation and coinduction 1 1.2 Objectives of the book 4 1.3 Use of the book 5 1.4 Structure of the book 6 1.5 Basic definitions and mathematical notations 7 2 Towards bisimulation 11 2.1 From functions to processes 11 2.2 Interaction and behaviour 13 2.3 Equality of behaviours 16 2.4 Bisimulation 19 3 Coinduction and the duality with induction 28 3.1 Examples of induction and coinduction 30 3.2 The duality 37 3.3 Fixed points in complete lattices 40 3.4 Inductively and coinductively defined sets 45 3.5 Definitions by means of rules 47 3.6 The examples, continued 50 3.7 Other induction and coinduction principles 57 3.8 Constructive proofs of the existence of least and greatest fixed points 66 3.9 Continuity and cocontinuity, for rules 71 3.10 Bisimilarity as a fixed point 73 3.11 Proofs of membership 79 3.12 Game interpretations 83 3.13 The bisimulation game 86 3.14 A simpler bisimulation game 86 4 Algebraic properties of bisimilarity 89 4.1 Basic process operators 90 4.2 CCS 92 4.3 Examples of equalities 94 4.4 Some algebraic laws 96 4.5 Compositionality properties 98 4.6 Algebraic characterisation 103 5 Processes with Internal Activities 108 5.1 Weak LTSs and weak transitions 109 5.2 Weak bisimulation 110 5.3 Divergence 115 5.4 Rooted weak bisimilarity 118 5.5 Axiomatisation 120 5.6 On the bisimulation game for internal moves 123 5.7 Bisimulation with divergence 124 5.8 Dynamic bisimulation 126 5.9 Branching bisimulation, eta-bisimulation, and delay bisimulation 126 6 Other approaches to behavioural equivalences 133 6.1 A testing scenario 135 6.2 Bisimulation via testing 136 6.3 Tests for weak bisimilarities 144 6.4 Processes as testers 146 6.5 Testing preorders 147 6.6 Examples 149 6.7 Characterisations of the may, must, and testing relations 150 6.8 Testing in weak LTSs 152 6.9 Refusal equivalence 156 6.10 Failure equivalence 157 6.11 Ready equivalence 159 6.12 Equivalences induced by SOS formats 160 6.13 Non-interleaving equivalences 165 6.14 Varieties in concurrency 165 7 Refinements of simulation 168 7.1 Complete simulation 168 7.2 Ready simulation 169 7.3 2-nested simulation equivalence 171 7.4 Weak simulations 173 7.5 Coupled simulation 174 7.6 The equivalence spectrum 180 8 Basic observables 182 8.1 Labelled bisimilarities: examples of problems 184 8.2 Reduction congruence 185 8.3 Barbed congruence 188 8.4 Barbed equivalence 191 8.5 The weak barbed relations 192 8.6 Reduction-closed barbed congruence 194 8.7 Final remarks 196 Appendix 1 Solutions to selected exercises 199 List of Notations 231 Bibliography 235 Index 244 ADVANCED TOPICS IN BISIMULATION AND COINDUCTION ========================================================= BLURB (from the cover page) Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material. CONTENTS Preface 6 Contributing authors 9 1 Origins of Bisimulation and Coinduction 11 Davide Sangiorgi 1.1 Introduction 11 1.2 Bisimulation in Modal Logic 13 1.3 Bisimulation in Computer Science 17 1.4 Set Theory 25 1.5 The introduction of fixed points in Computer Science 36 1.6 Fixed-point theorems 39 Bibliography 41 2 An introduction to (co)algebra and (co)induction 48 Bart Jacobs and Jan Rutten 2.1 Introduction 48 2.2 Algebraic and coalgebraic phenomena 52 2.3 Inductive and coinductive definitions 57 2.4 Functoriality of products, coproducts and powersets 60 2.5 Algebras and induction 63 2.6 Coalgebras and coinduction 76 2.7 Proofs by coinduction and bisimulation 85 2.8 Processes coalgebraically 88 2.9 Trace Semantics, coalgebraically 96 2.10 Exercises 100 Bibliography 104 3 The Algorithmics of Bisimilarity 109 Luca Aceto, Anna Ingolfsdottir, and Jiri Srba 3.1 Introduction 109 3.2 Classic algorithms for bisimilarity 112 3.3 The complexity of checking bisimilarity over finite processes 130 3.4 Decidability results for bisimilarity over infinite-state systems 151 3.5 The use of bisimilarity checking in verification and tools 166 Bibliography 173 4 Bisimulation and Logic 182 Colin Stirling 4.1 Introduction 182 4.2 Modal logic and bisimilarity 184 4.3 Bisimulation invariance 188 4.4 Modal mu-calculus 193 4.5 Monadic second-order logic and bisimulation invariance 199 Bibliography 205 5 Howe's Method for Higher-Order Languages 206 Andrew Pitts 5.1 Introduction 206 5.2 Call-by-value lambda-calculus 209 5.3 Applicative (bi)similarity for call-by-value lambda-calculus 210 5.4 Congruence 213 5.5 Howe's construction 216 5.6 Contextual equivalence 219 5.7 The transitive closure trick 223 5.8 CIU-equivalence 227 5.9 Call-by-name equivalences 234 5.10 Summary 238 5.11 Assessment 239 Bibliography 240 6 Enhancements of the bisimulation proof method 243 Damien Pous and Davide Sangiorgi 6.1 The need for enhancements 245 6.2 Examples of enhancements 249 6.3 A theory of enhancements 259 6.4 Congruence and up to context techniques 270 6.5 The case of weak bisimilarity 279 6.6 A summary of up to techniques for bisimulation 295 Bibliography 298 7 Probabilistic bisimulation 300 Prakash Panangaden 7.1 Introduction 300 7.2 Discrete systems 305 7.3 A Rapid Survey of Measure Theory 310 7.4 Labelled Markov Processes 316 7.5 Giry's monad 318 7.6 Probabilistic Bisimulation 320 7.7 Logical Characterization 322 7.8 Probabilistic cocongruences 326 7.9 Kozen's coinduction principle 330 7.10 Conclusions 331 Bibliography 334 From afelty at site.uOttawa.ca Tue Jan 17 10:12:31 2012 From: afelty at site.uOttawa.ca (Amy Felty) Date: Tue, 17 Jan 2012 10:12:31 -0500 Subject: [TYPES/announce] ITP 2012: Final Call for Papers Message-ID: <4F158FDF.6080700@site.uOttawa.ca> Final Call for Papers ITP 2012: 3rd International Conference on Interactive Theorem Proving 13-16 August 2012, Princeton, New Jersey, USA http://itp2012.cs.princeton.edu/ 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), and the second meeting took place in Nijmegen, The Netherlands, in August 2011. ITP 2012 will take place in Princeton, New Jersey, USA on 13-16 August 2012 with two workshops preceding the main conference: The Isabelle Workshop 2012 (organized by Tobias Nipkow, Larry Paulson, and Makarius Wenzel) and the 4th Coq Workshop (organized by Adam Chlipala). 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.); industrial applications of theorem proving; 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=itp2012 Papers may be no longer than 16 pages and are to be submitted in PDF using the Springer LNCS format. Instructions and style files may be found by going to http://www.springer.com/computer/lncs/lncs+authors and downloading the files llncs2e.zip and typeinst.zip. 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 and are 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. The submission page contains a corresponding file upload function. 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. Important dates: Abstract submission deadline: 6 February 2012 Paper submission deadline: 13 February 2012 Notification of paper decisions: 13 April 2012 Final versions due from authors: 5 May 2012 Pre-conference workshops: 12 August 2012 Conference dates: 13-16 August 2012 Web page: http://itp2012.cs.princeton.edu/ Invited Speakers: Gilles Barthe (IMDEA, Spain) Lawrence Paulson (Univ. of Cambridge, UK) Andre Platzer (Carnegie Mellon Univ., USA) Invited Tutorial: Andrew Gacek (Rockwell Collins, USA) General Co-Chairs: Andrew Appel (Princeton Univ., USA) Lennart Beringer (Princeton Univ., USA) Program Co-Chairs: Lennart Beringer (Princeton Univ., USA) Amy Felty (Univ. of Ottawa, Canada) Program Committee: Andreas Abel (LMU Munich, Germany) Nick Benton (Microsoft Research Cambridge, UK) Stefan Berghofer (secunet Security Networks AG, Germany) Lennart Beringer (Co-Chair, Princeton Univ., USA) Yves Bertot (INRIA Sophia-Antipolis, France) Adam Chlipala (MIT, USA) Ewen Denney (NASA, USA) Peter Dybjer (Chalmers Univ. of Technology, Sweden) Amy Felty (Co-Chair, Univ. of Ottawa, Canada) Herman Geuvers (Radboud Univ. Nijmegen, The Netherlands) Georges Gonthier (Microsoft Research Cambridge, UK) Jim Grundy (Intel Corp., USA) Elsa Gunter (Univ. Illinois at Urbana-Champaign, USA) Hugo Herbelin (INRIA Roquencourt-Paris, France) Joe Hurd (Galois, Inc., USA) Reiner H?hnle (Chalmers Univ. of Technology, Sweden) Matt Kaufmann (Univ. of Texas at Austin, USA) Gerwin Klein (NICTA, Australia) Assia Mahboubi (INRIA Saclay, France) Conor McBride (Univ. of Strathclyde, UK) Alberto Momigliano (Univ. of Milan, Italy) Magnus O. Myreen (Univ. of Cambridge, UK) Tobias Nipkow (TU Munich, Germany) Sam Owre (SRI, USA) Christine Paulin-Mohring (Univ. Paris-Sud, France) David Pichardie (INRIA Rennes, France) Brigitte Pientka (McGill Univ., Canada) Randy Pollack (Harvard Univ., USA) Julien Schmaltz (Open Univ. of the Netherlands, The Netherlands) Bas Spitters (Radboud Univ. Nijmegen, The Netherlands) Sofiene Tahar (Concordia Univ., Canada) Makarius Wenzel (Univ. Paris-Sud, France) From david.delahaye at cnam.fr Wed Jan 18 07:16:14 2012 From: david.delahaye at cnam.fr (david.delahaye at cnam.fr) Date: Wed, 18 Jan 2012 13:16:14 +0100 (CET) Subject: [TYPES/announce] Second CALL FOR PAPERS FM 2012 Message-ID: <52413.163.173.229.32.1326888974.squirrel@webmail.cnam.fr> [Apologies if you receive multiple copies of this message] Second CALL FOR PAPERS FM 2012 ********************************************************************** 18TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS August 27 - 31, 2012 CNAM, Paris, France http://fm2012.cnam.fr ********************************************************************** IMPORTANT DATES: Submission: March 5th, 2012 Notification: May 7th, 2012 Camera ready: June 4th, 2012 SCOPE: FM 2012 is the eighteenth in a series of symposia organized by Formal Methods Europe, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The symposia have been notably successful in bringing together innovators and practitioners in precise mathematical methods for software and systems development, industrial users as well as researchers. Submissions are welcomed in the form of original papers on research and industrial experience, proposals for workshops and tutorials, entries for the exhibition of software tools and projects, and reports on ongoing doctoral work. The FM 2012 Symposium will be based around the theme Interdisciplinary Formal Methods It will have the goal of highlighting the development and application of formal methods in connection with a variety of disciplines such as medicine, biology, human cognitive modelling, human automation interactions and aeronautics, among others. FM 2012 particularly welcomes papers on techniques, tools and experiences in interdisciplinary frameworks, as well as on experience with practical applications of formal methods in industrial and research settings, experimental validation of tools and methods as well as construction and evolution of formal methods tools. The broad topics of interest for FM 2012 include but are not limited to: Interdisciplinary formal methods: techniques, tools and experiences demonstrating formal methods in interdisciplinary frameworks; we encourage submissions involving formal methods related to maintenance, human automation interaction, human in the loop, system engineering, medicine and biology. Formal methods in practice: industrial applications of formal methods, experience with introducing formal methods in industry, tool usage reports, experiments with challenge problems. Authors are encouraged to explain how the use of formal methods has overcome problems, lead to improvements in design or provided new insights. Tools for formal methods: advances in automated verification and model-checking, integration of tools, environments for formal methods, experimental validation of tools. Authors are encouraged to demonstrate empirically that the new tool or environment advances the state of the art. Role of formal methods in software and systems engineering: development processes with formal methods, usage guidelines for formal methods, method integration. Authors are encouraged to demonstrate that process innovations lead to qualitative or quantitative improvements. Theoretical foundations: all aspects of theory related to specification, verification, refinement, and static and dynamic analysis. Authors are encouraged to explain how their results contribute to the solution of practical problems with methods or tools. Teaching formal methods: original contributions that provide insight, evaluations and suggestions for courses of action regarding the teaching of formal methods, including teaching experiences, educational resources, the integration of formal methods into the curriculum, the definition of a formal methods body of knowledge, etc. Authors are encouraged to provide some form of evaluation and assessment of the content and approach in the teaching being reported. PAPER SUBMISSION Papers will be evaluated by at least three members of the Programme Committee. They should be in Springer LNCS format and describe, in English, original work that has not been published or submitted elsewhere. PDF versions of papers should be submitted through the FM 2012 EasyChair web site: https://www.easychair.org/account/signin.cgi?conf=fm2012 We solicit two categories of papers: Regular papers not exceeding 15 pages (including appendices), describing fully developed work. Authors of papers reporting experimental work are strongly encouraged to make their experimental results available for use by reviewers. Similarly, case study papers should describe significant case studies and the complete development should be made available for use by reviewers. Tools papers of a maximum of 4 pages should describe an operational tool and its contributions; 2 additional pages of appendices are allowed that will not be included in the proceedings. Tool papers should explain enhancements made compared to previously published work. A tool paper need not present the theory behind the tool but can focus more on its features, and how it is used, with screen shots and examples. Authors of tools papers should make their tool available for use by reviewers. PUBLICATION Accepted papers will be published in the Symposium Proceedings, to appear in Springer's Lectures Notes in Computer Science. IMPORTANT DATES: Submission: March 5th, 2012 Notification: May 7th, 2012 Camera ready: June 4th, 2012 GENERAL CHAIRS: Kamel Barkaoui - Cedric, Cnam Paris B?atrice B?rard - LIP6, University Pierre et Marie Curie PC CHAIRS: Dimitra Giannakopoulou, NASA Ames, Research Center,Moffett Field Dominique M?ry, LORIA & Universit? Henri Poincar? Nancy 1 PROGRAM COMMITTEE: Yamine Ait Ameur, IRIT/ENSEEIHT France Keijiro Araki, Kyushu University, Japan Jos Baeten, CWI Amsterdam, The Netherlands Howard Barringer, The University of Manchester, UK Saddek Bensalem, University Joseph Fourier, France Bruno Blanchet, LIENS, France Ahmed Bouajjani, LIAFA, University of Paris 7, France Patricia Bouyer, LSV, CNRS & ENS Cachan, France Victor Braberman, Universidad de Buenos Aires, Argentina Michael Butler, University of Southampton, UK Andrew Butterfield, Trinity College Dublin, Ireland Ana Cavalcanti, University of York, UK Krishnendu Chatterjee, Institute of Science and Technology , Austria Marsha Chechik, University of Toronto, Canada Yu-Fang Chen, Academia Sinica, Taiwan Leonardo De Moura, Microsoft Research, USA Dino Distefano, Queen Mary, University of London, UK Matt Dwyer, University of Nebraska, USA Bernd Finkbeiner, Saarland University, Germany John Fitzgerald, Newcastle University, UK (chair) Dimitra Giannakopoulou, NASA Ames, USA Stefania Gnesi, ISTI-CNR, Italy Patrice Godefroid, Microsoft Research, USA Ganesh Gopalakrishnan, University of Utah, USA Kim Guldstrand Larsen, Aalborg University, Denmark Klaus Havelund, JPL, California Institute of Technology, USA Ian J. Hayes, University of Queensland, Australia Matthew Hennessy, Trinity College Dublin, Ireland Jane Hillston, University of Edinburgh, UK Bart Jacobs, ICIS, Radboud University Nijmegen, The Netherlands Claude Jard, ENS Cachan Bretagne, France Panagiotis Katsaros, Aristotle University of Thessaloniki, Greece Sarfraz Khurshid, The University of Texas at Austin, USA Daniel Kroening, Oxford University, UK Marta Kwiatkowska, Oxford University, UK Pascale Le Gall, Universit? d'Evry, France Rustan Leino, Microsoft Research, USA Michael Leuschel, University of D?sseldorf, Germany Zhiming Liu, United Nations University - IIST, Macao Tom Maibaum, McMaster University, Canada Rupak Majumdar, Max Planck, Germany Annabelle Mciver, Macquarie University, Australia (chair) Dominique Mery, Universit? Henri Poincar? Nancy 1 & LORIA, France Cesar Munoz, NASA, USA Fernando Orejas, UPC, Spain Isabelle Perseil, Inserm, France Andre Platzer, Carnegie Mellon University, USA Shengchao Qin, Teesside University, UK S Ramesh, General Motors R&D, India Jean-Francois Raskin, ULB, Belgium Neha Rungta, SGT/NASA Ames, USA Augusto Sampaio, Federal University of Pernambuco, Brazil Bernhard Schaetz, TU M?nchen, Germany Wolfram Schulte, Microsoft Research, USA Kaisa Sere, Abo Akademi University, Finland Bernhard Steffen, TU Dortmund, Germany Kenji Taguchi, AIST, Japan Francois Vernadat, LAAS-CNRS INSA, France Willem Visser, Stellenbosch University, South Africa Michael Whalen, University of Minnesota, USA Conservatoire National des Arts et M?tiers - 292 rue Saint-Martin ********************************************************************** This call for papers and additional information about the conference can be found at http://fm2012.cnam.fr. For information regarding the conference you can contact: fm2012 at cnam.fr. **************** From bcpierce at cis.upenn.edu Wed Jan 18 09:47:18 2012 From: bcpierce at cis.upenn.edu (Benjamin C. Pierce) Date: Wed, 18 Jan 2012 09:47:18 -0500 Subject: [TYPES/announce] Postdoc openings at University of Pennsylvania Message-ID: <7920801E-6332-414C-BDE3-E24E2D4492B4@cis.upenn.edu> Applications are invited for postdoc positions with these projects at the University of Pennsylvania (full details below): - CRASH/SAFE: clean-slate redesign of the HW/OS/PL stack - MRC/SOUND: foundations for secure networking - DP: Putting differential privacy to work The positions are for one year in the first instance, with possible renewal for one or more additional years. Starting date is negotiable; salary commensurate with experience. Applications from women and members of other under-represented groups are particularly welcome. Penn's department of Computer and Information Science offers a vibrant research environment with a long tradition of excellence in programming languages and related areas. We are located in Philadelphia, a city that offers a rich array of cultural, historical, and nightlife attractions, parks and outdoor recreation, convenient public transportation, and affordable housing. To apply, please send a CV, research statement, and the names of four people who can be asked for letters of reference to Benjamin Pierce (bcpierce at cis.upenn.edu). --------------------------------------------------- CRASH/SAFE http://www.crash-safe.org/ The SAFE project is part of CRASH, a DARPA-funded effort to design new computer systems that are highly resistant to cyber-attack, can adapt after a successful attack in order to continue rendering useful services, can learn from previous attacks how to guard against and cope with future attacks, and can repair themselves after attacks have succeeded. It offers a rare opportunity to rethink the hardware / OS / software stack from a completely clean slate, with no legacy constraints whatsoever. Specifically, we aim to build a suite of modern operating system services that embodies and supports fundamental security principles?including separation of privilege, least privilege, and mutual suspicion?down to its very bones, without compromising performance. Achieving this goal demands an integrated effort focusing on (1) processor architectures, (2) operating systems, (3) formal methods, and (4) programming languages and compilers -- coupled with a co-design methodology in which all critical system layers are designed together, with a ruthless insistence on simplicity, security, and verifiability at every level. The ideal candidate will have a Ph.D. in Computer Science, a combination of strong theoretical and practical interests, and expertise in two or more of the following areas: programming languages, security, formal verification, operating systems, and hardware design. This project is joint with Harvard, Northeastern, and BAE Systems. --------------------------------------------------- MRC/SOUND http://sound.cis.upenn.edu/ The goal of the SOUND project is to design a distributed system that can offer cloud-style services but is highly resilient to cyber-attacks. Rather than focusing on specific known attacks, we would like to provide resiliency against a broad range of known and unknown (Byzantine) attacks; for instance, an adversary could compromise a certain number of nodes and modify them in some arbitrary way. Our goal is to detect and mitigate such attacks whenever possible, e.g., by reconfiguring the system to exclude any compromised nodes. We approach this problem using the principle of mutual suspicion: Nodes continually monitor each other and check for unusual actions or changes in behavior that could be related to an attack. However, since we are assuming a very strong adversary, the bar for a successful solution is high: We require a strong, provable guarantee that the adversary cannot circumvent the system, as well as a practical design that can efficiently provide this guarantee. We expect that the SOUND project will build on results from the CRASH effort at the level of individual nodes; however, SOUND goes beyond CRASH by considering an entire distributed system with a heterogeneous mix of nodes, many of which may not be operating in a secure environment. The ideal candidate will have a Ph.D. in Computer Science, a combination of theoretical interests and strong system-building skills, as well as expertise in two or more of the following areas: distributed systems, programming languages, networking, and computer security. This project is joint with Portland State University and BAE Systems. --------------------------------------------------- Putting Differential Privacy to Work http://privacy.cis.upenn.edu/ A wealth of data about individuals is constantly accumulating in various databases in the form of medical records, social network graphs, mobility traces in cellular networks, search logs, and movie ratings, to name only a few. There are many valuable uses for such datasets, but it is difficult to realize these uses while protecting privacy. Even when data collectors try to protect the privacy of their customers by releasing anonymized or aggregated data, this data often reveals much more information than intended. To reliably prevent such privacy violations, we need to replace the current ad-hoc solutions with a principled data release mechanism that offers strong, provable privacy guarantees. Recent research on DIFFERENTIAL PRIVACY has brought us a big step closer to achieving this goal. Differential privacy allows us to reason formally about what an adversary could learn from released data, while avoiding the need for many assumptions (e.g. about what an adversary might already know), the failure of which have been the cause of privacy violations in the past. However, despite its great promise, differential privacy is still rarely used in practice. Proving that a given computation can be performed in a differentially private way requires substantial manual effort by experts in the field, which prevents it from scaling in practice. This project aims to put differential privacy to work---to build a system that supports differentially private data analysis, can be used by the average programmer, and is general enough to be used in a wide variety of applications. Such a system could be used pervasively and make strong privacy guarantees a standard feature wherever sensitive data is being released or analyzed. Specific contributions will include ENRICHING THE FUNDAMENTAL MODEL OF DIFFERENTIAL PRIVACY to address practical issues such as data with inherent correlations, increased accuracy, privacy of functions, or privacy for streaming data; DEVELOPING A DIFFERENTIALLY PRIVATE PROGRAMMING LANGUAGE, along with a compiler that can automatically prove programs in this language to be differentially private, and a runtime system that is hardened against side-channel attacks; and SHOWING HOW TO APPLY DIFFERENTIAL PRIVACY IN A DISTRIBUTED SETTING in which the private data is spread across many databases in differ ent administrative domains, with possible overlaps, heterogeneous schemata, and different expectations of privacy. The long-term goal is to combine ideas from differential privacy, programming languages, and distributed systems to make data analysis techniques with strong, provable privacy guarantees practical for general use. The themes of differential privacy are also being integrated into Penn's new undergraduate curriculum on Market and Social Systems Engineering. The ideal candidate for this position will have a Ph.D. in Computer Science, a combination of strong theoretical and practical interests, and expertise in at least two of: programming languages, theoretical computer science, and systems software. From nathan.collins at gmail.com Wed Jan 18 12:22:54 2012 From: nathan.collins at gmail.com (Nathan Collins) Date: Wed, 18 Jan 2012 12:22:54 -0500 Subject: [TYPES/announce] PhD program at Portland State accepting applications for Fall 2012 Message-ID: Hi, Portland State University has a lot going on in functional programming. The Fall 2012 PhD program application deadline is March 1 for US students and February 1 for international students: http://cs.pdx.edu/programs/admissions FP related work at Portland: - Tim Sheard is working on the Trellys project: design and implementation (in Haskell) of a "practical" dependently typed programming language. Joint project with Aaron Stump at UIowa and Stephanie Weirich at UPenn. Here "practical" means intended for programming more than for theorem proving. Supports theorem proving, but also logically dubious features like general recursion and Type in Type. The key design issue is the interplay between safe and unsafe features. Project repo: https://code.google.com/p/trellys/ - Andrew Tolmach, Mark Jones, and James Hook are working on HASP: design and implementation (in Haskell) of a functional programming language for high-assurance systems programming. Project page: http://hasp.cs.pdx.edu/ - Sergio Antoy is working on narrowing in functional logic programming and the Curry FLP language. Intro to functional logic programming: http://web.cecs.pdx.edu/~antoy/homepage/publications/cacm/paper.pdf PAKCS Curry implementation: http://www.informatik.uni-kiel.de/~pakcs/ - Arthur Peters, a student of Sergio?s, is working on a new implementation of Curry based on a simplified graph rewriting model of functional logic computation. A paper about it and the prototype implementation are available at: http://web.cecs.pdx.edu/~amp4/vialois - Andrew Black is a co-author on a recent paper on Haskell for the Cloud: https://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/ Other FP resources in Portland: - Galois, located a half mile from the computer science department, hosts many "Tech Talks", open to the public: http://corp.galois.com/blog/ - Functional programming study group: http://pdxfunc.org/ Living in Portland: - Portland is a very popular US city, known for beer, bikes, music, and street food: http://en.wikipedia.org/wiki/Portland_Oregon (wikipedia is blacked out today) Cheers, -nathan (PhD student in programming languages) From mwh at cs.umd.edu Wed Jan 18 19:31:59 2012 From: mwh at cs.umd.edu (Michael Hicks) Date: Wed, 18 Jan 2012 19:31:59 -0500 Subject: [TYPES/announce] Call for Papers: HotSWUp IV Message-ID: <24DA005E-F8BD-4D54-9119-6426A2C06392@cs.umd.edu> [Note to TYPES readers: types/logics for specifying and reasoning about software upgrades are just one way that this community could contribute to this area; submit your new ideas!] CALL FOR PAPERS HotSWUp 2012: Fourth Workshop on Hot Topics in Software Upgrades ICSE 2012 Workshop Zurich, Switzerland June 3, 2012 http://www.hotswup.org Submission deadline: February 17, 2012 OBJECTIVES Actively-used software systems are upgraded regularly to incorporate bug fixes and security patches or to keep up with evolving requirements. Whether upgrades are applied offline or online, they significantly impact the system's performance and reliability. Recently-introduced commercial products aim to address various aspects of this problem; however, recent studies and a large body of anecdotal evidence suggest that upgrades remain failure-prone, tedious, and expensive. The goal of HotSWUp Workshop is to identify cutting-edge research for supporting software upgrades that are flexible, efficient, robust, and easy to specify and apply. Many diverse research areas are concerned with building large, evolving, highly-available systems. In particular, there has been a recent surge of interest on software upgrades in all of these areas, as reflected in the recent issues of conferences such as ICSE, ICDE, FSE, SIGMOD, OOPSLA, PLDI, SOSP, and OSDI. By seeking contributions from both academic researchers and industry practitioners, HotSWUp aims to combine novel ideas with experience from upgrading real systems. The aim of HotSWUp is to bring together people from different communities that are working on software upgrades, which is the reason for having hosted the workshop at different conferences. In the past, HotSWUp has received contributions from many of these areas, in particular, from the areas of databases, distributed systems, and programming languages. Now, HotSWUp wants to actively involve the software engineering community. The present workshop aims to build on the successes of HotSWUp'08 (co-located with OOPSLA), HotSWUp'09 (OOPSLA), and HotSWUp '11 (ICDE) where the paper presentations and lively discussions attracted a diverse audience of researchers. The topics of interest include, but are not limited to: - Software engineering / programming language / middleware / operating system support for software upgrades. - Improving the reliability of upgrades (e.g., support for upgrade validation and for rollback after failures). - Verification methods and tools for software upgrades. - Software upgrades in product lines. - Support for system or data restructuring (e.g., evolving APIs, changes to database schemas). - Identifying dependencies between components and guaranteeing safe interactions among mixed versions. - Coordinating and disseminating upgrades in large-scale distributed systems. - Software upgrades and the cloud computing infrastructure. - Tools for preparing, testing, and applying software upgrades. - Software upgrades in the software maintenance process. - Human factors in software upgrades (e.g., usability of upgrading tools, common operator mistakes). SUBMISSION GUIDELINES We are interested in papers that address practical as well as theoretical aspects of software upgrades from large scale to embedded applications. Preferably, submissions should fall into one of the following categories: - Suggest how a successful approach can be applied in a different context (e.g., static dependency analysis applied to distributed-system upgrades). - Refute an old assumption about software upgrades (e.g., by presenting negative results). - Describe a new problem or propose a novel solution to an old problem. - Present empirical evidence related to the practical implementation of software upgrades. Papers must not exceed 5 pages, in IEEE camera-ready format. Templates can be found at http://www.ieee.org/web/publications/pubservices/confpub/AuthorTools /conferenceTemplates.html Papers must be submitted electronically at http://www.hotswup.org. IMPORTANT DATES Paper submissions: February 17, 2012 Notifications to authors: March 19, 2012 Camera-ready copies: March 29, 2012 Workshop date June 3, 2012 PROGRAM COMMITTEE Don Batory, The University of Texas at Austin Walter Cazzola, Universit? degli Studi di Milano Danny Dig, University of Illinois at Urbana-Champaign (co-organizer) Michael Hicks, University of Maryland Bo N?rregaard J?rgensen, University of Southern Denmark Julia Lawall, INRIA/LIP6, Paris-Rocquencourt, France Brice Morin, SINTEF ICT, Oslo, Norway Iulian Neamtiu, University of California, Riverside Tien N Nguyen, Iowa State University Manuel Oriol, ABB Corporate Research Michael Wahler, ABB Corporate Research (co-organizer, main contact) Robert J. Walker, University of Calgary Pen-Chung Yew, University of Minnesota at Twin Cities MORE INFORMATION Visit the workshop's homepage at: http://www.hotswup.org From tarmo at cs.ioc.ee Thu Jan 19 04:20:27 2012 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Thu, 19 Jan 2012 11:20:27 +0200 Subject: [TYPES/announce] ETAPS 2012 call for participation, early reg deadline 29 Jan. 2012 Message-ID: <20120119112027.63025d04@duality> [We apologise for multiple copies.] Things to notice: - The programme of the main conferences of ETAPS 2012 is on the web. - Early registration is until Sunday, 29 January 2012. - Special rates and/or block bookings for ETAPS 2012 participants at a number of central hotels also expire Sunday, 29 January 2012. We strongly advise that many participants book their accommodation before that date. ****************************************************************** CALL FOR PARTICIPATION: ETAPS 2012 European Joint Conferences on Theory And Practice of Software March 24 - April 1, 2012 Tallinn, Estonia http://www.etaps.org/2012 ****************************************************************** -- 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 (one of them, POST, being new in 2012), accompanied by satellite workshops. ETAPS 2012 is already the fifteenth 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 * New! POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED TALKS -- * Unifying speaker 1: Bruno Blanchet (INRIA / ENS / CNRS, France). Security protocol verification: Symbolic and computational models * Unifying speaker 2: Georg Gottlob (Univ. of Oxford, UK). TBA * CC invited speaker: Francois Bodin (IRISA and CAPS Entreprise, France). Programming heterogeneous many-cores using directives * ESOP invited speaker: Bjarne Stroustrup (Texas A&M Univ., USA) Foundations of C++ * FASE invited speaker: Wil van der Aalst (Techn. Univ. of Eindhoven, Netherlands). Distributed process discovery and conformance checking * FoSSaCS invited speaker: Glynn Winskel (Univ. of Cambridge, UK). Bicategories of concurrent games * POST invited speaker: Cynthia Dwork (Microsoft Research, Silicon Valley, USA). Differential privacy and the power of (formalizing) negative thinking * TACAS invited speaker: Holger Hermanns (Saarland University, Germany). Quantitative models for a not so dumb grid -- CONTRIBUTED PAPERS See the accepted paper lists and the programme of the main conferences at the conference website. -- SATELLITE EVENTS -- 21 satellite workshops will take place before or after ETAPS 2012. BX, FICS, FIT, GT-VMT, iWIGP, MBT, MSFP, VSSE, WRLA will take place in the weekend on 24-25 March 2012. ACCAT, AIPA, Bytecode, CMCS, DICE, FESCA, Graphite, HAS, LDTA, Linearity, PLACES, QAPL are scheduled for 31 March-1 April 2012. -- REGISTRATION Early registration is until Sunday, 29 January 2012. -- ACCOMMODATION Tallinn has developed ample hotel capacity. We request that participants arrange their accommodation on their own. We have negotiated special rates and made block bookings with a selection of centrally located hotels. A number of those expire Sunday, 29 January 2012. We strongly advise that many participants book their accommodation before that date. -- HOST CITY -- Tallinn, a city of 412,000 people, is the capital and largest city of Estonia, a small EU member country in Northern Europe, bordering Russia to the East and Latvia to the south. Located in the north of the country, on the southern shores of the Gulf of Finland, opposite Helsinki in Finland, Tallinn is most well known for its picturesque medieval Old Town, a UNESCO World Heritage site. But it also has a vivid cultural scene, outperforming most European centres of similar size. In 2011, Tallinn, along with Turku in Finland, was the Cultural Capital of Europe. Tallinn is easy to travel to. Estonia is part of Schengen and the Eurozone. The Lennart Meri International Airport of Tallinn (TLL) is only 4 kms from the city centre. -- ORGANIZERS * General chair: Tarmo Uustalu * Workshops chair: Keiko Nakata * Organizing committee: James Chapman, Juhan Ernits, Tiina Laasma, Monika Perkmann and colleagues * Host institution: Institute of Cybernetics at Tallinn University of Technology -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps12 at cs.ioc.ee. From pmt6sbc at maths.leeds.ac.uk Thu Jan 19 06:29:44 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Thu, 19 Jan 2012 11:29:44 GMT Subject: [TYPES/announce] Turing Centenary Conference (CiE 2012) - Final submission arrangements Message-ID: <201201191129.q0JBTihX013182@maths.leeds.ac.uk> --------------------------------------------------------------------------- FINAL SUBMISSION INFORMATION --------------------------------------------------------------------------- Turing Centenary Conference (CiE 2012) University of Cambridge, UK June 18 to 23, 2012 http://www.cie2012.eu All final submissions needed by 27 JANUARY 2012* * With CiE 2012 submissions running at unprecedented levels, and the organisers receiving numerous requests for extensions: The server for submissions to the Turing Centenary Conference: CiE 2012 will remain open for new submissions until the end of Sunday, 22 January. Revised versions of papers may be submitted until the end of Friday, 27 January as long as an abstract has been submitted by the end of Sunday, 22 January. --------------------------------------------------------------------------- Computability in Europe provides the largest international conference dealing with the full spectrum of computability-related research. The 2012 Turing Centenary Conference will be especially broad, bringing together researchers from the full community influenced by the seminal work of Turing and his contemporaries. For details of the full range of topics, we refer to the original Call for Papers at: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?42 Best wishes Anuj Dawar and Barry Cooper co-chairs, Turing Centenary Conference __________________________________________________________________________ CiE 2012: Turing Centenary Conference http://www.cie2012.eu ALAN TURING YEAR http://www.turingcentenary.eu AlanTuringYear on Twitter http://twitter.com/AlanTuringYear __________________________________________________________________________ From ggrov at staffmail.ed.ac.uk Thu Jan 19 10:58:33 2012 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Thu, 19 Jan 2012 15:58:33 +0000 Subject: [TYPES/announce] VSTTE 2012: Final Call for Participation Message-ID: ***************************************************************** *** Final Call for Participation *** VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ ****************************************************************** The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition has been held and the winner will be announced during the conference. KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research PROGRAM The full program is available at the conference web site: https://sites.google.com/site/vstte2012/program VENUE The conference is co-located with POPL and will be held at the Sheraton Society Hill Hotel in Philadelphia's historic district. For hotel rate details and booking please see the POPL webpage: http://www.cse.psu.edu/popl/12/ REGISTRATION Registration is handled by the POPL registration. For rates, please see http://www.cse.psu.edu/popl/12/ and for registration please follow this link: https://regmaster3.com/2012conf/POPL12/register.php Please note the very low registration fee for students! SPONSORS NSF Microsoft Research -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From manuel.mazzara at newcastle.ac.uk Thu Jan 19 12:34:26 2012 From: manuel.mazzara at newcastle.ac.uk (Manuel Mazzara) Date: Thu, 19 Jan 2012 17:34:26 +0000 Subject: [TYPES/announce] 1s International Workshop on Trustworthy Multi-Agent Systems (TruMAS'12) Message-ID: <64AAE0CF1D20CD4185CC828F6A8EBA307AD9BB7589@EXSAN01.campus.ncl.ac.uk> 1st International Workshop on Trustworthy Multi-Agent Systems (TruMAS'12) KES-AMSTA 2012 Special Session, Dubrovnik, Croatia, 25-27 June 2012 http://www2.imm.dtu.dk/~ndra/TruMAS12 Proceedings published by Springer-Verlag in a volume of LNCS/LNAI. IMPORTANT DATES 5 February 2012 Submission of papers 22 February 2012 Notification of acceptance 7 March 2012 Camera ready 25-27 June 2012 TruMAS and KES-AMSTA WORKSHOP AIM AND SCOPE The rapid development of computer-based technologies has made computers more and more complex and ubiquitous. Many computer-based systems are in charge of critical tasks such as, to mention only a few, the management of financial and medical databases, the monitoring of nuclear plants, the flying of airplanes, etc. Multi-agent systems (MAS) have been proposed as a new paradigm for conceptualizing, designing, and implementing open and distributed software systems. The foundational idea behind a Multi-Agent System is to have a loosely coupled network of software agents (i.e., sophisticated computer programs that act autonomously on behalf of their users) which interact to solve problems that are beyond the individual capacities or knowledge of each single agent. Therefore, it is not surprisingly MAS have received a lot of attention as reference computing paradigm to tackle complexity in modern computer-based systems. However, the complexity of modern computer-based systems as well as their numerous applications has inherently increased the challenges for ensuring trustworthiness. Trustworthiness encompasses vital characteristics of a system such as safety (the non-occurrence of catastrophic consequences for the environment the system works in), security (the non-occurrence of unauthorized disclosure of information), integrity (the non-occurrence of inadequate information alteration), availability (the readiness for correct service of the system), reliability (the property of the system to continuously provide service) or more generically dependability. The overall trustworthiness of a system is connected to all the aforementioned properties and should be regarded holistically. Functional correctness, security, safety, reliability are facets that have to be ensured for the system's components as well as for the system as a whole. The 1st International Workshop on Trustworthy Multi-Agent Systems (TruMAS 2012) aims at bringing together researchers, engineers and practitioners interested in all the different aspects of trust, dependability and security in Multi-Agent Systems. The workshop is expected to stimulate discussions about the future development of appropriate models, methods, notations, languages and tools for trustworthy Multi-Agent Systems. The overall goal is to explore the different facets of trustworthiness in Multi-Agent Systems, how every single aspect can be fostered, and how they relate. Topics of interests include, but are not limited to: - Trust and reputation models, metrics and assessment in Multi-Agent Systems - Dependability facets in Multi-Agent Systems - Fault-tolerance and robustness in Multi-Agent Systems - Architectures for trustworthy Multi-Agent Systems - Robust and secure communication in Multi-Agent Systems - Robust and secure negotiation in Multi-Agent Systems - Software engineering methodologies for trustworthy Multi-Agent Systems - Security and access control in open Multi-Agent Systems - Self-configuration and adaptation - Formal methods and frameworks to model, analyze, prove, or measure aspects of trustworthy Multi-Agent Systems - Industrial experiences in the adoption of trust-based Multi-Agent Systems approaches - Rigorous software development to ensure trustworthiness in Multi-Agent Systems Since the overall goal of trustworthy Multi-Agent Systems includes the investigation of several cross- disciplinary issues such as a deep understanding of trust vs. trustworthiness, trust-based approaches, dependability, etc..., a synergy between different scientific communities and research disciplines is needed. For this reason, although the workshop seems naturally focused on multi-agent issues, contributions from different disciplines such as philosophy, sociology, psychology, communication sciences, as well as from computer science specific sub-disciplines such as software engineering and dependability are welcomed and encouraged. SUBMISSION INSTRUCTIONS Submitted full papers must not exceed 10 pages in length, including bibliography and well-marked appendices. Papers can be submitted using the PROSE Online Paper Submission system available on the KES-AMSTA'12 Web site: http://www.prosemanager1.co.uk/amsta-12/submitpaper.asp Remember to select the TruMAS invited session entry (IS04) in the "Session Name" drop-down box when submitting your paper. Please use the LNCS templates and style files available on the Springer Web site (Information for LNCS Authors). Submitted papers will be evaluated by the program committee and chosen for presentation based on their scientific contribution and relevance to the topics of the workshop. At least one author of each accepted paper must register to the workshop and participate presenting the paper. Proceedings will be published by Springer-Verlag in a volume of LNCS/LNAI. CHAIRS Nicola Dragoni DTU Informatics Technical University of Denmark, Denmark ndra at imm.dtu.dk Manuel Mazzara School of Computing Science Newcastle University, UK manuel.mazzara at newcastle.ac.uk PROGRAM COMMITTEE Faycal Abouzaid, CRAC, Ecole Polytechnique of Montreal, Canada Enrico Denti, DEIS, University of Bologna, Italy Nicoletta Fornara, Faculty of Communication Sciences, University of Lugano, Switzerland Katsuhide Fujita, Institute of Engineering Innovation, School of Engineering, The University of Tokyo, Japan Mauro Gaspari, Department of Computer Science, University of Bologna, Italy Paolo Giorgini, Information Engineering and Computer Science Department (DISI), University of Trento, Italy Nathan Griffiths, Department of Computer Science, University of Warwick, UK Chung-Wei Hang, Department of Computer Science, North Carolina State University, USA Koji Hasebe, Academic Computing & Communications Center, University of Tsukuba, Japan Hiromitsu Hattori, Graduate School of Informatics, Kyoto University, Japan Takayuki Ito, Department of Computer Science and Engineering, Nagoya Institute of Technology, Japan Waqar Jaffry, Department of Artificial Intelligence, VU University, The Netherlands Andrew J I Jones, Department of Informatics, King's College London, UK Steve Marsh, Communications Research Centre, Canada Hernan Melgratti, University of Buenos Aires, Argentina Paul Scerri, Robotics Institute, Carnegie Mellon University, USA Eugen Staab, imc AG, Germany Daniel Villatoro, Artificial Intelligence Research Institute, Spanish Scientific Research Council, Spain Mirko Viroli, DEIS, University of Bologna, Italy -------------- next part -------------- An HTML attachment was scrubbed... URL: From mislove at tulane.edu Thu Jan 19 13:42:32 2012 From: mislove at tulane.edu (Mislove, Michael W) Date: Thu, 19 Jan 2012 18:42:32 +0000 Subject: [TYPES/announce] MFPS 28 Second Call for Papers Message-ID: <4E8FD86D-5A25-4C54-ABE6-A3108D95ED15@TULANE.EDU> MFPS XXVIII http://www.math.tulane.edu/~mfps/MFPS28 Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics University of Bath United Kingdom 6 - 9 June 2012 The Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of the University of Bath, United Kingdom from June 6 through June 9, 2012. MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighbouring areas. TOPICS include, but are not limited to, the following: biocomputation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. INVITED SPEAKERS: Steve Awodey, CMU Michael Clarkson, GWU Patricia Johann, Strathclyde Dexter Kozen, Cornell Drew Moshier, Chapman John Power, Bath SPECIAL SESSIONS: There will be four special sessions at the meeting, each associated with one of the plenary talks: * Logic, computation and algebraic topology, organised by Steve Awodey and Michael Mislove * Security, organised by Michael Clarkson and Catherine Meadows. The papers in this session will be chosen from the papers submitted in response to this Call. * Computational effects, organised by John Power * Computability on Continuous Data, organised by Drew Moshier This session is in association with the Alan Turing Centenary TUTORIALS: There will be a series of four Tutorial Lectures The topic and speakers are yet to be determined PROGRAM COMMITTEE: Thorsten Altenkirch, U Nottingham, UK Steve Awodey, Carnegie Mellon U, USA Andrej Bauer, U Ljubljana, Slovenia Ulrich Berger, Swansea U, UK (Chair) Stephen Brookes, Carnegie Mellon U, USA Bob Coecke, U Oxford, UK Martin Escardo, U Birmingham, UK Marcelo Fiore, U Cambridge, UK Neil Ghani, U Strathclyde, UK Alexey Gotsman, IMDEA, Madrid, Spain Hugo Herbelin, INRIA, Rocquencourt-Paris, France Achim Jung, U Birmingham, UK Daniel Leivant, U Indiana, USA Guy McCusker, U Bath, UK Catherine Meadows, NRL, USA Michael Mislove, Tulane U, USA Peter O'Hearn, Queen Mary U London, UK Luke Ong, U Oxford, UK Prakash Panangaden, McGill U, Canada John Power, U Bath, UK Jan Rutten, Radboud Nijmegen, Netherlands Alex Simpson, U Edinburgh, UK James Worrell, U Oxford, UK IMPORTANT DATES: - 24 February 2012 Title and Short Abstract submission deadline - 2 March 2012 Paper submission deadline - 2 April 2012 Notification to authors - 23 April 2012 Preliminary proceedings version due SUBMISSIONS should be prepared using ENTCS Macros, available from http://www.entcs.org Submissions should be in the form of a PDF file not exceeding 15 pages in length. Submissions are open on the EasyChair website: http://www.easychair.org/conferences/?conf=mfps2012 PROCEEDINGS: There will be a preliminary proceedings of the conference papers that will be distributed at the meeting, with a final proceedings published in ENTCS after the meeting. The Organisers of the MFPS series are Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane) and Prakash Panangaden (McGill). The local arrangements for MFPS XXVIII are being overseen by Guy McCusker (Bath) and John Power (Bath). ######################################################################## To unsubscribe from the MFPS-L list, click the following link: https://listserv.tulane.edu/cgi-bin/wa?SUBED1=MFPS-L&A=1 From: "Mislove, Michael W" Subject: MFPS Second Call for Papers Date: January 19, 2012 12:37:21 PM CST To: MFPS XXVIII http://www.math.tulane.edu/~mfps/MFPS28 Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics University of Bath United Kingdom 6 - 9 June 2012 The Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of the University of Bath, United Kingdom from June 6 through June 9, 2012. MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighbouring areas. TOPICS include, but are not limited to, the following: biocomputation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. INVITED SPEAKERS: Steve Awodey, CMU Michael Clarkson, GWU Patricia Johann, Strathclyde Dexter Kozen, Cornell Drew Moshier, Chapman John Power, Bath SPECIAL SESSIONS: There will be four special sessions at the meeting, each associated with one of the plenary talks: * Logic, computation and algebraic topology, organised by Steve Awodey and Michael Mislove * Security, organised by Michael Clarkson and Catherine Meadows. The papers in this session will be chosen from the papers submitted in response to this Call. * Computational effects, organised by John Power * Computability on Continuous Data, organised by Drew Moshier This session is in association with the Alan Turing Centenary TUTORIALS: There will be a series of four Tutorial Lectures The topic and speakers are yet to be determined PROGRAM COMMITTEE: Thorsten Altenkirch, U Nottingham, UK Steve Awodey, Carnegie Mellon U, USA Andrej Bauer, U Ljubljana, Slovenia Ulrich Berger, Swansea U, UK (Chair) Stephen Brookes, Carnegie Mellon U, USA Bob Coecke, U Oxford, UK Martin Escardo, U Birmingham, UK Marcelo Fiore, U Cambridge, UK Neil Ghani, U Strathclyde, UK Alexey Gotsman, IMDEA, Madrid, Spain Hugo Herbelin, INRIA, Rocquencourt-Paris, France Achim Jung, U Birmingham, UK Daniel Leivant, U Indiana, USA Guy McCusker, U Bath, UK Catherine Meadows, NRL, USA Michael Mislove, Tulane U, USA Peter O'Hearn, Queen Mary U London, UK Luke Ong, U Oxford, UK Prakash Panangaden, McGill U, Canada John Power, U Bath, UK Jan Rutten, Radboud Nijmegen, Netherlands Alex Simpson, U Edinburgh, UK James Worrell, U Oxford, UK IMPORTANT DATES: - 24 February 2012 Title and Short Abstract submission deadline - 2 March 2012 Paper submission deadline - 2 April 2012 Notification to authors - 23 April 2012 Preliminary proceedings version due SUBMISSIONS should be prepared using ENTCS Macros, available from http://www.entcs.org Submissions should be in the form of a PDF file not exceeding 15 pages in length. Submissions are open on the EasyChair website: http://www.easychair.org/conferences/?conf=mfps2012 PROCEEDINGS: There will be a preliminary proceedings of the conference papers that will be distributed at the meeting, with a final proceedings published in ENTCS after the meeting. The Organisers of the MFPS series are Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane) and Prakash Panangaden (McGill). The local arrangements for MFPS XXVIII are being overseen by Guy McCusker (Bath) and John Power (Bath). From jfoster at cs.umd.edu Thu Jan 19 18:22:08 2012 From: jfoster at cs.umd.edu (Jeff Foster) Date: Thu, 19 Jan 2012 18:22:08 -0500 Subject: [TYPES/announce] Postdoc in programming languages and security at the University of Maryland, College Park References: Message-ID: The programming languages group in the Department of Computer Science at the University of Maryland, College Park is offering a post doctoral position in programming languages, with an emphasis on security and privacy on mobile devices. Prior background in security/mobile systems is helpful but not required. Applicants to this position must have received their PhD, or completed the requirements for their PhD, when the appointment begins. * Application deadline: February 15, 2012 for full consideration. The position will remain open until filled. * Start date: July 1, 2012 (negotiable) * Duration: 1-2 years, depending on funding availability Interested candidates should send their CV to mwh at cs.umd.edu and jfoster at cs.umd.edu and arrange to have two letters of recommendation emailed to the same addresses. Questions about the position may be sent to the same addresses. For more information about the Maryland PL group, please visit http://www.cs.umd.edu/projects/PL/ The University of Maryland, College Park actively subscribes to a policy of equal employment opportunity, and will not discriminate against any employee or applicant because of race, age, sex, color, sexual orientation, physical or mental disability, religion, ancestry or national origin, marital status, genetic information, or political affiliation. Minorities and women are encouraged to apply. Jeff From eberinge at cs.princeton.edu Fri Jan 20 10:07:13 2012 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Fri, 20 Jan 2012 10:07:13 -0500 (EST) Subject: [TYPES/announce] ITP 2013: Call for bids In-Reply-To: Message-ID: As chairs of ITP 2012, it is our pleasure to initiate the process of selecting a host for ITP 2013, the Fourth International Conference on Interactive Theorem Proving. As in previous years, the procedure consists of two phases: solicitation of bids and voting. This message concerns the first phase. A long-standing ITP/TPHOLs convention is that the conference should be held in a continent different from the location of the previous meeting. For 2013, we therefore solicit bids from prospective hosts located outside North America. Similar to previous years, we expect bids to propose a date in July, August or September. Bids should be sent to itp2012 at easychair.org and should include at least the following information: - name and email address of a contact person - names of other people involved - address of website for the bid - approximate dates of the conference - structure (e.g., k workshop days and n days of presentations followed by excursion...) - advantages of the proposed venue Example of previous winning bids are here: http://itp2011.cs.ru.nl/ITP2011/Bid_ITP11.html http://www.cs.princeton.edu/~appel/itp2012/bid.html Deadline for all bids is Monday, 27 February 2012. Shortly after that, all admitted bids will be made public and the voting phase will take place. The people eligible to vote are those who are seriously thinking of attending ITP 2013. The voting system used will be Single Transferable Vote between all received bids. Andrew Appel Lennart Beringer Amy Felty From pedro.adao at ist.utl.pt Mon Jan 23 09:39:21 2012 From: pedro.adao at ist.utl.pt (=?iso-8859-1?Q?Pedro_Ad=E3o?=) Date: Mon, 23 Jan 2012 14:39:21 +0000 Subject: [TYPES/announce] PostDoc and PhD positions at Instituto de Telecomunicacoes/IST, Lisboa Message-ID: (Apologies for multiple copies) Applications are invited for - one PostDoc position (deadline 27/Jan/2012) and - one PhD position (deadline 27/Jan/2012) within the Security and Quantum Information Group (SQIG) of Instituto de Telecomunicacoes (IT), Lisboa, Portugal. These positions are offered in the scope of the ComFormCrypt project that aims at developing logics for studying properties of security protocols. For more details about the project please visit the webpage at http://www.math.ist.utl.pt/~padao/projects/ComFormCrypt/ Applicants should hold a MSc/PhD degree in Mathematic or Computer Science for the PhD/postdoc position, respectively. The ideal candidate will have interests in logics, complexity, and probabilities. These positions include NO teaching duties and the starting date can be as early as February 2012 (negotiable). Knowledge of Portuguese is not a prerequisite as the working language is English. To apply, please send a CV, a brief research statement, and the names of two references to Pedro Adao (pedro.adao at ist.utl.pt) Further enquiries are also welcomed. Instituto de Telecomunica??es (IT) is a private, not-for-profit association of Instituto Superior T?cnico, Universidade de Aveiro, Faculdade de Ci?ncias e Tecnologia da Universidade de Coimbra, Universidade da Beira Interior, Portugal Telecom Inova??o and Nokia Siemens Networks, with more than 200 researchers. In recognition of its achievements IT was awarded the status of Associate Laboratory in 2001. ComFormCrypt is a 3-year project funded by FCT-Fundacao para a Ciencia e Tecnologia. ------------------------------------ Pedro Ad?o Department of Computer Science and Engineering Instituto Superior T?cnico Avenida Professor Cavaco Silva, 2744-016 Porto Salvo, PORTUGAL Tel. (+351) 21-423-3260 Fax. (+351) 21-423-3247 http://web.ist.utl.pt/~pedro.adao/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Andrew.Pitts at cl.cam.ac.uk Mon Jan 23 11:20:06 2012 From: Andrew.Pitts at cl.cam.ac.uk (Andrew Pitts) Date: Mon, 23 Jan 2012 16:20:06 +0000 Subject: [TYPES/announce] ICALP 2012 - 2nd Call for Papers Message-ID: *ICALP 2012 - 2nd Call for Papers* The 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place 9-13 July 2012 at the University of Warwick, UK. The conference is also one of the Alan Turing Centenary Celebration events, celebrating the Life and Work, and Legacy of Alan Turing. The main conference will be preceded by a series of workshops. URL: http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012 Topics Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: *Track A: Algorithms, Complexity and Games* Algorithmic Game Theory, Approximation Algorithms, Combinatorial Optimization, Combinatorics in Computer Science, Computational Biology, Computational Complexity, Computational Geometry, Cryptography, Data Structures, Design and Analysis of Algorithms, Machine Learning, Parallel, Distributed and External Memory Computing, Randomness in Computation, Quantum Computing. *Track B: Logic, Semantics, Automata and Theory of Programming* Algebraic and Categorical Models, Automata Theory, Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Principles of Programming Languages, Logics, Formal Methods and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Program Analysis and Transformation, Specification, Refinement and Verification, Type Systems and Theory, Typed Calculi. *Track C: Foundations of Networked Computation* Cloud Computing, Overlay Networks, P2P Systems; Cryptography, Privacy,Security, Spam; Distributed and Parallel Computing; E-commerce, Auctions; Game Theory, Incentives, Selfishness; Internet Algorithms; Mobile and Complex Networks; Natural and Physical Algorithms; Network Information Management; Sensor, Mesh, and Ad Hoc Networks; Social Networks, Viral Marketing; Specification, Semantics, Synchronization; Trust and Reputation; Web Mining and Analysis; Web Searching and Ranking; Wireless and Optical Communication. * * Important Dates - Submission: February 21, 2012 - Notification: April 17 2012 - Final manuscript due: May 8, 2012 - The conference: July 9 - 13, 2012 Submission Guidelines Authors are invited to submit an extended abstract of no more than 12 pages (including references) in LNCS style. No prior publication or simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. Submissions must adhere to the specified format and length. Submissions that do not adhere will be rejected immediately. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Submissions for each of the Tracks A, B and C should be made at the EasyChair submission site, following the instructions at http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/cfp/ Best Paper Awards As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Invited Speakers Gilles Dowek (INRIA Paris) Kohei Honda (Queen Mary London) Stefano Leonardi (Sapienza University of Rome) Daniel A. Spielman (Yale) Berthold V?cking (RWTH Aachen) Conference Chair Artur Czumaj (University of Warwick) Contact: -------------- next part -------------- An HTML attachment was scrubbed... URL: From wintersmind at gmail.com Mon Jan 23 13:51:46 2012 From: wintersmind at gmail.com (Christian Skalka) Date: Mon, 23 Jan 2012 13:51:46 -0500 Subject: [TYPES/announce] PhD Assistantship at University of Vermont Message-ID: PhD Assistantship Opportunity ***************************** Department of Computer Science University of Vermont (UVM) Burlington, Vermont 05405, USA The Department of Computer Science at UVM announces a Graduate Research Assistantships (GRA) for PhD studies starting Fall 2012 under the supervision of Prof. Christian Skalka. Research under this assistanship will focus on topic areas related to Types in Programming Languages. Directions include: - Well-typed staged programming for resource constrained embedded devices - Programming language-based security in WSNs For more information about this research, including previous publications, see Prof. Skalka's homepage: - http://www.cs.uvm.edu/~skalka/ The Computer Science Ph.D. program at UVM has been growing steadily, and currently has about 20 Ph.D. students. The faculty in Computer Science is involved in the forefront of research in intelligent systems including artificial intelligence, data mining, distributed systems, and evolutionary computation. The research areas of individual faculty members can be found in the Further Information page linked to below. Qualifications ************** Successful applicants must possess a bachelor's degree in computer science or a related field, and show satisfactory test scores on the Graduate Record Examination (GRE). International applicants must submit a TOEFL test score as well. Further Information ******************* Tel: +1-802-656-3330 Email: csgrad-info at cems.uvm.edu CS Ph.D. Program: http://www.uvm.edu/~cems/cs/?Page=grad/phd-guide.php&SM=grad/_gradmenu.html Online Application: https://www.applyweb.com/apply/uvmg/menu.html Application Deadline: Review of applications will begin February 15, 2012, and will continue until position is filled. -- Christian Skalka Associate Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka -------------- next part -------------- An HTML attachment was scrubbed... URL: From xie at csc.ncsu.edu Tue Jan 24 02:22:40 2012 From: xie at csc.ncsu.edu (Tao Xie) Date: Tue, 24 Jan 2012 15:22:40 +0800 Subject: [TYPES/announce] CFP: International Workshop on Software and System Performance Analytics (SSPA 2012) co-located with PLDI 2012 In-Reply-To: References: Message-ID: CALL FOR PAPERS SSPA 2012 - International Workshop on Software and System Performance Analytics June 15, 2012, Beijing, China (co-located with PLDI 2012) http://research.csc.ncsu.edu/ase/sspa/ OVERVIEW Performance is one of the key properties of software and systems. For example, responsiveness, throughput, and resource utilization are the three key aspects of software and system performance. Modern software systems are increasingly complex, being implemented upon layers of complicated frameworks or technologies often with insufficient documentation, and being distributed over wide-range regions, on heterogeneous platforms, and within different administrative domains, posing challenges for offering satisfactory performance. This workshop is a forum for researchers and practitioners interested in the intersection of compilers, programming languages, software engineering, systems, high-performance computing, performance engineering, machine learning, and data mining for addressing software and system performance. The workshop focuses on developing and studying analytic technologies (e.g., program analysis, statistical analysis, machine learning, data mining, visualization) applied on various software or system artifacts (e.g., requirements, designs, implementations, tests, program traces, system logs) to address issues in software and system performance (e.g., responsiveness, throughput, and resource utilization). We invite paper submissions (falling into the above-mentioned workshop scope) of two kinds: (1) regular papers with page limit of 8 pages, and (2) short papers with page limit of 4 pages. We solicit short papers falling into two categories: formal short papers to appear in the proceedings, and informal short papers that will not; authors choose the category at the time of submission. Presentations of informal short papers are not precluded for future publication at other conference venues or journals. IMPORTANT DATES Paper submission deadline (regular papers and formal short papers): March 28th, 2012 Paper submission deadline (informal short papers): April 4th, 2012 Notification of acceptance: April 28th, 2012 Camera-ready deadline: May 12th, 2012 Workshop: June 15, 2012 Note: All submission deadlines are 11:59 PM (Pago Pago, American Samoa) on the dates indicated. SUBMISSION Submissions must be in ACM proceedings format, 9-point type, and may not exceed 8 pages (all inclusive) for regular papers and not exceed 4 pages for short papers. Word and LaTeX templates for this format are available here (http://www.sigplan.org/authorInformation.htm). Submissions must be in PDF, printable on US Letter and A4 sized paper. Regular papers or formal short papers must describe unpublished work that is not currently submitted for publication elsewhere as discussed here ( http://www.acm.org/sigs/sigplan/republicationpolicy.htm). Submissions should be made via the workshop EasyChair submission site ( https://www.easychair.org/conferences/?conf=sspa2012). Each regular paper or formal short paper submission is evaluated based on significance, originality, and clarity. Each informal short paper submission is evaluated based on relevance and interest to the workshop audience along with significance and clarity. Accepted regular papers and formal short papers will have their accepted paper published in the ACM proceedings and included in the ACM Digital Library. These authors of accepted papers are required to sign an ACM copyright release. ORGANIZATION Workshop Co-Chairs: Brian Demsky (University of California, Irvine, USA) Tao Xie (North Carolina State University, USA) Guoqing (Harry) Xu (University of California, Irvine, USA) Dongmei Zhang (Microsoft Research Asia, China) Program Committee: Mithun Acharya (ABB Research, USA) Wenguang Chen (Tsinghua University, China) Samuel Guyer (Tufts University, USA) Shi Han (Microsoft Research Asia, China) James Hill (IUPUI, USA) Jack Zhenming Jiang (Queen's University, Canada) Patrick Lam (University of Waterloo, Canada) Todd Mytkowicz (Microsoft Research, USA) Feng Qin (Ohio State University, USA) Jennifer Sartor (EPFL, Switzerland) Lidong Zhou (Microsoft Research Asia, China) -------------- next part -------------- An HTML attachment was scrubbed... URL: From fp at cs.cmu.edu Tue Jan 24 08:56:53 2012 From: fp at cs.cmu.edu (Frank Pfenning) Date: Tue, 24 Jan 2012 08:56:53 -0500 Subject: [TYPES/announce] Postdoctoral Position in Computational Logic Message-ID: Please see the announcement below. I will be at POPL and TLDI this week and would be happy to chat with anyone who is potentially interested. - Frank --------------------------------------------------------------------- Postdoctoral Position in Computational Logic The School of Computer Science at Carnegie Mellon University invites applications for one postdoctoral fellow position in computational logic. The position is based in Pittsburgh and is part of a project to develop recent work on language specification with substructural operational semantics into methodologies for designing and reasoning about programming and specification languages for distributed computation. The research will be conducted under the supervision of Prof. Frank Pfenning and Prof. Iliano Cervesato. The project runs through 31 November 2013. Candidates are also encouraged to explore research ideas beyond the project description. The position provides significant opportunities for professional development. For further details see http://www.qatar.cmu.edu/iliano/projects/metaCLF/index.shtml Applicants should have a strong background and interest in some combination of type theory, proof theory, concurrency, logical frameworks, and linear or substructural logics. To apply, send a cover letter, a CV and a list of references in PDF format to fp at cs.cmu.edu andiliano at cmu.edu. Additional material will be requested as needed. This posting will stay open until filled. Early expressions of interest are encouraged. -------------- next part -------------- An HTML attachment was scrubbed... URL: From marcello at liacs.nl Tue Jan 24 17:04:06 2012 From: marcello at liacs.nl (M.M. Bonsangue) Date: Tue, 24 Jan 2012 23:04:06 +0100 Subject: [TYPES/announce] Preliminary Call for Papers: The 7th IFIP Conference on Theoretical Computer Science 2012 Message-ID: <20120124220406.CBA86A6B@silver.liacs.nl> Preliminary Call for Papers: The 7th IFIP Conference on Theoretical Computer Science 2012 September 26 - 28, Amsterdam, The Netherlands General Info The conference Theoretical Computer Science, which is held every two years, either in conjunction or in the framework of the IFIP World Computing Congress, is the meeting place of the TC1 community where new results of computation theory are presented and more broadly experts in theoretical computer science meet to share insights and ask questions about the future directions of the field. TCS 2012 (http://tcs.project.cwi.nl/) is associated with The Alan Turing Year 2012 (www.mathcomp.leeds.ac.uk/turing2012). Previous conferences of this series were held in Sendai (2000), Montreal (2002), Toulouse (2004), Santiago (2006), Milano (2008), Brisbane (2010). Venue TCS 2012 will be held at the Centrum Wiskunde & Informatica (CWI), Amsterdam (http://www.cwi.nl), The Netherlands. Scope and Topics Algorithms, Complexity and Models of Computation, Logic, Semantics, Specification and Verification. Proceedings Accepted papers will be published in the Lecture Notes of Computer Science series. Important Dates TCS Conference: September 26-28 Camera ready version: July 16 Notification: June 25 Deadline reviews: June 13 (Discussion: June 13-20) Paper submission: May 1. Organisation General chair Jos Baeten (http://www.win.tue.nl/~josb/) PC co-chairs Tom Ball (http://research.microsoft.com/en-us/people/tball/) and Frank de Boer (http://homepages.cwi.nl/~frb/). PC committee Ahmed Bouajjani (http://www.liafa.jussieu.fr/~abou/) Ana Cavalcanti (http://www-users.cs.york.ac.uk/~alcc/) Joseph Kiniry (http://www.itu.dk/~josr/) Peter Mueller (http://www.pm.inf.ethz.ch/people/pmueller) David Naumann (http://www.cs.stevens.edu/~naumann/) Susanne Graf (http://www-verimag.imag.fr/~graf/) Juraj Hromkovic (http://www.ite.ethz.ch/people/host/jhromkov) Martin Kutrib (,http://www.informatik.uni-giessen.de/staff/kutrib/). Aart Middeldorp (http://cl-informatik.uibk.ac.at/users/ami/index.php) Jan Juerjens (http://www-jj.cs.tu-dortmund.de/jj/) Ugo Montanari (http://www.di.unipi.it/~ugo/) Catuscia Palamidessi (http://www.lix.polytechnique.fr/~catuscia/) Jeff Shallit (http://www.cs.uwaterloo.ca/~shallit/) Jan Rutten (http://homepages.cwi.nl/~janr/) Davide Sangiorgi (ttp://www.cs.unibo.it/~sangio/) Igor Walukiewics (http://www.labri.fr/perso/igw/) Jim Woodcock (http://www-users.cs.york.ac.uk/~jim/) From wasowski at itu.dk Wed Jan 25 13:21:15 2012 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Wed, 25 Jan 2012 19:21:15 +0100 Subject: [TYPES/announce] FINAL CALL 2nd International PhD School on Quantitative Model Checking Message-ID: <4F20481B.4070700@itu.dk> Final Call for Participation: 2nd International PhD School on Quantitative Model Checking Copenhagen 27 Feb - 1 Mar http://itu.dk/qmc2012/ Registration Deadline: February 7th, 2012 The European Network of Excellence ARTIST Design is organizing a PhD school on Quantitative Model Checking to take place at IT University of Copenhagen from 27 February to 1 March 2012. The School will feature lectures by world-renowned experts within the areas of discrete, real-time and probabilistic model checking. As of today, the list of confirmed speakers is as follows: Jan Tretmans - model-based testing Wolfgang Thomas - games in model checking Javier Esparza - verification of infinite state systems Patrice Godefroid - software model checking Holger Hermans - compositional stochastic modeling and verification Axel Legay - statistical model checking Joel Ouaknine - metric temporal logics Andrzej Wasowski - compositional design & verification of real time systems PhD students and others interested in this school can register by sending an e-mail to Louis-Marie Traonouez (lmtr at itu.dk) and paying the registration fee. More information available at http://www.itu.dk/qmc2012/ . The number of seats is limited. Registration cost: 1200 DKK Kim G. Larsen Axel Legay Andrzej Wasowski -- Andrzej W?sowski, PhD, http://www.itu.dk/~wasowski/ Associate prof., head of MSc Programme on Software Development IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark office 2M27, phone +45 7218 5086, fax +45 7218 5001 From isabelle.perseil at telecom-paristech.fr Wed Jan 25 18:53:34 2012 From: isabelle.perseil at telecom-paristech.fr (Isabelle Perseil) Date: Thu, 26 Jan 2012 00:53:34 +0100 Subject: [TYPES/announce] [TYPES-announce] CALL FOR PAPERS : UML&FM 2012 Message-ID: <1c8182f1891f9cd15e6087b2c1f0228a.squirrel@webmail1.telecom-paristech.fr> ********************************************************************** CALL FOR PAPERS : UML&FM 2012 5th INTERNATIONAL WORKSHOP ON UML&FORMAL METHODS http://www-public.int-evry.fr/~gibson/Workshops/UML-FM-2012.html Workshop held in conjunction with FM 2012 The 18th International Symposium on Formal Methods http://fm2012.cnam.fr/ August 27th, 2012 Paris, France ************************************************************************ Submission deadline: March 5th, 2012 ------------------------------------- Many interest groups from a research perspective are in favour of the creation of this workshop. For more than a decade now, the two communities of UML and formal methods have been working together to produce a simultaneously practical (via UML) and rigorous (via formal methods) approach to software engineering. UML is the de facto standard for modelling various aspects of software systems in both industry and academia, despite the inconvenience that its current specification is complex and its syntax imprecise. The fact that the UML semantics is too informal have led many researchers to formalize it with all kinds of existing formal languages, like OCL, Z, B, TLA+, CSP, VDM, Petri Nets, UPPAAL, HOL, Coq, PVS etc. This fifth edition of the workshop will be open to various subjects as the main objective is to encourage new initiatives of building bridges between informal, semi-formal and formal notations. Topics: ====== This workshop seeks contributions from researchers and practitioners interested in all aspects of integrating UML and formal methods. To this end, we solicit papers (no more than 8 pages long) related to, but not limited to, the following principal topics: * Consistent specifications, model transformations (QVT technologies, transformation repositories). Transformations to make models more analyzable so as to make them executable. * Automation of traceability through transformations * Refinement techniques: developing detailed design from a UML abstract specification * Refinement of OCL specification as well * Formal reasoning on models for code generation * Technologies for compositional verification of models * Specification of a formal semantics for the UML. Giving an abstract syntax to UML diagrams * Formal validation and verification of software * Co-modeling methods formal/informal mapping techniques * End-to-end methodologies or software process engineering,correct- by-construction design providing and supporting tools for safety- critical embedded systems design Workshop Format =============== This full-day workshop will consist of an introduction of the topic by the workshop organizers, presentations of accepted papers, and in depth discussion of previously identified subjects emerging from the submissions. A summary of the discussions will be made available. Submission and Publication ========================== To contribute, please send a position paper or a technical paper at: https://www.easychair.org/account/signin.cgi?conf=umlfm2012 Two versions of the papers will be requested. Short versions are required for the workshop participation. Only the best papers of extended versions will be published in a special issue of the Formal Aspects of Computing journal. - 1/ Short versions will be published in the ACM Software Engineering Notes (SEN), July 2012 (all the selected papers) Papers should not exceed 8 pages. Submitted manuscripts should be in English and formatted in the style of the SEN Format. http://www.stidolph.com/SEN/index.html Preferably, submissions should be in PDF format. - 2/ Extended versions of the best papers will be published in the Formal Aspects of Computing journal, inside a special issue These extended papers should not exceed 20 pages, must be based on the same results as the original paper but different. Submitted manuscripts should be in English and formatted in the style of the Formal Aspects of Computing Springer Format. Preferably, submissions should be in PDF format. IMPORTANT DATES =============== Submission deadline: March 5th, 2012 All Notification of acceptance: May 7th, 2012 Final copy: June 4th, 2012 Workshop date: August 27th, 2012 Organizers ========== Organizational sponsors : IEEE France Section OMG (http://www.omg.org/) SEE Organizers and Programme Steering committee: Sebastien Gerard (CEA-LIST, France) Paul Gibson (Telecom SudParis, France) Dominique Mery (LORIA, France) Isabelle Perseil (Inserm, France) Jim Woodcock (University of York, United Kingdom) Program Committee: * Lukman Ab Rahim (Lancaster University, United Kingdom) * Nazareno Aguirre (Universidad Nacional de Rio Cuarto, Argentina) * Marc Aiguier (Ecole Centrale Paris, France) * Yamine Ait Ameur (LISI / ENSMA, France) * Pascal Andre (LINA, University of Nantes, France) * Luciano Baresi (Politecnico di Milano, Italia) * Kamel Barkaoui (CEDRIC-CNAM, France) * David Clark (UCL, United Kingdom) * Vincent Englebert (University of Namur, Belgium) * Huascar Espinoza (Tecnalia, Spain) * Sebastien Gerard (CEA-LIST, France) * Frederic Gervais (Universite Paris-Est, LACL, France) * Paul Gibson (Telecom SudParis, France) * Martin Gogolla (University of Bremen, Germany) * Jerome Hugues (ISAE, France) * Paul Krause (University of Surrey, United Kingdom) * Kevin Lano (Kings College London, United Kingdom) * Manuel Mazzara (Newcastle University, United Kingdom) * Stephen J.Mellor (Accelerated Technologies, Tucson AZ, USA) * Sun Meng (Peking University, China) * Dominique Mery (LORIA, France) * Alexandre Mota (Universidade Federal de Pernambuco, Brazil) * Elie Najm (Telecom Paristech, France) * Isabelle Perseil (Inserm, France) * Franck Pommereau (IBISC, University of Evry, France) * Shengchao Qin (Teesside University, United Kingdom) * Arend Rensink (University of Twente, Netherlands) * Thomas Robert (Telecom ParisTech, France) * Douglas Schmidt (Vanderbilt University, USA) * Pierre-Yves Schobbens (University of Namur, Belgium) * Bran Selic (Malina Software Corp, Canada) * Francoise Simonot Lion (LORIA, France) * Neeraj-Kumar Singh (University of York, United Kingdom) * Volker Stolz (United Nations University, Norway) * Jing Sun (University of Auckland, New Zealand) * Bedir Tekinerdogan (Bilkent University, Turkey) * Tatsuhiro Tsuchiya (Osaka University, Japan) * Naoyasu Ubayashi (Kyushu Institute of Technology, Japan) * Stefan Van Baelen (Catholic University of Leuven, Belgium) * Tullio Vardanega (University of Padua, Italia) * Francois Vernadat (CNRS-LAAS, France) * Eugenio Villar (Universidad de Cantabria, Spain) * Tim Weilkiens (OOSE Innovative Informatik, Germany) From P.B.Levy at cs.bham.ac.uk Thu Jan 26 09:38:22 2012 From: P.B.Levy at cs.bham.ac.uk (Paul Levy) Date: Thu, 26 Jan 2012 14:38:22 +0000 Subject: [TYPES/announce] MSFP 2012 call for participation Message-ID: Please note the deadline for early registration, including discounted hotel bookings: *Sunday 29 January* =========================== Fourth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 March, Tallinn, Estonia A satellite workshop of ETAPS 2012 http://cs.ioc.ee/msfp/msfp2012/ The fourth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without arrows? Call-by-push-value without adjunctions? Type theory without universes? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. Invited Talks: ================= Dependently typed continuation monads as models in Logic Danko Ilik, Goce Del?ev University of ?tip, Republic of Macedonia Fibred Data Types Neil Ghani, University of Strathclyde, UK Accepted Papers ================== ? A Formal Comparison of Approaches to Datatype-Generic Programming Jos? Pedro Magalh?es and Andres L?h ? An Investigation of the Laws of Traversals Mauro Jaskelioff and Ondrej Rypacek ? Evaluation strategies for monadic computations Tomas Petricek ? From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine Wouter Swierstra ? Irrelevance, Heterogenous Equality, and Call-by-value Dependent Type Systems Vilhelm Sj?berg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump and Stephanie Weirich ? Parametric Compositional Data Types Tom Hvitved and Patrick Bahr ? Step-Indexed Normalization for a Language with General Recursion Chris Casinghino, Vilhelm Sj?berg and Stephanie Weirich ? Tracing monadic computations and representing effects Maciej Pir?g and Jeremy Gibbons ETAPS: ====== 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 (one of them, POST, being new in 2012), accompanied by satellite workshops. ETAPS 2012 is the fifteenth event in the series. http://www.etaps.org/2012 Host City: ========== Tallinn, a city of 412,000 people, is the capital and largest city of Estonia, a small EU member country in Northern Europe, bordering Russia to the East and Latvia to the south. Located in the north of the country, on the southern shores of the Gulf of Finland, opposite Helsinki in Finland, Tallinn is most well known for its picturesque medieval Old Town, a UNESCO World Heritage site. But it also has a vivid cultural scene, outperforming most European centres of similar size. In 2011, Tallinn, along with Turku in Finland, is the Cultural Capital of Europe. Tallinn is easy to travel to. Estonia is part of Schengen and the Eurozone. The Lennart Meri International Airport of Tallinn /TLL) is only 4km from the city centre. Programme Committee: ==================== * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Paul Blain Levy (co-chair), University of Birmingham, UK * Thorsten Altenkirch, University of Nottingham, UK * Robert Atkey, University of Strathclyde, Glasgow, UK * Nils Anders Danielsson, Chalmers University and University of Gothenburg, Sweden * Martin Escardo, University of Birmingham, UK * Ichiro Hasuo, University of Tokyo, Japan * Ralf Hinze, University of Oxford, UK * Neelakantan Krishnaswami, Microsoft Research, Cambridge, UK * Daniel R. Licata, Carnegie Mellon University, Pittsburgh, PA * Ulrich Schoepp, LMU Munich, Germany * Alex Simpson, University of Edinburgh, UK * Matthieu Sozeau, INRIA, Paris, France * Sam Staton, University of Cambridge, UK Further Information: ==================== For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2012/ With any other questions please do not hesitate to contact the co-chairs at msfp2012 at easychair.org. From Yves.Bertot at inria.fr Thu Jan 26 10:19:07 2012 From: Yves.Bertot at inria.fr (bertot) Date: Thu, 26 Jan 2012 16:19:07 +0100 Subject: [TYPES/announce] Call for Participation: School on Formalization of Mathematics (March 12-16) Message-ID: <4F216EEB.3060801@inria.fr> International Spring School on FORMALIZATION OF MATHEMATICS Sophia Antipolis, France March 12-16, 2012 http://www-sop.inria.fr/manifestations/MapSpringSchool New: Grants for PhD students covering the full registration fee. Overview and topics A growing population of mathematicians, computer scientists, and engineers use computers to construct and verify proofs of mathematical results. Among the various approaches to this activity, a fruitful one relies on interactive theorem proving. When following this approach, researchers have to use the formal language of a theorem prover to encode their mathematical knowledge and the proofs they want to scrutinize. The mathematical knowledge often contains two parts: a static part describing structures and a dynamic part describing algorithms. Then proofs are made in a style that is inspired from usual mathematical practice but often differs enough that it requires some training. A key ingredient for the mathematical practitioner is the amount of mathematical knowledge that is already available in the system's library. The Coq system is an interactive theorem prover based on Type Theory. It was recently used to study the proofs of advanced mathematical results. In particular, it was used to provide a mechanically verified proof of the four color theorem and it is now being used in a long term effort, called Mathematical Components to verify results in group theory, with a specific focus on the odd order theorem, also known as the Feit-Thompson theorem. These two examples rely on a structured library that covers various aspects of finite set theory, group theory, arithmetic, and algebra. The school's contents will be organized as a balanced schedule between lectures and laboratory sessions where participants will be invited to work on their own computer and try their hands on a progressive collection of exercices. Course contents: * Using computers to state and prove theorems - Why trust a computer to check proofs, and what to trust? - Typed formulas, quantifications, and logical connectives - Using theorems as functions - Modeling the mathematical practice of notation abuse * Principles and practice of goal directed proofs - Basic commands for proofs in Coq/Ssreflect - Advanced techniques for rewriting and proofs by induction - Changing points of views: reflection mechanisms * A guided tour of the ssreflect library - Basic notions: numbers, tuples, finite sets - Algebraic notions: polynomials, abstract algebra, linear algebra - Structuration principles - Illustration on an advanced example Invited lectures Georges Gonthier (Microsoft Research) Title to be announced Thomas C. Hales (University of Pittsburgh) Lessons from the Flyspeck Formalization Project Julio Rubio (Universidad de La Rioja) Formalization of Mathematics: why Algebraic Topology? Bas Spitters (Radboud Universiteit, Nijmegen) From computational analysis to thoughts about analysis in HoTT Vladimir Voevodsky (Institute for advanced study, Princeton) Designing a universe polymorphic type system Speakers: Yves Bertot (INRIA) Assia Mahboubi (INRIA) Laurence Rideau (INRIA) Pierre-Yves Strub (MSR-Inria Joint Centre) Enrico Tassi (INRIA) Laurent Th?ry (INRIA) Registration The registration fee is 320? and includes lunch meals, one evening meal (banquet), and organization costs. There are a limited number of grants for PhD students, which cover the full registration fee. A registration form is available on the web site http://www-sop.inria.fr/manifestations/MapSpringSchool From Simon.Gay at glasgow.ac.uk Thu Jan 26 13:41:04 2012 From: Simon.Gay at glasgow.ac.uk (Simon J. Gay) Date: Thu, 26 Jan 2012 18:41:04 +0000 Subject: [TYPES/announce] PLACES 2012 Call For Participation Message-ID: <947E7D54-0800-4CF0-B4C6-670F9903D1B1@dcs.gla.ac.uk> CALL FOR PARTICIPATION PLACES'12 Programming Language Approaches to Concurrency and Communication-cEntric Software 31st March 2012, Tallinn, Estonia (affiliated to ETAPS 2012) http://places12.di.fc.ul.pt/ ** Information ** 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. ** Invited Speaker ** Benedict Gaster, AMD (title to be confirmed) ** Accepted Papers ** QIRAL: A High Level Language for Lattice QCD Code Generation Denis Barthou (University of Bordeaux, France) Gilbert Grosdidier (Laboratoire de l'Accelerateur Lineaire, France) Michael Kruse (INRIA Saclay, France) Olivier P?ne (Universit? Paris-Sud, France) Claude Tadonki (Mines ParisTech/CRI, France) An event-based model for contracts Massimo Bartoletti (University of Cagliari, Italy) Tiziana Cimoli (University of Cagliari, Italy) G. Michele Pinna (University of Cagliari, Italy) Roberto Zunino (University of Trento, Italy) Mapping the Join Calculus to Heterogeneous Hardware Peter Calvert (University of Cambridge, UK) Alan Mycroft (University of Cambridge, UK) Merging Multiparty Protocols in Multiparty Choreographies Marco Carbone (IT University of Copenhagen, Denmark) Fabrizio Montesi (IT University of Copenhagen, Denmark) Specifying stateful asynchronous properties for distributed programs Tzu-Chun Chen (Queen Mary University of London, UK) Kohei Honda (Queen Mary University of London, UK) Typing Context-Dependent Behavioural Variation Pierpaolo Degano (University of Pisa, Italy) Gianluigi Ferrari (University of Pisa, Italy) Letterio Galletta (University of Pisa, Italy) Gianluca Mezzetti (University of Pisa, Italy) Stratified Protocols in Session-Types Romain Demangeon (Queen Mary University of London, UK) Modularizing and Specifying Protocols among Threads Sung-Shik T.Q. Jongmans (CWI Amsterdam, Netherlands) Farhad Arbab (CWI Amsterdam and University of Leiden, Netherlands) Variant-Frequency Semantics for Green Futures Yu David Liu (SUNY Binghamton, USA) Work-streaming compilation of futures Antoniu Pop (INRIA, France) Albert Cohen (INRIA, France) ** Registration ** Please register through the ETAPS registration site. The early registration deadline is 29th January. ** Program Committee ** Alastair Beresford, University of Cambridge, UK Mario Bravetti, University of Bologna, Italy Marco Carbone, IT University of Copenhagen, Denmark Alastair Donaldson, Imperial College London, UK Stephen Fink, IBM T. J. Watson Research Center, USA Kohei Honda, Queen Mary, University of London, UK Simon Gay, University of Glasgow, UK (co-chair) Lee Howes, AMD Paul Kelly, Imperial College London, UK (co-chair) Anton Lokhmotov, ARM David Pearce, Victoria University of Wellington, New Zealand Franz Puntigam, Technical University of Vienna, Austria Nikhil Swamy, Microsoft Research, USA Ana Lucia Varbanescu, Vrije Universiteit Amsterdam, The Netherlands Jan Vitek, Purdue University, USA ** Organizing Committee ** Alastair Beresford, University of Cambridge, UK Kohei Honda, Queen Mary, University of London, 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 The University of Glasgow, charity number SC004401 From jv at informatik.uni-bonn.de Thu Jan 26 15:09:14 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Thu, 26 Jan 2012 21:09:14 +0100 Subject: [TYPES/announce] Call for Participation - BX'12 (co-located with ETAPS'12) Message-ID: <4F21B2EA.5040905@informatik.uni-bonn.de> Please note the deadline for early registration, including discounted hotel bookings: *Sunday 29 January* ======================================================================== CALL FOR PARTICIPATION First International Workshop on Bidirectional Transformations (BX 2012) Tallinn, Estonia Sun, March 25, 2012 (co-located with ETAPS 2012, adjacent to FASE, ESOP, GT-VMT) http://www.program-transformation.org/BX12 http://www.program-transformation.org/BX12/InvitedTalks http://www.program-transformation.org/BX12/AcceptedPapers ======================================================================== Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be databases, software models, documents, graphs, and trees. BX are an emerging topic in a wide range of research areas with prominent presence at top conferences in different fields. This workshop now establishes a dedicated venue for bx in all relevant areas. We have a great programme, join us at ETAPS! REGISTRATION: To register for BX'12, please follow the instructions at: http://www.etaps.org/2012/registration The early registration deadline is January 29, 2012! HOTEL INFORMATION: BX will be co-located with ETAPS. Please visit ETAPS's web site to get more information about accommodation: http://www.etaps.org/2012/accommodation Special rates and/or block bookings for ETAPS 2012 participants at a number of central hotels also expire Sunday, 29 January 2012. INVITED TALKS: * Juan de Lara (Autonomous University of Madrid, Spain): Bidirectional Transformation with Graphical Constraints * Jean-Luc Hainaut (University of Namur, Belgium) CONTRIBUTED TALKS: * Anthony Anjorin, Gergely Varro and Andy Sch?rr: Complex Attribute Manipulation in TGGs with Constraint-Based Programming Techniques * Jeremy Gibbons and Michael Johnson: Relating Algebraic and Coalgebraic Descriptions of Lenses * Hugo Pacheco, Alcino Cunha and Zhenjiang Hu: Delta Lenses over Inductive Types * Vadim Zaytsev: Language Evolution, Metasyntactically * Michael Johnson and Robert Rosebrugh: Lens put-put laws: Monotonic and mixed * Leen Lambers, Stephan Hildebrandt, Holger Giese and Fernando Orejas: Attribute Handling for Bidirectional Model Transformations: The Triple Graph Grammar Case * Erwann Wernli: Bidirectional transformations meets dynamic updates: promise & perils * Perdita Stevens: Observations relating to the equivalences induced on model sets by bidirectional transformations -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv at iai.uni-bonn.de From Manuela.Bujorianu at manchester.ac.uk Thu Jan 26 16:22:11 2012 From: Manuela.Bujorianu at manchester.ac.uk (Manuela Bujorianu) Date: Thu, 26 Jan 2012 21:22:11 +0000 Subject: [TYPES/announce] HAS2012: Hybrid Autonomous Systems Workshop In-Reply-To: <38A9C8B532151940826352E121D3570C08EACF@MBXP07.ds.man.ac.uk> References: <38A9C8B532151940826352E121D3570C08EACF@MBXP07.ds.man.ac.uk> Message-ID: <38A9C8B532151940826352E121D3570C08EAE9@MBXP07.ds.man.ac.uk> HAS2012: Hybrid Autonomous Systems Workshop * Aplogies for the inherent multiple postings! The second edition of the workshop on hybrid autonomous systems Tallinn, Estonia, 31st of March Satellite event of ETAPS 2012 1 tutorial and 8 lectures http: http://personalpages.manchester.ac.uk/staff/Manuela.Bujorianu/HAS2012.htm Early regstration: 29 January 2012 Registration fee: 30 euro On-line registration is available at: https://purchase.ioc.ee/etaps12/ Organization Manuela Bujorianu (University of Manchester, UK) Emilio Frazzoli (MIT, US) Joost-Pieter Katoen (RWTH Aachen, DE) Tutorial Pieter Mosterman (MathWorks, US and McGill University, CA) Analyzing Execution Semantics of High-level Formalisms for Modelling Hybrid Dynamic Systems Lectures Luca Bortolussi (University of Trieste, IT) Hybrid Behaviour of Continuous Time Markov Chains Louise Dennis (University of Liverpool, UK) Verifying Reasoning within Agent-based Hybrid Control Systems Martin Fraenzle (Oldenburg University, DE) Towards a formal basis of robust behaviour Holger Hermanns (University of Saarlandes, DE) Wireless Hard Real-Time. Probably Provable Mike Hinchey (LERO and NASA, IE) The Challenge of Developing Autonomic Space-exploration Systems Peter Marwedel (University of Dortmund, DE) Efficient Computing in Cyber-Physical Systems Giordano Pola (University of L?Aquila, IT) Arenas of Finite State Machines and their application to the Modelling and Analysis of Air Traffic Management Systems Cristina Seceleanu (Malardalen University, SE) A Resource-Aware Framework for Embedded System Design and Its Extension Towards Adaptivity From sebastian.bauer at pst.ifi.lmu.de Fri Jan 27 03:51:49 2012 From: sebastian.bauer at pst.ifi.lmu.de (Sebastian Bauer) Date: Fri, 27 Jan 2012 09:51:49 +0100 Subject: [TYPES/announce] FIT 2012: call for participation Message-ID: ****************************************************************** CALL FOR PARTICIPATION: FIT 2012 4th International Workshop on Foundations of Interface Technologies Satellite Workshop at ETAPS 2012 Tallinn, Estonia, March 25, 2012 http://fit2012.pst.ifi.lmu.de/ ****************************************************************** - Workshop Topic: Component-based design is widely considered as a major approach to developing complex systems in a time- and cost-effective way. Component interfaces are central in this approach and summarize the externally visible properties of a component which can be syntactic properties such as operation signatures, but can also be behavioral and extra-functional properties such as quality of service, security and dependability. In recent years, rich interface formalisms have been proposed to specify legal sequences of messages, or resource and timing constraints. The challenge is to achieve compositionality - the key requirement for the effective analysis and prediction of global system behavior based on individual component behaviors. The aim of this workshop is to bring together researchers who are interested in the formal underpinnings of interface technologies. - Contributed talks and invited speakers: * Jose Luiz Fiadeiro - An Interface and Component Algebra for Service-Oriented Design * Karsten Wolf - Show me your friends and I tell you who you are * Salvatore La Torre, P. Madhusudan and Gennaro Parlato - Sequentializing Parameterized Programs * Oana Andrei, Muffy Calder and Alice Miller - Role-based Interface Automata * Marco Carbone, Thomas Hildebrandt, Hugo A. Lopez, Gian Perrone and Andrzej Wasowski - Refinement for Transition Systems with Responses * Rolf Hennicker - Challenges and Solutions in Interface-Based Design of Component Systems * Jiri Srba - Beyond the Classical Modal Transition Systems * Axel Legay - tba * Louis-Marie Traonouez - A parametric counterexample approach for robust timed specifications - Registration: Registration is handled through the ETAPS registration website. Early registration will close 29th of January, 2012. - Venue: The workshop will take place at the campus of the Tallinn University of Technology. Please visit the official ETAPS website for details on the venue. Sebastian Bauer (Ludwig-Maximilians-Universit?t M?nchen, Germany) & Jean-Baptiste Raclet (University Paul Sabatier-Toulouse III, France) From paolini at di.unito.it Fri Jan 27 04:57:37 2012 From: paolini at di.unito.it (Luca Paolini) Date: Fri, 27 Jan 2012 10:57:37 +0100 Subject: [TYPES/announce] Workshop on Intersection Types and Related Systems (ITRS 2012) Message-ID: <4F227511.30709@di.unito.it> ********************************************************************** First CALL FOR PAPER Sixth Workshop on Intersection Types and Related Systems (ITRS 2012) June 29th, Dubrovnik (Croatia). http://itrs2012.di.unito.it/ Workshop held in conjunction with LICS 2012 ********************************************************************** Deadline: April 13th, 2012 --------------------------- ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. ( More details at http://itrs2012.di.unito.it/ ). SUBMISSION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format. (2) After the workshop, authors of accepted papers will be invited to submit full versions, for inclusion in EPTCS. TOPICS Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications for programming languages. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intesional types to characterize computational properties. PROGRAM COMMITTEE St?phane Lengrand (?cole Polytechnique) Koji Nakazawa (Kyoto Univ.) Luke Ong (Oxford Univ.) Luca Paolini (Univ. Torino), chair Frank Pfenning (Carniege Mellon Univ.) Betti Venneri (Univ. di Firenze) INFORMATION For further information, please contact Luca Paolini Email: paolini AT di DOT unito DOT it From rlazarus at bbn.com Fri Jan 27 16:09:31 2012 From: rlazarus at bbn.com (Richard Lazarus) Date: Fri, 27 Jan 2012 16:09:31 -0500 Subject: [TYPES/announce] PostDoc or permanent hire position for Quantum programming language/compiler research In-Reply-To: <4F22F3B6.2080102@bbn.com> References: <4F22F3B6.2080102@bbn.com> Message-ID: <4F23128B.9080508@bbn.com> BBN is looking for candidates with expertise in programming language design, compiler design, and quantum information science. This position can be as a funded post-doc or as a permanent hire. We are conducting research in the area of quantum programming languages, quantum compilers and circuit optimization. This work focuses on designing a high-level functional 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, optimization of quantum circuits, and GUIs 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 process tomography, quantum communication, quantum estimation, and algorithms -- or in other exotic language/compiler systems such as those for synthetic biology. 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. View the full position description here: http://careers.bbn.com/servlet/av/jd?ai=715&ji=2599534&sn=I -- Richard Lazarus Disruptive Information Processing Technologies Raytheon BBN Technologies 10 Moulton St., Cambridge, MA 02138 www.bbn.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Fri Jan 27 16:58:53 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Fri, 27 Jan 2012 22:58:53 +0100 Subject: [TYPES/announce] Call for Papers - Haskell Symposium 2012 Message-ID: <4F231E1D.1070503@informatik.uni-bonn.de> ======================================================================== "Haskell 2012" ACM SIGPLAN Haskell Symposium 2012 Copenhagen, Denmark 13th September, 2012 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2012/ ======================================================================== The ACM SIGPLAN Haskell Symposium 2012 will be co-located with the 2012 International Conference on Functional Programming (ICFP), in Copenhagen, Denmark. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Functional Pearls, being elegant, instructive examples of using Haskell; * Experience Reports, general practice and experience with Haskell, e.g., in an education or industry context. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (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, based on running (perhaps prototype) software rather than necessarily on novel research results. Such short demo proposals should explain why a demonstration would be of interest to the Haskell community. 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. In addition to printed proceedings, 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 proposals, assessed for relevance by the PC, will be published on the symposium web page, but not formally published in the proceedings. Submission Details: =================== * Abstract Submission: 31st May 2012 * Submission Deadline: 3rd June 2012, 11:00 am, UTC * Author Notification: 27th June 2012 * Final Papers Due : 10th July 2012 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. Demo proposals are limited to 2-page abstracts, in the same format. "Functional Pearls", "Experience Reports", and "Demo 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. Programme Committee: ==================== * Amal Ahmed, Northeastern University * Jost Berthold, University of Copenhagen * Nils Anders Danielsson, University of Gothenburg * Iavor Diatchki, Galois Inc. * Jeremy Gibbons, University of Oxford * Jurriaan Hage, Utrecht University * Zhenjiang Hu, National Institute of Informatics Tokyo * Daan Leijen, Microsoft Research * Ben Lippmeier, University of New South Wales * Simon Peyton Jones, Microsoft Research * Colin Runciman, University of York * Eijiro Sumii, Tohoku University * Janis Voigtl?nder (chair), University of Bonn * Brent Yorgey, University of Pennsylvania Links: ====== * http://www.haskell.org/haskell-symposium (the permanent web page of the Haskell Symposium) * http://www.haskell.org/haskell-symposium/2012 (the 2012 Haskell Symposium web page) * http://www.icfpconference.org/icfp2012 (the ICFP 2012 web page) -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv at iai.uni-bonn.de From sandra at dcc.fc.up.pt Sat Jan 28 17:44:51 2012 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Sat, 28 Jan 2012 22:44:51 +0000 Subject: [TYPES/announce] Linearity 2012 call for participation Message-ID: <1327790691.2155.13.camel@localhost.localdomain> Please note the deadline for early registration, including discounted hotel bookings: *Sunday 29 January* =========================== Second Workshop on Linearity 1 April, Tallinn, Estonia A satellite workshop of ETAPS 2012 https://sites.google.com/site/linearity2012/ With the urge for more robust, verifiable and optimised programming languages, the interest for linearity in order to have more control on computational resources is increasing in several areas of Computer Science, both in the theoretical side: with work on proof technology, complexity classes and more recently quantum computation, and in the practical side: work on program analysis, expressive operational semantics, linear languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. LINEARITY 2012 will be a one-day satellite event of ETAPS 2012. Invited Talks: ================= The Geometry of Types Ugo Dal Lago, University of Bologna Linear Types in Programming Languages: Progress and Prospects Simon Gay, University of Glasgow Accepted Papers ================== Standardization in Resource lambda Calculus Maurizio Dominici, Simona Ronchi Della Rocca and Paolo Tranquill Extending the Interaction Nets Calculus by Generic Rules Eugen Jiresch Higher-order port-graph rewriting Maribel Fernandez and Sebastien Maulat Linearly Refined Session Types Pedro Baltazar, Dimitris Mostrous and Vasco Vasconcelos Relating Reasoning Methodologies in Linear Logic and Process Algebra Yuxin Deng, Iliano Cervesato and Robert Simmons A linear analysis of the call-by-value lambda calculus Beniamino Accattoli Linear Dependent Types with Local Variables Paolo Torrini Registration ================== Registration is handled through the ETAPS registration website. http://www.etaps.org/2012/registration Venue ================== The workshop will take place at the campus of the Tallinn University of Technology. Please visit the official ETAPS website for details on the venue and accommodation. From ggrov at staffmail.ed.ac.uk Mon Jan 30 09:41:25 2012 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Mon, 30 Jan 2012 14:41:25 +0000 Subject: [TYPES/announce] WING 2012: First Call for Papers Message-ID: [Please post - apologies for multiple copies.] ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- First Call for Papers --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. Releasing the software developer from this burden is crucial for ensuring the practical relevance of program verification. In the context of testing, suitable invariants have the potential of enabling high-coverage test-case generation. Thus, invariant generation is a key ingredient in a broad spectrum of tools that help to improve program reliability and understanding. As the design and implementation of reliable software remains an important issue, any progress in this area will have a significant impact. The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer-aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Groebner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis, and abstract interpretation. The aim of this workshop is to bring together researchers from these diverse fields. Scope ----- We encourage submissions presenting work in progress, tools under development, as well as work by PhD students, such that the workshop can become a forum for active dialogue between the groups involved in this new research area. 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 the following tools: - 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 Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Important Dates --------------- Submission deadline: April 06, 2012 Notification of acceptance: May 04, 2012 Final version due: June 08, 2012 Workshop: June 30, 2012 Submission ---------- WING 2012 encourages submissions in the following two categories: * Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. Given the informal style of the workshop, papers describing work in progress, with sufficient detail to assess the contribution, are also welcome. Original papers should not exceed 15 pages. * Extended abstracts: contain preliminary reports of work in progress, case studies, or tool descriptions. These will be judged based on the expected level of interest for the WING community. They will be included in the CEUR-WS proceedings. Extended abstracts should not exceed 5 pages. All submissions should conform to Springer's LNCS format. Formatting style files can be found at http://www.springer.de/comp/lncs/authors.html Technical details may be included in an appendix to be read at the reviewers' discretion and to be omitted in the final version. Please prepare your submission in accordance with the rules described above and submit a pdf file via https://www.easychair.org/?conf=wing2012 Publication ----------- All submissions will be peer-reviewed by the program committee. Accepted contributions will be published in archived electronic notes, as a volume of CEUR Workshop Proceedings. A special issue of the Journal of Science of Computer Programming with extended versions of selected papers will be published after the workshop. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Dejan.Nickovic at ait.ac.at Tue Jan 31 08:35:28 2012 From: Dejan.Nickovic at ait.ac.at (Nickovic Dejan) Date: Tue, 31 Jan 2012 14:35:28 +0100 Subject: [TYPES/announce] CfP: FORMATS'12 - 10th International Conference on Formal Modeling and Analysis of Timed Systems Message-ID: <7E6452B3D693BB45A4C92F20A9331B5A787A947739@MAILBOX.arc.local> CALL FOR PAPERS FORMATS 2012 10th International Conference on Formal Modeling and Analysis of Timed Systems Imperial College London, London, United Kingdom 18-20 September, 2012 http://go.warwick.ac.uk/formats2012/ (Co-located with QEST 2012) -------------------------------------------------------------------------------- Objective and Scope: Timing aspects of systems from a variety of computer science domains have been treated independently by different communities. Researchers interested in semantics, verification and performance analysis study models such as timed automata and timed Petri nets, the digital design community focuses on propagation and switching delays, while designers of embedded controllers have to take account of the time taken by controllers to compute their responses after sampling the environment. Timing-related questions in these separate disciplines do have their particularities. However, there is a growing awareness that there are basic problems that are common to all of them. In particular, all these sub-disciplines treat systems whose behavior depends upon combinations of logical and temporal constraints; namely, constraints on the temporal distances between occurrences of events. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modeling and analysis of timed systems. Typical topics include (but are not limited to): * Foundations and Semantics: Theoretical foundations of timed systems and languages; comparison between different models (timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). * Methods and Tools: Techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (scheduling, worst-case execution time analysis, optimization, model checking, testing, constraint solving, etc.). * Applications: Adaptation and specialization of timing technology in application domains in which timing plays an important role (real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunications). -------------------------------------------------------------------------------- Important Dates: * Abstract submission: 7 May 2012 * Paper submission: 11 May 2012 * Notification: 15 June 2012 * Final version due: 7 July 2012 -------------------------------------------------------------------------------- Program Chairs: Marcin Jurdzi?ski, University of Warwick, UK Dejan Nickovic, AIT, Austria -------------------------------------------------------------------------------- Submission and Publication: The proceedings of FORMATS 2012 will be published by Springer in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate references to and comparison with related work. Simultaneous submission to other conferences with published proceedings is not allowed. Submissions should not exceed 15 pages, and should 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. Submissions will be handled by the EasyChair system. -------------- next part -------------- An HTML attachment was scrubbed... URL: From deligu at di.unito.it Tue Jan 31 16:34:55 2012 From: deligu at di.unito.it (Ugo de' Liguoro) Date: Tue, 31 Jan 2012 22:34:55 +0100 Subject: [TYPES/announce] Classical Logic and Computation (CL&C'12): Call for Papers Message-ID: <4F285E7F.5010201@di.unito.it> International Workshop on Classical Logic and Computation (CL&C'12) http://www.doc.ic.ac.uk/~svb/CLaC12 July, 8 2012 Warwick, England CL&C'12 is a satellite workshop of ICALP'12. IMPORTANT DATES Deadline for abstract: March, 29, 2012 Deadline for submission: April, 9, 2012 Notification of acceptance: June, 11, 2012 Final version due: June, 25, 2012 Workshop date: July, 8, 2012 INTRODUCTION CL&C'12 is the fourth of a conference series on Classical Logic and Computation. It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as satellite workshop of ICALP'12 in Warwick: http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/ CL&C is focused on the interplay between program extraction from classical the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic; - design of programming languages inspired by classical logic; - cut-elimination for classical systems; - proof representation and proof search for classical logic; - translations of classical to intuitionistic proofs; - constructive interpretation of non-constructive principles; - witness extraction from classical proofs; - constructive semantics for classical logic (e.g. game semantics); - case studies (for any of the previous points). SUBMISSION AND PUBLICATION. This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic / position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. All submitted papers will be reviewed to normal standards. The PC recognises two kinds of papers: it will distinguish between accepted (full) papers that contain unpublished results not submitted elsewhere, and presentations of (short) papers about work in progress. The accepted papers will appear in EPTCS. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at https://www.easychair.org/conferences/?conf=clc2012 A participants' proceedings will be distributed at the workshop. PROGRAMME COMMITTEE * Herman Geuvers (Nijmegen) - chair * Stefano Berardi (Turin) * Steffen van Bakel (Imperial College London) * Silvia Ghilezan (Novi Sad) * Ugo de'Liguoro (Turin) CONTACT deligu at di.unito.it From giannini at di.unipmn.it Tue Jan 31 16:35:49 2012 From: giannini at di.unipmn.it (Paola Giannini) Date: Tue, 31 Jan 2012 22:35:49 +0100 Subject: [TYPES/announce] CS2Bio'12 (First Call for paper) Message-ID: <54D744AB-E457-47ED-BFB9-CB666C07781D@di.unipmn.it> ======================================================= Call for Papers CS2Bio'12 3rd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'12 16th of June 2012 Stockholm, Sweden http://cs2bio12.di.unipmn.it/ ======================================================== The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science, Biology and life sciences. In particular, we solicit contribution of original results that address both theoretical aspects of modeling and applied work on the comprehension of biological behavior. We encourage presentations of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present the modeling a specific biological phenomenon using formal techniques, or a modeling, 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. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Formal methods for the representation of biological systems and their dynamics (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparison between different formal models for the modeling of biological processes; -- Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi. -- Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: -- Prediction of biological behavior from incomplete information; -- Model checking, abstract interpretation, type systems, etc. Tools and Simulation -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological and medical systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of a Computer Science journal is planned. *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio12). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. *** IMPORTANT DATES *** - Submission deadline: April 2, 2012 - Notification to authors: May 16, 2012 - Workshop: June 16, 2012 *** STEERING COMMITTEE *** - Erik de Vink - Paola Giannini - Jean Krivine - Angelo Troina *** PROGRAM COMMITTEE *** - Francesca Cordero - Erik de Vink (Co-chair) - Francois Fages - Jerome Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - David Safranek - Angelo Troina - Adelinde Uhrmacher - Verena Wolf Other names to be confirmed. -- Paola Giannini Dipartimento di Informatica Universita' del Piemonte Orientale via Teresa Michel, 11 15100 Alessandria, Italy phone: (+39) 0131 360171 fax : (+39) 0131 360390 email: giannini at di.unipmn.it http://www.di.unito.it/~giannini -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Wed Feb 1 14:51:12 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Wed, 01 Feb 2012 20:51:12 +0100 Subject: [TYPES/announce] Call for Papers - Workshop on Reversible Computation 2012 Message-ID: <4F2997B0.3070104@informatik.uni-bonn.de> ============================================================== Call for Papers 4th Workshop on Reversible Computation (RC 2012) July 2nd-3rd, 2012, Copenhagen, Denmark Abstract Submission: March 2nd, 2012 Submission Deadline: March 9th, 2012 http://www.reversible-computation.org ============================================================== Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, program debugging, testing, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented recently and are seen as promising alternatives to conventional CMOS technology. The workshop will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation. This particularly includes applications of reversibility in quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the workshop. Contributions on the following topics in Reversible Computation are welcome: * Applications * Architectures * Algorithms * Circuit Design * Debugging * Fault Tolerance and Error Correction * Hardware * Information Theory * Physical Realizations * Programming Languages * Quantum Computation * Software * Synthesis * Theoretical Results * Testing * Verification ===== Important Dates ===== - Abstract Submission: March 2nd, 2012 - Submission Deadline: March 9th, 2012 (strict) - Notification to Authors: May 7th, 2012 - Final Version: June 1st, 2012 - Workshop: July 2nd-3rd, 2012 ===== Paper submission ===== Interested researchers are invited to submit full research papers (12 pages maximum), tutorials (12 pages maximum), as well as work-in-progress reports or demonstration papers (6 pages maximum). All submissions will be accepted as PDF file using the LNCS style (more details can be found at the workshop website). A preliminary version of the proceedings will include all accepted papers and will be available at the workshop. Furthermore, authors of selected papers will be invited after the workshop to prepare a final version of their paper to be published in an official publication venue. Paper can be submitted through the following webpage: http://www.reversible-computation.org/2012/cms/index.php?paper_submission ===== Program Chairs ===== Robert Gl?ck University of Copenhagen glueck at acm.org Tetsuo Yokoyama Nanzan University tyokoyama at acm.org ===== Program Committee ===== * St?phane Burignat (Gent University, Belgium) * Vincent Danos (Universit? Paris Diderot, France) * Gerhard W. Dueck (University of New Brunswick, Canada) * Nate Foster (Cornell University, USA) * Luca Gammaitoni (University of Perugia, Italy) * Simon Gay (University of Glasgow, United Kingdom) * Markus Grassl (Centre for Quantum Technologies, Singapore) * Jarkko J. Kari (University of Turku, Finland) * Martin Kutrib (University of Giessen, Germany) * Per Larsson-Edefors (Chalmers University of Technology, Sweden) * Kazutaka Matsuda (Tohoku University, Japan) * D. Michael Miller (University of Victoria, Canada) * Shin-ichi Minato (Hokkaido University, Japan) * Kenichi Morita (Hiroshima University, Japan) * Ilia Polian (University of Passau, Germany) * Michel Schellekens (University College Cork, Ireland) * Irek Ulidowski (University of Leicester, United Kingdom) * Janis Voigtl?nder (University of Bonn, Germany) * Robert Wille (University of Bremen, Germany) * Paolo Zuliani (Carnegie Mellon University, USA) ===== Workshop Organizer ===== Holger Bock Axelsen University of Copenhagen Department of Computer Science Universitetsparken 1 2100 Copenhagen, Denmark info at reversible-computation.org http://www.reversible-computation.org From herbert at doc.ic.ac.uk Thu Feb 2 07:06:32 2012 From: herbert at doc.ic.ac.uk (Herbert Wiklicky) Date: Thu, 02 Feb 2012 12:06:32 +0000 Subject: [TYPES/announce] QAPL'12 - Call for Participation Message-ID: <4F2A7C48.4010605@doc.ic.ac.uk> [Apologies for multiple copies] ******************************************************************************* CALL FOR PARTICIPATION Tenth Workshop on Quantitative Aspects of Programming Languages (QAPL 2012) Affiliated with ETAPS 2012 March 31 - April 1, 2012, Tallinn, Estonia http://www1.isti.cnr.it/~Massink/EVENTS/QAPL2012/ ******************************************************************************* PROGRAMME: The programme for the workshop is available from: http://www1.isti.cnr.it/~Massink/EVENTS/QAPL2012/ REGISTRATION Registration is through the ETAPS registration page: http://www.etaps.org/2012/registration Details on the venue, local information and accommodation are also available through the ETAPS site: http://www.etaps.org INVITED SPEAKERS: * Jeremy Bradley, Imperial College London, U.K. Topic: Mean field and fluid approaches to Markov chain analysis * Boris K?pf, IMDEA Software Institute, Madrid, Spain Topic: Quantitative Information-flow Analysis * Kim G. Larsen, Aalborg University, Denmark Topic: Statistical Model Checking SCOPE: Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as well as mathematical quantities (e.g. probability and measures for reliability, security and trust). Such quantities play a central role in defining both the model of systems (architecture, language design, semantics) and the methodologies and tools for the analysis and verification of system properties. The aim of this workshop is to discuss the explicit use of quantitative information such as time and probabilities either directly in the model or as a tool for the analysis of systems. In particular, the workshop focuses on: * the design of probabilistic, real-time, quantum languages and the definition of semantical models for such languages * the discussion of methodologies for the analysis of probabilistic and timing properties (e.g. security, safety, schedulability) and of other quantifiable properties such as reliability (for hardware components), trustworthiness (in information security) and resource usage (e.g., worst-case memory/stack/cache requirements) * the probabilistic analysis of systems which do not explicitly incorporate quantitative aspects (e.g. performance, reliability and risk analysis) * applications to safety-critical systems, communication protocols, control systems, asynchronous hardware, and to any other domain involving quantitative issues ORGANIZATION: PC Chairs: * Mieke Massink, CNR-ISTI, Pisa, Italy * Herbert Wiklicky, Imperial College London, UK Program Committee: * Alessandro Aldini, University of Urbino, Italy * Christel Baier, Technical University of Dresden, Germany * Marco Bernardo, University of Urbino, Italy * Nathalie Bertrand, IRISA/INRIA Rennes, France * Luca Bortolussi, University of Trieste, Italy * Jeremy Bradley, Imperial College London, UK * Tomas Brazdil, Masaryk University, Czech Republic * Antonio Cerone, UNU-IIST, Macao * Kostas Chatzikokolakis, CNRS, France * Josee Desharnais, Laval University, Canada * Alessandra Di Pierro, University of Verona, Italy * Mieke Massink, CNR-ISTI, Pisa, Italy * Paulo Mateus, Technical University of Lisbon, Portugal * Annabelle McIver, Maquarie University, Australia * Gethin Norman, University of Glasgow, UK * David Parker, University of Oxford, UK * Anne Remke, University of Twente, the Netherlands * Jeremy Sproston, University of Torino, Italy * Herbert Wiklicky, Imperial College London, UK From cezarykaliszyk at gmail.com Thu Feb 2 14:07:52 2012 From: cezarykaliszyk at gmail.com (Cezary Kaliszyk) Date: Thu, 2 Feb 2012 20:07:52 +0100 Subject: [TYPES/announce] UITP'12: First Call for Papers Message-ID: <20120202190752.GA1887@lap39-cl-c703.uibk.ac.at> UITP'12: First Call for Papers [Apologies if you receive multiple copies] ------------------------------------------ --- First Call for Papers --- 10th International Workshop on User Interfaces for Theorem Provers (UITP 2012) 11.07.2012, Bremen, Germany, Part of CICM 2012 http://www.informatik.uni-bremen.de/uitp12/ While interactive theorem provers have found many new application areas in the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. More and more, this is becoming an obstacle for the wider adoption of theorem proving technologies outside the academic community. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with interactive proof systems, be it theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. For the forthcoming 10th UITP workshop, we invite contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. Topics covered include, but are not limited to: * Application-specific interaction mechanisms or designs for prover interfaces; * Experiments and evaluation of prover interfaces; * Languages and tools for authoring, exchanging and presenting proof; * Implementation techniques (e.g. web services, custom middleware, DSLs); * Integration of interfaces and tools to explore and construct proof; * Representation and manipulation of mathematical knowledge or objects; * Visualisation of mathematical objects and proof; * System descriptions. Submitted papers should describe previously unpublished work (completed or in progress), and not be longer than twelve pages. We encourage concise but relevant papers. Submissions should be in PDF format, and typeset with the EasyChair LaTeX document class (which can be downloaded from www.easychair.org), or in similar style. Submission will be via EasyChair. All papers will be peer reviewed by members of the programme committee and selected by the organizers in accordance with the referee reports. Proceedings Accepted papers will appear in the workshop proceedings, which will be available in printed form at the workshop. After the workshop, revised papers can be submitted to a postproceedings, which will appear in an archivable electronic format, preferably published open access. Important Dates Submission deadline: 01.05.2012 Acceptance notification: 01.06.2012 Camera-ready copy: 15.06.2012 PC Chairs Christoph L?th (DFKI, Germany) Cezary Kaliszyk (University of Innsbruck, Austria) The full program committee will be announced soon. More information about the workshop series can be found at the UITP Interest Group web page www.uitp-ig.org. -- Cezary Kaliszyk, University of Innsbruck, http://cl-informatik.uibk.ac.at/~cek/ From rseba at disi.unitn.it Thu Feb 2 13:58:50 2012 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Thu, 2 Feb 2012 19:58:50 +0100 Subject: [TYPES/announce] SAT 2012: Final Call for Papers Message-ID: <20120202185850.GA9912@disi.unitn.it> [ We apologize if you receive multiple copies of this CFP. ] ------------------------------------------------------------------------- 15th International Conference on THEORY AND APPLICATIONS OF SATISFIABILITY TESTING --- SAT 2012 --- Trento, Italy, June 17-20th, 2012 http://sat2012.fbk.eu/ ------------------------------------------------------------------------- AIM and SCOPE ============= The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers studying the propositional satisfiability problem. Importantly, here SAT is interpreted in a rather broad sense: besides plain propositional satisfiability, it includes the domains of MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraints Programming (CSP) techniques for word-level problems and their propositional encoding. To this extent, many hard combinatorial problems can be encoded as SAT instances, in the broad sense mentioned above, including problems that arise in hardware and software verification, AI planning and scheduling, OR resource allocation, etc. The theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in these domains. SAT 2012 will take place in Trento, Italy, a cosmopolitan city set in a spectacular mountain scenery, and home to a world-class university and research centres. RELEVANT TOPICS =============== The topics of the conference span practical and theoretical research on SAT (in the broader sense above) and its applications, and include, but are not limited to: * Theoretical issues - Combinatorial Theory of SAT - Proof Systems and Proof Complexity in SAT - Analysis of SAT Algorithms * Solving: - Improvements of current solving procedures - Novel solving procedures, techniques and heuristics - Incremental solving * Beyond solving: - Functionalities (e.g., proofs, unsat-cores, interpolants,...) - Optimization * Applications - SAT techniques for other domains - Novel Problem Encodings - Novel Industrial Applications of SAT A more detailed description can be found on the web site. INVITED SPEAKERS ================ We are honored to announce the following invited speakers at SAT 2012: * Aaron Bradley, Boulder, USA. "SAT-based Verification with IC3: Foundations and Demands" * Donald Knuth, Stanford, USA. "Satisfiability and The Art of Computer Programming" The presence of both speakers has been confirmed, although the titles of the talks may be provisional. AFFILIATED EVENTS ================= SAT 2012 is co-located with the 2nd International SAT/SMT Summer School (June 12-15), http://satsmtschool2012.fbk.eu/. SAT 2012 will also host related events like workshops (June 16) and various competitive events. PAPER SUBMISSION ================ Papers must be edited in LATEX using the LNCS format and be submitted electronically as PDF files via EasyChair. We envisage three categories of submissions: REGULAR PAPERS. Submissions, not exceeding fourteen (14) pages, should contain original research, and sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data available with their submission. Submissions reporting on case studies in an industrial context are strongly invited, and should describe details, weaknesses and strength in sufficient depth. Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. TOOL PRESENTATIONS. Submissions, not exceeding six (6) pages, should describe the implemented tool and its novel features. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented in other conferences before will be accepted only if significant and clear enhancements to the tool are reported and implemented. EXTENDED ABSTRACTS/POSTERS. Submissions, not exceeding two (2) pages, briefly introducing work in progress, student work, or preliminary results. These papers are expected to be presented as posters at the conference. Further information about paper submission, including a more detailed description of the scope and specification of the three submission categories, will be made available at SAT 2012 web page. The review process will be subject to a rebuttal phase. IMPORTANT DATES: ================ Abstract Submission: 05/02/2012 Paper Submission: 12/02/2012 Rebuttal phase: 28-30/03/2012 Final Notification: 12/04/2012 Final Version Due: 04/05/2012 SAT/SMT School: 12-15/06/2012 Workshops: 16/06/2012 Conference: 17-20/06/2012 PROCEEDINGS =========== The proceedings of SAT 2012 will be published by Springer-Verlag in the LNCS series. PROGRAM CHAIRS ============== Alessandro Cimatti -- FBK-Irst, Trento, Italy Roberto Sebastiani -- DISI, University of Trento, Italy PROGRAM COMMITTEE ================= Dimitris Achlioptas -- UC Santa Cruz, USA Fahiem Bacchus -- University of Toronto, Canada Paul Beame -- University of Washington, USA Armin Biere -- Johannes Kepler University, Austria Randal Bryant -- Carnegie Mellon University, USA Uwe Bubeck -- University of Paderborn, Germany Nadia Creignou -- Aix-Marseille Universit?, France Leonardo DeMoura -- Microsoft Research, USA John Franco -- University of Cincinnati, USA Malay Ganai -- NEC, USA Enrico Giunchiglia -- Universit? di Genova, Italy Youssef Hamadi -- Microsoft Research, UK Zyiad Hanna -- Jasper, USA Holger Hoos -- University of British Columbia, Canada Marijn Heule -- Johannes Kepler University, Austria Kazuo Iwama -- Kyoto University, Japan Oliver Kullmann -- Swansea University, UK Daniel Le Berre -- Universit? d?Artois, France Ines Lynce -- Instituto Superior Te?cnico, Portugal Panagiotis Manolios -- Northeastern University, USA Joao Marques-Silva -- University College Dublin, Ireland David Mitchell -- Simon Fraser University, Canada Alexander Nadel -- Intel, Israel Jussi Rintanen -- The Austrailan National University, Australia Lakhdar Sais -- Universite? d?Artois, France Karem Sakallah -- University of Michigan, USA Bart Selman -- Cornell University, USA Laurent Simon -- Universit? Paris 11, France Carsten Sinz -- Karlsruhe Institute of Technology, Germany Niklas Sorensson -- Chalmers University, Sweden Ofer Strichman -- Technion, Israel Stefan Szeider -- Vienna University of Technology, Austria Allen Van Gelder -- University of California, Santa Cruz, USA Toby Walsh -- University of New South Wales, Australia Xishun Zhao -- Sun Yat-Sen University, China From spitters at cs.ru.nl Tue Feb 7 07:38:54 2012 From: spitters at cs.ru.nl (Bas Spitters) Date: Tue, 7 Feb 2012 13:38:54 +0100 Subject: [TYPES/announce] Announcement: Fourth Workshop on Formal Topology (4WFTop) and Workshop on higher dimensional algebra, categories and types (HDACT) Message-ID: FOURTH WORKSHOP ON FORMAL TOPOLOGY (4WFTop) June 15-19 2012 and HIGHER DIMENSIONAL ALGEBRA, CATEGORIES AND TYPES (HDACT) June 20 2012 Ljubljana (Slovenia) http://4wft.fmf.uni-lj.si/ FOURTH WORKSHOP ON FORMAL TOPOLOGY (4WFTop) =========================================== The workshop on formal topology is an international meeting dedicated to formal topology and related topics, including constructive and computable topology, point-free topology, and other generalizations of topology. This is the fourth of a series of successful meetings on the development of Formal Topology and its connections with related approaches. The first three have been held in Padua (1997), Venice (2002), and Padua (2007). IMPORTANT DATES May 2 - deadline for abstract submissions May 16 - notification of accepted contributions June 15 - 4WFTop tutorial day June 16-19 - 4WFTop workshop June 20 - HDACT workshop KEYNOTE SPEAKERS * Per Martin-L?f (Stockholm University) * Ieke Moerdijk (Radboud University Nijmegen) * Vladimir Voevodsky (Institute of Advanced Studies) INVITED SPEAKERS * Olivia Caramello (University of Cambridge) * Francesco Ciraulo (University of Padua) * Hajime Ishihara (Japan Advanced Institute of Science and Technology) * Davorin Le?nik (TU Darmstadt) * Claudio Sacerdoti Coen (University of Bologna) * Alex Simpson (University of Edinburgh) * Bas Spitters (Radboud University Nijmegen) * Paul Taylor (United Kingdom) PROGRAM COMMITTEE * Andrej Bauer (chair, University of Ljubljana) * Thierry Coquand (Chalmers University) * Maria Emilia Maietti (University of Padua) * Giovanni Sambin (University of Padua) * Peter Schuster (co-chair, University of Leeds) SUBMISSIONS Submissions of short abstracts are accepted through easychair.org, see http://www.easychair.org/conferences/?conf=4wftop TUTORIAL DAY June 15th 2012 will be dedicated to tutorials on topics in and around formal topology, suitable for researchers and graduate students without in-depth knowledge of the area. They will be given by: * Thierry Coquand (Chalmers University) * Erik Palmgren (Stockholm University) * Giovanni Sambin (University of Padua) * Steven Vickers (University of Birmingham) For further information on the workshop visit http://4wft.fmf.uni-lj.si/ The workshop is supported by: * Faculty of Mathematics and Physics at the University of Ljubljana * Institute of mathematics, physics and mechanics, Ljubljana HIGHER DIMENSIONAL ALGEBRA, CATEGORIES AND TYPES ================================================ The Workshop on formal topology will be followed by a one-day workshop on higher dimensional algebra, categories and types, organized by * Nicola Gambino * Niel Ghani * Zhaohui Luo * Randy Pollack * Urs Schreiber * Bas Spitters * Thomas Streicher The importance of higher dimensional structure for mathematics and computer science has been recognized for a long time. However, recent connections between homotopy theory and type theory have spurred new activity that is connecting previously unrelated topics. The workshop will be a place for meeting and dissemination of ideas between researchers from different areas who all use higher dimensional structures. More information on participation and submission will follow. For further information on the workshop visit http://4wft.fmf.uni-lj.si/ From francesco.tiezzi at imtlucca.it Wed Feb 8 03:42:30 2012 From: francesco.tiezzi at imtlucca.it (Francesco tiezzi) Date: Wed, 8 Feb 2012 09:42:30 +0100 Subject: [TYPES/announce] 1st Call for Papers: WWV 2012 Message-ID: [Apologies for multiple copies] ******************************************************** First Call for Papers WWV 2012 Automated Specification and Verification of Web Systems 8th International Workshop (as part of DisCoTec'12) http://users.dsic.upv.es/~jsilva/wwv2012/ June 16, 2012 - Stockholm, Sweden ******************************************************** IMPORTANT DATES Abstract Submission March 26, 2012 Full Paper Submission April 2, 2012 Acceptance Notification May 16, 2012 Camera Ready (pre-proceedings) May 30, 2012 Workshop June 16, 2012 Camera Ready (post-proceedings) July 4, 2012 SCOPE 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. 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. INVITED SPEAKER TBA 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 in PDF format and prepared in LaTeX using the EPTCS-style format (http://style.eptcs.org/) and should not exceed 15 pages (typeset 11 points). Submissions are handled using the EasyChair online system and can be uploaded using the following link: https://www.easychair.org/conferences/?conf=wwv2012 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. Workshop post-proceedings will be published as a volume of the EPTCS (Electronic Proceedings in Theoretical Computer Science, http://eptcs.org/) series. An open call for a special high-quality journal issue on the topic of the WWV workshop is envisaged. WORKSHOP CO-CHAIRS Josep Silva Universidad Polit?cnica de Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy PROGRAM COMMITTEE Jesus M. Almendros-Jimenez Universidad de Almeria, Spain Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz University of Minho, Portugal Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Elie Najm Telecom ParisTech, France Rosario Pugliese University of Florence, Italy Ant?nio Ravara University of Lisbon, Portugal Kostis Sagonas Uppsala University, Sweden Josep Silva Universidad Polit?cnica de Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom CONTACT wwv2012 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From palmgren at math.su.se Wed Feb 8 10:24:56 2012 From: palmgren at math.su.se (Erik Palmgren) Date: Wed, 8 Feb 2012 16:24:56 +0100 Subject: [TYPES/announce] Call for Papers: 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK Message-ID: <06C347CB-2841-4F7F-A38D-B8FD4E70834A@math.su.se> 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK First Announcement and Call for Papers The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner, Denmark, 20-21 August 2012. After a gap of fifteen years, the Scandinavian Logic Symposium is back. The Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS, http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark. As with previous editions of this conference, the aim of the programme is to reflect current activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic countries and Northwestern Russia will take the opportunity to contribute a talk and to meet with fellow logicians from the area. But needless to say, we also extend a warm welcome to logicians from further afield and plan to present a varied and interesting collection of invited and contributed talks. Related events: A post-SLS tutorial day will be organized on August 22 Also note that Advances in Modal Logic (AiML) will be held on 22-25 August 2012, Copenhagen, Denmark. URL:http://hylocore.ruc.dk/aiml2012/ . TOPICS The scope of SLS 2012 is broad, ranging over the whole area of mathematical and philosophical logic, and logical methods in computer science. Suitable topics include (but are not limited to) Proof Theory and Constructivism, Model Theory (including Finite Model Theory), Set Theory, Computability Theory, Categorical Logic, Logic and Provability, Logic and Computer Science, Logic and Linguistics, Modal, Hybrid, Temporal and Description Logic, Logics of Games, Dynamics and Interaction, and Philosophical Logic. PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA: 7th Scandinavian Logic Symposium: Uppsala in 1996 6th Scandinavian Logic Symposium: Telemark in 1982 5th Scandinavian Logic Symposium: Aalborg in 1979 4th Scandinavian Logic Symposium: Jyv?skyl? in 1976 3rd Scandinavian Logic Symposium: Uppsala in 1973 2nd Scandinavian Logic Symposium: Oslo in 1971 1st Scandinavian Logic Symposium: ?bo in 1968 The proceedings of several of these meetings have been published in book form. INVITED SPEAKERS To be announced PROGRAM COMMITTEE Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm) Members: Torben Brauner (Roskilde) Peter Dybjer (Chalmers) Lars Kristiansen (Oslo) ?ystein Linnebo (Birkbeck) Sara Negri (Helsinki) Dag Normann (Oslo) Asger T?rnquist, (Vienna) Jouko V??n?nen (Helsinki) ORGANISING COMMITTEE Patrick Blackburn (RUC), Klaus Frovin J?rgensen (RUC), Stig Andur Petersen (RUC) SUBMISSIONS Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system https://www.easychair.org/conferences/?conf=sls2012 The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format. LOCATION Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from Central Copenhagen, and five minutes by train from Roskilde. ACCOMMODATION Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most conference attendees will book hotels in central Copenhagen, where there are many hotels in many price ranges. Hotel accommodation can also be found in Roskilde, though there the options are more limited. REGISTRATION The conference website will be found at: http://scandinavianlogic.weebly.com/ Details concerning registration will be posted there in due course. Erik Palmgren, Professor Department of Mathematics Stockholm University 106 91 Stockholm www.math.su.se/~palmgren palmgren at math.su.se -------------- next part -------------- An HTML attachment was scrubbed... URL: From carbonem at itu.dk Thu Feb 9 11:14:26 2012 From: carbonem at itu.dk (Marco Carbone) Date: Thu, 9 Feb 2012 17:14:26 +0100 Subject: [TYPES/announce] ICE 2012 - First Call for Papers (Deadline 4 April 2012) Message-ID: Dear all, Please find below the ICE 2012 Call for Papers. Apologies for multiple copies. Yours, Marco Carbone, Ivan Lanese, Alexandra Silva and Ana Sokolova +++++++++++++++++++++++ * ICE 2012 5th Interaction and Concurrency Experience June 16, 2012, Stockholm, Sweden http://www.artist-embedded.org/artist/-ICE-2012-.html Satellite workshop of DisCoTec 2012 http://discotec.ict.kth.se/ === Highlights === - Invited talks: Marcello Bonsangue & Ichiro Hasuo - Innovative selection procedure - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 30 March 2012................Abstract submission 04 April 2012...................Full paper submission 18 April - 12 May 2012....Reviews, rebuttal and PC discussion 16 May 2012....................Notification to authors 30 May 2012....................Camera-ready for pre-proceedings 16 June 2012...................ICE in Stockholm 15 Sept 2012...................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, but every experience focuses on a different specific topic (see "Previous Editions" at the end of this call) related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. The theme of ICE 2012 is ***Distributed coordination, execution models, and resilient interaction***. 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 interaction - 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 - Relating 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 whose access will be restricted to the authors and all the PC members who do not have a conflict of interests with the paper. The PC members post comments/questions that the authors shall reply to. As witnessed by the past four 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 will be 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 === Papers must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2012 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2012) and should not exceed 15 pages with the EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full versions of the best papers selected by the PC will be invited to appear in a special issue of the journal of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/). 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 === Lucia Acciai (University of Firenze, Italy) Luca Aceto (Reykjavik University, Iceland) Massimo Bartoletti (University of Cagliari, Italy) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, United Kingdom) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marco Carbone (co-chair) Vincenzo Ciancia (University of Amsterdam, The Netherlands) Pierre-Malo Denielou (Imperial College, United Kingdom) Cinzia Di Giusto (CEA, France) Tobias Heindel (CEA, France) Tom Hirschowitz (CNRS, France) Bartek Klin (Warsaw University, Poland) Ivan Lanese (University of Bologna/INRIA, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Bas Luttik (Technische Universiteit Eindhoven, The Netherlands) Manuel Mazzara (Newcastle University, United Kingdom) Mohammadreza Mousavi (Technische Universiteit Eindhoven, The Netherlands) Damien Pous (CNRS, France) Jens-Wolfhard Schicke-Uffmann (TU Braunschweig, Germany ) Alexandra Silva (co-chair) Ana Sokolova (University of Salzburg, Austria) Francesco Tiezzi (IMT Lucca, Italy) Emilio Tuosto (University of Leicester, United Kingdom) Erik de Vink (Technische Universiteit Eindhoven, The Netherlands) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alexandra Silva (Radboud University Nijmegen & CWI, The Netherlands; HasLab / INESC TEC, Portugal; co-chair) - Ana Sokolova (University of Salzburg, Austria) === Contact === ice2012 at easychair.org === Previous editions === The previous four editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland with focus on Synchronous and Asynchronous Interactions in Concurrent/ Distributed Systems, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy with focus on Structured Interactions, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and a special issue of MSCS is in preparation. * June 10th, 2010 in Amsterdam, The Netherlands with focus on Guaranteed Interactions, 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 with focus on Reliable and Contract-based Interactions, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and a special issue of SACS is now in preparation. === Workshop Sponsors === CEA-List Computer Science Department - University of Bologna* -------------- next part -------------- An HTML attachment was scrubbed... URL: From tobias.wrigstad at it.uu.se Thu Feb 9 11:17:15 2012 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Thu, 9 Feb 2012 17:17:15 +0100 Subject: [TYPES/announce] Two post-doc positions at the UPMARC centre of excellence at Uppsala University Message-ID: <54386B15-772D-4542-BDCF-129571567CD6@it.uu.se> Two post-doc positions at the UPMARC centre of excellence at Uppsala University Topic: Methods and tools for software development for multicore computer systems within one or several of following areas: computer architecture, computer networks, programming language technology, real-time and embedded systems, scientific computing, semantics, testing, verification. One of the positions is reserved for the area of programming language technology. The positions are placed within the UPMARC centre of excellence at Uppsala University. UPMARC has been formed to make a broad coordinated attack on the challenges of developing methods and tools to support development of parallel software, and has been awarded a ten year Linnaeus grant from the Swedish Research Council, as a sign of scientific excellence. See http://www.upmarc.se Application deadline: March 16, 2012. For more information about how to apply, consult the official announcement at http://www2.personalavd.uu.se/ledigaplatser/281postdokENG.html A Post-Doctoral position requires a Ph.D. degree in Computer Science, Computer Engineering, or equivalent. The degree should typically have been obtained not more than three years ago. A Post-Doctoral position is time-limited for a maximum of two years, and may include some teaching (at most 20%). The department is striving to achieve a more equal gender balance and female candidates are particularly invited to apply. Some information about health- and childcare in Sweden: Healthcare incurs only small fees. Parental benefits are generous, allowing 13 months of parental leave, extending the length of employment correspondingly. Childcare is of high quality and very affordable. For more information, see http://www.upmarc.se (UPMARC), http://www.it.uu.se/ (the department) or contact: Prof. Bengt Jonsson, bengt.jonsson at it.uu.se, or any other member of the UPMARC consortium (see www.upmarc.se). ------------------------------------------------------------ Tobias Wrigstad, assistant professor (bitr. lektor) Department of Information Technology Uppsala University, Sweden Email: tobias.wrigstad at it.uu.se Office: +46-18-471-1072 Cell: +46-736-777-418 Web: http://wrigstad.com From kutsia at risc.jku.at Fri Feb 10 07:53:31 2012 From: kutsia at risc.jku.at (Temur Kutsia) Date: Fri, 10 Feb 2012 13:53:31 +0100 Subject: [TYPES/announce] PhD Position in Computational Logic at RISC Message-ID: <4F35134B.5010300@risc.jku.at> PhD Position in Computational Logic at RISC =========================================== Applications are invited for one PhD position in the frame of the project "SToUT: Symbolic Computation Techniques for Unranked Terms" funded by the FWF (Austrian Science Fund). The focus of the PhD project will be on designing new algorithms and procedures for solving equational constraints and anti-unification problems over unranked terms in various theories and on developing the corresponding software library. The successful applicant is expected to conduct research leading to original contributions to the project culminating in a PhD thesis. Requirements for applicants: * University degree in computer science or mathematics * Strong interest and commitment to research * Competency in English * Good programming skills * Preferably, knowledge of logic Interested candidates should submit their application to the project leader Temur Kutsia not later than March 31, 2012, preferably by email: Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz Altenbergerstrasse 69 A-4040 Linz, Austria Phone: +43 (0)732 2468 9982 kutsia at risc.jku.at The application should include a CV and a description of research interests. Informal enquiries to the same address are welcome. The position is for three years. The expected starting period is June-September 2012. The exact date can be negotiated. Salary is paid according to the FWF funding scheme for PhD students. The successful candidate will work and study at the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz, in an inspiring research environment in a medieval castle. Further information is available from the following links: SToUT Project: http://www.risc.jku.at/projects/stout/ RISC: http://www.risc.jku.at/ Johannes Kepler University: http://www.jku.at/ FWF salary scheme: http://fwf.ac.at/de/projects/personalkostensaetze.html From craciunf at googlemail.com Fri Feb 10 15:45:34 2012 From: craciunf at googlemail.com (Florin Craciun) Date: Fri, 10 Feb 2012 22:45:34 +0200 Subject: [TYPES/announce] CFP: FTfJP 2012 - 14th ECOOP Workshop on Formal Techniques for Java-like Programs Message-ID: CALL FOR PAPERS 14th ECOOP Workshop on Formal Techniques for Java-like Programs (FTfJP 2012) (co-located with ECOOP and PLDI) Beijing China June 12, 2012 http://www.comp.nus.edu.sg/~ftfjp OVERVIEW Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - formal techniques for Java, C#, Scala or similar languages - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties - verification logics - language semantics - type systems - dynamic linking and loading - security CALL FOR CONTRIBUTIONS Contributions (of up to 6 pages in the ACM 2-column style) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions need not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, and the potential to generate interesting discussions. Accepted papers will be published in the ACM Digital Library. In addition, depending on the nature of the contributions, we may organize a special journal issue as a follow-up to the workshop, as has been done for some of the previous FTfJP workshops. Contributions must be in English, in pdf format, and are limited to 6-pages in ACM 2-column style. Papers must be submitted electronically via Easy Chair at: https://www.easychair.org/conferences/?conf=ftfjp2012 Any PC member, other than the chair, may be an author or co-author on any paper submitted for consideration but will be excluded from any evaluation or discussion of the paper. IMPORTANT DATES abstract submission: 16 March 2012 (anywhere on Earth) full paper submission: 25 March 2012 (anywhere on Earth) notification: 29 April 2012 camera-ready paper: 12 May 2012 conference date: 12 June 2012 PROGRAM COMMITTEE Aditya Nori, Microsoft Research India Aquinas Hobor, National University of Singapore, (co-chair) Atsushi Igarashi, Kyoto University, Japan Florin Craciun, Babes Bolyai University, Romania Hoang Truong, Vietnam National University, Vietnam Jens Palsberg, University of California, USA Jesper Bengtson, IT-University of Copenhagen, Denmark Jianjun Zhao, Shanghai Jiaotong University, China John Boyland, University of Wisconsin-Milwaukee, USA Jules Villard, Queen Mary, University of London, UK Sophia Drossopoulou, Imperial College London, UK Thomas Wies, New York University, USA Tyng-Ruey Chuang, Academia Sinica, Taiwan Wei-Ngan Chin, National University of Singapore, (co-chair) Zongyan Qiu, Peking University, China From Frank.Ortmeier at ovgu.de Sun Feb 12 03:23:51 2012 From: Frank.Ortmeier at ovgu.de (Ortmeier, Frank, Prof.) Date: Sun, 12 Feb 2012 09:23:51 +0100 Subject: [TYPES/announce] SAFECOMP: March 5th - Deadline for papers Message-ID: CALL FOR PAPERS: SAFECOMP 2012 ************************************************************************** 31st International Conference on Computer Safety, Reliability and Security 25.09. - 28.09.2012 \\ Magdeburg, Germany www.ovgu.de/safecomp ************************************************************************** DEADLINE EXTENSION: 5.3.2012 ************************************************************************** SAFECOMP is an annual event covering new trends, technologies and experiences in the areas of safety, security and reliability of critical computer applications. Since it was established in 1979, SAFECOMP has continuously contributed to the progress of state-of-the-art in dependability of computers in critical systems. The key theme of SAFECOMP2012 will be "Virtually safe -- making system safety traceable". Dependability is an abstract concept and so are most methods for analyzing them. But engineers, reviewers and the public need to understand why a system is safe. Therefore, in 2012 we will focus on methods which make system safety traceable and understandable. Examples range from virtual reality models and scenarios through simulation and model-based analyses to approaches for tracing requirements. All accepted papers will be published in a special volume of Springer LNCS. In addition, it is planned to invite the best contributions to a special issue of the International Journal on Reliability Engineering and System Safety (RESS) published by Elsevier. Deadline for papers is March 5th 2012. Dependability related topics for SAFECOMP2012 include but are not limited to: * safety/security risk assessment * model-based design and analysis * risk reduction and mitigation techniques * self-healing and resilience * formal methods, verification and validation * in-the-loop and model-based testing * methods for qualification and certification * dependability analysis using simulation and virtual reality * human factors in dependability analysis * cyber-physical threats and vulnerability analysis * safety guidelines, standards and certification * safety and security interactions * traceability & safety cases Domains of application include but are not limited to: * networking and telecommunication * railway systems, automotive, aerospace and avionics * logistics, production automation and robotics * medical devices and e-health * critical infrastructures and power systems * off-shore technology * education & training SAFECOMP will also offer various workshops on September 25th related to dependability. We will provide organization (including rooms, catering and payment). If workshops have adequate quality measures (i.e. program committee, acceptance rate, etc.), they might be included in a special Springer LNCS volume for SAFECOMP workshops. If you are interested in organizing a workshop please contact safecomp at ovgu.de for further details. Workshop proposals will be accepted/reject within in two weeks. Workshop proposal arriving before Nov 30th 2012, will be offered the possibility of including the workshops CFP in a joint CFP for workshops. Paper submission details ************************************************************************** The tradition of SAFECOMP is to act as platform for bringing together academic research and industrial needs. Therefore, industrial contributions and real-world experience reports are explicitly invited. We solicit two types of papers: * academic papers (up to 12 pages) and * industrial experiences papers (up to 8 pages). All papers will be reviewed by at least three members of the international program committee. Papers must not have been previously published or concurrently submitted elsewhere. Paper submission details and style files may be found on the website. Publication ************************************************************************** All accepted papers will be published by Springer in the LNCS series. In addition, it is planned to consider extended versions of the best papers for a special issue of the International Journal on Reliability Engineering and System Safety (RESS) published by Elsevier. Important dates ************************************************************************** Full paper submission: 05. March 2012 (extended) Tutorial proposals: 30. April 2012 Notification of acceptance: 14. May 2012 NEW: The SAFECOMP 2012 - Community - a new way of exchanging ideas with research colleagues ************************************************************************** Scientific conference are for networking and exchange of ideas! But, * very often you only learn who might be interesting for exchanging ideas at the very end of the conference (maybe after the social event). * you often find interesting people for discussion and wish, you could have read some of their papers before. To compensate these deficiencies, we developed the SAFECOMP Community forum. It is an absolutely PRIVATE, NON-COMMERCIAL forum for SAFECOMP authors, participants and supporters to hook up with each other. We will under no circumstances give away any data. In SAFECOMP Community, you may enter keywords describing your research and in exchange find colleagues in the community who are working and researching on similar topics. You will also be able to upload up to three of your own papers to share with others. As papers will only be available to a limited audience in a protected area this is also compliant with most copyright regulations. However, it is each authors responsibility to check this for his own papers. We hope, that you like this new feature and are happily awaiting any feedback and suggestions. Your advantages are: * Connect to other people with the same fields of research * With SAFECOMP Community you can find new colleagues, working on related problems * Make others aware of your newest ideas and publications * Plan your networking and the talks you are most interested in * Automatically get all information & updates regarding the conference Get more information about SAFECOMP Community at http://www.ovgu.de/safecomp/about-sc-2012/safecomp-community International Program Committee ************************************************************************** Program Chairs: F. Ortmeier (DE) P. Daniel (DE) Program Committee Members: Anderson S. (UK) Knight J. (US) Anderson T. (UK) Koornneef F. (NL) Bitsch F. (DE) Ladkin P. (DE) Bloomfield R. (UK) Lesage J.-J. (FR) Bologna S. (IT) Liggesmeyer P. (DE) Bondavali A. (IT) Lindskov Hansen S. (DK) Braband J. (DE) Littlewood B. (UK) Broy M. (DE) Mottok J. (DE) Buth B. (DE) Nordland O. (NO) Damm W. (DE) Ortmeier F. (DE) Daniel P. (UK) Pataricza A. (HU) Dittmann J. (DE) Pfeiffenberger T. (AT) Ehrenberger W. (DE) Reif W. (DE) Felici M. (UK) Rieger G. (DE) Flammini F. (IT) Romanovsky A. (UK) Frey G. (DE) Rothfelder M. (DE) Giese H. (DE) Saake G. (DE) Gla? M. (DE) Saglietti F. (DE) G?hner P. (DE) Sch?tz B. (DE) Gorski J. (PL) Schenk M. (DE) Grunske L. (DE) Schmitz C. (CH) Guiochet J. (Fr) Schoitsch E. (AT) Halang W. (DE) Schulze, S.-O. (IN) Heisel M. (DE) Sch?fer W. (DE) Heitmeyer C. (US) Sedigh S. (US) Johnson C. (UK) Sujan M.-A. (UK) J?rjens J. (DE) Trivedi K. (US) Kaaniche M. (FR Van der Meulen M. (NO) Keller H. (DE) Vogel-Heuser B. (DE) Kelly T. (UK) SAFECOMP Contacts: ************************************************************************** Otto-von-Guericke-Universit?t Magdeburg Fakult?t f?r Informatik Sekretariat Computer Systems in Engineering Universit?tsplatz 2 / Geb?ude 29 39106 Magdeburg Fon +49 391 67-18915 Fax +49 391 67-12020 Mail safecomp at ovgu.de -------------- next part -------------- An HTML attachment was scrubbed... URL: From craciunf at googlemail.com Sun Feb 12 06:12:29 2012 From: craciunf at googlemail.com (Florin Craciun) Date: Sun, 12 Feb 2012 13:12:29 +0200 Subject: [TYPES/announce] Ph.D. Studentship at University of Teesside, UK Message-ID: SCHOOL OF COMPUTING University of Teesside Fully Funded University Ph.D. Studentship (3 years) Ref: QinFeb12 Applications are invited for a Ph.D. student to work in the research area of formal methods and software verification under the supervision of Professor Shengchao Qin in the School of Computing in Teesside University. Prof. Qin is affiliated with the Teesside Formal Methods and Programming Research Group (TFMPRG) and has been supervising a number of research associate and Ph.D students. Prospective candidates must have (or expect to have) at least a good honours degree in Computer Science or closely related subjects at grade 2:1 or equivalent or higher. The studentship requires good background knowledge in most of the following areas: logic and discrete mathematics related to computer science, compilers, program analysis and software verification. Strong programming skills will also be essential for the studentship. This fully funded studentship provides a tax-free living allowance at the standard rate (?13,590 p.a. for 2011/12) and full student tuition fees for three years. The successful candidate is expected to start on October 1 2012. More information can be obtained by contacting Prof. Shengchao Qin at s.qin at tees.ac.uk, or by visiting http://www.scm.tees.ac.uk/s.qin. For an application form, applicants should contact graduateresearchschool at tees.ac.uk. Applicants are expected to return their application form plus a CV, a research proposal, their degree certificates and academic transcripts by the following deadline (to graduateresearchschool at tees.ac.uk and copy to Professor Qin): Deadline for application: 8 March 2012. The selection process will start shortly after the deadline and be completed in March. From sandra at dcc.fc.up.pt Sun Feb 12 18:46:07 2012 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Sun, 12 Feb 2012 23:46:07 +0000 Subject: [TYPES/announce] Call for Papers - First IFCoLog-CIE Student Session Message-ID: <1329090367.2186.7.camel@localhost.localdomain> Call for Papers First IFCoLog-CIE Student Session 18-23 June 2012, University of Cambridge. In conjunction with CiE 2012, TURING CENTENARY CONFERENCE ? How the World Computes =================================================================== Important Dates --------------- * 11 May 2012: Submission deadline * 31 May 2012: Author notification * 18-23 June 2012: Student Sessions The contributions and program will be available online before the event. Scope ----- The CiE-IFCoLog student sessions is an initiative to encourage undergraduate and master students to present their research projects at high profile computer science events, and offer a good opportunity for undergraduate and masters students to interact with more senior researchers. In 2012 CiE is celebrating the life achievements of Alan Turing and we believe that being involved in this event, will be an exciting opportunity for young people contemplating a research career. Topics ------ The CiE-IFCoLog student sessions will consider papers in all aspects of computability and foundations of computer science, as well as well as papers exploring the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. See CiE?s CFP for a list of topics: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?42 More details about the event will become available in http://www.ifcolog.net/?page_id=6149 Submission and Publication -------------------------- Authors are invited to submit an extended abstract (max. 5 pages). Papers should be written in English, and submitted in PostScript or PDF format, using the EasyChair class style. After the student session, authors of accepted submissions will be asked to submit a final version to be published in a biannual issue of the IFCoLog workshop series. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=cieifcologss2012 Programme Committee ------------------- Sandra Alves Edwin Brady Maribel Fern?ndez Michael Gabbay Ian Mackie Andrew Pits Pedro Vasconcelos Contact ------- Sandra Alves: sandra at dcc.fc.up.pt Michael Gabbay: michael.gabbay at kcl.ac.uk From Maribel.Fernandez at kcl.ac.uk Mon Feb 13 12:49:38 2012 From: Maribel.Fernandez at kcl.ac.uk (Maribel Fernandez) Date: Mon, 13 Feb 2012 17:49:38 +0000 Subject: [TYPES/announce] CFP: IWS 2012 at IJCAR, Manchester, 1 July 2012 Message-ID: <4F394D32.1070105@kcl.ac.uk> IWS 2012 at IJCAR: FIRST CALL FOR PAPERS 2nd Joint International Workshop on Strategies in Rewriting, Proving and Programming 1 July 2012, Manchester, UK http://www.dcs.kcl.ac.uk/staff/maribel/IWS2012/IWS2012.html **** Submission: 9 April 2012 **** AIM AND TOPICS: Strategies are ubiquitous in automated reasoning engines, high level programming languages, verification tools, and affect their useability, performance and practical impact. They control search (for proofs or models), transformation (of programs), access (to resources) and modelling. Work on strategies and search plans remains often hidden in implementations of theorem provers, proof assistants, model builders, interpreters, SAT and SMT solvers, decision procedures for satisfiability, termination provers and verifiers. The 2nd IWS Workshop provides a forum to present research on strategies, focusing on the following topics: * Strategies in automated theorem provers, automated model builders, decision procedures and their combinations, SAT and SMT solvers; * Strategies and tacticals in interactive theorem provers and proof assistants; * Strategies in interpreters of programming languages, rewriting engines and termination provers; * Strategies in program analysers and tools for verification modulo theories; * Performance evaluation: empirical evaluation, comparison and optimisation of strategies; * Strategy analysis: evaluation, comparison, and optimisation of strategies by mathematical approaches to model search spaces and measure search complexity; * Strategy languages: essential constructs, meta-level features, design, implementation and application; * Applications and case studies where strategies play a major role. Papers on strategies in automated reasoning, programming languages and software verification are equally welcome, as the workshop aims at facilitating synergies. IMPORTANT DATES: All in 2012: # Submission: 9 April # Notification: 7 May # Preliminary proceedings version due: 30 May # Submission for final proceedings: 9 September # Notification: 9 November # Final version: 2 December SUBMISSION AND PUBLICATION: There are three categories of submissions: Regular: This is for typical workshop papers. Authors submit an abstract (max 5 pages). Accepted abstracts are presented at the workshop and included in the preliminary proceedings, available at the workshop. After the workshop, authors of accepted abstracts are invited to submit a full version (max 15 pages), which is refereed again for inclusion in the final workshop proceedings, that we expect to publish with EPTCS (http://eptcs.org/). Abstract-only: This is for preliminary research that may not be ready to develop into a full paper afterthe workshop. Authors submit an abstract (max 5 pages). Accepted abstracts are presented at the workshop and included only in the preliminary proceedings. Presentation-only: This is for papers in the scope of the workshop that have been or will be published elsewhere. They may be submitted in full (max 15 pages), indicating where the paper appears. If accepted, one page including title, authors, abstract as in the published paper, and a reference to the full paper, is included in the preliminary proceedings. Authors are strongly encouraged to produce their papers in LaTeX and must indicate the submission category. All submissions are through https://www.easychair.org/account/signin.cgi?conf=iws2012 also reachable from the workshop web site. PROGRAMME COMMITTEE: Maria Paola Bonacina (Co-Chair) (Universita degli Studi di Verona) Bruno Dutertre (SRI International) Maribel Fernandez (Co-Chair) (King's College London) Mnacho Echenim (Universite de Grenoble) Swen Jacobs (EPFL) Helene Kirchner (INRIA) Salvador Lucas (Universidad Politecnica de Valencia) Christophe Ringeissen (INRIA) Stephan Schulz (eprover.org) CONTACT: mariapaola.bonacina at univr.it and Maribel.Fernandez at kcl.ac.uk From pangjun at gmail.com Tue Feb 14 03:31:32 2012 From: pangjun at gmail.com (Jun PANG) Date: Tue, 14 Feb 2012 09:31:32 +0100 Subject: [TYPES/announce] ICTAC'12: 2nd Call For Papers Message-ID: ================================================== ICTAC 2012 9th International Colloquium on Theoretical Aspects of Computing URL: http://www.iiitb.ac.in/ictac 24 - 27 September 2012, Bangalore, India ================================================== The Colloquium will be held at the International Institute of Information Technology (IIIT), which is located in Electronics City of Bangalore. It is two hours by car or taxi from Bangalore International Airport. Bangalore is internationally known as the Silicon Valley of India, with many hi-tech companies and research labs. Holding the conference in the Electronics City of Bangalore gives the conference participants valuable opportunity to discuss and network with the software practitioners and researchers in India's Information Technology (IT) hub. This will be further facilitated via an Industry Day, a special feature of ICTAC 2012. SUBMISSION DEADLINE -------------------------------------------------- Regular and Short Paper submission deadline: 16 April 2012 BACKGROUND ------------------------------------------------- ICTAC 2012 is the 9th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2012 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. TOPICS ------------------------------------------------- The topics of the conference include, but are not limited to: * automata theory and formal languages; * principles and semantics of programming languages; * logics and their applications; * software architectures and their description languages; * relationship between software requirements, models and code; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented architectures: models and development methods; * models of concurrency, security, and mobility; * theory of parallel, distributed, grid and cloud computing; * real-time, embedded, hybrid and cyber-physical systems; * type and category theory in computer science; * models for learning and education; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. INDUSTRY DAY ------------------------------------------------- ICTAC 2012 will feature an Industry Day, a special feature being introduced to the ICTAC colloquium for the first time. One of the days of the conference is planned to be marked as Industry Day. The industry day will feature technical talks from the industry participants. These talks will be drawn from the papers submitted and accepted to the conference; however any such paper must have at least one co-author from the Industry and must be clearly marked for `Industry Day' during submission. In addition, we plan to have tool demonstrations and posters by the companies in the exhibition floor. Participants from academia will thus also get a chance to mingle with the industry participants in an informal atmosphere, thereby getting a flavor of the ongoing activities in Bangalore's IT industry. Industry Day Co-chairs: * Sriram Rajamani (Microsoft Research) * Satish Chandra (IBM Research) KEYNOTE SPEAKERS ------------------------------------------------- * Gernot Heiser, UNSW (for Industry Day) * Luke Ong, Oxford * Ganesan Ramalingam, Microsoft Research PUBLICATION AND SUBMISSION ------------------------------------------------- The proceedings of ICTAC 2012 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2012 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be either Regular Papers or Short Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 15 pages and Short Papers should be between 4 and 8 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers shall be submitted at http://www.easychair.org/conferences/?conf=ictac2012 All queries should be sent to: ictac2012 at iist.unu.edu IMPORTANT DATES ------------------------------------------------- Paper submission deadline: 16 April 2012 Paper Accept/Reject Notification: 8 June 2012 Final paper submission: 29 June 2012 PROGRAM COMMITTEE ------------------------------------------------- * Ana Cavalcanti, University of York, UK * Supratik Chakraborty, IIT Mumbai, India * Satish Chandra, IBM Watson, USA * Yifeng Chen, Peking University, China * Meenakshi D'Souza, IIIT Bangalore, India * Thao Dang, Verimag, France * Frank S. deBoer, CWI, Netherlands * Xinyu Feng, USTC, China * John Fitzgerald, University of Newcastle, UK * Susanne Graf, Verimag, France * Lindsay Groves, Victoria University, New Zealand * Zhenjiang Hu, NII, Japan * Lei Ju, Shandong University, China * Moonzoo Kim, KAIST, Korea * Daniel Kroening, Oxford University, UK * Kim G. Larsen, Aalborg University, Denmark * Martin Leucker, TU Munich, Germany * Zhiming Liu, UNU-IIST, Macau SAR, China * Kamal Lodaya, Inst. of Mathematical Sciences, India * Annabelle McIver Macquarie University, Australia * Madhavan Mukund, Chennai Mathematical Inst., India * Kedar Namjoshi, Bell Labs, USA * Jun Pang, Univ. of Luxembourg, Luxembourg * Sanjiva Prasad, IIT Delhi, India * Geguang Pu, ECNU, China * Zongyan Qiu, Peking University, China * Anders P. Ravn, Aalborg University, Denmark * Abhik Roychoudhury, National University of Singapore, Singapore (Chair) * Diptikalyan Saha, IBM Research, India * Augusto Sampaio, UFPE, Brazil * Bikram Sengupta, IBM Research, India * R.K. Shyamasundar, TIFR, India * Sofiene Tahar, Concordia University, Canada * Kapil Vaswani, Microsoft Research, India * Wang Yi, Uppsala University, Sweden * Naijun Zhan, Chinese Academy of Sciences, China * Jianjun Zhao, Shanghai Jiao Tong University, China ORGANISING COMMITTEE ------------------------------------------------- * Meenakshi D'Souza, IIIT-B (General Chair) * Jun Pang, Univ. of Luxembourg (Publicity Chair) * Deepak D'Souza, Indian Institute of Science * Sumesh Divakaran, IIIT-B STEERING COMMITTEE ------------------------------------------------- * John Fitzgerald, UK * Martin Leucker, Germany * Zhiming Liu, Macau SAR China (Chair) * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK From dallago at cs.unibo.it Wed Feb 15 03:16:45 2012 From: dallago at cs.unibo.it (Ugo Dal Lago) Date: Wed, 15 Feb 2012 09:16:45 +0100 Subject: [TYPES/announce] DICE 2012 - Call for Presentations Message-ID: <4F3B69ED.8000004@cs.unibo.it> =============================================================== CALL FOR ABSTRACTS/PRESENTATIONS DICE 2012 3rd Workshop on Developments in Implicit Complexity Tallinn (Estonia), March 31st and April 1st, 2012 (Affiliated with ETAPS 2012) http://dice2012.cs.unibo.it/ =============================================================== 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. polytime or 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 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, ? certification of complexity properties of programs, ? application of implicit complexity to other programming paradigms (e.g. imperative or object-oriented languages). The first two DICE workshops were held in 2010 in Cyprus and in 2011 in Germany, both as part of ETAPS conferences. Before that, several meetings on this topic had already been held with success in Paris (WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit computational complexity). _______________________________________________________________ SUBMISSION Extended abstracts for presentations of up to 3 pages. The following deadlines are strict: ? Submission (extended abstracts): February 18th, 2012; ? Notification (extended abstracts): February 28th, 2012. Abstracts must be submitted electronically, as pdf files, at the following page: https://www.easychair.org/conferences/?conf=dice2012. _______________________________________________________________ PROGRAM COMMITTEE ? Guillaume Bonfante (Nancy) ? Ugo Dal Lago (Bologna, chair) ? Marco Gaboardi (Bologna and UPenn) ? Nao Hirokawa (JAIST) ? Martin Hofmann (Munchen) ? Olivier Laurent (ENS Lyon) ? Jean-Yves Moyen (Paris Nord) ? Isabel Oitavem (Lisboa) ? German Puebla (Madrid) ? Simona Ronchi Della Rocca (Torino) _______________________________________________________________ From dale at lix.polytechnique.fr Wed Feb 15 08:28:08 2012 From: dale at lix.polytechnique.fr (Dale Miller) Date: Wed, 15 Feb 2012 14:28:08 +0100 Subject: [TYPES/announce] PostDoc available at LIX, Ecole Polytechnique, France Message-ID: The following postdoc position is available at the LIX labs on the campus of Ecole Polytechnique, France. *PostDoc: Designing and implementing proof certificates* *Context* ProofCert is a recently awarded ERC Advanced Grant that will be funded for the five years 2012-2016. The goal of ProofCert is to design 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 and as well as supporting (bounded) proof reconstruction. A postdoctoral position is available within the ProofCert project. This position is concerned with helping to design, implement, and experimentally validate the design of proof certificates for a range of theorem provers in classical first-order logic. The position is for one year, with a second year extension possible. It should start in Fall 2012. The ideal candidate should have strong backgrounds in - basic proof theory (in particular, the sequent calculus); - various automated and interactive theorem proving systems; and - programming in logic programming (Prolog or lambda Prolog) as well as other high-level programming languages (such as ML or Haskell). *Venue* The postdoc will be a member of the INRIA Parsifal team and will work in a new building on the campus of the Ecole Polytechnique that houses the Laboratoire d?Informatique (LIX). This campus is situated to the south of Paris, an easy commute from Paris on the RER B regional train line. French proficiency is not necessary. *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 around the beginning of April 2012. *More Information* Further information regarding ProofCert and the Parsifal team can be found at the following links. - 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 2012: 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 kaustuv.chaudhuri at inria.fr Wed Feb 15 08:40:26 2012 From: kaustuv.chaudhuri at inria.fr (Kaustuv Chaudhuri) Date: Wed, 15 Feb 2012 14:40:26 +0100 Subject: [TYPES/announce] Post Doctoral position at INRIA Saclay/Ecole Polytechnique In-Reply-To: References: Message-ID: ? ? ? ? ? ? ? ? ? ?Post Doctoral Position ? ? ? ? ? Structural and Computational Proof Theory ? ? ? ?INRIA Saclay & LIX/Ecole Polytechnique, France Context ------- ? The ANR project STRUCTURAL investigates the structural and ? computational proof theory of recent proof formalisms such as deep ? inference and proof-nets. ?One of its main goals is to find ? canonical proof objects that are also suitable for computation in ? terms of proof search and normalization. ?Traditional proof systems ? such as the sequent calculus, although well-suited for search, do ? not yield canonical proofs because their syntax records irrelevant ? details such as a particular but arbitrary order for permutable ? rules. ?More "bureaucracy-free" formalisms such as proof-nets can ? have represent the parallelism in a proof graphically and therefore ? canonically, but such formalisms are generally only well behaved on ? logics with a low expressive power. ?Recent results using deep ? inference and focusing suggest interesting future directions for ? this research goal. ? More details of the research effort can be found in the scientific ? programme of the STRUCTURAL project [1]. Post Doctoral Position ---------------------- ? This is a call for a post doctoral position to support the research ? effort and goals expressed in the scientific programme [1] within ? the INRIA Parsifal team [2]. ? The successful candidate will undertake basic research in the design ? of new proof systems that both provide canonical proof objects and ? are concrete enough structures to support the computational aspects ? of proof search and normalization. General Information ------------------- ? Duration: 12 months ? Starting date: Fall 2012 (between 1 Sep and 1 Nov) ? Location: Laboratoire d'Informatique (LIX), Ecole Polytechnique [3] Requirements ------------ ? Candidates must have a Ph.D. and a strong background in proof ? theory and related fields. ?If the Ph.D. thesis is not yet ? defended, the candidate must provide the planned defence date and ? the composition of the thesis committee. ? To apply, please contact *both* the following people as soon as ? possible. ?Include your current CV, a link to a list of your ? publications, and a research statement summarizing your research ? activities and goals. ? ? ? Kaustuv CHAUDHURI (kaustuv dot chaudhuri at inria dot fr) ? ? ? Lutz STRASSBURGER (lutz at lix dot polytechnique dot fr) ? Please also include the names of two references. ? The deadline for applications is 20 May 2012, but early expression ? of interest is encouraged. More Information ---------------- ?[0] ?The STRUCTURAL project ? ? ? http://www.lix.polytechnique.fr/~lutz/orgs/structural.html ?[1] ?The STRUCTURAL project description ? ? ? http://www.lix.polytechnique.fr/~lutz/orgs/structural-short.pdf ?[2] ?The INRIA Parsifal team ? ? ? http://team.inria.fr/parsifal/ ?[3] ?LIX/Ecole Polytechnique ? ? ? http://www.lix.polytechnique.fr/ This announcement also available on the web at: ? ?http://team.inria.fr/parsifal/positions/structural From samth at ccs.neu.edu Wed Feb 15 11:37:34 2012 From: samth at ccs.neu.edu (Sam Tobin-Hochstadt) Date: Wed, 15 Feb 2012 11:37:34 -0500 Subject: [TYPES/announce] Call for Papers: Workshop on Script to Program Evolution (STOP 2012) Message-ID: CALL FOR PAPERS 3rd Workshop on Script to Program Evolution (co-located with ECOOP and PLDI) Beijing, China June 11, 2012 http://wrigstad.com/stop12/ OVERVIEW Recent years have seen increased use of scripting languages in large applications. Scripting languages optimize development time, especially early in the software life cycle, over safety and robustness. As the understanding of the system reaches a critical point and requirements stabilize, scripting languages become less appealing. Compromises made to optimize development time make it harder to reason about program correctness, harder to do semantic-preserving refactorings, and harder to optimize execution speed. Lack of type information makes code harder to navigate and to use correctly. In the worst cases, this situation leads to a costly and potentially error-prone rewrite of a program in a compiled language, losing the flexibility of scripting languages for future extension. Recently, pluggable type systems and annotation systems have been proposed. Such systems add compile-time checkable annotations without changing a program?s run-time semantics which facilitates early error checking and program analysis. It is believed that untyped scripts can be retrofitted to work with such systems. Furthermore, integration of typed and untyped code, for example, through use of gradual typing, allows scripts to evolve into safer programs more suitable for program analysis and compile-time optimizations. With few exceptions, practical reports are yet to be found. The STOP workshop focuses on the evolution of scripts, largely untyped code, into safer programs, with more rigid structure and more constrained behavior through the use of gradual/hybrid/pluggable typing, optional contract checking, extensible languages, refactoring tools, and the like. The goal is to further the understanding and use of such systems in practice, and connect practice and theory. CALL FOR CONTRIBUTIONS Abstracts, position papers, and status reports are welcome. Papers should be 1-2 pages in standard ACM SIGPLAN format. All submissions will be reviewed by the program committee. The accepted papers, after rework by the authors, will be published in an informal proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Papers are to be submitted electronically via the STOP website: http://wrigstad.com/stop12/ IMPORTANT DATES paper submission: 11:59 PM 30 March 2012 Eastern Daylight Time notification: 20 April 2012 camera-ready paper: 15 May 2012 conference date: 11 June 2012 PROGRAM COMMITTEE Avik Chaudhuri, Adobe Labs Kathryn Gray, Swansea University Arjun Guha, Brown University David Herman, Mozilla Research Manuel Hermenegildo, IMDEA Atsushi Igarashi, Kyoto University Ranjit Jhala, University of California, San Diego Sam Tobin-Hochstadt (Chair), Northeastern University From Matthew.Hennessy at cs.tcd.ie Wed Feb 15 12:21:59 2012 From: Matthew.Hennessy at cs.tcd.ie (Matthew Hennessy) Date: Wed, 15 Feb 2012 17:21:59 +0000 Subject: [TYPES/announce] Postdoctoral Research Fellowship Message-ID: <67306724-09C0-4AF6-AABF-030F6485FC95@cs.tcd.ie> Apologies for Multiple Postings -------------------------------- The Foundations of Global Computing - Trinity College Dublin Postdoctoral Research Fellowship Applications are invited for a post-doctoral position to undertake research into the foundations of Global Computing. The post is within the Software Systems Lab of the Department of Computer Science at Trinity College Dublin as part of an SFI-funded research project, under the direction of Matthew Hennessy, which seeks to establish a core of research expertise in behavioural theories of distributed systems and to encourage their application to strategically important domains such as Mobile computing, Web services and Wireless networks. Applicants should have a PhD in Computer Science, or a closely related discipline. Candidates with expertise in following areas are particularly welcome: - model checking - verification techniques - program logics - formal techniques for web services The post is tenable from April 2012 for a period of 12 months, with a possibility of renewal; the post will remain open until filled. The salary will be commensurate with the successful candidates' qualifications and experience, and in line with HEA guidelines. Further particulars of the posts may be obtained from the address below, and informal enquiries are also welcomed. Applications should include - detailed curriculum vitae, in pdf format - copies of relevant publications, or url-pointers to them - the names of three referees - a statement outlining the applicant's suitability to the project. Applications should be sent/emailed to: Matthew Hennessy Department of Computer Science The O'Reilly Institute Trinity College Dublin 2 Ireland email: matthew.hennessy at cs.tcd.ie tel: +353 (01) 8962634 Trinity College is an equal opportunities employer. From bcpierce at cis.upenn.edu Wed Feb 15 23:08:19 2012 From: bcpierce at cis.upenn.edu (Pierce Benjamin C.) Date: Wed, 15 Feb 2012 23:08:19 -0500 Subject: [TYPES/announce] Oregon Programming Languages Summer School - call for participation In-Reply-To: <20110114212852.GA26366@seas.upenn.edu> References: <20110114212852.GA26366@seas.upenn.edu> Message-ID: <508E30D6-911A-4A95-A08E-D8B5E1529E42@cis.upenn.edu> We are pleased to announce this year's program for the University of Oregon Programming Languages Summer School, to be held from the 16th to the 28th of July, 2012 in Eugene, Oregon. This year's program, on the themes of Logic, Languages, Compilation, and Verification, features an impressive roster of speakers, including Amal Ahmed (Northeastern), Steve Awodey (Carnegie Mellon), Robert Constable (Cornell), Robert Harper (Carnegie Mellon), John Hughes (Chalmers), Xavier Leroy (INRIA), Andrew Myers (Cornell), Frank Pfenning (Carnegie Mellon), Benjamin Pierce (Penn). The registration deadline is April 16th. Full information on registration and scholarships an be found at http://www.cs.uoregon.edu/Activities/summerschool Looking forward to a great program! Zena Ariola Robert Constable Benjamin Pierce From francesco.zappa_nardelli at inria.fr Thu Feb 16 04:18:36 2012 From: francesco.zappa_nardelli at inria.fr (Francesco Zappa Nardelli) Date: Thu, 16 Feb 2012 10:18:36 +0100 Subject: [TYPES/announce] Summer School on Functional Programming for Parallel and Concurrent Applications In-Reply-To: References: Message-ID: Dear all, I am happy to annouce the CEA-EDF-INRIA summer school on ? ? ? ? ? ? ? ? ? ? ? FUNCTIONAL PROGRAMMING ? ? ? ? ? ? ?FOR PARALLEL AND CONCURRENT APPLICATIONS ?11-22 June 2012, Castle of Cadarache, Saint Paul Lez Durance, France ? ? ? ? ? http://www-hpc.cea.fr/SummerSchools2012-CS.htm Objectives The aim of the summer school is to give a thorough and application- oriented introduction to functional programming using the programming language Haskell. A special focus is on parallel and concurrent programming, highlighting the ways in which features such as strong typing and purity make it dramatically easier to write reliable parallel or concurrent code. The school is split into three different courses that highlight different aspects of functional programming. All courses consist of lectures and hands-on sessions where everyone can try out the language on several exercises. Public This school is a 2 weeks course for engineers, and for students and researchers. Participants should be familiar with programming (e.g. in C or Java), but the school will be self-contained and no preliminary knowledge of functional programing is required. Speakers ?Ralf Hinze (Oxford University) ?Andres L?h (Well-Typed) ?Simon Marlow (Microsoft Research) Talks (to be confirmed) Joe Armstrong, Mark Shinwell, Anil Madhavapeddy. Registration and contact: The deadline for registration is May 30, 2012. ?Please contact: ?R?gis Vizet - CEA ?regis.vizet (at) cea.fr ?tel: 0033 1 69 26 47 45 for further informations. Best regards ?Francesco Zappa Nardelli From agoodloe at gmail.com Thu Feb 16 08:36:51 2012 From: agoodloe at gmail.com (Alwyn Goodloe) Date: Thu, 16 Feb 2012 08:36:51 -0500 Subject: [TYPES/announce] NFM 2012 Call for Participation Message-ID: =================================================== CALL FOR PARTICIPATION Fourth NASA Formal Methods Symposium *http://shemesh.larc.nasa.gov/nfm2012/index.html * April 3-5, 2012 Norfolk, Virginia, USA =================================================== The NFM 2012 program is available online: *http://shemesh.larc.nasa.gov/nfm2012/program.html * REGISTRATION IS NOW OPEN To register: *http://shemesh.larc.nasa.gov/nfm2012/registration.html * There will not be a registration fee charged to participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. Within NASA, for example, such systems include autonomous robots, separation assurance algorithms for aircraft, Next Generation Air Transportation (NextGen), and autonomous rendezvous and docking for spacecraft. Moreover, emerging paradigms such as code generation and safety cases are bringing with them new challenges and opportunities. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other safety-critical systems. Invited speakers: * Andrew Appel, Princeton University ?Verified Software Toolchain? * Patrick Cousot, ?cole normale sup?rieure, Paris and New York University ?Formal Verification by Abstract Interpretation? * Cesare Tinelli, University of Iowa ?SMT-based Model Checking? Contact Information: *nasa-nfm2012 at mail.nasa.gov * Conference Chairs Alwyn Goodloe, NASA Langley Research Center Suzette Person, NASA Langley Research Center Program Committee Nikolaj Bjoerner, Microsoft Research, USA Jonathan Bowen, London South Bank Univ, UK Julia Badger, NASA Johnson Space Center, USA Ricky Butler, NASA Langley Research Center, USA Rance Cleaveland, Univ of Maryland, USA Darren Cofer, Rockwell Collins, USA Ewen Denney, NASA Ames Research Center, USA Dino Distefano, Queen Mary Univ of London and Monoidics Ltd., UK Jin Song Dong, Univ of Singapore, Singapore Jean-Christophe Filliatre, CNRS, France Dimitra Giannakopoulou, NASA Ames Research Center, USA Eric Goubault, CEA LIST, France George Hagen, NASA Langley Research Center, USA John Hatcliff, Kansas State Univ, USA Klaus Havelund, NASA/JPL, USA Mats Heimdahl, Univ of Minnesota, USA Gerard Holzmann, NASA/JPL, USA Joe Hurd, Galois, USA Bart Jacobs, Katholieke Univ Leuven, Belgium Kenneth McMillan, Microsoft Research, USA Eric Mercer, Brigham Young University, USA Cesar Munoz, NASA Langley Research Center, USA Anthony Narkawicz, NASA Langley Research Center, USA Natasha Neogi, National Institute of Aerospace, USA Corina Pasareanu, NASA Ames Research Center, USA Charles Pecheur, Univ de Louvain, Belgium Kristin Rozier, NASA Ames Research Center, USA Natarajan Shankar, SRI, International, USA Oleg Sokolsky, Univ of Pennsylvania, USA Sofiene Tahar, Concordia Univ, Canada Oksana Tkachuk, NASA Ames Research Center, USA Willem Visser, Univ of Stellenbosch, South Africa Mike Whalen, Univ of Minnesota, USA Virginie Wiels, ONERA, France Jim Woodcock, University of York, UK -- Alwyn E. Goodloe, Ph.D. agoodloe at gmail.com Research Computer Engineer NASA Langley Research Center -------------- next part -------------- An HTML attachment was scrubbed... URL: From t.kitamura at aist.go.jp Fri Feb 17 02:01:20 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Fri, 17 Feb 2012 16:01:20 +0900 Subject: [TYPES/announce] 1st CFP: ICFEM 2012 - 14th International Conference on Formal Engineering Methods Message-ID: <20120217160120.EF0E.35D11551@aist.go.jp> ************************************************************ ICFEM 2012: 14th International Conference on Formal Engineering Methods CALL FOR PAPERs 12th-16th, November, 2012 Kyoto Research Park, Kyoto, Japan URL: http://www.jaist.ac.jp/icfem2012 ************************************************************ ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2012 will be hosted by National Institute of Advanced Industrial Science and Technology (AIST) and Japan Advanced Institute of Science and Technology (JAIST), which will be held in Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find many historical sites which have been designated as World Heritage there. We are looking forward to your submissions. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Formal methods for cloud computing/robotics/cyber-physical systems/ medical devices/aeronautics/railway * Formal methods for self-* systems * Formal methods for software safety, security, reliability and dependability * Experiments involving verified systems * Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc) * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2012 submission page (https://www.easychair.org/conferences/?conf=icfem2012), handled by the EasyChair conference system. IMPORTANT DATES Abstract Submission Deadline: 9th April, 2012 Full Paper Submission Deadline: 16th April, 2012 Acceptance/Rejection Notification: 18th June, 2012 Camera Ready Copy Due: 16th July, 2012 ORGANIZATION COMMITTEE Conference Chair: Hitoshi Ohsaki (AIST, Japan) Program Chairs: Kenji Taguchi (AIST, Japan) Toshiaki Aoki (JAIST, Japan) General Chairs: Kokichi Futatsugi (JAIST, Japan) Shaoying Liu (Hosei Uni., Japan) Steering Committee Keijiro Araki, Japan Jin Song Dong, Singapore Jifeng He, China Shaoying Liu (Chair), Japan Program Committee (TBD) ------------------------------------ Takashi KITAMURA Ph.D. Collaborative Facilities for Verification and Specification (CVS) National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 From J.T.Jeuring at uu.nl Fri Feb 17 05:15:16 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Fri, 17 Feb 2012 11:15:16 +0100 Subject: [TYPES/announce] Conference on Intelligent Computer Mathematics, last call for papers Message-ID: <65C6AF62-7D10-4934-A313-0B8CFE373DD5@uu.nl> CICM 2012 - Conference on Intelligent Computer Mathematics July 9-13, 2012 at Jacobs University, Bremen, Germany http://www.informatik.uni-bremen.de/cicm2012/ Call for Papers ---------------------------------------------------------------- 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 Conference on Intelligent Computer Mathematics offers a venue for discussing these areas and their synergy. The conference will be organized by Serge Autexier and Michael Kohlhase at Jacobs University in Bremen and consist of five tracks: Artificial Intelligence and Symbolic Computation (AISC) Co-Chairs: John A. Campbell, Jacques Carette Calculemus Chair: Gabriel Dos Reis Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: Makarius Wenzel Systems and Projects Chair: Volker Sorge The overall programme will be organized by the General Program Chair Johan Jeuring. Invited talks will be given by: Yannis Haralambous, D?partement Informatique, T?l?com Bretagne Conor McBride, Department of Computer and Information Sciences, University of Strathclyde Cezar Ionescu, Potsdam Institute for Climate Impact Research ---------------------------------------------------------------- Important dates ---------------------------------------------------------------- Abstract submission: 20 February 2012 Submission deadline: 26 February 2012 Reviews sent to authors: 23 March 2012 Rebuttals due: 30 March 2012 Notification of acceptance: 6 April 2012 Camera ready copies due: 20 April 2012 Conference: 9-13 July 2012 ---------------------------------------------------------------- Tracks ---------------------------------------------------------------- *** AISC *** Symbolic computation can be roughly described as the study of algorithms which operate on expression trees. Another way to phrase this is to say that the denotational semantics of expressions trees is not fixed, but is rather context dependent. Expression simplification is probably the archetypal symbolic computation. Mathematically oriented software (such as the so-called computer algebra systems) have been doing this for decades, but not long thereafter, systems doing proof planning and theorem discovery also started doing the same; some attempts at knowledge management and 'expert systems' were also symbolic, but less successfully so. More recently, many different kinds of program analyses have gotten `symbolic', as well as some of the automated theorem proving (SMT, CAV, etc). But a large number of the underlying problems solved by symbolic techniques are well known to be undecidable (never mind the many that are EXP-time complete, etc). Artificial Intelligence has been attacking many of these different sub-problems for quite some time, and has also built up a solid body of knowledge. In fact, most symbolic computation systems grew out of AI projects. These two fields definitely intersect. One could say that in the intersection lies all those problems for which we have no decision procedures. In other words, decision procedures mark a definite phase shift in our understanding, but are not always possible. Yet we still want to solve certain problems, and must find 'other' means of (partial) solution. This is the fertile land which comprises the core of AISC. Rather than try to exhaustively list topics of interest, it is simplest to say that AISC seeks work which advances the understanding of Solving problems which fundamentally involve the manipulation of expressions, but for which decision procedures are unlikely to ever exist. *** Calculemus *** Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. The topics of interest of Calculemus include but are not limited to: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Theory exploration techniques * Input languages, programming languages, types and constraint languages, and modeling languages for mechanised mathematics systems (PA, CAS, and ATP). * Infrastructure for mathematical services *** 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. Following success of DML 2008, DML 2009 DML 2010, and DML 2011 track objectives are to formulate the strategy and goals of a global mathematical digital library and to summarize the current successes and failures of ongoing technologies and related projects as EuDML, asking such questions as: * What technologies, standards, algorithms and formats should be used and what metadata should be shared? * What business models are suitable for publishers of mathematical literature, authors and funders of their projects and institutions? * Is there a model of sustainable, interoperable, and extensible mathematical library that mathematicians can use in their everyday work? * What is the best practice for * retrodigitized mathematics (from images via OCR to MathML or TeX); * retro-born-digital mathematics (from existing electronic copy in DVI, PS or PDF to MathML or TeX); * born-digital mathematics (how to make needed metadata and file formats available as a side effect of publishing workflow [CEDRAM/Euclid model])? DML is an opportunity to share experience and best practices between projects in any area (MKM, NLP, OCR, pattern recognition, whatever) that could change the paradigm for searching, accessing, and interacting with the mathematical corpus. The track is trans/interdisciplinary and contributions from any kind of people on any aspect of the DML building are welcome. *** 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 presentation of systems and new and ongoing projects in all areas and topics related to the CICM conferences: * AI and Symbolic Computation * Deduction and Computer Algebra * Mathematical Knowledge Management * Digital Mathematical Libraries 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. We solicit submissions for two page abstracts in the categories of system descriptions and project presentations. System description should present * newly developed systems, * systems that have not previously been presented to the CICM community, or * significant updates to existing systems. Project presentation 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. All submissions should contain links to demos, downloadable systems, or project pages. Availability of such accompanying material will be a strong prerequisite for acceptance. Accepted abstracts will be published in the CICM proceedings in Springer's LNAI series. Author's are expected to present their abstracts in 5-10 minute teaser talks followed by an open demo/poster session. System papers must be accompanied by a system demonstration, while project papers must be accompanied by a poster presentation. ---------------------------------------------------------------- Submitting ---------------------------------------------------------------- Submissions to tracks A to D 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. Submissions to the Systems & Projects track must not exceed four pages. The accepted abstracts will be presented at CICM in a fast presentation session, followed by an open demo/poster session. System papers must be accompanied by a system demonstration, and project papers must be accompanied by a poster presentation. The four pages of the abstract should be new material, accompanied by links to demos/downloads/project-pages and [existing] system descriptions. Availability of such accompanying material will be a strong prerequisite for acceptance. Accepted conference submissions from all tracks will 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. 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=cicm2012). ---------------------------------------------------------------- Program Committees ---------------------------------------------------------------- General chair: Johan Jeuring (Utrecht University and Open Universiteit the Netherlands) AISC track John A. Campbell; University College London, UK; Co-chair Jacques Carette; McMaster University, Canada; Co-chair Serge Autexier; DFKI Bremen, Germany Jacques Calmet; University of Karlsruhe, Germany Jacques Fleuriot; University of Edinburgh, UK Andrea Kohlhase; International University Bremen, Germany Erik Postma; Maplesoft Inc., Canada Alan Sexton; University of Birmingham, UK Chung-chieh Shan; Cornell University, USA. Stephen Watt; University of Western Ontario, Canada Calculemus track Gabriel Dos Reis; Texas A&M University, USA; Chair Andrea Asperti; University of Bologna, Italy Laurent Bernardin; Maplesoft, Canada James Davenport; University of Bath, UK Ruben Gamboa; University of Wyoming, USA Mark Giesbrecht; University of Waterloo, Canada Sumit Gulwani; Microsoft Research, USA John Harrison; Intel, USA Joris van der Hoeven; ?cole Polytechnique, France Hoon Hong; North Carolina State University, USA Lo?c Pottier; INRIA, France Wolfgang Windsteiger; RISC, Austria DML track Petr Sojka; Masaryk University, Brno, CZ; Chair Jos? Borbinha; Technical University of Lisbon, PT Thierry Bouche; University Grenoble, FR Michael Doob; University of Manitoba, Winnipeg, CA Thomas Fischer; Goettingen University, DE Yannis Haralambous; T?l?com Bretagne, FR V?clav Hlav??; Czech Technical University, Prague, CZ Michael Kohlhase; Jacobs University Bremen, DE Janka Chleb?kov?; Portsmouth University, UK Enrique Maci?s-Virg?s; University of Santiago de Compostela, ES Bruce Miller; NIST, USA Ji?? R?kosn?k; Academy of Sciences, Prague, CZ Eugenio Rocha; University of Aveiro, PT David Ruddy; Cornell University, US Volker Sorge; University of Birmingham, UK Masakazu Suzuki; Kyushu University, JP MKM track Makarius Wenzel; University of Paris-South, France; Chair David Aspinall; University of Edinburgh, Scotland Jeremy Avigad; Carnegie Mellon University, USA Mateja Jamnik; University of Cambridge, UK Cezary Kaliszyk; University of Tsukuba, Japan Manfred Kerber; University of Birmingham, UK Christoph L?th; DFKI Bremen, Germany Adam Naumowicz; University of Bia?ystok, Poland Jim Pitman; University of California, Berkeley, USA Pedro Quaresma; Universidade de Coimbra, Portugal Florian Rabe; Jacobs University Bremen, Germany Claudio Sacerdoti Coen; University of Bologna, Italy Enrico Tassi; INRIA Saclay, France Freek Wiedijk; Radboud University Nijmegen, The Netherlands Systems & Projects track Volker Sorge; University of Birmingham, UK; Chair Josef Baker; University of Birmingham, UK John Charnley; Imperial College, UK Manuel Kauers; RISC, Austria Koji Nakagawa; Kyushu University, Japan Piotr Rudnicki; University of Alberta, Canada Josef Urban; Radboud University Nijmegen, The Netherlands Richard Zanibbi; Rochester Institute of Technologies, USA From viktor at mpi-sws.org Mon Feb 20 08:05:52 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Mon, 20 Feb 2012 14:05:52 +0100 Subject: [TYPES/announce] POPL'13: Call for proposals for co-located events Message-ID: *** POPL'13: Call for proposals for co-located events *** Event dates: 20 -- 22, 26 January 2013 Location: Rome, Italy Deadline: 22 April 2012 Notification: 30 May 2012 Proposals are invited for workshops and other events to be co-located with POPL 2013. Events can either be sponsored by SIGPLAN or supported through in-cooperation status. For more information and submission details, please visit: http://matt.might.net/events/popl/2013/call-for-events/ http://popl.mpi-sws.org/2013/ From eberinge at cs.princeton.edu Mon Feb 20 15:08:28 2012 From: eberinge at cs.princeton.edu ( Lennart Beringer) Date: Mon, 20 Feb 2012 15:08:28 -0500 (EST) Subject: [TYPES/announce] ITP 2013: final call for bids In-Reply-To: <64bd4bd3-201e-44ad-a60c-6d735fcab732@suckerpunch-mbx-0.CS.Princeton.EDU> Message-ID: As chairs of ITP 2012, it is our pleasure to initiate the process of selecting a host for ITP 2013, the Fourth International Conference on Interactive Theorem Proving. As in previous years, the procedure consists of two phases: solicitation of bids and voting. This message concerns the first phase. A long-standing ITP/TPHOLs convention is that the conference should be held in a continent different from the location of the previous meeting. For 2013, we therefore solicit bids from prospective hosts located outside North America. Similar to previous years, we expect bids to propose a date in July, August or September. Bids should be sent to itp2012 at easychair.org and should include at least the following pieces of information: - name and email address of a contact person - names of other people involved - address of website for the bid - approximate dates of the conference - structure (e.g., k workshop days and n days of presentations followed by excursion...) - advantages of the proposed venue Example of previous winning bids are here: http://itp2011.cs.ru.nl/ITP2011/Bid_ITP11.html http://www.cs.princeton.edu/~appel/itp2012/bid.html Deadline for all bids is Monday, 27 February 2012. Shortly after that, all admitted bids will be made public and the voting phase will take place. The people eligible to vote are those who are seriously thinking of attending ITP 2013. The voting system used will be Single Transferable Vote between all received bids. Andrew Appel Lennart Beringer Amy Felty From efmera at gmail.com Tue Feb 21 05:32:32 2012 From: efmera at gmail.com (Edison Mera) Date: Tue, 21 Feb 2012 11:32:32 +0100 Subject: [TYPES/announce] Postdoctoral Research Fellowship In-Reply-To: <67306724-09C0-4AF6-AABF-030F6485FC95@cs.tcd.ie> References: <67306724-09C0-4AF6-AABF-030F6485FC95@cs.tcd.ie> Message-ID: Dear Matthew Hennessy, This mail is to express you my interest in the offered post-doctoral position in the Software Systems Lab of the Department of Computer Science at Trinity College Dublin, as described in your announcement. Currently I am looking for a job in which my skills and capabilities can be fully exploited and I am really motivated with the possibility of working in your University, I see the offered position is very related with my research field and skills. I have a strong background in Computational Logic, resource analysis and run-time verification, as proved by my "PhD in Computer Science and Artificial Intelligence", thesis entitled "A Unified Framework for Resource and Execution Time Analysis, Run-Time Checking and Unit-Testing", where a framework for automatically inferring both upper and lower bounds on the usage that a logic program makes of general resources was presented, for example, you can analyze the amount of energy, memory, time, bandwidth, or even monetary units that a program requires, in particular the inference of execution time (which is platform-dependent) was studied in detail in my thesis. The system also is able to validate (or falsify) statically properties written by the user, including (but not limited to) those related with resource analysis, and for those properties that can not be verified at compile time, a run-time check is generated. Finally, unit-tests for the program are defined using the same assertion (or specification) language and run-time checking machinery. The unit-test and the run-time checking part was further published in the ICLP 2009 Conference. This framework is able to work even with big real Prolog Programs, for example, we analyzed the system itself which have 10 megabytes/300.000 lines of source code! Beyond my research interests, one of my best achievements in my PhD position was the implementation of a testing framework as part of the deployment of a continuous development environment, in which all versions of the system are analyzed and tested each time a developer introduce a change. Such framework consist of several parts, beginning from unit-tests, several system tests, integration tests, up to a tool to automatically configure and manage the compile farm that execute the tests forever in several architectures (versions of Windows, Linux, Mac OS X, and Solaris, in virtualized or real machines). I began the development of this framework at the beginning of my PhD studies, voluntarily, motivated mainly because the problems present in the system before, prevented to me (and other coworkers) to accomplish other responsibilities (e.g., the maintenance and development of an installer required to have a system at least syntax-error free, and to have more time to do researching). Thanks to this tool, now developers do not waste their time trying to locate old bugs that were introduced inadvertently and would be detected running the tests. The earlier error detection is saving a lot of time increasing the group productivity, in concrete, the developers where able to reduce from 40% to 8% the number of failed ISO-Prolog compliance unit-tests. In addition to this, I have a strong knowledge implementing applications using the Object Oriented Programming in several languages, such as C++, Delphi (Object Oriented Pascal) and Java, proved by my professional experience and my specialisation in analysis, design and implementation in POO. I also have experience in design and management of relational databases, I recommend you look at my scores in http://www.brainbench.com (transcript id 185939) and the open-source tools published in my blog http://edisonm.dyndns.org/blog/ As required in your announcement, let me recommend you 3 selected papers I wrote: 1. E. Mera, T. Trigo, P. L?pez, M. Hermenegildo. Profiling for Run-Time Checking of Computational Properties and Performance Debugging. LNCS 6539. Pages 38?53. Practical Aspects of Declarative Languages, PADL 2011, 2007. Springer-Verlag. Austin, Texas, USA. January 2011. http://www.clip.dia.fi.upm.es/papers/profiling-padl11.pdf 2. E. Mera, P. L?pez, M. Hermenegildo. Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework. LNCS 5649. Pages 281?295. International Conference on Logic Programming, ICLP 2009. Springer-Verlag. Pasadena, California, USA. July 2009. http://www.clip.dia.fi.upm.es/papers/testchecks-iclp09.pdf 3. J. Navas, E. Mera, P. L?pez, M. Hermenegildo. User-Definable Resource Bounds Analysis for Logic Programs. LNCS 4670. Pages 348?363. International Conference on Logic Programming, ICLP 2007. Springer-Verlag. Porto, Portugal. September 2007. http://www.clip.dia.fi.upm.es/papers/resource-iclp07.pdf If you are interested in other papers or documents, note that the enclosed Curriculum Vitae have links in the title of each paper, so you can click in the title to open or download it directly from the Internet. Professional References: 1. Manuel Hermenegildo. Research Professor and Scientific Director at Imdea Software Institute. Madrid, Spain. manuel.hermenegildo at imdea.org. +34-91-336-3742 ext 4101. 2. Pedro L?pez Garc?a. Researcher at Imdea Software Institute. Madrid, Spain. pedro.lopez at imdea.org. +34-91-336-3742 ext 4109. 3. Francisco L?pez Fraguas. Full Professor at Computer Science School, Director of DSIC Department. Complutense University of Madrid. Spain. fraguas at sip.ucm.es. +34-91-394-7630. Note: Felt free to ask them for recommendation letters if required. Thank you for your time and consideration. Please do not hesitate to contact me if you have any questions. Best Regards, Edison Mera. 2012/2/15 Matthew Hennessy > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/**mailman/listinfo/types-**announce] > > Apologies for Multiple Postings > ------------------------------**-- > > > The Foundations of Global Computing - Trinity College Dublin > Postdoctoral Research Fellowship > > Applications are invited for a post-doctoral position to > undertake research into the foundations of Global Computing. The > post is within the Software Systems Lab of the Department of > Computer Science at Trinity College Dublin as part of an SFI-funded > research project, under the direction of Matthew Hennessy, which seeks > to establish a core of research expertise in behavioural > theories of distributed systems and to encourage their application to > strategically important domains such as Mobile computing, > Web services and Wireless networks. > > Applicants should have a PhD in Computer Science, or a closely related > discipline. Candidates with expertise in following areas are > particularly welcome: > > > - model checking > - verification techniques > - program logics > - formal techniques for web services > > > The post is tenable from April 2012 for a period of 12 months, with a > possibility of renewal; the post will remain open until filled. The > salary will be commensurate with the successful candidates' > qualifications and experience, and in line with HEA guidelines. > Further particulars of the posts may be obtained from the address > below, and informal enquiries are also welcomed. > > Applications should include > - detailed curriculum vitae, in pdf format > - copies of relevant publications, or url-pointers to them > - the names of three referees > - a statement outlining the applicant's suitability to the project. > > Applications should be sent/emailed to: > > Matthew Hennessy > Department of Computer Science > The O'Reilly Institute > Trinity College > Dublin 2 > Ireland > email: matthew.hennessy at cs.tcd.ie > tel: +353 (01) 8962634 > > Trinity College is an equal opportunities employer. > > -- +-------------------------------------------+------------_.---.)--+ | Edison Fernando Mera Menendez | (^--^)_.-" `; | | PhD in Computer Science | ) ee ( | | | Technical University of Madrid | (_.__._) / | | efmera at gmail.com | www.cliplab.org/edison | `--', ,' | | +34-64-018-9493 | tinyurl.com/6agusby | fff )_|--')_| | +-------------------------------------------+--------""'---""'----+ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: cv_edison.pdf Type: application/pdf Size: 91665 bytes Desc: not available URL: From dreyer at mpi-sws.org Tue Feb 21 07:05:36 2012 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Tue, 21 Feb 2012 13:05:36 +0100 Subject: [TYPES/announce] Postdoctoral Research Fellowship In-Reply-To: References: <67306724-09C0-4AF6-AABF-030F6485FC95@cs.tcd.ie> Message-ID: Sorry, this message was a mistake and should not have been accepted to the list. My sincere apologies for the oversight. Derek Dreyer Types moderator On Tue, Feb 21, 2012 at 11:32 AM, Edison Mera wrote: > [ The Types Forum (announcements only), > ? ? http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > > Dear Matthew Hennessy, > > This mail is? to express you my interest? in the offered post-doctoral > position in? the Software? Systems Lab of? the Department? of Computer > Science at Trinity College Dublin, as described in your announcement. > > Currently I am? looking for a job in which? my skills and capabilities > can be fully exploited and? I am really motivated with the possibility > of? working in your? University, I? see the? offered position? is very > related with my research field and skills. > > I have? a strong background in Computational? Logic, resource analysis > and run-time? verification, as proved? by my "PhD in? Computer Science > and Artificial Intelligence", thesis entitled "A Unified Framework for > Resource?? and? Execution?? Time? Analysis,?? Run-Time?? Checking? and > Unit-Testing",? where? a framework? for? automatically inferring? both > upper and? lower bounds? on the? usage that a? logic program? makes of > general? resources was? presented, for? example, you? can? analyze the > amount of energy, memory, time, bandwidth, or even monetary units that > a? program requires,? in particular? the inference? of? execution time > (which is platform-dependent) was studied in detail in my thesis.? The > system? also is able? to validate? (or falsify)? statically properties > written by the user, including (but not limited to) those related with > resource analysis, and? for those properties that can? not be verified > at compile? time, a run-time check is? generated.? Finally, unit-tests > for?? the? program?? are? defined?? using? the?? same?? assertion? (or > specification)?? language? and?? run-time? checking?? machinery.?? The > unit-test and the run-time checking? part was further published in the > ICLP 2009? Conference. This? framework is able? to work even? with big > real Prolog Programs, for example, we analyzed the system itself which > have 10 megabytes/300.000 lines of source code! > > Beyond my? research interests, one of? my best achievements? in my PhD > position was the implementation of? a testing framework as part of the > deployment? of? a continuous? development? environment,? in which? all > versions of the? system are analyzed and tested? each time a developer > introduce? a? change.?? Such?? framework? consist? of? several? parts, > beginning from unit-tests, several system tests, integration tests, up > to a tool to automatically? configure and manage the compile farm that > execute? the? tests? forever? in several? architectures? (versions? of > Windows,? Linux,? Mac? OS? X,? and Solaris,? in? virtualized? or? real > machines).? I began the development of this framework at the beginning > of my PhD studies,? voluntarily, motivated mainly because the problems > present in the system before, prevented to me (and other coworkers) to > accomplish?? other? responsibilities?? (e.g.,?? the? maintenance?? and > development? of? an installer? required? to? have? a system? at? least > syntax-error free, and? to have more time to? do researching).? Thanks > to this tool, now developers do? not waste their time trying to locate > old? bugs that? were introduced? inadvertently and? would? be detected > running the? tests.? The? earlier error detection? is saving a? lot of > time increasing? the group? productivity, in concrete,? the developers > where able? to reduce from 40%? to 8% the number? of failed ISO-Prolog > compliance unit-tests. > > In? addition?? to? this,? I? have? a?? strong? knowledge? implementing > applications? using?? the? Object? Oriented?? Programming? in? several > languages,? such as? C++, Delphi? (Object Oriented? Pascal)? and Java, > proved? by? my? professional?? experience? and? my? specialisation? in > analysis, design and implementation in? POO. I also have experience in > design and management of relational databases, I recommend you look at > my scores in http://www.brainbench.com? (transcript id 185939) and the > open-source tools published in my blog http://edisonm.dyndns.org/blog/ > > As? required in? your announcement,? let me? recommend you? 3 selected > papers I wrote: > > 1.? E. Mera,? T. Trigo,? P.? L?pez,? M.? Hermenegildo.?? Profiling for > ?? Run-Time? Checking? of? Computational? Properties? and? Performance > ?? Debugging.?? LNCS?? 6539.?? Pages? 38?53.??? Practical? Aspects? of > ?? Declarative Languages,? PADL 2011, 2007.?? Springer-Verlag. Austin, > ?? Texas, USA.? January 2011. > > ?? http://www.clip.dia.fi.upm.es/papers/profiling-padl11.pdf > > 2. E.? Mera, P.? L?pez, M. Hermenegildo.? Integrating Software Testing > ?? and Run-Time Checking in? an Assertion Verification Framework. LNCS > ?? 5649.??? Pages?? 281?295.??? International? Conference?? on?? Logic > ?? Programming,? ICLP 2009.?? Springer-Verlag.?? Pasadena, California, > ?? USA.? July 2009. > > ?? http://www.clip.dia.fi.upm.es/papers/testchecks-iclp09.pdf > > 3.? J. Navas,? E.? Mera, P.? L?pez,? M.? Hermenegildo.? User-Definable > ?? Resource? Bounds Analysis? for Logic? Programs.? LNCS? 4670.? Pages > ?? 348?363.? International Conference on Logic Programming, ICLP 2007. > ?? Springer-Verlag.? Porto, Portugal.? September 2007. > > ?? http://www.clip.dia.fi.upm.es/papers/resource-iclp07.pdf > > If? you are interested? in other? papers or? documents, note? that the > enclosed Curriculum? Vitae have links in? the title of? each paper, so > you can? click in the title to? open or download it? directly from the > Internet. > > Professional References: > > 1. Manuel Hermenegildo.? Research Professor and Scientific Director at > ?? Imdea??????? Software?????? Institute.???????? Madrid,?????? Spain. > ?? manuel.hermenegildo at imdea.org. +34-91-336-3742 ext 4101. > > 2.? Pedro? L?pez? Garc?a.? Researcher? at? Imdea? Software? Institute. > ?? Madrid, Spain. pedro.lopez at imdea.org.? +34-91-336-3742 ext 4109. > > 3.? Francisco? L?pez? Fraguas.?? Full Professor? at? Computer? Science > ?? School,? Director of? DSIC Department.?? Complutense? University of > ?? Madrid. Spain.? fraguas at sip.ucm.es. +34-91-394-7630. > > Note: Felt free to ask them for recommendation letters if required. > > Thank you for? your time and consideration. Please? do not hesitate to > contact me if you have any questions. > > Best Regards, > > > Edison Mera. > > > 2012/2/15 Matthew Hennessy >> >> [ The Types Forum (announcements only), >> ? ?http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] >> >> Apologies for Multiple Postings >> -------------------------------- >> >> >> ? ? The Foundations of Global Computing - Trinity College Dublin >> ? ? ? ? ? ? ?Postdoctoral Research Fellowship >> >> Applications are invited for a ?post-doctoral ?position to >> undertake research into the foundations of Global Computing. ?The >> post is within the Software Systems Lab ?of the Department of >> Computer Science at Trinity College Dublin as part of an SFI-funded >> research project, under the direction of Matthew Hennessy, which seeks >> to establish a core of research expertise in behavioural >> theories of distributed systems and to encourage their application to >> strategically important domains such as Mobile computing, >> Web services and ?Wireless networks. >> >> Applicants should have a PhD in Computer Science, or a closely related >> discipline. Candidates with ?expertise in following areas are >> particularly welcome: >> >> >> - model checking >> - verification techniques >> - program logics >> - formal techniques for web services >> >> >> The post is tenable from April 2012 for a period of 12 months, with a >> possibility of renewal; the post will remain open until filled. ?The >> salary will be commensurate with the successful candidates' >> qualifications and experience, and in line with HEA guidelines. >> Further particulars of the posts may be obtained from the address >> below, and informal enquiries are also welcomed. >> >> Applications should include >> ?- detailed curriculum vitae, in pdf format >> ?- copies of relevant publications, or url-pointers to them >> ?- the names of three referees >> ?- a statement outlining ?the applicant's suitability to the project. >> >> Applications should be sent/emailed to: >> >> Matthew Hennessy >> Department of Computer Science >> The O'Reilly Institute >> Trinity College >> Dublin 2 >> Ireland >> email: matthew.hennessy at cs.tcd.ie >> tel: +353 (01) 8962634 >> >> Trinity College is an equal opportunities employer. >> > > -- > +-------------------------------------------+------------_.---.)--+ > | Edison Fernando Mera Menendez???????????? |? (^--^)_.-"????? `; | > | PhD in Computer Science?????????????????? |? ) ee (?????????? | | > | Technical University of Madrid??????????? | (_.__._)???????? /? | > | efmera at gmail.com | www.cliplab.org/edison |?? `--',??????? ,'?? | > | +34-64-018-9493? | tinyurl.com/6agusby??? |??? fff )_|--')_|??? | > +-------------------------------------------+--------""'---""'----+ > > From palmgren at math.su.se Tue Feb 21 11:10:01 2012 From: palmgren at math.su.se (Erik Palmgren) Date: Tue, 21 Feb 2012 17:10:01 +0100 Subject: [TYPES/announce] Call for papers: special issue of MSCS Message-ID: *********************** Call for papers *************************************** * Mathematical Structures in Computer Science - Special issue * "From Type Theory and Homotopy Theory to Univalent Foundations" * Deadline for submissions: December 31st, 2012 BACKGROUND Over the last few years, there has been significant progress in relating type theory with homotopy theory and higher-dimensional category theory. These advances have stimulated a new wave of research in type theory, in which ideas of mathematical logic and theoretical computer science are often combined with geometric intuition in an original way. In particular, the Univalent Foundations programme formulated by Vladimir Voevodsky seeks to develop a new approach to the foundations of mathematics on the basis of type theories that combine the good computational properties of Martin-L?f type theories and the Calculus of Inductive Constructions with new axioms inspired by homotopy theory, such as the Univalence Axiom. AIMS AND SCOPE The aim of the special issue is to provide a comprehensive and timely account of the state of the art in this new area of research, thus providing a basis for future developments. We welcome submissions from participants in the several conferences and workshops on these topics that are occurring this year or have occurred in the past few years. Topics of interest include, but are not limited, to: - homotopical semantics of type theories - semantics of type theories in higher categories - syntactic and semantic aspects of identity types - syntactic and semantic aspects of the Univalence Axiom - development of Univalent Foundations - related issues and challenges in computer-assisted proof-checking - representation of homotopical and higher categorical structures in type theory - related applications of polynomial/container functors. SUBMISSION The deadline for submissions is December 31st, 2012. Papers should be submitted as pdf attachments with an email to one of the editors. EDITORS The special issue will be edited by Steve Awodey (Carnegie Mellon University) Nicola Gambino (University of Palermo) Erik Palmgren (University of Stockholm) With best wishes Erik From davide at disi.unige.it Tue Feb 21 18:14:25 2012 From: davide at disi.unige.it (Davide Ancona) Date: Wed, 22 Feb 2012 00:14:25 +0100 Subject: [TYPES/announce] [CFP] Reachability Problems (RP'12) Message-ID: <4F442551.3040405@disi.unige.it> ============================================================== 6th International Workshop on Reachability Problems (RP'12) (September 17-19, 2012, Bordeaux, France) Deadline for submissions: 10 May, 2011 http://rp12.labri.fr/ ============================================================== The 6th Workshop on Reachability Problems will be hosted by LaBRI (Laboratoire Bordelais de Recherche en Informatique), Universit? de Bordeaux, France. The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in - Algebraic structures - Computational models - Hybrid systems - Logic - Verification Invited Speakers: ================ - Mikolaj Bojanczyk, Warsaw - Antonin Kucera, Brno - Joel Ouaknine, Oxford - Igor Walukiewicz, Bordeaux Submissions: =========== Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. Topics of interest include (but are not limited to): Reachability for infinite state systems, rewriting systems; Reachability analysis in counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of semigroups, groups and rings; Reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via the conference web page. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in postscript or pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Important Dates =============== Submission deadline: 10 May, 2012 Notification: 25 June, 2012 Final version: 5 July, 2012 Conference: 17-19 September, 2012 Proceedings =========== The Conference Proceedings will be published as the volume of the Springer Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure. Program Commitee: ============= Davide Ancona, Genova Bernard Boigelot, Liege Olivier Bournez, Palaiseau Cristian S. Calude, Auckland Giorgio Delzanno, Genova Javier Esparza, M?nchen Alain Finkel, Cachan Vesa Halava, Turku Juhani Karhum?ki, Turku Alexander Kurz, Leicester Kim G. Larsen, Aalborg Jerome Leroux, Bordeaux Richard Mayr, Edinburgh Alexei Lisitsa, Liverpool Igor Potapov, Liverpool Jean-Francois Raskin, Bruxels Sylvain Schmitz, Cachan Wolfgang Thomas, Aachen James Worrell, Oxford Hsu-Chun Yen, Taipei Gianluigi Zavattaro, Bologna Organizing Committee: ================ - Alain Finkel, Cachan - J?r?me Leroux, Bordeaux - Igor Potapov, Liverpool Contacts ================ E-mail: leroux at labri.fr, finkel at lsv.ens-cachan.fr, potapov at liverpool.ac.uk Web: http://rp12.labri.fr From tarmo at cs.ioc.ee Wed Feb 22 18:54:28 2012 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Thu, 23 Feb 2012 01:54:28 +0200 Subject: [TYPES/announce] ETAPS 2012 2nd call for participation, normal reg. closing 26 Feb. 2012 Message-ID: <20120223015428.321a6ec0@duality> Things to notice: - The programme of the main conferences and a draft summary programme of the workshops of ETAPS 2012 are on the web. - Normal registration will close 26 February 2012, in 4 days. After that date, late registration fees will apply. ****************************************************************** CALL FOR PARTICIPATION: ETAPS 2012 European Joint Conferences on Theory And Practice of Software March 24 - April 1, 2012 Tallinn, Estonia http://www.etaps.org/2012 ****************************************************************** -- 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 (one of them, POST, being new in 2012), accompanied by satellite workshops. ETAPS 2012 is already the fifteenth 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 * New! POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED TALKS -- * Unifying speaker 1: Bruno Blanchet (INRIA / ENS / CNRS, France). Security protocol verification: Symbolic and computational models * Unifying speaker 2: Georg Gottlob (Univ. of Oxford, UK). Querying UML class diagrams * CC invited speaker: Francois Bodin (IRISA and CAPS Entreprise, France). Programming heterogeneous many-cores using directives * ESOP invited speaker: Bjarne Stroustrup (Texas A&M Univ., USA) Foundations of C++ * FASE invited speaker: Wil van der Aalst (Techn. Univ. of Eindhoven, Netherlands). Distributed process discovery and conformance checking * FoSSaCS invited speaker: Glynn Winskel (Univ. of Cambridge, UK). Bicategories of concurrent games * POST invited speaker: Cynthia Dwork (Microsoft Research, Silicon Valley, USA). Differential privacy and the power of (formalizing) negative thinking * TACAS invited speaker: Holger Hermanns (Saarland University, Germany). Quantitative models for a not so dumb grid -- CONTRIBUTED PAPERS See the accepted paper lists and the programme of the main conferences at the conference website. -- SATELLITE EVENTS -- 21 satellite workshops will take place before or after ETAPS 2012. BX, FICS, FIT, GT-VMT, iWIGP, MBT, MSFP, VSSE, WRLA will take place in the weekend on 24-25 March 2012. ACCAT, AIPA, Bytecode, CMCS, DICE, FESCA, Graphite, HAS, LDTA, Linearity, PLACES, QAPL are scheduled for 31 March-1 April 2012. See a draft summary programme of the workshops at the conference website. -- REGISTRATION Normal registration is until Sunday, 26 February 2012. -- ACCOMMODATION Tallinn has developed ample hotel capacity. We request that participants arrange their accommodation on their own. -- HOST CITY -- Tallinn, a city of 412,000 people, is the capital and largest city of Estonia, a small EU member country in Northern Europe, bordering Russia to the East and Latvia to the south. Located in the north of the country, on the southern shores of the Gulf of Finland, opposite Helsinki in Finland, Tallinn is most well known for its picturesque medieval Old Town, a UNESCO World Heritage site. But it also has a vivid cultural scene, outperforming most European centres of similar size. In 2011, Tallinn, along with Turku in Finland, was the Cultural Capital of Europe. Tallinn is easy to travel to. Estonia is part of Schengen and the Eurozone. The Lennart Meri International Airport of Tallinn (TLL) is only 4 kms from the city centre. -- ORGANIZERS * General chair: Tarmo Uustalu * Workshops chair: Keiko Nakata * Organizing committee: James Chapman, Juhan Ernits, Tiina Laasma, Monika Perkmann and colleagues * Host institution: Institute of Cybernetics at Tallinn University of Technology -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps12 at cs.ioc.ee. From c.a.furia at gmail.com Thu Feb 23 05:38:58 2012 From: c.a.furia at gmail.com (Carlo Alberto Furia) Date: Thu, 23 Feb 2012 11:38:58 +0100 Subject: [TYPES/announce] TIME 2012 -- Call for Papers Message-ID: <4F461742.30600@gmail.com> (Apologies for duplicates) TIME 2012 Call for Papers Nineteenth International Symposium on Temporal Representation and Reasoning Leicester, UK, September 12-14, 2012 http://www.tech.dmu.ac.uk/STRL/time12/ TIME 2012 is an official event of THE ALAN TURING YEAR http://www.mathcomp.leeds.ac.uk/turing2012/ The TIME symposium series is a well-established annual event that brings together researchers from all areas of computer science that involve temporal representation and reasoning. This includes, but is not limited to, artificial intelligence, temporal databases, and the verification of software and hardware systems. In addition to fostering interdisciplinarity, the TIME symposia emphasize bridging the gap between theoretical and applied research. The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. In addition, TIME 2012 will feature a special track on Temporal Representation and Reasoning in Medicine. * IMPORTANT DATES Abstract Submission: April 16 Paper Submission: April 20 Paper Notification: May 20 Camera Ready Copy Due: June 24 TIME 2012 Symposium: September 12-14 * TOPICS The main topics of the conference are: (1) Temporal Representation and Reasoning in AI (2) Temporal Database Management (3) Temporal Logic and Verification in Computer Science (4) Special Track on Temporal Representation and Reasoning in Medicine 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 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 - Interval temporal logics - Temporal logics: expressiveness, decidability, and complexity - Tools and practical systems - Temporal issues in security * SPECIAL TRACK ON TEMPORAL REPRESENTATION AND REASONING IN MEDICINE This year, TIME has an additional special track on Temporal Representation and Reasoning in Medicine 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. Representing, maintaining, querying, and reasoning about time-oriented medical data are a major theoretical and practical research area. Temporal representation and reasoning deals with storage and retrieval of data that have heterogeneous temporal dimensions, with the support of various inference tasks involving time-oriented data, such as planning and diagnosing, and with the formal specification of temporal systems. Temporal representation and reasoning in medicine holds a long history and received an increasing interest over the last 30 years: indeed, it is important to medical decision making (e.g., in clinical diagnosis and therapy planning) and in medical data modeling and managing (e.g., for representation of the patient's medical record). High quality contributions for the special track are welcome in, but are not limited to, any of the following sub-areas of research: - Temporal reasoning and time-oriented diagnosis or therapy-planning in medicine - Temporal constraint representation and management in medical databases - Querying and maintaining time-oriented medical databases - Modeling and querying time-oriented medical data - Acquisition, maintenance, sharing, and reuse of temporal medical knowledge - Handling multiple and heterogeneous time-oriented clinical databases - Design and implementation of time-oriented medical information systems - Summarization of time-oriented medical data - Temporal data mining in medicine - Visualization of temporal clinical data and knowledge - Temporal knowledge and medical ontologies - Clinical guidelines, workflows and temporal information - Managing multimedia temporal data * PAPER SUBMISSION Submissions of high quality papers describing research results 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, as in previous years, are expected to be published by the IEEE Computer Society's 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 guide-lines described at ftp://pubftp.computer.org/press/outgoing/ proceedings/8.5x11 - Formatting files/ and must not exceed 8 pages; over-length submissions may be rejected without review. Papers are submitted electronically via EasyChair: http://www.easychair.org/conferences/?conf=time12 * CONFERENCE OFFICERS General Chair: Ben Moszkowski, De Montfort University, UK Program Committee Chairs: Ben Moszkowski, De Montfort University, UK Mark Reynolds, University of Western Australia, Australia Paolo Terenziani, University of Piemonte Orientale, Italy Organizational Chairs: Antonio Cau, De Montfort University, UK Hongji Yang, De Montfort University, UK * PROGRAM COMMITTEE Alessandro Artale, Free University of Bozen-Bolzano, Italy Alexander Artikis, National Centre for Scientific Research "Demokritos", Greece Philippe Balbiani, IRIT, France Claudio Bettini, University of Milan, Italy Antonio Cau, De Montfort University, UK Carlo Combi, University of Verona, Italy Amar Das, Stanford University, USA Clare Dixon, University of Liverpool, UK Zhenhua Duan, Xidian University, Xi'an, China Carlo Alberto Furia, ETH Zurich, Switzerland Antony Galton, University of Exeter, UK Fabio Grandi, University of Bologna, Italy Keijo Heljanko, Aalto University, Finland Jose Juarez, University of Murcia, Spain Martin Leucker, University of Luebeck, Germany Silvia Miksch, Vienna University of Technology, Austria Angelo Montanari, University of Udine, Italy Ben Moszkowski, De Montfort University, UK James Pustejovsky, Brandeis University, USA Jean-Francois Raskin, Universite Libre de Bruxelles, Belgium Jochen Renz, Australian National University, Australia Peter Revesz, University of Nebraska-Lincoln, USA Mark Reynolds, University of Western Australia, Australia Lucia Sacchi, Brunel University, UK Martin Sachenbacher, Technical University Munich, Germany Cesar Sanchez, IMDEA Software Institute, Spain Yuval Shahar, Ben-Gurion University of the Negev, Israel Richard Snodgrass, University of Arizona, USA Paolo Terenziani, University of Piemonte Orientale, Italy Richard Trefler, University of Waterloo, Canada Stefan Woelfl, University of Freiburg, Germany Naijun Zhan, Chinese Academy of Sciences, Beijing, China * FURTHER INFORMATION Questions related to submission, reviewing, and program: time12 at dmu.ac.uk Questions related to local organization: time12-org at dmu.ac.uk From m.huisman at utwente.nl Thu Feb 23 07:36:09 2012 From: m.huisman at utwente.nl (Marieke Huisman) Date: Thu, 23 Feb 2012 13:36:09 +0100 Subject: [TYPES/announce] call for participation: Bytecode 2012 (an ETAPS 2012 workshop), March 31, 2012 in Tallinn, Estonia Message-ID: <4F4632B9.8080409@utwente.nl> CALL FOR PARTICIPATION Bytecode 2012 Seventh Workshop on Bytecode Semantics, Verification, Analysis and Transformation A Satellite workshop of ETAPS 2012 Tallinn, Estonia, 31 March 2012 http://wwwhome.ewi.utwente.nl/~marieke/Bytecode2012/ NOTE: DEADLINE FOR NORMAL REGISTRATION ETAPS IS CLOSING ON FEB 26, 2012 Program ======= 9:00-10:00 Jeff Foster Using bytecode transformation to retrofit fine-grained security policies on unmodified Android 10:00-10:30 Olga Gadyatskaya, Eduardo Lostal and Fabio Massacci Extended Abstract: Embeddable Security-by-Contract Verifier for Java Card 10:30 - 11:00 Coffee Break 11:00 - 12:00 James Hunt Bytecode and Safety-Critical Systems: Friend or Foe? 12:00 - 13:00 Henrik Soendberg Karlsen, Erik Ramsgaard Wognsen, Mads Chr. Olesen and Rene Rydhof Hansen Study, Formalisation, and Analysis of Dalvik Bytecode 12:30 - 14:00 Lunch Break 14:00 - 15:00 Diego Garbervetsky Quantitative analysis of Java/.Net like programs to understand heap memory requirements 15:00 - 15:30 Gabriele Costa, Giulio Caravagna, Giovanni Pardini and Luca Wiegand Log-based Lazy Monitoring of OSGi Bundles 15:30 - 16:00 Coffee Break 16:00 - 16:30 Elvira Albert, Samir Genaim and Guillermo Rom?n-D?ez Conditional Termination of Loops over Arrays 16:30 - 17:00 Michael Barnett and Shaz Qadeer BCT: A translator from MSIL to Boogie Description of the workshop =========================== Bytecode, such as produced by e.g., Java and .NET compilers, has become an important topic of interest, both for industry and academia. The industrial interest stems from the fact that bytecode is typically used for Internet and mobile device applications (smart cards, phones, etc.), where security is a major issue. Moreover, bytecode is device independent and allows dynamic loading of classes, which provides an extra challenge for the application of formal methods. Also the unstructuredness of the code and the pervasive presence of the operand stack provide further challenges for the analysis of bytecode. This workshop will focus on theoretical and practical aspects of semantics, verification, analysis, certification and transformation of bytecode. Research on bytecode is an ideal test bench for the application of formal methods to real languages. There is a major pressure in this sense, because security is a hot topic for bytecode applications in embedded devices. However, the scientific community on bytecode semantics, verification, analysis, and transformation is currently fragmented, and researchers often come from the two distinct worlds of industry and academia. Therefore, the aim of our workshop is to let researchers and practitioners from both the industrial and the academic world present new or preliminary results and demonstrate new software tools that are of interest for the community as a whole. The workshop will be a mixture of extended abstracts, position papers, and invited presentations. The goal is to make the workshop an active discussion forum for all work related to bytecode. Organiser ========= Marieke Huisman, University of Twente, Netherlands. All questions about the workshop can be addressed to her via mail: M.Huisman at utwente.nl. Workshop Committee ================== Elvira Albert, Complutense University of Madrid, Spain June Andronick, NICTA, Australia Massimo Bartoletti, University of Cagliari, Italy Lennart Beringer, Princeton University, USA Marieke Huisman, University of Twente, Netherlands Francesco Logozzo, Microsoft Research, USA Peter Mueller, ETH Zuerich, Switzerland Tamara Rezk, INRIA Sophia Antipolis-Mediterranee, France Bernhard Scholz, University of Sydney, Australia Fausto Spoto, University of Verona, Italy From maffeis at doc.ic.ac.uk Thu Feb 23 08:26:16 2012 From: maffeis at doc.ic.ac.uk (Sergio Maffeis) Date: Thu, 23 Feb 2012 13:26:16 +0000 Subject: [TYPES/announce] PLAS 2012: Deadline Approaching Message-ID: <4F463E78.1010108@doc.ic.ac.uk> *********************************************************************** Final Call for Papers Seventh ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2012) http://www.doc.ic.ac.uk/PLAS2012 June 15, 2012 Co-located with PLDI 2012, Beijing, China *********************************************************************** SCOPE PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. The scope of PLAS includes but is not limited to: * Compiler-based security mechanisms or runtime-based security mechanisms such as inline reference monitors * Program analysis techniques for discovering security vulnerabilities * Automated introduction and/or verification of security enforcement mechanisms * Language-based verification of security properties in software including verification of cryptographic protocols and algorithms * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT INFORMATION ***************************** Submissions due: March 2, 2012. Author notification: April 4, 2012. PLAS 2010 workshop: June 15, 2012. STUDENT TRAVEL GRANTS Thanks to our sponsors, we will offer travel grants to student attendees of PLAS (in addition to the PLDI travel grants). Further details will be available on the website. SUBMISSION GUIDELINES We invite papers in two categories: * Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each. * Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase "Position Paper: " (without quotes) to the title of the submitted paper. Submissions should be PDF documents typeset in the ACM proceedings format using 10pt fonts. SIGPLAN-approved templates can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. All submissions must be in English. Page limits are strict. Both full and position papers must describe work not published in other refereed venues (see the SIGPLAN republication policy at http://www.acm.org/sigs/sigplan/republicationpolicy.htm for details). Accepted papers will appear in the workshop proceedings which will be distributed to workshop participants and be available in the ACM Digital Library. Papers may be submitted via EasyChair at http://www.easychair.org/conferences/?conf=plas2012. The submission deadline is Friday, March 02, 2012 (23:59:59 Samoa Time). PROGRAM COMMITTEE Sruthi Bandhakavi (Google Inc.) Avik Chaudhuri (Adobe Systems) Stephen Chong (Harvard University) Yuxin Deng (Shanghai Jiao Tong University) Feng Dengguo (Chinese Academy of Sciences) Marieke Huisman (University of Twente) Sergio Maffeis (Imperial College London) [co-chair] Prasad Naldurg (Microsoft Research India) Marco Pistoia (IBM T. J. Watson Research Center) Tamara Rezk (INRIA) [co-chair] David Sands (Chalmers University) Zhong Shao (Yale University) From pmt6sbc at maths.leeds.ac.uk Thu Feb 23 15:41:43 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Thu, 23 Feb 2012 20:41:43 GMT Subject: [TYPES/announce] [CiE 2012] Call for Informal Presentations for Turing Centenary Conference in Cambridge Message-ID: <201202232041.q1NKfhka016840@maths.leeds.ac.uk> ********************************************************************** CALL FOR INFORMAL PRESENTATIONS: TURING CENTENARY CONFERENCE http://www.cie2012.eu Computability in Europe 2012: How the World Computes University of Cambridge Cambridge, 18-23 June 2012 CiE 2012 is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, artificial intelligence, philosophy and computational aspects of physics, biology, linguistics, economics and the wider scientific world. CiE 2012 is planned to be an event worthy of the remarkable scientific career it commemorates, and will be the largest ever conference centred on the Computability Theoretic legacy of Turing and his contemporaries. PLENARY SPEAKERS include: Andrew Hodges (Oxford, Special Invited Lecture), Ian Stewart (Warwick, Special Public Lecture), Dorit Aharonov (Jerusalem), Veronica Becher (Buenos Aires), Lenore Blum (Carnegie Mellon, The 2012 APAL Lecture), Rodney Downey (Wellington), Yuri Gurevich (Microsoft, The EACSL Lecture), Juris Hartmanis (Cornell), Richard Jozsa (Cambridge, jointly organised lecture with King's College), Stuart Kauffman (Vermont/ Santa Fe), James Murray (Oxford/Princeton, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College). SUBMISSION OF ABSTRACTS OF INFORMAL PRESENTATIONS are now invited for this historic event. For submission details, see: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12 SUBMISSION DEADLINE for Informal Presentations: MAY 11, 2012 Authors will be notified of acceptance, usually within two weeks of submission. All accepted papers become eligible for consideration for post-conference journals: COMPUTABILITY will consider journal versions of papers presented at CiE conferences as a general rule; and there will be special issues of Logical Methods in Computer Science (LMCS) and Annals of Pure and Applied Logic (APAL). CiE 2012 CONFERENCE TOPICS include, but not exclusively - * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. CiE 2012 will have a special relationship to the scientific legacy of Alan Turing, reflected in the broad theme: How the World Computes, with all its different layers of meaning. Contributions which are directly related to the visionary and seminal work of Turing will be particularly welcome. SPECIAL SESSIONS include: * Cryptography, Complexity, and Randomness Chairs: Rod Downey and Jack Lutz Speakers so far: Eric Allender, Lance Fortnow, Valentine Kabanets, Omer Reingold, Alexander Shen + Panel Discussion on Future Directions * The Turing Test and Thinking Machines Chairs: Mark Bishop and Rineke Verbrugge Speakers: Bruce Edmonds, John Preston, Susan Sterrett, Kevin Warwick, Jiri Wiedermann + Panel Discussion on Future Directions * Computational Models After Turing: The Church-Turing Thesis and Beyond Chairs: Martin Davis and Wilfried Sieg Speakers: Giuseppe Longo, Peter Nemeti, Stewart Shapiro, Matthew Szudzik, Philip Welch, Michiel van Lambalgen * Morphogenesis/Emergence as a Computability Theoretic Phenomenon Chairs: Philip Maini and Peter Sloot Speakers: Jaap Kaandorp, Shigeru Kondo, Nick Monk, John Reinitz, James Sharpe, Jonathan Sherratt * Open Problems in the Philosophy of Information Chairs: Pieter Adriaans and Benedikt Loewe Speakers: Patrick Allo, Luis Antunes, Mark Finlayson, Amos Golan, Ruth Millikan + Panel Discussion on Future Directions * The Universal Turing Machine, and History of the Computer Chairs: Jack Copeland and John Tucker Speakers so far: Steven Ericsson-Zenith, Ivor Grattan-Guinness, Mark Priestley, Robert I. Soare + Panel Discussion Information of funding for students (including ASL grants) and the attendance of female researchers is at: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?14 There will be the annual Women in Computability Workshop, supported by a grant from the Elsevier Foundation. CiE 2012 will be associated/co-located with a number of other Turing centenary events, including: * ACE 2012, June 15-16, 2012 * Computability and Complexity in Analysis (CCA 2012), June 24-27, 2012 http://cca-net.de/cca2012/ * Developments in Computational Models (DCM 2012), June 17, 2012 http://www.math.uni-hamburg.de/home/loewe/DCM2012/ * THE INCOMPUTABLE at Kavli Royal Society International Centre Chicheley Hall, June 12-15, 2012 http://www.mathcomp.leeds.ac.uk/turing2012/inc/ PROGRAMME COMMITTEE: * Samson Abramsky (Oxford) * Pieter Adriaans (Amsterdam) * Franz Baader (Dresden) * Arnold Beckmann (Swansea) * Mark Bishop (London) * Paola Bonizzoni (Milan) * Luca Cardelli (Cambridge) * Douglas Cenzer (Gainesville) * S Barry Cooper (Leeds, Co-chair) * Ann Copestake (Cambridge) * Anuj Dawar (Cambridge, Co-chair) * Solomon Feferman (Stanford) * Bernold Fiedler (Berlin) * Luciano Floridi (Hertfordshire) * Martin Hyland (Cambridge) * Marcus Hutter (Canberra) * Viv Kendon (Leeds) * Stephan Kreutzer (Oxford) * Ming Li (Waterloo) * Benedikt Loewe (Amsterdam) * Angus MacIntyre (London) * Philip Maini (Oxford) * Larry Moss (Bloomington) * Amitabha Mukerjee (Kanpur) * Damian Niwinski (Warsaw) * Dag Normann (Oslo) * Prakash Panangaden (Montreal) * Jeff Paris (Manchester) * Brigitte Pientka (Montreal) * Helmut Schwichtenberg (Munich) * Wilfried Sieg (Carnegie Mellon) * Mariya Soskova (Sofia) * Bettina Speckmann (Eindhoven) * Christof Teuscher (Portland) * Peter van Emde Boas (Amsterdam) * Jan van Leeuwen (Utrecht) * Rineke Verbrugge (Groningen) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit abstracts of their proposed presentations (in PDF-format, max 1 page) for CiE 2012. We particularly invite papers that build bridges between different parts of the research community. ORGANISING COMMITTEE: Arnold Beckmann (Swansea), Luca Cardelli (Cambridge), S Barry Cooper (Leeds), Ann Copestake (Cambridge), Anuj Dawar (Cambridge, Chair), Bjarki Holm (Cambridge), Martin Hyland (Cambridge), Benedikt Loewe (Amsterdam), Arno Pauly (Cambridge), Andrew Pitts (Cambridge) The conference is sponsored by the ASL, EACSL, EATCS, Elsevier Foundation, IFCoLog, King's College Cambridge, The University of Cambridge and Microsoft Research. For a small poster to download and display: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/Images/cie12.poster.1000x1400.png Contact: Anuj Dawar - anuj.dawar(at)cl.cam.ac.uk ********************************************************************** From U.Berger at swansea.ac.uk Thu Feb 23 19:03:11 2012 From: U.Berger at swansea.ac.uk (U.Berger at swansea.ac.uk) Date: Fri, 24 Feb 2012 00:03:11 -0000 (GMT) Subject: [TYPES/announce] MFPS 28: paper submission deadline extended by one week Message-ID: <49682.92.6.174.163.1330041791.squirrel@cs.swansea.ac.uk> Dear Colleagues, Due to several requests the submission deadlines for MFPS XXVIII have been extended by one week. The new dates are: - 2 March 2012 Title and Short Abstract submission due - 9 March 2012 Paper submission due The amended CfP is appended below. Best regards, Ulrich Berger (Chair of the MFPS XXVIII Programme Committee) ------------------------------------------------------------------------ MFPS XXVIII http://www.math.tulane.edu/~mfps/MFPS28 Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics University of Bath United Kingdom 6 - 9 June 2012 In association with the Alan Turing Year The Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics will take place on the campus of the University of Bath, United Kingdom from June 6 through June 9, 2012. MFPS conferences are devoted to those areas of mathematics, logic, and computer science that are related to models of computation, in general, and to the semantics of programming languages, in particular. The series has particularly stressed providing a forum where researchers in mathematics and computer science can meet and exchange ideas about problems of common interest. As the series also strives to maintain breadth in its scope, the conference strongly encourages participation by researchers in neighbouring areas. TOPICS include, but are not limited to, the following: biocomputation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. INVITED SPEAKERS: Steve Awodey, CMU Michael Clarkson, GWU Patricia Johann, Strathclyde Dexter Kozen, Cornell Drew Moshier, Chapman John Power, Bath SPECIAL SESSIONS: There will be four special sessions at the meeting, each associated with one of the plenary talks: * Logic, computation and algebraic topology, organised by Steve Awodey and Michael Mislove * Security, organised by Michael Clarkson and Catherine Meadows. The papers in this session will be chosen from the papers submitted in response to this Call. * Computational effects, organised by John Power * Computability on Continuous Data, organised by Drew Moshier There also will be a series of four Tutorial Lectures; the topic and speakers will be announced later. PROGRAM COMMITTEE: Thorsten Altenkirch, U Nottingham, UK Steve Awodey, Carnegie Mellon U, USA Andrej Bauer, U Ljubljana, Slovenia Ulrich Berger, Swansea U, UK (Chair) Bob Coecke, U Oxford, UK Stephen Brooks, Carnegie Mellon U, USA Martin Escardo, U Birmingham, UK Marcelo Fiore, U Cambridge, UK Neil Ghani, U Strathclyde, UK Alexey Gotsman, IMDEA, Madrid, Spain Hugo Herbelin, INRIA, Rocquencourt-Paris, France Achim Jung, U Birmingham, UK Daniel Leivant, U Indiana, USA Guy McCusker, U Bath, UK Catherine Meadows, NRL, USA Michael Mislove, Tulane U, USA Peter O'Hearn, Queen Mary U London, UK Luke Ong, U Oxford, UK Prakash Panangaden, McGill U, Canada John Power, U Bath, UK Jan Rutten, Radboud Nijmegen, Netherlands Alex Simpson, U Edinburgh, UK James Worrell, U Oxford, UK IMPORTANT DATES: - 2 March 2012 Title and Short Abstract submission deadline (extended) - 9 March 2012 Paper submission deadline (extended) - 2 April 2012 Notification to authors - 23 April 2012 Preliminary proceedings version due SUBMISSIONS should be prepared using ENTCS Macros, available from http://www.entcs.org. Submissions should be in the form of a PDF file not exceeding 15 pages in length. Submissions will be open shortly after January 1 on the EasyChair website: http://www.easychair.org/conferences/?conf=mfps2012 PROCEEDINGS: There will be a preliminary proceedings of the conference papers that will be distributed at the meeting, with a final proceedings published in ENTCS after the meeting. The Organisers of the MFPS series are Stephen Brookes (CMU), Achim Jung (Birmingham), Catherine Meadows (NRL), Michael Mislove (Tulane) and Prakash Panangaden (McGill). The local arrangements for MFPS XXVIII are being overseen by Guy McCusker (Bath) and John Power (Bath). From stephan.merz at loria.fr Fri Feb 24 06:17:20 2012 From: stephan.merz at loria.fr (Stephan Merz) Date: Fri, 24 Feb 2012 12:17:20 +0100 Subject: [TYPES/announce] post-doc position at MSR-INRIA centre, Paris, France Message-ID: <12BC9FC5-B148-489F-B573-06874F474B98@loria.fr> Research team: Tools for Proofs, MSR-INRIA Joint Centre ======================================================= The Microsoft Research-INRIA Joint Centre is offering a 2-year position for a post-doctoral researcher to contribute to a proof development environment for TLA+ developed in the Tools for Proofs project (see http://www.msr-inria.inria.fr). Research Context ================ TLA+ is a language for specifying and reasoning about systems, including concurrent and distributed systems. It is based on first-order logic, set theory, temporal logic, and a module system. TLA+ and its tools have been used in industry for over a decade. More recently, we have extended TLA+ to include hierarchically structured formal proofs that are independent of any proof checker. We have released several versions of the TLAPS proof checker (http://msr-inria.inria.fr/~doligez/tlaps/) and integrated it into the TLA+ Toolbox, an IDE for the TLA+ tools (http://research.microsoft.com/en-us/um/people/lamport/tla/toolbox.html). TLAPS and the Toolbox support the top-down development of proofs and the checking of individual proof steps independently of the rest of the proof. This helps users focus on the part of the proof they are working on. Although still lacking important features, TLAPS is already a powerful tool and has been used for a few verification projects, including a proof of the safety properties of a Byzantine-fault tolerant consensus algorithm (http://research.microsoft.com/en-us/um/people/lamport/tla/byzpaxos.html). TLAPS consists of the Proof Manager (PM, an interpreter for the proof language that computes the proof obligations corresponding to each proof step) and an extensible list of backend provers. Current backends include the tableau prover Zenon, an encoding of TLA+ as an object logic in the Isabelle proof assistant, and a generic backend for SMT solvers. When possible, we expect backend provers to produce a detailed proof that is then checked by Isabelle. In this way, we can obtain high assurance of correctness as well as satisfactory automation. The current version of the PM handles only the "action" part of TLA+: first-order formulas with primed and unprimed variables, where a variable v is considered to be unrelated to its primed version v'. This allows us to translate non-temporal proof obligations to standard first-order logic, without the overhead associated with an encoding of temporal logic into first-order logic. Description of the activity of the post-doc =========================================== You will work with other members of the project, including Leslie Lamport, Damien Doligez, and Stephan Merz, on the extension of the TLA+ proof language to temporal operators. This extension poses interesting conceptual and practical problems. In particular, the new translation must smoothly extend the existing one since temporal proof steps rely on action-level subproofs. You will have the primary responsibility for designing and implementing algorithms to generate corresponding proof obligations. As time permits and depending on your interests, you will have the opportunity to contribute to further improving the proof checker. This may include: - adding support for certain TLA+ features that are not yet handled by the PM, such as recursive operator definitions and elaborate patterns for variable bindings; - finding what improvements are needed by verifying real examples, perhaps including liveness of the aforementioned consensus algorithm; - integrating new backends to improve the automation of proofs; - adding validation of proofs by backends whose proofs are not now checked. Skills and profile of the candidate =================================== You should have a solid knowledge of logic and set theory as well as good implementation skills related to symbolic theorem proving. Of particular relevance are parsing and compilation techniques. Our tools are mainly implemented in OCaml. Experience with temporal and modal logics, Isabelle, Java or Eclipse would be a plus. Given the geographical distribution of the members of the team, we highly value a good balance between the ability to work in a team and the capacity to propose initiatives. Location ======== The Microsoft Research-INRIA Joint Centre is located on the Campus of INRIA Saclay south of Paris, near the Le Guichet RER station. Starting date ============= The normal starting date of the contract would be September 2012, but we can arrange for an extremely well-qualified candidate to start sooner. Contact ======= Candidates should send a resume and the name and e-mail addresses of one or two references to Damien Doligez . The deadline for application is April 15, 2012. This announcement is available at http://www.msr-inria.inria.fr/Members/doligez/post-doc-position-2012/view From brucker at spamfence.net Sat Feb 25 07:40:52 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Sat, 25 Feb 2012 13:40:52 +0100 Subject: [TYPES/announce] Call for Journal Papers: STVR Special Issue on Tests and Proofs Message-ID: <20120225124052.GA16743@shinanogawa.brucker.ch> Apologies for duplicates. CALL FOR PAPERS STVR Special Issue on Tests and Proofs http://lifc.univ-fcomte.fr/tap2012/stvr/ The Software Testing, Verification & Reliability (STVR) journal (http://www3.interscience.wiley.com/journal/13635/home) invites authors to submit papers to a Special Issue on Tests and Proofs. Background ========== The increasing use of software and the growing system complexity make focused software testing a challenging task. Recent years have seen an increasing industrial and academic interest in the use of static and dynamic analysis techniques together. Success has been reported combining different test techniques such as model-based testing, structural testing, or concolic testing with static techniques such as program slicing, dependencies analysis, model-checking, abstract interpretation, predicate abstraction, or verification. This special issue serves as a platform for researchers and practitioners to present theory, results, experience and advances in Tests and Proofs (TAP). Topics ====== This special issue focuses on all topics relevant to TAP. In particular, the topics of interest include, but are not limited to: * Program proving with the aid of testing techniques * New challenges 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, SAT and SMT solving * Model-based testing and verification * Automatic bug finding * Debugging of programs combining static and dynamic analysis * Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing * Formal frameworks for test and proof * Tool descriptions, experience reports and evaluation of test and proof * Case studies combining tests and proofs * Applying combination of test and proof techniques to new application domains such as validating security procotols or vulnerability detection of programs * The processes, techniques, and tools that support test and proof Submission Information ====================== The deadline for submissions is 17th December, 2012. Notification of decisions will be given by April 15th, 2013. All submissions must contain original unpublished work not being considered for publication elsewhere. Original extensions to conference papers - identifing clearly additional contributions - are also encouraged unless prohibited by copyright. Submissions will be refereed according to standard procedures for Software Testing, Verification and Reliability. Please submit your paper electronically using the Software Testing, Verification & Reliability manuscript submission site. Select "Special Issue Paper" and enter "Tests and Proofs" as title. Important Dates: ================ * Paper submission: December 17, 2012 * Notification: April 15, 2013 Guest Editors ============= * Achim D. Brucker, SAP Research, Germany http://www.brucker.ch/ * Wolfgang Grieskamp, Google, U.S.A. http://www.linkedin.com/in/wgrieskamp * Jacques Julliand, University of Franche-Comt?, France http://lifc.univ-fcomte.fr/page_personnelle/accueil/8 -- Dr. Achim D. Brucker, SAP Research, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch From tadeusz.litak at gmail.com Mon Feb 27 07:19:37 2012 From: tadeusz.litak at gmail.com (Tadeusz Litak) Date: Mon, 27 Feb 2012 12:19:37 +0000 Subject: [TYPES/announce] AiML 2012: final CfP, with a special session "Modalities for Types" Message-ID: <4F4B74D9.9080603@gmail.com> Dear all, [as usual, apologies for multiple posting] AiML 2012 (Advances in Modal Logic) final call for papers has been released, please find it below. From the point of view of TYPES community, the following special session may be of particular interest: SPECIAL SESSION ON MODALITES FOR TYPES. Recent years have witnessed significant growth of interest in constructive type-theoretical modalities, in particular modalities ensuring productivity and type safety of (co-)recursive definitions in reactive programming. Some earlier examples include the use of modalities for staged computation, metaprogramming or in computational lambda-calculus. In order to boost interaction between programming, type-theoretical and modal communities, AiML 2012 will host a special session on these topics. Papers for this session should be submitted to the EasyChair site along with others. We will have Lars Birkedal as an invited speaker for the session. Moreover, the submission deadline has been set after LiCS and IJCAR notification deadlines (March 30)... Hope the event will help to draw the modal community and type-theoretic community a bit closer together. Best regards, Alexander Kurz, Tadeusz Litak (U. of Leicester, AiML PC) AiML-2012: FINAL CALL FOR PAPERS 9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC COPENHAGEN, 22-25 AUGUST, 2012 http://hylocore.ruc.dk/aiml2012.html Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences. Information about the AiML series can be obtained at http://www.aiml.net. AiML-2012 is the ninth conference in the series. TOPICS We invite submission on all aspects of modal logic, including: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic (complexity and decidability of modal and temporal logics, modal and temporal logic programming, model checking, model generation, theorem proving for modal logics) - theoretical aspects of modal logic (algebraic/categorical perspectives on modal logic, coalgebraic modal logic, completeness and canonicity, correspondence and duality theory, many-dimensional modal logics, modal fixed point logics, model theory of modal logic, proof theory of modal logic) - specific instances and variations of modal logic (description logics, modal logics over non-boolean bases, dynamic logics and other process logics, epistemic and deontic logics, modal logics for agent-based systems, modal logic and game theory, modal logic and grammar formalisms, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics, computationally light fragments of all such logics) Papers on related subjects will also be considered. CONFERENCE LOCATION Advances in Modal Logic 2012 will be held at the IDA conference center in downtown Copenhagen: http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx This is in easy walking distance from Copenhagen Central Station and a number of reasonably priced hotels. PAPER SUBMISSIONS There will be two types of submissions to AiML-2012: (1) Full papers for publication in the proceedings and presentation at the conference. (2) Abstracts for short presentation only. Both types of papers should be submitted electronically using the EasyChair submission page at http://www.easychair.org/conferences/?conf=aiml2012 At least one author of each accepted paper of abstract must register for, and attend, the conference to present his or her work. (1) FULL PAPERS. Authors are invited to submit, for presentation at the conference and publication in the proceedings, full papers reporting on original research and not submitted elsewhere. The proceedings of AiML'2012 will be published by College Publications (http://www.collegepublications.co.uk) in a volume to be made available at the conference. The submissions should be at most 15 pages, with an optional technical appendix of up to 5 pages, together with a plain-text abstract of 100-200 words. The submissions must be typeset in LaTeX, using a style file and template that will be provided on the AiML'2012 website. (2) ABSTRACTS. These should be at most 5 pages. They may describe preliminary results, work in progress etc., and will be subject to light reviewing. The accepted abstracts will be made available at the conference, and the authors will have the opportunity to make short presentations (of up to 15 minutes) on them. SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic allowing to refer explicitly to states of the model in the syntax of formulas. There will be a special session of AiML devoted to papers on hybrid logic. The scope of the special session is standard hybrid-logical machinery like nominals, satisfaction operators, and the downarrow binder, but also other extensions of modal logic can be considered. SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a special session of AiML devoted to papers and talks in honour of Larisa Maksimova, in recognition of her many outstanding contributions to modal logic. SPECIAL SESSION ON MODALITES FOR TYPES. Recent years have witnessed significant growth of interest in constructive type-theoretical modalities, in particular modalities ensuring productivity and type safety of (co-)recursive definitions in reactive programming. Some earlier examples include the use of modalities for staged computation, metaprogramming or in computational lambda-calculus. In order to boost interaction between programming, type-theoretical and modal communities, AiML 2012 will host a special session on these topics. Papers for this session should be submitted to the EasyChair site along with others. Papers for the special sessions should be submitted to the EasyChair site along with others. INVITED SPEAKERS Lev Beklemishev (Moscow State University) Johan van Benthem (University of Amsterdam and Stanford University) Lars Birkedal (IT University of Copenhagen, Denmark) Patrick Blackburn (Roskilde University) Balder ten Cate, (UC Santa Cruz) Larisa Maksimova (Novosibirsk State University) PROGRAMME COMMITTEE Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina) Philippe Balbiani (IRIT, Toulouse, France) Lev Beklemishev (Moscow State University, Russia) Guram Bezhanishvili (New Mexico State University, USA) Nick Bezhanishvili (Imperial College London, UK) Patrick Blackburn (Roskilde University, Denmark) Thomas Bolander (Technical University of Denmark) Torben Brauner (Roskilde University, Denmark) Giovanna Corsi (Universit? di Bologna, Italy) Giovanna D'Agostino (Universit? di Udine, Italy) Stephane Demri (LSV, ENS Cachan, France) Melvin Fitting (Lehman College, CUNY, USA) Robert Goldblatt (Victoria University of Wellington, New Zealand) Valentin Goranko (Technical University of Denmark) Rajeev Gore (Australian National University, Australia) Andreas Herzig (IRIT, Toulouse, France) Ian Hodkinson (Imperial College London, UK) Wiebe van der Hoek (University of Liverpool, UK) Rosalie Iemhoff (University of Utrecht, The Netherlands) Alexander Kurz (University of Leicester, UK) Tadeusz Litak (University of Leicester, UK) Hiroakira Ono (Japan Advanced Institute of Science and Technology) Martin Otto (Technical University of Darmstadt, Germany) Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands) Renate Schmidt (University of Manchester, UK) Lutz Schr?der (DFKI GmbH and University of Bremen, Germany) Valentin Shehtman (Moscow State University, Russia) Dimiter Vakarelov (Sofia University, Bulgaria) Yde Venema (ILLC, University of Amsterdam, The Netherlands) Heinrich Wansing (Ruhr University Bochum, Germany) Frank Wolter (University of Liverpool, UK) Michael Zakharyaschev (Birkbeck College, London, UK) PROGRAMME COMMITTEE CO-CHAIRS Silvio Ghilardi (Universit? degli Studi di Milano, Italy) Lawrence Moss (Indiana University, USA) ORGANIZING COMMITTEE CO-CHAIRS Thomas Bolander (Technical University of Denmark) Torben Brauner (Roskilde University, Denmark) IMPORTANT DATES Full papers submission deadline: 30 March 2012 Full papers acceptance notification: 18 May 2012 Short presentations submission deadline: 1 June, 2012 Short presentations acceptance notification: 18 June, 2012 Final version of full papers and abstracts due: 15 June 2012 Conference: 22-25 August, 2012. FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/ ENQUIRIES. E-mail enquiries should be directed respectively to the PC co-chairs, sent to aiml2012 at easychair.org From pmt6sbc at maths.leeds.ac.uk Mon Feb 27 08:26:13 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Mon, 27 Feb 2012 13:26:13 GMT Subject: [TYPES/announce] Alan Turing Centenary Conference, University of Manchester, 22-25 June, 2012 Message-ID: <201202271326.q1RDQDOU011050@maths.leeds.ac.uk> THE TURING CENTENARY CONFERENCE Manchester, UK, June 22-25, 2012 http://www.turing100.manchester.ac.uk/ First announcement and call for submissions Features: (1) Ten Turing Award winners, a Templeton Award winner and Garry Kasparov as invited speakers (2) 20,000 pounds worth best paper award program, including 5,000 pounds best paper award (3) Three panels and two public lectures (4) Turing Fellowship award ceremony (5) and many more ... For more details please check http://www.turing100.manchester.ac.uk/. SPEAKERS Confirmed invited speakers: - Fred Brooks (University of North Carolina) - Rodney Brooks (MIT) - Vint Cerf (Google) - Ed Clarke (Carnegie Mellon University) - Jack Copeland (University of Canterbury, New Zealand) - George Francis Rayner Ellis (University of Cape Town) - David Ferrucci (IBM) - Tony Hoare (Microsoft Research) - Garry Kasparov (Kasparov Chess Foundation) - Don Knuth (Stanford University) - Yuri Matiyasevich (Institute of Mathematics, St. Petersburg) - Roger Penrose (Oxford) - Adi Shamir (Weizmann Institute of Science) - Michael Rabin (Harvard) - Leslie Valiant (Harvard) - Manuela M. Veloso (Carnegie Mellon University) - Andrew Yao (Tsinghua University) Confirmed panel speakers: - Ron Brachman (Yahoo Labs) - Steve Furber (The University of Manchester) - Carole Goble (The University of Manchester) - Pat Hayes (Institute for Human and Machine Cognition, Pensacola) - Bertrand Meyer (Swiss Federal Institute of Technology) - Moshe Vardi (Rice University) SUBMISSIONS: Submissions are welcome in all areas related to the work of Alan Turing in computer science, mathematics, cognitive science and mathematical biology. A non-exclusive list of topics is shown below: - computation theory - logic in computation - artificial intelligence - social aspects of computation - models of computation - program analysis - mathematics of evolution and emergence - knowledge processing - natural language processing - cryptography - machine learning See http://www.turing100.manchester.ac.uk/index.php/submission for more details. BEST PAPER AWARDS: A subset of poster session submissions will be selected as candidates for best paper awards: - The best paper award of 5,000 pounds - The best young researcher best paper award of 3,000 pounds - The second best paper award of 2,500 pounds - The second best young researcher best paper award of 1,500 pounds - Sixteen (16) awards of 500 pounds each See http://www.turing100.manchester.ac.uk/index.php/submission/bestpaper for more details. REGISTRATION: The number of participants is limited. Register early to avoid disappointment! DATES: February 23: Paper submission opens March 1: Registration opens March 15: Extended abstract submission deadline March 29: Poster session notification and selection of candidates for the best paper awards April 20: Full versions of papers selected for the best paper awards May 1: Final versions of poster session papers May 21: Best paper award decisions May 28: Final versions of papers selected for the best paper awards June 22-25: Conference CHAIRS: Honorary Chairs: Rodney Brooks (MIT) Roger Penrose (Oxford) Conference Chairs: Matthias Baaz (Vienna University of Technology) Andrei Voronkov (The University of Manchester) Turing Fellowships Chair: Barry Cooper (University of Leeds) Programme Chair Andrei Voronkov (The University of Manchester) __________________________________________________________________ The Alan Turing Year http://www.turingcentenary.eu/ From Alex.Simpson at ed.ac.uk Tue Feb 28 11:06:34 2012 From: Alex.Simpson at ed.ac.uk (Alex Simpson) Date: Tue, 28 Feb 2012 16:06:34 +0000 Subject: [TYPES/announce] Student funding for Milner Symposium, Edinburgh, 16-18 April 2012 Message-ID: <20120228160634.1710762j551gbpwc@www.staffmail.ed.ac.uk> Of potential interest to PhD students and supervisors who read the types mailing list: There is funding available for PhD students to attend the Milner Symposium in Edinburgh 16-18 April. Application for student funding is via: http://events.inf.ed.ac.uk/Milner2012/studentregistration.html --- A Symposium in Celebration of the Life and Work of Robin Milner to be held from 16th-18th April 2012 in Edinburgh. The symposium will feature Robin's colleagues from all areas of his work, as well as others participating in its continuation. Robin's inspiring contributions continue to have a profound effect on computer science, and the symposium will show how his vision has developed our subject over the last few decades, and how new work continues to build on his many contributions. All are welcome to attend this event, whether to hear the thoughts of leading figures in computer science, or simply to re-make the many connections that Robin brought into being, through his broad research agenda and his kindness to all who worked with or near him. The symposium will be hosted by the Laboratory for Foundations of Computer Science in the School of Informatics at the University of Edinburgh. Date: 16-18 April 2012 Place: Informatics Forum, Edinburgh Web: http://events.inf.ed.ac.uk/Milner2012/ Poster: http://events.inf.ed.ac.uk/Milner2012/baposter/poster.pdf Email: milner-symposium at inf.ed.ac.uk -- 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 hamana at cs.gunma-u.ac.jp Tue Feb 28 16:32:42 2012 From: hamana at cs.gunma-u.ac.jp (Makoto Hamana) Date: Wed, 29 Feb 2012 06:32:42 +0900 Subject: [TYPES/announce] CFP: HOR 2012 in Nagoya, Japan Message-ID: <20120229063242.c381ad2ae6c7d5e27ce470c4a8b68598.e6d0f@cs.gunma-u.ac.jp> ===================================================================== Call for papers 6th International Workshop on Higher-Order Rewriting HOR 2012 June 2, 2012, Nagoya, Japan Colocated with RTA'12 http://www.cs.gunma-u.ac.jp/events/hor/ ====================================================================== HOR is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. The following is a non-exhaustive list of topics for the workshop: * Applications: proof checking, type checking, theorem proving, functional programming, declarative programming, program transformation, using some notions of higher-order rewriting. * Foundations: pattern matching, unification, strategies, termination, syntactic properties, type theory, for higher-order rewriting. * Frameworks: graph rewriting, net rewriting, comparisons of different formats. * Implementation: explicit substitution, rewriting tools, compilation techniques. * Semantics: semantics of higher-order rewriting, higher-order abstract syntax, categorical rewriting. Important dates --------------- Paper submission: March 19, 2012 Notification: April 20, 2012 Final version: May 10, 2012 Workshop: June 2, 2012 Submissions ----------- Two categories of papers are solicited: - Category A: Extended abstracts of new results, describing work in progress, or problems in higher-order rewriting. - Category B: Short versions of recently published or submitted elsewhere articles on higher-order rewriting. Papers in this category are for presentation only, and not considered as candidates for the post-workshop proceedings. Papers in both categories should be between 2 and 5 pages, and should note the category (either A or B). Papers are formatted according to EPTCS style, and submitted electronically via the EasyChair submission website. Papers will be judged on relevance, originality, correctness and usefulness. Please address your questions to the PC chair: hamana at cs.gunma-u.ac.jp. Proceedings ----------- The proceedings of HOR 2012 will be made available on the HOR 2012 web page, and a printed version will be distributed at the workshop. Post-workshop proceedings of extended abstracts of selected contributions is planned to be published as a volume of EPTCS. Program Committee ------------------- Andreas Abel (Ludwig-Maximilians-University Munich, Germany) Frederic Blanqui (INRIA, France) Makoto Hamana (Gunma University, Japan) (chair) Stefan Kahrs (University of Kent, UK) Fer-Jan de Vries (University of Leicester, UK) Program and Organizing Chair ---------------------------- Makoto Hamana (Gunma University, Japan) From alastair.donaldson at imperial.ac.uk Wed Feb 29 11:16:24 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Wed, 29 Feb 2012 16:16:24 +0000 Subject: [TYPES/announce] Second CfP: SPIN 2012 - 19th International Workshop on Model Checking Software In-Reply-To: <4F057DD1.5090601@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> Message-ID: <4F4E4F58.7090102@imperial.ac.uk> Apologies for multiple copies *** SPIN 2012: SECOND CALL FOR PAPERS *** 19th International Workshop on Model Checking Software - SPIN 2012 Oxford, July 23-24 2012 http://qav.cs.ox.ac.uk/spin2012/ IMPORTANT DATES - Submission of abstracts: 26 March AoE (Anywhere on Earth) - Submission of full papers: 30 March AoE (Anywhere on Earth) - Notification of acceptance/rejection: 7 May - Final version due: 14 May - Workshop: July 23-24 AIMS AND SCOPE The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. 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 workshop. 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 workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: - 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 modelling 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 workshop INVITED SPEAKERS - Tom Ball Microsoft Research - Andrey Rybalchenko TU Munich - Andreas Zeller Saarland University INVITED TUTORIAL - Cristian Cadar Imperial College London 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 an international journal (journal to be confirmed). 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 workshop 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 workshop website: http://qav.cs.ox.ac.uk/spin2012/ At least one author of each accepted paper must attend the workshop and present the paper. ORGANISATION Programme Chairs: - Alastair F. Donaldson, Imperial College London, UK - David Parker, University of Oxford, UK Local Arrangements Chair: - Michael Tautschnig, University of Oxford, UK Programme Committee: - Christel Baier (University of Dresden, Germany) - Dirk Beyer (University of Passau, Germany) - Dragan Bosnacki (Eindhoven University of Technology, Netherlands) - Alessandro Cimatti (Fondazione Bruno Kessler, IRST, Italy) - Alastair Donaldson (Imperial College London, UK) - Stefan Edelkamp (TZI University Bremen, Germany) - Alex Groce (Oregon State University, USA) - Gerard Holzmann (NASA/JPL, USA) - Radu Iosif (VERIMAG, CNRS, France) - Stefan Leue (University of Konstanz, Germany) - Eric Mercer (Brigham Young University, USA) - Alice Miller (University of Glasgow, UK) - Madanlal Musuvathi (Microsoft Research, Redmond, USA) - David Parker (University of Oxford, UK) - Corina Pasareanu (NASA Ames, USA) - Doron Peled (Bar Ilan University, Israel) - Jaco van de Pol (University of Twente, Netherlands) - Kees Pronk (Delft University of Technology, Netherlands) - Shaz Qadeer (Microsoft Research, Redmond, USA) - Alastair Reid (ARM, UK) - Tayssir Touili (LIAFA, CNRS, France) - Helmut Veith (Vienna University of Technology, Austria) - Thomas Wahl (Northeastern University, 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) SPONSORSHIP The SPIN 2012 workshop is generously sponsored by: - ARM (http://www.arm.com) - Codeplay (http://www.codeplay.com) - Microsoft Research (http://research.microsoft.com/en-us) - Monoidics (http://www.monoidics.com) From gerardo at ifi.uio.no Wed Feb 29 11:17:19 2012 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Wed, 29 Feb 2012 17:17:19 +0100 Subject: [TYPES/announce] Professor/Associate professor in Formal Methods at Chalmers Message-ID: <77C8AFA4-772A-4E48-A849-0BFF944A8B00@ifi.uio.no> CHALMERS University of Technology, Gothenburg, Sweden Department of Computer Science and Engineering Professor/Associate professor in Formal Methods The Department has 76 faculty members and enrols about 70 PhD students from more than 30 countries. The research spans the whole spectrum, from theoretical underpinnings to applied systems development. There is extensive national and international collaboration with academia and industry all around the world. The Division of Software Technology has around 15 faculty members and 25 postdocs and PhD students. We conduct successful research in functional programming, automatic theorem-proving, hardware design and verification, property-based testing of software, language-based security, and software verification. The scientific area of the new position is Formal Methods, interpreted broadly so as to include at least - formal specification, development and verification of software, - automatic theorem-proving and model-checking, - lightweight formal methods, including testing, - program semantics and analysis. Application deadline: March 22nd For more information see that full advertisement at http://www.chalmers.se/en/about-chalmers/vacancies/Pages/default.aspx (Select "Professor/Associate professor in formal methods", published 17/02/2012) --- Gerardo Schneider Dept. of Computer Science and Engineering Chalmers | University of Gothenburg SE 412 96 G?teborg, Sweden http://www.cse.chalmers.se/~gersch/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.stannett at dcs.shef.ac.uk Wed Feb 29 12:10:08 2012 From: m.stannett at dcs.shef.ac.uk (Mike Stannett) Date: Wed, 29 Feb 2012 17:10:08 +0000 Subject: [TYPES/announce] Call for papers: HAI2012 Message-ID: FINAL CALL FOR PAPERS HAI2012 (Hypercomputation and Artificial Intelligence 2012) http://vt.shef.ac.uk/hai2012/ A Special Symposium of the AISB/IACAP World Congress 2012 in honour of Alan Turing Birmingham, UK, 2-6 July 2012 http://www.aisb.org.uk/convention/aisb12/ organized by the AISB INTRODUCTION Recently, a number of researchers have argued that the mind has the capability to tackle incomputable problems, that is, problems that the Turing machine cannot solve. We aim to bring together researchers and scholars that work in uncomputability (hypercomputation), AI and ALife. Generally speaking, research areas where incomputability is encountered include, but are not restricted to: natural computation (including computational models inspired by living organisms and colonies); quantum computation (including brain-related models); vague computing (including fuzzy computing), the philosophy of mind (including mind as computation); and incomputable physical phenomena (including economic and social phenomena). Mathematical, computational, logical and philosophical aspects regarding the potential, behaviour and properties of these unconventional computing models are also of interest, as is the possibility of formally verifying systems associated with different methods and tools. Papers are invited on all aspects of the relationship between uncomputability and AI/ALife. Relevant topics include (but are not limited to): * hypercomputation and brain function * quantum bases for intelligence * computable and uncomputable aspects of "natural computing" paradigms * type systems for uncomputable semantics * the mind as computation * uncomputability and rational thought The symposium will end with an open panel discussing current and future research directions in natural computing, and their relationship to questions in AI. PROGRAMME COMMITTEE * Erzsebet Csuhaj-Varju, SZTAKI, Hungary * Alberto Leporati, University of Milan, Italy * Daniela Romano, Sheffield University, UK * Mario J Perez-Jimenez, University of Seville, Spain * Francisco Doria (Organising Committee, Brazil) * Marian Gheorghe (Chair, Sheffield) * Apostolos Syropoulos (Organising Committee, Greece) * Mike Stannett (Organising Committee, UK) KEYNOTE SPEAKER * Selmer Bringsjord (Rensselaer) PLENARY SPEAKERS * Colin Allen * Luciano Floridi * Aaron Sloman * Sir John Dermot Turing * Blay Whitby Please see the World Congress list of invited speakers for more details (http://events.cs.bham.ac.uk/turing12/invited.php) ORGANISING COMMITTEE * Francisco Doria (Brazil) * Marian Gheorghe (UK, Chair) * Apostolos Syropoulos (Greece) * Mike Stannett (UK) WHAT TO SUBMIT In the first instance, extended abstracts of 2-4 pages are requested. Successful authors will then be asked to submit finalised versions for inclusion in the proceedings. All submissions should be formatted for A4 paper, and submitted in PDF format via easychair, using the link at http://www.easychair.org/conferences/?conf=hai2012. Authors will be expected to present their papers at the Symposium, and should register via the World Congress web site (http://events.cs.bham.ac.uk/turing12/). IMPORTANT DATES Late submissions may be accepted until the middle of March. Please contact the organisers (M.Gheorghe at dcs.shef.ac.uk). Submission of papers Friday, 2 Mar 2012 (extended) Notification of authors Monday, 2 April 2012 Final versions due Friday, 4 May 2012 Symposium Monday 2nd July - Wednesday 4th July, 2012 SYMPOSIUM PROCEEDINGS A separate proceedings, produced before the Congress, will be available at the start of the event. Each delegate at the Congress will receive, on arrival, a memory stick containing the proceedings of all symposia. Some copies of the proceedings of each symposium will be printed for various purposes. ABOUT THE WORLD CONGRESS The Congress serves both as the year's AISB Convention and the year's IACAP conference. The Congress has been inspired by a desire to honour Alan Turing, and by the broad and deep significance of Turing's work to AI, to the philosophical ramifications of computing, and to philosophy and computing more generally. The Congress is one of the events forming the Alan Turing Year (http://www.mathcomp.leeds.ac.uk). The intent of the Congress is to stimulate a particularly rich interchange between AI and Philosophy on any areas of mutual interest, whether directly addressing Turing's own research output or not. The Congress will consist mainly of a number of collocated Symposia on specific research areas, interspersed with Congress-wide refreshment breaks, social events and invited Plenary Talks. All papers other than the invited Plenaries will be given within Symposia. Full details of the World Congress can be found online at the http://events.cs.bham.ac.uk/turing12/. -- Department of Computer Science, University of Sheffield Times Higher Education University of the Year From shilov at iis.nsk.su Wed Feb 29 22:00:35 2012 From: shilov at iis.nsk.su (=?koi8-r?B?7snLz8zByiD7yczP1w==?=) Date: Thu, 1 Mar 2012 10:00:35 +0700 Subject: [TYPES/announce] CFP: Program Semantics, Specification and Verification (Russia, 1-2 July, 2012) Message-ID: <000f01ccf757$7a0783b0$6e168b10$@nsk.su> Call for Papers The Third Workshop on Program Semantics, Specification and Verification: Theory and Applications July 1-2, 2012 in Nizhni Novgorod, Russia (PSSV 2012, http://agora.guru.ru/display.php?conf=csr2012&page=item009) affiliated with 7th International Computer Science Symposium in Russia (CSR-2012, http://agora.guru.ru/display.php?conf=csr2012), just 3 days ahead of META 2012, Third International Valentin Turchin Workshop on Metacomputation July 5-9, 2012, Pereslavl-Zalessky (120 km to the north-east from Moscow), Russia (http://meta2012.pereslavl.ru/index.html) Please refer http://pssv-conf.ru/ for PSSV archive. =========================================== Important dates (extended) Extended abstract submission: March 18, 2012 Notification: April 9, 2012 =========================================== Official language: English =========================================== Scope and Topics Research and work in progress papers are welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics; * formal models and semantics of programs and systems; * semantics of programming and specification languages; * formal description techniques; * logics for formal specification and verification; * deductive program verification; * automatic theorem proving; * model checking of programs and systems; * static analysis of programs; * formal approach to testing and validation; * program analysis and verification tools. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee (confirmed) * Sergey Baranov (St.Petersburg Institute for Informatics and Automation, Russia), * Nina Evtushenko (Tomsk State University, Russia), * Vladimir Itsykson (St. Petersburg State Polytech. University, Russia), * Andrei Klimov (Keldysh Institute of Applied Mathematics, Moscow, Russia), * Victor Kuliamin (Institute for System Programming, Moscow, Russia), * Irina Lomazova (Higher School of Economics, Moscow, Russia), * Nikolay Shilov (Institute of Informatics Systems, Novosibirsk, Russia), * Vladimir Zakharov (Moscow State University, Russia). =========================================== Submission and Publication Program Committee invites submissions in the form of extended abstracts (up to 8 pages, Lecture Notes in Computer Science style) in English. Additional details may be included in an appendix up to 4 pages for Program Committee. Submissions should be in PDF format. They should be sent (as attachments) by e-mail with subject line "PSSV-2012" to Alexei Promsky (promsky at iis.nsk.su) and their abstracts should be sent (as attachments) to PSSV Chairs. The acknowledgment will be send during 3 days. Program committee plans to have regular sessions and posters presentations. All accepted papers will be published in the preliminary proceedings before the workshop and the volume of the proceedings will be distributed at the workshop. Selected papers will be published after the workshop in one of Russian peer-review journals. At least one author of every accepted paper should present a talk in the workshop. =========================================== Registration and fees Registration fee 1600 rubles (for all participants) via homepage of The 7th International Computer Science Symposium in Russia. From cristina.pereira at informatics-europe.org Thu Mar 1 06:09:15 2012 From: cristina.pereira at informatics-europe.org (cristina.pereira at informatics-europe.org) Date: Thu, 01 Mar 2012 12:09:15 +0100 Subject: [TYPES/announce] Working group on Parallel Computing Education in Europe - Call for Participation Message-ID: <20120301120915.177435ry0s1flsyj@webmail.informatics-europe.org> Dear Colleagues, Looking back to the last European Computer Science Summit of Informatics Europe we would like to draw your attention to a new initiative actively discussed in Milan. We are talking about a new Working Group within Informatics Europe which was announced in Milan: ?Parallel Computing (Supercomputing) Education in Europe: State-of-Art?. Why did Informatics Europe take a decision to start this working group? Parallelism and concurrency have become an integral part of computer science for the last decade and, moreover, the degree of parallelism is constantly growing year by year. In 2020 there will be thousands cores in laptops and dozens/hundreds cores in mobile devices. How many of our students are ready for this forthcoming reality? We suppose, just a few? Why did we mention ?Supercomputing? in the title of the working group? Supercomputing is an essential part of computing, it is one of the most important parts of parallel computing, it is a point where parallelism is concentrated, it is an area where numerous breakthrough technologies appear first before being widely used. In summary, it is really time to think seriously about parallel computing and education. What did we talk in Milan about? To be able to move in this direction we need to form a relatively small working group (about 10 people) with the mission: - to show the need for urgent changes in higher education in the area of computational sciences, - to compose a survey of the current landscape of parallel computing and supercomputing education in Europe with respect to different universities and countries, - to prepare a set of recommendations how to bring ideas of parallel computing and supercomputing into higher educational systems of European countries. If you feel that this is your topic, if you are interested to join the working group to be able to bring your ideas and to share your knowledge with our community - you are highly welcome! Let us know about you decision by March, 9, 2012 sending a brief message to "wg-hpc-edu at parallel.ru". If you have any questions do not hesitate to contact us: voevodin at parallel.ru, gergel at unn.ru. Sincerely Yours, Prof. Vladimir Voevodin, MSU and Prof. Victor Gergel, NNSU From james.cheney at gmail.com Thu Mar 1 18:42:17 2012 From: james.cheney at gmail.com (James Cheney) Date: Fri, 2 Mar 2012 00:42:17 +0100 Subject: [TYPES/announce] CFP: First Workshop on Cross-Model Language Design and Implementation Message-ID: [The topic of the workshop, cross-model programming, includes many topics of interest to readers of TYPES, including typed languages or type systems for language-integrated query, Web programming, database programming, etc. --James] CALL FOR PAPERS XLDI 2012: First international workshop on Cross-model Language Design and Implementation Affiliated with ICFP 2012, Copenhagen, Denmark Sponsored by ACM SIGPLAN September 9, 2012 http://workshops.inf.ed.ac.uk/xldi2012/ There has recently been a burst of systems research advocating high-performance commodity "big data" or "massively parallel" computing models, often using simpler high-level languages or interfaces as front-ends. This work is often described as part of a shift towards a new "cloud computing" paradigm, but these buzzwords mask the major problems these techniques face: both big data and massively parallel systems currently employ systems-based methods and testing regimes that cannot offer guarantees of safety, security, correctness and evolvability. Language-based techniques, particularly formalization, verification, abstraction, and representation independence, offer the promise to reconcile the performance benefits of new execution models with the advantages of modern programming languages. Cross-model programming is not a new problem: for example, smooth integration of relational database programming models into general-purpose programming languages has been a long-standing challenge, with some approaches now in mainstream use (such as Microsoft's LINQ). But in the last few years there has been a dramatic increase in the number of domain-specific languages or libraries for interfacing with different computing models (data-parallelism, sensor networks, MapReduce-style fault-tolerant parallelism, distributed programming, Bayesian inference engines, declarative networking, or multi-tier Web programming), as well as techniques for language-integrated querying or processing data over other data models. Cross-model programs that execute in multiple (possibly heterogeneous) environments have much more challenging security, debugging, validation, and optimization problems. - Language designs for simplifying cross-model programming with database queries, data parallelism, networking, distributed programming, Web programming, or security primitives. - Formalizations or comparisons of existing languages, libraries or extensions for integrating multiple execution models - Monads, comprehensions, arrows, applicative functors, formlets, and other abstractions for combining or embedding models - Compilation and implementation techniques for cross-model programs - Type systems (polymorphism, dependent types, GADTs, modal types, refinement types) to support safe cross-model programming - Domain-specific embedded languages or libraries, syntax extensions, meta-programming facilities, or staged computation. - Language support for programming with XML, RDF, JSON, or other data interchange formats, or for programming Web services or other distributed programming formalisms. - Techniques for securing, debugging, performance profiling, optimization, or provenance tracking in cross-model programs. SUBMISSIONS: Submission should consist of short papers of at most 3 pages in ACM SIGPLAN conference format (sigplanconf.cls). Submissions will be accepted electronically. The submission site will be advertised around one month before the submission deadline. Simultaneous submission to another workshop, conference or journal is not allowed. An author of each accepted paper is expected to present the paper at the workshop. There will be no formal proceedings, but submissions will be made available from the workshop web page. Authors will retain the copyright. IMPORTANT DATES: Submission: May 15 Notification: July 1 Final papers due: August 1 Workshop: September 9 ICFP 2012: September 10-12 ORGANIZATION: Program committee: James Cheney, University of Edinburgh (co-chair) Kathleen Fisher, Tufts University Matthew Fluet, Rochester Institute of Technology Nate Foster, Cornell University Torsten Grust, University of Tuebingen (co-chair) Anastasios Kementsietsidis, IBM Research Shriram Krishnamurthi, Brown University Peter Thiemann, University of Freiburg Atsushi Ohori, Tohoku University Jan van den Bussche, University of Hasselt From amal at ccs.neu.edu Thu Mar 1 19:59:00 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Thu, 1 Mar 2012 19:59:00 -0500 Subject: [TYPES/announce] LOLA 2012 -- call for contributed talks Message-ID: <18BD2DCC-E53F-4CCF-BA73-E665FA79B4B6@ccs.neu.edu> ============================================================ *** CALL FOR CONTRIBUTED TALKS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in 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 short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From lanese at cs.unibo.it Fri Mar 2 09:40:02 2012 From: lanese at cs.unibo.it (Ivan Lanese) Date: Fri, 2 Mar 2012 15:40:02 +0100 (CET) Subject: [TYPES/announce] REVER Call for Ph.D. and post-doc Message-ID: Call for PostDoc and Ph.D. The ANR REVER project is seeking applicants for both a PhD student position and a 2-year post-doctoral research position. The work will be done either inside the Sardes team at INRIA Grenoble or inside the Focus team at University of Bologna (joint team with INRIA Sophia Antipolis M?diterran?e). The REVER project aims at facilitating the programming of recoverable systems, i.e. of systems that can tolerate faults by means of system recovery techniques. More precisely, the REVER project aims to study the possibility of defining semantically well-founded and composable abstractions for dependable computing on the basis of a reversible programming language substrate, where reversibility means the ability to undo any distributed program execution, possibly step by step, and to revert it to a state consistent with the past execution. See http://www.pps.jussieu.fr/~jkrivine/REVER/ANR_REVER/Welcome.html for more information on the REVER project. The successful applicants will be expected to contribute to this research effort, which will include both semantic foundations, programming abstractions, and practical implementations. Requirements for Ph.D. application: * Master Degree in Computer Science, Mathematics, or related field Requirements for PostDoc application: * Ph.D. in Computer Science (completed or near completion) * A research background on concurrency theory, programming language semantics, or distributed algorithms. For both the positions: * To apply send a curriculum, a publication record and a statement of interest via e-mail to Prof. Jean-Bernard Stefani and Dr. Ivan Lanese * Deadline: April 15, 2012 From Ewen.W.Denney at nasa.gov Fri Mar 2 17:34:46 2012 From: Ewen.W.Denney at nasa.gov (Ewen Denney) Date: Fri, 2 Mar 2012 14:34:46 -0800 Subject: [TYPES/announce] CFP: ASE '12 Tool Demonstrations Message-ID: <4F514B06.4050602@nasa.gov> Automated Software Engineering 2012: Call for Tool Demonstrations [Tools based on typed-based formalisms that have applicability to some area of software engineering are welcome.] Software Engineering is concerned with the analysis, design, implementation, testing, and maintenance of software systems. Automated software engineering focuses on how to automate these tasks in order to achieve improvements in quality and productivity. Tool support, therefore, is central to this. The 27th IEEE/ACM International Conference on Automated Software Engineering invites high-quality submissions for its tool demonstrations track. The ASE 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 with the goal of allowing live presentation of new research tools. Tools can range from research prototypes to in-house or pre-commercialized products. The tool demonstrations are intended to highlight underlying scientific contributions. Whereas a regular research paper is intended to give background information and point out the scientific contribution of a new software engineering approach, a tool demonstration paper provides a good opportunity to show how the scientific approach has been transferred into a working tool. Authors of regular research papers are thus encouraged to submit an accompanying tool demonstration paper. The Tool Demonstration 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 that will be scheduled into the conference program. There will also be a demonstration area open to attendees at scheduled times during the conference, during which demonstrators are expected to be available. Presentation at the conference is a requirement for publication. Submissions of proposals for formal tool demonstrations must: * adhere to the ASE 2012 proceedings format (ACM proceedings style) * have a maximum of 4 pages that describe the technology or approach, how it relates to other industrial or research efforts, including references, and describe what the expected benefits are; in addition, the submissions can include an appendix 2 pages of screenshots. * have an appendix (not included in the 4 page count) that provides a brief description of how the demonstration will be conducted (possibly illustrated with further screen shots) * 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. All examples and scenarios presented in the paper and appendix should be replicable directly. * be submitted via the EasyChair system by May 14, 2012: http://www.easychair.org/conferences/?conf=ase2012tools Important Dates Paper submission: May 14, 2012 Author notification: June 22, 2012 Camera-ready papers: July 9, 2012 Demonstration Chairs Ewen Denney (SGT / NASA Ames) Bernd Fischer (University of Southampton) Contact:ase2012tools at easychair.org Program Committee David Aspinall (University of Edinburgh, Scotland) Gilles Barthe (IMDEA, Spain) Anthony Cleve (FUNDP Namur, Belgium) Rohit Gheyi (Federal University of Campina Grande, Brazil) Christoph Gladisch (Karlsruhe Institute of Technology, Germany) Paul Gruenbacher (University of Linz, Austria) Robert Hall (AT&T Labs Research, USA) Reiko Heckel (University of Leicester, England) John Hosking (ANU, Australia) Andrew Ireland (Heriot-Watt University, Scotland) Anjali Joshi (MathWorks, USA) Jens Krinke (UCL, England) Julia Lawall (INRIA Paris-Rocquencourt, France) Michael Lowry (NASA Ames, USA) John Penix (Google, USA) Suresh Thummalapenta (IBM Research, India) Daniel Varro (Budapest University of Technology and Economics, Hungary) Michael Whalen (University of Minnesota, USA) Andrea Zisman (City University, England) -------------- next part -------------- An HTML attachment was scrubbed... URL: From rseba at disi.unitn.it Sat Mar 3 20:20:00 2012 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Sun, 4 Mar 2012 02:20:00 +0100 Subject: [TYPES/announce] PHD position on SMT-based formal verification in Trento Message-ID: <20120304012000.GA9986@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- 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 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 Research Program DISI, University of Trento, via Sommarive 14, I-38123 Povo, Trento, Italy http://disi.unitn.it/~rseba/. 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 SMT platform (http://mathsat.fbk.eu/), and provided as an API. Ph.D. courses will start in Autumn 2012, 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 rseba at disi.unitn.it Sat Mar 3 20:19:59 2012 From: rseba at disi.unitn.it (Roberto Sebastiani) Date: Sun, 4 Mar 2012 02:19:59 +0100 Subject: [TYPES/announce] PHD position on SAT/SMT applications to requirement engineering in Trento Message-ID: <20120304011959.GA9974@disi.unitn.it> --------------------------------------------------------------------------- [[[ We apologize if you receive multiple copies of this message ]]] --------------------------------------------------------------------------- -------------------------------------------------------------- PLEASE FORWARD THIS EMAIL TO WHOEVER YOU MAY THINK INTERESTED. -------------------------------------------------------------- ======================================================================== Call for one PhD position in ICT on "Application of SAT- and SMT-based optimization algorithms to requirement engineering" at Dept. of Computer Science & Engineering, University of Trento, Italy. Advisors: Prof. John Mylopoulos and Prof. Roberto Sebastiani http://disi.unitn.it/users/john.mylopoulos http://disi.unitn.it/~rseba ======================================================================== ELIGIBILITY CRITERIA: Candidates are required to have a master -- or equivalent -- degree in Computer Science, Computer Engineering or Mathematics, or to obtain it withing November 1st 2011. The ideal candidates should have a good background in logic and in software engineering. A background knowledge in Propositional Satisfiability (SAT), Satisfiablity Modulo Theory (SMT), Automated Reasoning, Knowledge Representation & Reasoning or Formal Methods would be very-positively evaluated. All the positions are covered by a scholarship, amounting roughly to 51,000 Euros over the three years. Substantial extra funding is available for participation in international conferences, schools, and workshops. DESCRIPTION: Over the past decade, logic-based goal-oriented requirements modeling languages have been used in Computer Science in order to represent software requirements, business objectives and design qualities. Such models extend traditional AI planning techniques for representing goals by allowing for partially defined and possibly inconsistent goals. In past work by the proposers, a framework for reasoning with such goal models have been proposed. The goal af the PhD project is to investigate and implement novel automated reasoning procedures --or to adapt existing ones-- for efficiently solving requirements problems expressed as goal models, for optimizing the solutions according to required criteria and, since requirements evolve with time, to minimize the effort of finding new solutions and maximizing the reuse of old solutions. In particular, a significant effort will be devoted to investigate and adapt SAT- and SMT-based algorithms for finding optimal solutions to parameterized goal models. HOW TO APPLY: Interested candidates should inquire for further information and/or apply by sending email to roberto.sebastiani 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 as subject: 'PHD ON LUCRETIUS PROJECT' INFORMAL ENQUIRIES ARE ENCOURAGED. You can get in touch with Prof. Roberto Sebastiani (roberto.sebastiani at disi.unitn.it, +39.0461.281514), in order to have a better understanding of possible research activities and the formal application details. FUNDING: The position is funded by the project ?Lucretius: Foundations for Software Evolution", thanks to an ERC (European Research Council) advanced grant awarded to Prof. John Mylopoulos (2011-2016). The positions is within the Software Engineering and Formal Methods group, Department of Information Engineering and Computer Science (http://www.disi.unitn.it) and the ICT Doctoral School of the Department (http://ict.unitn.it) of the University of Trento, Trento, Italy. From carette at mcmaster.ca Sun Mar 4 11:13:48 2012 From: carette at mcmaster.ca (Jacques Carette) Date: Sun, 04 Mar 2012 11:13:48 -0500 Subject: [TYPES/announce] WGP call for papers Message-ID: <4F5394BC.5060207@mcmaster.ca> ====================================================================== CALL FOR PAPERS WGP 2012 8th ACM SIGPLAN Workshop on Generic Programming Copenhagen, Denmark Sunday, September 9th, 2012 http://www.wgp-sigplan.org/2012 Co-located with the International Conference on Functional Programming (ICFP 2012) ====================================================================== 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 ----------------- Anya Helene Bagge, University of Bergen Jacques Carette, McMaster University Manuel Chakravarty, University of New South Wales Ronald Garcia (co-chair), University of British Columbia Jacques Garrigue, Nagoya University Andy Gill, University of Kansas Douglas Gregor, Apple Andrew Kennedy, Microsoft Research Cambridge Neelakantan Krishnaswami, Max Planck Institute for Software Systems Andres L?h (co-chair), Well-Typed LLP Zoltan Porkolab, E?tv?s Lor?nd University Chung-chieh Shan, University of Tsukuba 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 2012-06-01 Notification of acceptance: Wednesday 2012-06-27 Final submission due: Tuesday 2012-07-10 Workshop: Sunday 2012-09-09 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2012 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 * 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 ---------------------- Patrik Jansson (chair) Sibylle Schupp Bruno Oliveira Marcin Zalewski Jaako J?rvi Shin-Cheng Mu Jeremy Gibbons Magne Haveraaen Tim Sheard From E.Ritter at cs.bham.ac.uk Mon Mar 5 08:01:22 2012 From: E.Ritter at cs.bham.ac.uk (E.Ritter at cs.bham.ac.uk) Date: Mon, 05 Mar 2012 13:01:22 +0000 Subject: [TYPES/announce] 2nd Call for Participation: Midlands Graduate School 2012 Message-ID: 2nd Call for Participation Midlands Graduate School in Computer Science 23-27 April 2012 School of Computer Science, University of Birmingham, UK The Midlands Graduate School (MGS) in the Foundations of Computing Science provides an intensive course of lectures on the Mathematical Foundations of Computing. It has run annually since 1999, and is hosted by the Universites of Birmingham, Leicester, and Nottingham in rotation. The lectures are aimed at PhD students, typically in their first or second year of study. However, the school is open to anyone who is interested in learning more about the mathematical foundations of computing, and all such participants are warmly welcomed. We also very much welcome students from abroad. The following courses will be offered: Introductory Courses: * Category Theory Graham Hutton (University of Nottingham) * Advanced Functional Programming Henrik Nilsson (University of Nottingham) * Typed Lambda Calculus Paul Levy (University of Birmingham) Advanced Courses: * Constructive Mathematics and Type Theory Thierry Coquand (University of Gothenburg) * Categories and Functors Uday Reddy (University of Birmingham) * Computing with Infinite Objects Martin Escardo (University of Birmingham) * Logical Relations Andrzej Murawski (University of Leicester) * Provability, fixed points and clock ticks Tadeusz Litak (University of Leicester) * Kleene Algebras Georg Struth (University of Sheffield) LOCATION The school will be held in the School of Computer Science, University of Birmingham. Birmingham is centrally located in the UK, and is easily reachable by road, rail and air (Birmingham International Airport). REGISTRATION The deadline for early registration is 15 March 2012. The registration fee is ??230. After 15 March the registration fee will increase to ??270. The deadline for registration is 13 April. ACCOMMODATION We have reserved accommodation in the ETAP-hotel for five nights for ??170. Please indicate during registration whether you would like us to reserve accommodation for you. Accommodation can only be reserved until 15 March. FURTHER DETAILS Google search - MGS 2012 Web page - http://events.cs.bham.ac.uk/mgs2012 From donnam at microsoft.com Mon Mar 5 12:03:50 2012 From: donnam at microsoft.com (Donna Malayeri) Date: Mon, 5 Mar 2012 17:03:50 +0000 Subject: [TYPES/announce] Lang.NEXT Call for Participation Message-ID: Lang.NEXT Call for Participation We invite you to attend Lang.NEXT, a cross-industry conference on programming language design and implementation. The focus is on mutual inspiration and novel ideas in both industry and academia. The event is held at the Microsoft Campus on Apr 2-4, and includes talks, panels, and discussions from 9-5 each day. Attendance is free, and includes lunch. We have an impressive list of speakers signed up: Andrew Black, Portland State University Andy Gordon, Microsoft Andy Moran, Galois Brian Goetz, Oracle Donna Malayeri, Microsoft Dustin Campbell, Microsoft Gilad Bracha, Google Herb Sutter, Microsoft James Noble, Victoria University of Wellington Jeroen Frijters, Sumatra Software John Cook, University of Texas Graduate School of Biomedical Sciences Kim Bruce, Pomona College Kunle Olukotun, Stanford Luke Hoban, Microsoft Mads Torgersen, Microsoft Martin Odersky, EPFL, Typesafe Martyn Lovell, Microsoft Peter Alvaro, University of California at Berkeley Robert Griesemer, Google Walter Bright William Cook, University of Texas at Austin Please share the invitation with friends and colleagues! We are still setting up an official site on Channel 9, but registration is open now at http://www.regonline.com/langnext2012. We are closed for new speakers. However, there will be a number of slots for lightning talks, which will be allotted on a first come, first served basis at the event itself. If you have heard of or attended Lang.NET on the Microsoft Campus in the past, that is no coincidence: this is the same event revived! We changed the name since the event isn't particularly focused on .NET. Indeed, we traditionally have a large majority of speakers and attendees from outside Microsoft Hope to see you in April! From murano at na.infn.it Mon Mar 5 13:34:16 2012 From: murano at na.infn.it (Nello Murano) Date: Mon, 5 Mar 2012 19:34:16 +0100 (CET) Subject: [TYPES/announce] Preliminary call for papers GandALF 2012 Message-ID: <45934.172.16.4.16.1330972456.squirrel@imap-lp.na.infn.it> [We apologize if you have received multiple copies of this message] ***************************************************************** ------ GandALF 2012 ----- ***************************************************************** Third International Symposium on Games, Automata, Logics, and Formal Verification Napoli, Italy, September 6th-8th, 2012 http://www.gandalf.unina.it ************************************************ | PRELIMINARY CALL FOR PAPERS | ************************************************ OBJECTIVES The aim of the symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. LIST OF TOPICS The topics covered by the conference include, but are not limited to, the following: Automata Theory Automated Deduction Computational aspects of Game Theory Concurrency and Distributed computation Decision Procedures Deductive, Compositional, and Abstraction Techniques for Verification Finite Model Theory First-order and Higher-order Logics Formal Languages Formal Methods for Complex Systems (e.g., Interactive Systems, Systems Biology) Games and Automata for Verification Game Semantics Hybrid, Embedded, and Mobile Systems Verification Logical aspects of Computational Complexity Logics of Programs Modal and Temporal Logics Model Checking Models of Reactive and Real-Time Systems Program Analysis and Software Verification Run-time Verification and Testing Specification and Verification of Finite and Infinite-state Systems Synthesis PAPER SUBMISSION Submitted papers should not exceed fourteen (14) pages using EPTCS format, be unpublished and contain original research. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF or PS format and will be handled via EasyChair. IMPORTANT DATES Abstract submission May 9, 2012 Paper submission May 15, 2012 Acceptance notification June 27, 2012 Final version July 15, 2012 Conference September 6-8, 2012 PROCEEDINGS The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. A special issue of a major international journal to publish an extended and revised version of the best symposium papers is also under consideration. Revised versions of the selected papers from the previous editions lead to two special issues of the International Journal of Foundation of Computer Science and of Theoretical Computer Science, respectively. PROGRAM CHAIRS Marco Faella (Universita? di Napoli "Federico II", Italy) Aniello Murano (Universita? di Napoli "Federico II", Italy) PROGRAM COMMITTEE Veronique Bruyere (Universite' de Mons-Hainaut, Belgium) Agostino Cortesi (Universita' Ca' Foscari di Venezia, Italy) Luca de Alfaro, (University of California at Santa Cruz, USA) Kousha Etessami, (University of Edinburgh, UK) Erich Gr?del, (RWTH Aachen University, Germany) Arie Gurfinkel, (Carnegie Mellon University, USA) Orna Kupferman, (Hebrew Unversity, Israel) Martin Lange, (University of Kassel, Germany) Carsten Lutz, (University of Bremen, Germany) Oded Maler (CNRS-VERIMAG, University of Grenoble, France) Nicolas Markey, (LSV, CNRS & ENS Cachan, France) Anca Muscholl, (University of Bordeaux, France) Margherita Napoli, (Universita? di Salerno , Italy) Damian Niwinski (University of Warsaw, Poland) Carla Piazza, (University of Udine, Italy) Nir Piterman, (University of Leicester,UK) Gabriele Puppis, (University of Oxford, UK) Ramaswamy Ramanujam, (IMSC Chennai, India) Sven Schewe, (University of Liverpool, UK) Natasha Sharygina, (University of Lugano, Switzerland) Marielle Stoelinga, (University of Twente, Netherlands) Enrico Tronci, (Universita? di Roma "La Sapienza", Italy) Helmut Veith, (TU Vienna, Austria) Tiziano Villa, (Universita? di Verona, Italy) Mahesh Viswanathan, (University of Illinois, USA) STEERING COMMITTEE Mikolaj Bojanczyk (University of Warsaw, POLAND) Javier Esparza (University of Munich, GERMANY) Angelo Montanari (University of Udine, ITALY) Margherita Napoli (University of Salerno, ITALY) Mimmo Parente (University of Salerno, ITALY) Wolfgang Thomas (RWTH Aachen University, GERMANY) Wieslaw Zielonka (University of Paris7, FRANCE) ADVISORY BOARD Stefano Crespi Reghizzi (University of Milan, ITALY) Jozef Gruska (Masaryk University, CZECH REPUBLIK) Oscar H. Ibarra (University of California, USA) Andrea Maggiolo-Schettini (University of Pisa, ITALY) INFO Please visit the conference website (http://www.gandalf.unina.it) for more information. From pmt6sbc at maths.leeds.ac.uk Mon Mar 5 14:05:51 2012 From: pmt6sbc at maths.leeds.ac.uk (S Barry Cooper) Date: Mon, 5 Mar 2012 19:05:51 +0000 (GMT) Subject: [TYPES/announce] Turing Centenary Workshop on "The Incomputable", June 12-15, 2012 Message-ID: ************************************************************************** Registration - final deadline March 16: June 12-15, 2012 - Turing Centenary Workshop on "THE INCOMPUTABLE" at the Kavli Royal Society International Centre, Chicheley Hall, UK www.mathcomp.leeds.ac.uk/turing2012/inc/ THE INCOMPUTABLE is a major workshop of the 6-month Isaac Newton Institute programme - "Semantics and Syntax: A Legacy of Alan Turing" (SAS). THE INCOMPUTABLE is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy and the wider scientific world. It is held in association with the Turing Centenary Conference (CiE 2012) in Cambridge the following week, which will run up to the June 23rd centenary of Turing's birth, and will culminate with a birthday celebration at Turing's old college, King's College, Cambridge. The programme includes invited talks from over 50 leaders in their fields, with a unique multidisciplinary coverage of areas including mathematics, computer science, physics, biology and philosophy. For details, see the webpage: http://www.mathcomp.leeds.ac.uk/turing2012/inc/ Chicheley Hall is a truly extraordinary venue for the meeting, beautifully maintained by the Royal Society, and offering superb facilities for the talks, accommodation, and informal discussions. Set in 80 acres of country landscape, it offers comfort, free wifi throughout, a bar open to 12 or later each night, and many other comforts and opportunities for exciting and novel interactions. THE INCOMPUTABLE, generously supported by the John Templeton Foundation, promises to be a historic event, bringing the mathematical theory of incomputability centre-stage once again. Attendance is limited to 115 participants, and there are already nearly this number registered. If you would like to register, or be placed on the waiting list for a place at the workshop, please go to the registration page at: http://www.mathcomp.leeds.ac.uk/turing2012/inc/give-page.php?26 and fill in the form there. Suggested arrival and departure dates are June 11, and June 16, respectively. Note: Participants of the Isaac Newton Institute for Mathematical Sciences programme "Semantics and Syntax: A Legacy of Alan Turing", including Junior Members, may request that their local expenses for the workshop be supported by the INI. Organisers: S Barry Cooper and Mariya Soskova ************************************************************************** ALAN TURING YEAR http://www.turingcentenary.eu From H.W.Loidl at hw.ac.uk Mon Mar 5 18:17:32 2012 From: H.W.Loidl at hw.ac.uk (Hans-Wolfgang Loidl) Date: Mon, 5 Mar 2012 23:17:32 +0000 Subject: [TYPES/announce] CFP: TFP12, Trends in Functional Programming 2012, St Andrews, U.K., June 12-14, 2012 Message-ID: <20120305231732.552d1805@hw.ac.uk> [In short: submissions of papers & ext'd abstracts by March 26th; TFP12 symposium June 12-14th; Apologies for multiple copies of this call -- HWL ] CALL FOR PAPERS 13th International Symposium Trends in Functional Programming 2012 St Andrews, U.K. June 12-14, 2012 http://www.tifp.org/TFP12.html 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 2012 will be the main event of a week of functional programming extravaganza at the University of St Andrews. The week will start with the International Workshop on Trends in Functional Programming in Education, followed by TFP, followed by a workshop on 75 years of Lambda Calculus, an Erlang day, and a technical workshop on Patterns for MultiCores (ParaPhrase/Release projects). 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, and in Madrid (Spain) in 2011. 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 . 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 2012 program chair, Hans-Wolfgang Loidl, at tfp12 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 peer review 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 2012 website. Paper submission is done through TFP12's easychair page: https://www.easychair.org/conferences/?conf=tfp12 Important dates (2012): Full papers/extended abstracts submission: March 26th Notification of acceptance for presentation: April 4th Early registration deadline: April 11th Camera ready for draft proceeding: May 28th 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 two instances of TFP have been published as LNCS 6546 (TFP10) and LNCS 7193 (TFP11). 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 (2012): TFP 2012 Symposium: June 12-14th Student papers feedback: June 22nd Submission for formal review: July 9th Notification of acceptance for LNCS: September 17th Camera ready paper: October 15th REGISTRATION Registration for TFP12, 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 of April 11th, 2012. http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&compid=1 TFP 2012 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Symposium Organization Chair: Kevin Hammond, University of St. Andrews, UK Local Arrangements: Edwin Brady, Vladimir Janjic, University of St. Andrews, UK TFP 2012 PROGRAMME COMMITTEE Peter Achten, Radboud University Nijmegen, The Netherlands Jost Berthold, University of Copenhagen, Denmark Edwin Brady, University of St. Andrews, U.K. Matthias Blume, Google, U.S.A. Clemens Grelck, University of Amsterdam, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Graham Hutton, University of Nottingham, U.K Patricia Johann, University of Strathclyde, U.K. Hans-Wolfgang Loidl (PC Chair), Heriot-Watt University, U.K. Jay McCarthy, Brigham Young University, Utah, U.S.A. Rex Page, University of Oklahoma, U.S.A. Ricardo Pe?a, Complutense University of Madrid, Spain Kostis Sagonas, Uppsala University, Sweden Manuel Serrano, INRIA Sophia Antipolis, France Mary Sheeran, Chalmers, Sweden Nikhil Swamy, Microsoft Research, Redmond, U.S.A. Phil Trinder, Heriot-Watt University, U.K. Wim A Vanderbauwhede, University of Glasgow, U.K. Marko van Eekelen, Radboud University Nijmegen, The Netherlands David Van Horn, Northeastern University, U.S.A. Malcolm Wallace, Standard Chartered, U.K. Vikt?ria Zs?k, E?tv?s Lor?nd University, Hungary SPONSORS TFP 2012 is sponsored by Erlang Solutions Ltd. and the Scottish Informatics and Computer Science Alliance (SICSA). INVITED SPEAKER In this instance of TFP, an invited talk will be given by David A Turner, Professor emeritus at Middlesex University and at the University of Kent, inventor of Miranda, KRC and SASL. Prof Turner will be talking on the history of functional programming languages. LINKS Main TFP12 page: http://www.tifp.org/TFP12.html TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp12 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&compid=1 Facebook page: http://www.facebook.com/pages/TFP-Symposium-Series-on-Trends-in-Functional-Programming/118379188198725 -- Hans-Wolfgang Loidl School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Scotland, U.K. From hirokawa at jaist.ac.jp Tue Mar 6 20:55:48 2012 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Wed, 7 Mar 2012 10:55:48 +0900 Subject: [TYPES/announce] IWC 2012: Second Call for Papers Message-ID: <20120307105548.286983df.hirokawa@jaist.ac.jp> ====================================================================== Second Call for Papers (* extended deadline *) IWC 2012 1st International Workshop on Confluence 29 May 2012, Nagoya, Japan, collocated with RTA 2012 http://cl-informatik.uibk.ac.at/events/iwc-2012/ ====================================================================== 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 23rd International Conference on Rewriting Techniques and Applications (RTA 2012). During the workshop the 1st Confluence Competition (CoCo 2012) http://coco.nue.riec.tohoku.ac.jp/2012/ takes place. IMPORTANT DATES: * submission March 26, 2012 (extended) * notification April 9, 2012 * final version April 30, 2012 * workshop May 29, 2012 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence ORGANISING COMMITTEE: * Nao Hirokawa JAIST * Aart Middeldorp University of Innsbruck * Naoki Nishida Nagoya University PROGRAM COMMITTEE: * Takahito Aoto Tohoku University * Nao Hirokawa JAIST (co-chair) * Aart Middeldorp University of Innsbruck (co-chair) * Femke van Raamsdonk VU University Amsterdam * Aaron Stump The University of Iowa * Rakesh M. Verma University of Houston 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. In addition, we plan to distribute a printed version of the proceedings at 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=iwc2012 From Neil.Ghani at cis.strath.ac.uk Wed Mar 7 04:32:05 2012 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Wed, 7 Mar 2012 09:32:05 +0000 Subject: [TYPES/announce] PhD position in the MSP group, Univ. Strathclyde Message-ID: <8650D7BC-1804-46E8-9BF4-87100BD64D5B@cis.strath.ac.uk> ****************************************************************** *** PhD Position *** *** Higher Dimensional Categories and Types *** *** Mathematically Structured Programming Group *** University of Strathclyde *** ****************************************************************** Applications are invited for PhD study under the supervision of Prof Neil Ghani on any topic relating to higher dimensional category theory and/or higher dimensional type theory. The position is fully funded for EU students (apologies to non EU-citizens for this ridiculous piece of non-meritocracy) and will last for 3 years.The applicant's motivation must centre on a desire for beautiful mathematics of lasting value. The applicant should also have an innate sense of the wonder of learning allied to the capacity to work hard and achieve their goals. The Mathematically Structured Programming Group's vision is to use mathematics to understand the nature of computation, and to then turn that understanding into the next generation of programming languages. This reflects the symbiotic relationship between mathematics, programming, and the design of programming languages --- any attempt to sever this connection will diminish each component. In order to achieve these research goals we mainly use ideas from category theory, type theory and functional programming. Besides Professor Neil Ghani, the group consists of a number of internationally leading researchers including Dr Patricia Johann, Dr Conor McBride, Dr Peter Hancock, Dr Robert Atkey as well as a number of PhD students. Anyone interested should in the first instance contact Professor Neil Ghani whose email address is "ng at cis.strath.ac.uk" and outline their academic background. Applications will be considered on a first come, first served basis. -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Pichardie at irisa.fr Wed Mar 7 13:50:15 2012 From: David.Pichardie at irisa.fr (David Pichardie) Date: Wed, 7 Mar 2012 13:50:15 -0500 Subject: [TYPES/announce] PxTP 2012 (IJCAR workshop) - call for papers Message-ID: The Second International Workshop on Proof Exchange for Theorem Proving (PxTP) http://pxtp2012.inria.fr associated with The International Joint Conference on Automated Reasoning (IJCAR), 2012 ---------------------------------------------------------------------- The goal of this workshop is to bring together researchers working on proof production from automated theorem provers with potential consumers of proofs. Machine-checkable proofs have been proposed for applications like proof-carrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning systems. For example, interactive theorem provers can import results from otherwise untrusted high-performance solvers, by means of proofs the solvers produce. In such situations, one automated reasoning tool can make use of the results of another, without having to trust that the second tool is sound. It is only necessary to be able to reconstruct a proof that the first tool will accept, in order to import the result without increasing the size of the trusted computing base. This simple idea of proof exchange for theorem proving becomes quite complicated under the real-world constraints of highly complex and heterogeneous proof producers and proof consumers. For example, even the issue of a standard proof format for a single class of solvers, like SMT solvers, is quite difficult to address, as different solvers use different inference systems. It may be quite challenging, from an engineering and possibly also theoretical point of view, to fit these into a single standard format. Emerging work from several groups proposes standard meta-languages or parametrized formats to achieve flexibility while retaining a universal proof language. ---------------------------------------------------------------------- Topics of interest for this workshop include all aspects of proof exchange among automated reasoning tools. More specifically, some suggested topics are: -- proposed proof formats for different classes of logic solvers (SAT, SMT, QBF, First-Order ATP, Higher-Order ATP, Rewriting, etc.). -- meta-languages and logical frameworks for proofs, particularly proof systems designed for solvers. -- proof checking tools and algorithms. -- proof translation and methods for importing proofs, including proof replaying or reconstruction. -- tools and case studies related to analyzing proofs produced by solvers, and proof metrics. -- applications relying on importing proofs from automated theorem provers, such as certified static analysis, proof-carrying code, or certified compilation. -- data structures and algorithms for improved proof production in solvers (for example, more time- or memory-efficient ways of representing proofs). ---------------------------------------------------------------------- Submissions Submitted papers must fall into one of the following two categories: * Short papers: up to 6 pages, work in progress, experience reports, tool presentations or position statements * Regular papers: 12-15 pages, research papers Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. Submissions should be in standard-conforming Postscript or PDF. Final versions should be prepared in LaTeX using the easychair.cls class file. To submit a paper, go to the EasyChair PxTP page http://www.easychair.org/conferences/?conf=pxtp2012 and follow the instructions there. PxTP will have no formal proceedings, but we intend to provide electronic proceedings on the CEUR-WS website. ---------------------------------------------------------------------- Important dates Submission of papers: April 2nd, 2012 Notification: May 7th, 2012 Camera-ready versions due: May 21th, 2012 Workshop: June 30th, 2012 ---------------------------------------------------------------------- Program Committee Jasmin Blanchette, Technische Universit?t M?nchen, Germany Pascal Fontaine, University of Nancy, France John Harrison, Intel Corporation, USA Leonardo de Moura, Microsoft Research, USA David Pichardie (co-chair), INRIA Rennes, France Aaron Stump, The University of Iowa, USA Geoff Sutcliffe, University of Miami, USA Laurent Th?ry, INRIA Sophia-Antipolis, France Allen Van Gelder, University of California at Santa Cruz, USA Tjark Weber (co-chair), Uppsala University, Sweden ---------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From giannini at di.unipmn.it Wed Mar 7 16:40:03 2012 From: giannini at di.unipmn.it (Paola Giannini) Date: Wed, 07 Mar 2012 22:40:03 +0100 Subject: [TYPES/announce] CS2Bio 12 Call for Papers (June 2012- Stockholm) Message-ID: <4F57D5B3.1070606@di.unipmn.it> ================================================================ Second Call for papers ================================================================= CS2Bio'12 3rd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'12 16th of June 2012 Stockholm, Sweden http://cs2bio12.di.unipmn.it/ ================================================================= *** IMPORTANT DATES *** - Submission deadline: April 2, 2012 - Notification to authors: May 16, 2012 - Workshop: June 16, 2012 ================================================================= The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science, Biology and life sciences. In particular, we solicit contribution of original results that address both theoretical aspects of modeling and applied work on the comprehension of biological behavior. We encourage presentations of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present the modeling a specific biological phenomenon using formal techniques, or a modeling, 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. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Formal methods for the representation of biological systems and their dynamics (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparison between different formal models for the modeling of biological processes; -- Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi. -- Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: -- Prediction of biological behavior from incomplete information; -- Model checking, abstract interpretation, type systems, etc. Tools and Simulation -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological and medical systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of a Computer Science journal is planned. *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio12). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. ================================================================= *** INVITED SPEAKERS *** - Jane Hillston (Lab for Foundation of Computer Science - Edinburgh, UK) - Gianluigi Zavattaro (Department of Computer Science - University of Bologna, IT) *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Francesca Cordero - Erik de Vink (Co-chair) - Francois Fages - Jerome Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - David Safranek - Angelo Troina - Adelinde Uhrmacher - Verena Wolf *** STEERING COMMITTEE *** - Erik de Vink - Paola Giannini - Jean Krivine - Angelo Troina -- Paola Giannini Dipartimento di Informatica Universita' del Piemonte Orientale via Teresa Michel, 11 15100 Alessandria, Italy phone: (+39) 0131 360171 fax : (+39) 0131 360390 email: giannini at di.unipmn.it http://www.di.unito.it/~giannini From collberg at gmail.com Wed Mar 7 17:11:01 2012 From: collberg at gmail.com (Christian Collberg) Date: Wed, 7 Mar 2012 15:11:01 -0700 Subject: [TYPES/announce] Postdoc position in Software Security/Programming Languages/Compilers at the University of Arizona Message-ID: A Postdoc position in the area of Software Security is available at the University of Arizona. A successful candidate should have a technical background in one or more of computer security, cryptography, and programming languages/compilers. **Call for applications** Expected funding duration: 24 Months Starting date: July 1 **Project description** This project aims to investigate innovative approaches to protecting the integrity and confidentiality of a piece of software against an attacker (the man-at-the-end, MATE) who has physical access to the software and so is able to inspect, modify, and execute it. One important goal of the project is to derive a fundamental basis of MATE defense principles and metrics. **Key tasks to be performed** Develop MATE attack models that formally characterize the process of device compromise. Design novel MATE defense algorithms. Provide attack tools to allow easy testing of these defenses. Devise community standards for defense evaluation. Investigate different approaches to constructing and validating metrics for obfuscation, tamper-proofing, and software watermarking. **Applicant profile** The applicant must have a PhD in Computer Science or other strongly related field. A successful candidate should have a technical background in one or more of computer security, cryptography, and programming languages/compilers. **Location** The work will be carried out at the University of Arizona, under the supervision of a team of researchers from the Computer Science and Electrical and Computer Engineering departments. **Application** For further information, send your CV to Christian Collberg, collberg at gmail.com. To formally apply for this position, visit https://www.uacareertrack.com, position number 48560. -- s?p?? ?u?? ?s???u? From cbraga at ic.uff.br Thu Mar 8 10:07:45 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Thu, 8 Mar 2012 12:07:45 -0300 Subject: [TYPES/announce] CFP: 15th BRAZILIAN SYMPOSIUM ON FORMAL METHODS References: <201203081226.q28CQKnT021262@DSX4000-4.tagadab.com> Message-ID: <99E4521B-0992-4A8E-95C9-4EDD8A08CCA5@ic.uff.br> ===SBMF 2012=== 15th BRAZILIAN SYMPOSIUM ON FORMAL METHODS http://cbsoft.dimap.ufrn.br/ Natal, Brazil September 23-28, 2012 Abstract Submission: May 08, 2012 (American Samoa Time Zone) Paper Submission: May 14, 2012 (American Samoa Time Zone) CALL FOR PAPERS =============== SBMF 2012 is the fifteenth of a series of events devoted to the development, dissemination and use of formal methods for the construction of high-quality computational systems. It is now a well-established event, with an international reputation. Keynote speakers will be * John Rushby, SRI International, Menlo Park CA, USA * Wolfram Schulte, Microsoft Research, Redmond WA, USA The symposium will be part of a larger event, CBSoft, the Brazilian Conference on Software: Theory and Practice (http://cbsoft.dimap.ufrn.br/) including as well as SBMF three other symposia: *XXVI Brazilian Symposium on Software Engineering (SBES); *XVI Brazilian Symposium on Programming Languages (SBLP); *VI Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS). CBSoft will be held in Natal, an important city in research and development in both academic and industrial areas. It is also known as "City of the Dunes", with a Park of Dunes measuring 8 kilometers of extension and 1,8 kilometer of width. Its sea is of calm, blue and crystal clear waters. The south coast comprises 15 beaches with dunes, cliffs, coconut trees, hills, reefs and some natural swimming pools. The aim of SBMF is to provide a venue for the presentation and discussion of high-quality papers, from researchers with a broad range of interests in formal methods, on recent developments in this field. The topics include, but are not limited to, the following: -Well-founded specification and design languages; -Formal aspects of popular languages and methodologies; -Logics and semantics of programming- and specification languages; -Reusable domain theories; -Type systems and category theory in computer science; -Computational complexity of methods and models; -Computational models; -Rewriting systems; -Formal methods integration; -Formal methods for software/hardware development; -Formal methods applied to model-driven engineering; -Code generation; -Formal design methods; -Specification and modeling; -Abstraction, modularization and refinement techniques; -Program and test synthesis; -Techniques for correctness by construction; -Formal methods and models for objects, aspects and component systems; -Formal methods and models for real-time, hybrid and critical systems; -Formal methods and models for service-oriented systems; -Models of concurrency, security and mobility; -Model checking; -Theorem proving; -Static analysis; -Formal techniques for software testing; -Software certification; -Formal techniques for software inspection. -Teaching of, for and with formal methods; -Experience reports on the use of formal methods; -Industrial case studies; -Tools supporting the formal development of computational systems; -Development methodologies with formal foundations; -Software evolution based on formal methods. Papers with a strong emphasis on Formal Methods, whether practical or theoretical, are invited for submission. They should present unpublished and original work that has a clear contribution to the state of the art on the theory and practice of formal methods. They should not be simultaneously submitted elsewhere. Papers will be judged on the basis of originality, relevance, technical soundness and presentation quality. They should be written in English. There are two types of submissions: * Full papers: (max. 16 pages in LNCS format) should contain theory- or application-oriented results which must be original, significant, and sound; they will undergo a full reviewing process. Papers from industry should emphasize practical application of formal methods and/or report open challenges. The proceedings will be published in LNCS/Springer. * Short papers: (max. 6 pages in LNCS format) should describe recent research activities, practical experience, and preliminary results that are worth discussing. If accepted, they will be published as a Technical Report of UFCG with an ISBN number available online. Every accepted paper MUST have at least one author registered to the symposium by the time the camera- ready copy is submitted; the author is also expected to attend the symposium and present the paper. Papers originally submitted in English MUST be presented in English. Papers can be submitted via the following link: http://www.easychair.org/conferences/?conf=sbmf2012 =============== IMPORTANT DATES 08/05/2012: Abstract Submission Deadline (American Samoa Time Zone) 14/05/2012: Full Paper Submission Deadline (American Samoa Time Zone) 02/07/2012: Full Paper Acceptance Notification 10/07/2012: Full Paper Camera-ready Version 09/07/2012: Short Paper Submission Deadline 30/07/2012: Short Paper Acceptance Notification 13/08/2012: Short Paper Camera-ready Version --- Program Committee Chairs David Naumann Stevens Institute of Technology, USA Rohit Gheyi UFCG, Brazil --- Steering Committee Jim Davies, University of Oxford, UK Rohit Gheyi, UFCG, Brazil (Co-chair) Juliano Iyoda, UFPE, Brazil Carroll Morgan, UNSW, Australia David Naumann, Stevens Institute of Technology, USA (Co-chair) Marcel Oliveira, UFRN, Brazil Leila Silva UFS, Brazil Adenilso Simao, ICMC-USP, Brazil Jim Woodcock, University of York, UK --- Program Committee Aline Andrade (UFBA, Brazil) Luis Barbosa (Universidade do Minho, Portugal) Roberto Bigonha (UFMG, Brazil) Christiano Braga (UFF, Brazil) Michael Butler (University of Southampton, UK) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Marcio Cornelio (UFPE, Brazil) Andrea Corradini (Universita' di Pisa, Italy) Jim Davies (University of Oxford, UK) David Deharbe (UFRN, Brazil) Ewen Denney (RIACS/NASA, USA) Clare Dixon (University of Liverpool, UK) Jorge Figueiredo (UFCG, Brazil) Rohit Gheyi (UFCG, Brazil) John Harrison (Intel Corporation, USA) Rolf Hennicker (Ludwig-Maximilians-Universitaet Muenchen, Germany) Juliano Iyoda (UFPE, Brazil) Zhiming Liu (UNU-IIST, China) Gerald Luettgen (University of Bamberg, Germany) Patricia Machado (UFCG, Brazil) Tiago Massoni (UFCG, Brazil) Ana Melo (USP, Brazil) Stephan Merz (INRIA Lorraine, France) Alvaro Moreira (UFRGS, Brazil) Anamaria Moreira (UFRN, Brazil) Carroll Morgan (University of New South Wales, Australia) Arnaldo Moura (UNICAMP, Brazil) Alexandre Mota (UFPE, Brazil) David Naumann (Stevens Institute of Technology, USA) Daltro Nunes (UFRGS, Brazil) Jose Oliveira (Universidade do Minho, Portugal) Marcel Oliveira (UFRN, Brazil) Alberto Pardo (Universidad de la Republica, Uruguay) Alexandre Petrenko (CRIM, Canada) Leila Ribeiro (UFRGS, Brazil) Augusto Sampaio (UFPE, Brazil) Leila Silva (UFS, Brazil) Adenilso Simao (ICMC-USP, Brazil) Heike Wehrheim (University of Paderborn, Germany) From paolini at di.unito.it Fri Mar 9 03:00:54 2012 From: paolini at di.unito.it (Luca Paolini) Date: Fri, 09 Mar 2012 09:00:54 +0100 Subject: [TYPES/announce] Intersection Types and Related Systems (ITRS 2012) -- 2nd CFP Message-ID: <4F59B8B6.70300@di.unito.it> ********************************************************************** Second CALL FOR PAPER Sixth Workshop on Intersection Types and Related Systems (ITRS 2012) June 29th, Dubrovnik (Croatia). http://itrs2012.di.unito.it/ Workshop held in conjunction with LICS 2012 ********************************************************************** Abstract submission: April 13th, 2012 Author notification: April 30th Final version due: June 10th -------------------------------------- ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. ( More details at http://itrs2012.di.unito.it/ ). SUBMISSION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (max. 10 pages) in PDF format. (2) After the workshop, authors of accepted papers will be invited to submit full versions, for inclusion in EPTCS. TOPICS Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications for programming languages. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intesional types to characterize computational properties. PROGRAM COMMITTEE St?phane Lengrand (?cole Polytechnique) Koji Nakazawa (Kyoto Univ.) Luke Ong (Oxford Univ.) Luca Paolini (Univ. Torino), chair Frank Pfenning (Carniege Mellon Univ.) Betti Venneri (Univ. di Firenze) INFORMATION For further information, please contact Luca Paolini Email: paolini AT di DOT unito DOT it From esslli2012stus at loriweb.org Fri Mar 9 04:53:20 2012 From: esslli2012stus at loriweb.org (ESSLLI 2012 Student Session) Date: Fri, 09 Mar 2012 10:53:20 +0100 Subject: [TYPES/announce] Final CfP: ESSLLI 2012 Student Session In-Reply-To: <4EE9E448.8080204@loriweb.org> References: <4EE9E448.8080204@loriweb.org> Message-ID: <4F59D310.4020707@loriweb.org> ** APOLOGIES FOR MULTIPLE POSTINGS** *** PLEASE DISTRIBUTE TO STUDENTS *** Final Call for Papers *ESSLLI 2012 STUDENT SESSION* Held during The 24th European Summer School in Logic, Language and Information Opole, Poland, August 6-17, 2012 Deadline for submissions: March 30, 2012 http://loriweb.org/ESSLLI2012StuS/ *ABOUT:* The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience. ESSLLI 2012 will feature a wide range of foundational and advanced courses and workshops in all areas of Logic, Language, and Computation. Consult the main ESSLLI website (link below) for further information. *SPRINGER PRIZES FOR BEST PAPER AND BEST POSTER* In 2012, Springer has again continued its generous support for the Student Session by offering EUR 1000 in prizes. These include a a EUR 500 for Best Paper and EUR 500 for Best Poster. The prizes are awarded best on the reviews of the submission as well as the oral presentation. *INSTRUCTIONS FOR AUTHORS:* Authors must be students, i.e., may not have received the Ph.D. degree before August 2012. All submissions must be in PDF format and be submitted to the conference EasyChair website. Submissions may be singly or jointly authored. No one may submit more than one singly and one jointly authored paper. There are two types of papers. Long papers of up to 8 pages will be considered for both oral presentation and the poster session. Short papers of up to 4 pages will be considered as submissions for the poster session. Submissions must be anonymous, without any identifying information, and must be must be received by *March 30, 2012*. More detailed guidelines regarding submission can be found on the Student Session website: http://loriweb.org/ESSLLI2012StuS/ Links to previous years' proceedings are also available there. Please direct inquiries about submission procedures or other matters relating to the Student Session to esslli2012stus at loriweb.org. For general inquiries about ESSLLI 2012, please consult the main ESSLLI 2012 page, http://esslli2012.pl/. Kind regards, The ESSLLI 2012 Students Session Organization Committee, Rasmus K. Rendsvig (Roskilde University) (chair) Anders Johannsen (University of Copenhagen) Dominik Klein (Tilburg University) Margot Colinet (Universit? de Paris 7) Matthijs Westera (Universiteit van Amsterdam) Maxim Haddad (University of Osnabr?ck) Niels Beuck (Hamburg University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From deligu at di.unito.it Fri Mar 9 07:26:28 2012 From: deligu at di.unito.it (Ugo de'Liguoro) Date: Fri, 09 Mar 2012 13:26:28 +0100 Subject: [TYPES/announce] Classical Logic and Computation (CL&C'12) - 2nd Call for Papers Message-ID: <4F59F6F4.1070401@di.unito.it> International Workshop on Classical Logic and Computation (CL&C'12) http://www.doc.ic.ac.uk/~svb/CLaC12 July, 8 2012 Warwick, England CL&C'12 is a satellite workshop of ICALP'12. IMPORTANT DATES Deadline for abstract: March, 29, 2012 Deadline for submission: April, 9, 2012 Notification of acceptance: June, 11, 2012 Final version due: June, 25, 2012 Workshop date: July, 8, 2012 INTRODUCTION CL&C'12 is the fourth of a conference series on Classical Logic and Computation. It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as satellite workshop of ICALP'12 in Warwick: http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/ CL&C is focused on the interplay between program extraction from classical the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic; - design of programming languages inspired by classical logic; - cut-elimination for classical systems; - proof representation and proof search for classical logic; - translations of classical to intuitionistic proofs; - constructive interpretation of non-constructive principles; - witness extraction from classical proofs; - constructive semantics for classical logic (e.g. game semantics); - case studies (for any of the previous points). SUBMISSION AND PUBLICATION. This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic / position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. All submitted papers will be reviewed to normal standards. The PC recognises two kinds of papers: it will distinguish between accepted (full) papers that contain unpublished results not submitted elsewhere, and presentations of (short) papers about work in progress. The accepted papers will appear in EPTCS. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at https://www.easychair.org/conferences/?conf=clc2012 A participants' proceedings will be distributed at the workshop. PROGRAMME COMMITTEE * Herman Geuvers (Nijmegen) - chair * Stefano Berardi (Turin) * Steffen van Bakel (Imperial College London) * Silvia Ghilezan (Novi Sad) * Koji Nakazawa (Kyoto) * Ugo de'Liguoro (Turin) CONTACT deligu at di.unito.it -------------- next part -------------- An HTML attachment was scrubbed... URL: From Didier.Remy at inria.fr Fri Mar 9 08:40:56 2012 From: Didier.Remy at inria.fr (Didier Remy) Date: Fri, 09 Mar 2012 14:40:56 +0100 Subject: [TYPES/announce] OCaml Users and Developers workshop (OUD) Message-ID: <4F5A0868.4060409@inria.fr> OCAML USERS AND DEVELOPERS WORKSHOP 2012 OUD 2012 http://oud.ocaml.org CALL FOR PRESENTATIONS Copenhagen, Denmark Fri, Sep 14th Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 8th June 2012 In 2012, the OCaml Meeting will be renamed the OCaml Users and Developers workshop (OUD), and be colocated with ICFP in Copenhagen, Denmark. It will be held on Friday September 14, after the ML workshop (Thu 13) and before the Commercial Users of Functional Programming (Sat 15). The OCaml Users and Developers Workshop will bring together industrial users of OCaml with academics and hackers who are working on extending the language, type system and tools. Discussion will focus on the practical aspects of OCaml programming and the nitty gritty of the tool-chain and upcoming improvements and changes. Thus, we aim to solicit talks on all aspects related to improving the use or development of the language, including, for example: - compiler developments; new backends, runtime and architectures. - practical type system improvements, such as (but not exhaustively) GADTs, first-class modules, generic programming, or dependent types. - new library or application releases, and their design rationales. - tool enhancements by commercial consultants. - prominent industrial uses of OCaml, or deployments in unusual situations. It will be an informal meeting, with an online scribe report of the meeting, but no formal proceedings for this year. Slides of presentations will be available online from the workshop homepage. To submit a talk, please register an abstract or outline (1-2 pages) at http://oud.ocaml.org/talks with as much information as you feel will support the proposal. If you wish to perform a demo or require any special setup, we will do our best to accommodate you. Schedule ======== Abstract Submission Deadline: Friday, 8th June 2012 Notification to Speakers: Friday, 6th July 2012 Workshop: Fri, 14th September 2012 Program Committee ================= * Didier Remy (co-chair) * Anil Madhavapeddy (co-chair) * Alain Frisch * Jacques Garrigue * Thomas Gazagnaire * Martin Jambon * Richard Jones If you have any questions, please e-mail: Didier Remy Anil Madhavapeddy From gdp at inf.ed.ac.uk Fri Mar 9 11:24:33 2012 From: gdp at inf.ed.ac.uk (Gordon Plotkin) Date: Fri, 9 Mar 2012 16:24:33 +0000 Subject: [TYPES/announce] Milner Symposium - early registration - student support Message-ID: <7310E779-85AD-4268-A776-1392885BC49E@inf.ed.ac.uk> We would like to remind you that early registration closes on Thursday 15 March 2012, after which the registration fee rises from ?60 to ?90. We are also pleased to say that some funds are available to support students attending the event. If you wish to apply for this, please DO NOT register via the web, but write to milner-symposium-students at inf.ed.ac.uk giving details of your student status, and the email address of your PhD supervisor. Otherwise, please register at http://events.inf.ed.ac.uk/Milner2012/registration.html A Symposium in Celebration of the Life and Work of Robin Milner to be held from 15th-18th April 2012 in Edinburgh. The symposium will feature Robin's colleagues from all areas of his work, as well as others participating in its continuation. Robin's inspiring contributions continue to have a profound effect on computer science, and the symposium will show how his vision has developed our subject over the last few decades, and how new work continues to build on his many contributions. All are welcome to attend this event, whether to hear the thoughts of leading figures in computer science, or simply to re-make the many connections that Robin brought into being, through his broad research agenda and his kindness to all who worked with or near him. The symposium will be hosted by the Laboratory for Foundations of Computer Science in the School of Informatics at the University of Edinburgh. The Symposium proper runs from 16th to 18th April, and is preceded in the evening of Sunday 15th by a reception to mark 25 years of LFCS, and a Ph.D. student career guidance panel. Date: 15-18 April 2012 Place: Informatics Forum, Edinburgh Web: http://events.inf.ed.ac.uk/Milner2012/ Poster: http://events.inf.ed.ac.uk/Milner2012/baposter/poster.pdf Email: milner-symposium at inf.ed.ac.uk -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: not available URL: From ulrich.fahrenberg at irisa.fr Sat Mar 10 12:14:56 2012 From: ulrich.fahrenberg at irisa.fr (Uli Fahrenberg) Date: Sat, 10 Mar 2012 18:14:56 +0100 Subject: [TYPES/announce] Call for Papers: QFM 2012 Message-ID: <4F5B8C10.9090407@irisa.fr> Apologies for multiple copies of this email: CALL FOR PAPERS QFM 2012 International Workshop on Quantities in Formal Methods CNAM Paris, France 28 August 2012 http://qfm2012.cs.aau.dk/ QFM 2012, the 1st workshop on Quantities in Formal Methods, will take place in Paris on 28 August 2012. It is associated with the 18th International Symposium on Formal Methods (FM2012), held at CNAM Paris 27-31 August. QFM will focus on quantities in modeling, verification, and synthesis. The aim is to create a forum where current and new application areas can be discussed together with verification techniques that might apply to them. All researchers with an interest in systems exhibiting quantitative behaviour are welcome. In particular, papers on or related to the following topics are solicitated: * Formal modeling, verification, and synthesis of quantitative behavior: timed, continuous and hybrid, probabilistic, costs and rewards, expected-value etc. * Data structures for quantitative methods * Quantitative techniques in refinement, simulation and bisimulation * Quantitative algebraic and rewriting techniques * Robustness of quantitative methods * Industrial case-studies on any (combination) of the above, e.g. hardware verification and performance evaluation, security systems with probabilistic behavior, risk analysis in safety-critical systems, quantitative aspects of wireless networks, etc. Submissions to QFM can be of two kinds: * Regular papers, containing original contributions presenting hitherto unpublished work. If accepted, these papers will be published in the EPTCS workshop proceedings and may be selected for subsequent publication in a special issue of a journal. * Extended abstracts of work-in-progress or of work already published or submitted elsewhere. Extended abstracts will not be published in the workshop proceedings. Both types of submissions will be carefully evaluated by the program committee. The page limit for both types of submissions is 15 pages; additional material may be submitted in a clearly marked appendix which may or may not be evaluated by the program committee. Submissions must be formatted using the EPTCS LaTeX document class and uploaded at http://www.easychair.org/conferences/?conf=qfm2012 . Important dates: Submission deadline: 15 May 2012, 23:00 UTC Notification: 15 June 2012 Final version: 10 July 2012 QFM 2012: 28 August 2012 From tiezzi at dsi.unifi.it Mon Mar 12 03:12:58 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Mon, 12 Mar 2012 08:12:58 +0100 Subject: [TYPES/announce] 2nd Call for Papers: WWV 2012 Message-ID: <0C8732A1-0446-4ED0-AB25-F7726CBD1CA1@dsi.unifi.it> [Apologies for multiple copies] ******************************************************** Second Call for Papers WWV 2012 Automated Specification and Verification of Web Systems 8th International Workshop (as part of DisCoTec'12) http://users.dsic.upv.es/~jsilva/wwv2012/ June 16, 2012 - Stockholm, Sweden ******************************************************** IMPORTANT DATES Abstract Submission March 26, 2012 Full Paper Submission April 2, 2012 Acceptance Notification May 16, 2012 Camera Ready (pre-proceedings) May 30, 2012 Workshop June 16, 2012 Camera Ready (post-proceedings) July 4, 2012 SCOPE 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. 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. INVITED SPEAKER Jos? Luiz Fiadeiro (University of Leicester) 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 in PDF format and prepared in LaTeX using the EPTCS-style format (http://style.eptcs.org/) and should not exceed 15 pages (typeset 11 points). Submissions are handled using the EasyChair online system and can be uploaded using the following link: https://www.easychair.org/conferences/?conf=wwv2012 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. Workshop post-proceedings will be published as a volume of the EPTCS (Electronic Proceedings in Theoretical Computer Science, http://eptcs.org/) series. An open call for a special high-quality journal issue on the topic of the WWV workshop is envisaged. WORKSHOP CO-CHAIRS Josep Silva Universidad Polit??cnica de Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy PROGRAM COMMITTEE Jesus M. Almendros-Jimenez Universidad de Almeria, Spain Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz University of Minho, Portugal Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Elie Najm Telecom ParisTech, France Rosario Pugliese University of Florence, Italy Ant??nio Ravara New University of Lisbon, Portugal Kostis Sagonas Uppsala University, Sweden Josep Silva Universidad Polit??cnica de Valencia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom CONTACT wwv2012 at easychair.org From d.r.ghica at cs.bham.ac.uk Tue Mar 13 07:04:58 2012 From: d.r.ghica at cs.bham.ac.uk (Dan Ghica) Date: Tue, 13 Mar 2012 11:04:58 +0000 Subject: [TYPES/announce] 7th Workshop on Games for Logic and Programming Languages (GaLoP) Message-ID: <4F5F29DA.30008@cs.bham.ac.uk> // Call for Submissions // 7th Workshop on Games for Logic and Programming Languages (GaLoP 2012) // LICS 2012 // Dubrovnik, Croatia // 29 June // http://sites.google.com/site/galopws/ GaLoP is the annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as contributed papers and invited talks. GaLoP VII will be held in Dubrovnik, Croatia, on June 29 2012. It will be associated with the Twenty-Seventh Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2012) Contributions are invited on all pertinent subjects, with particular interest in game-semantic and interaction models for logics and programming languages. Typical but not exclusive areas of interest are: * categorical aspects; * algorithmic aspects; * programming languages and full abstraction; * semantics of logics and proof systems; * proof search; * higher-order automata; * program verification and model checking; * program analysis; * security; * theories of concurrency; * probabilistic models; * Geometry of Interaction; * Ludics; * epistemic game theory; * logics of dependence and independence; * computational linguistics There will be no formal proceedings but the possibility of a special issue in a journal will be considered (selected papers from GaLoP 2005 and 2008 have appeared in Annals of Pure and Applied Logic and a similar issue for GaLoP 2011 is in the works). // Submission Instructions // Please email an abstract of your proposed talk to Dan Ghica (D.R.Ghica at cs.bham.ac.uk). You may also submit an accompanying paper for the talk. // Important Dates // Submission: April 1 Notification: April 10 Workshop: June 29 // Steering Committee // ? Samson Abramsky (Chair), Oxford ? Pierre-Louis Curien, PPS ? Claudia Faggian, PPS ? Dan Ghica, Birmingham ? Ichiro Hasuo, Tokyo ? Jim Laird, Bath ? Olivier Laurent, ENS Lyon ? Guy McCusker, Bath ? Luke Ong, Oxford ? Gabriel Sandu, Paris ? Andrea Schalk, Manchester ? Jouko Vaananen, Helsinki -- Dan Ghica ? U. of Birmingham ? Sr. Lecturer ? http://bit.ly/drgbham From henglein at diku.dk Tue Mar 13 12:01:38 2012 From: henglein at diku.dk (Fritz Henglein) Date: Tue, 13 Mar 2012 17:01:38 +0100 Subject: [TYPES/announce] PhD and postdoc positions in regular exressions and types Message-ID: Two PhD and postdoc positions are available at DIKU, the Department of Computer Science at the University of Copenhagen, in the Project *Kleene Meets Church (KMC): Regular Expressions and Types*. The overall objective of KMC is to investigate the type-theoretical foundations for the prevalent use of regular expressions (and related grammars) for extracting information from an input, not just classifying it into accepting/nonaccepting; to explore and demonstrate guaranteed safety and expressiveness of programming with regular expressions as types; and to drastically improve semantic predictability and computational scalability vis a vis commonly used regular expression processing tools such as Perl. Application deadline: *March 31st, 2012*. For information on the positions and application requirements, please see http://diku.dk/english/about/vacancies -------------- next part -------------- An HTML attachment was scrubbed... URL: From cristina.pereira at informatics-europe.org Wed Mar 14 06:02:44 2012 From: cristina.pereira at informatics-europe.org (Cristina Pereira) Date: Wed, 14 Mar 2012 11:02:44 +0100 Subject: [TYPES/announce] Informatics Europe Curriculum Award 2012 - Embedded and Mobile Computing Message-ID: <4F606CC4.6010703@informatics-europe.org> Informatics Europe proudly announces its 2012 Curriculum Award, devoted to curriculum initiatives in the area of *Embedded and Mobile Computing. * The Informatics Europe Curriculum 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 the teaching of Embedded and Mobile Computing . is widely available for reuse by the teaching community . has made a measurable impact in its original institution and beyond it. Examples of impact include course results, industry collaborations, student projects, textbooks, or influence on the curriculum of other universities. The 2012Award is devoted to curriculum initiatives in the general area of *Embedded and Mobile Computing. * *The Award carries a prize of EUR 30,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 different 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's 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 department management, academic colleagues in the same or another institution, industry colleagues. *Proposals should be submitted only at: www.easychair.org/conferences/?conf=ieca2012* *Deadlines: Abstract: May 15, 2012 Full proposal: June 15, 2012 Notification of winner(s): August 1, 2012* The Award will be presented at the 8th European Computer Science Summit, in Barcelona, 20-21 November 2012, 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:* * Friedemann Mattern, ETH Zurich (chair) * Mark Harris, InnoVaventures (vice-chair) * Anind Dey, Carnegie Mellon University * Cecilia Mascolo, University of Cambridge * Luca Mottola, Swedish Institute of Computer Science * Mieczyslaw Muraszkiewicz, Warsaw University of Technology * Michael Rohs, LMU M?nchen /(More names to be announced)/ For latest information visit: *www.informatics-europe.org/services/curriculum-award.html* For further inquires: curriculum-award at informatics-europe.org ------------------------------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From t.kitamura at aist.go.jp Wed Mar 14 09:29:02 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Wed, 14 Mar 2012 22:29:02 +0900 Subject: [TYPES/announce] Last CFP: ICFEM 2012 - 14th International Conference on Formal Engineering Methods Message-ID: <20120314222901.8C09.35D11551@aist.go.jp> ************************************************************ ICFEM 2012: 14th International Conference on Formal Engineering Methods CALL FOR PAPERs 12th-16th, November, 2012 Kyoto Research Park, Kyoto, Japan URL: http://www.jaist.ac.jp/icfem2012 ************************************************************ ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2012 will be hosted by National Institute of Advanced Industrial Science and Technology (AIST) and Japan Advanced Institute of Science and Technology (JAIST), which will be held in Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find many historical sites which have been designated as World Heritage there. We are looking forward to your submissions. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Formal methods for cloud computing/robotics/cyber-physical systems/ medical devices/aeronautics/railway * Formal methods for self-* systems * Formal methods for software safety, security, reliability and dependability * Experiments involving verified systems * Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc) * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2012 submission page (https://www.easychair.org/conferences/?conf=icfem2012), handled by the EasyChair conference system. IMPORTANT DATES Abstract Submission Deadline: 9th April, 2012 Full Paper Submission Deadline: 16th April, 2012 Acceptance/Rejection Notification: 18th June, 2012 Camera Ready Copy Due: 16th July, 2012 Conference: 12th-16th, November, 2012. ORGANIZATION COMMITTEE General Chairs: Kokichi Futatsugi, JAIST, Japan Shaoying Liu, Hosei Uni., Japan Conference Chair: Hitoshi Ohsaki, AIST, Japan Program Chairs: Kenji Taguchi, AIST, Japan Toshiaki Aoki, JAIST, Japan Steering Committee: Keijiro Araki, Kyushu University, Japan Michael Butler, University of Southampton, UK Jin Song Dong, National University of Singapore, Singapore He Jifeng, East China Normal University, China Shaoying Liu (Chair), Hosei University, Japan Jeff Offutt, George Mason University, USA Shengchao Qin, University of Teesside, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Cyrille Artho (AIST, Japan) Richard Banach (University of Manchester, UK) Nikolaj Bjorner(Microsoft Research Redmond, USA) Jonathan P. Bowen (University of Westminster, UK) Michael Butler (University of Southampton, UK) Sagar Chaki (CMU/SEI, USA) Rance Cleaveland (University of Maryland/Reactive Systems, USA) Jim Davies (Oxford University, UK) Zhenhua Duan (Xidian University, China) Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain) Andy Galloway (University of York, UK) Stefania Gnesi (ISTI-CNR, Italy) Wolfgang Grieskamp (Google, USA) Klaus Havelund (NASA JPL, USA) Daniel Jackson (MIT, USA) Thierry Jeron (INRIA, France) Gerwin Klein (NICTA, Australia) Weiqiang Kong (Kyushu University, Japan) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Engineering College of Aarhus, Denmark) Insup Lee (University of Pennsylvania, USA) Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany) Xuandong Li (Nanjing University, China) Yuan-Fang Li (Monash University, Australia) Zhiming Liu (UNU/IIST, Macau) Dominique Mery (Nancy University and LORIA, France) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Alexandre Mota (CIn-UFPE, Brasil) Shin Nakajima (NII, Japan) Kazuhiro Ogata (JAIST, Japan) Jose Nuno Oliveira (Universidade do Minho, Portugal) Jun Pang (University of Luxembourg, Luxembourg) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) S. Ramesh (General Motors India, India) Alexander Romanovsky (Newcastle University, UK) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Greame Smith (The University of Queensland, Australia) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Yih-Kuen Tsay (National Taiwan University, Taiwan) Viktor Vafeiadis (MPI-SWS, Germany) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Wang Yi (Uppsala University, Sweden) Jian Zhang (Chinese Academy of Sciences, China) Huibiao Zhu (East China Normal University, China) ------------------------------------ Takashi KITAMURA Ph.D. National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 From might at cs.utah.edu Wed Mar 14 19:01:02 2012 From: might at cs.utah.edu (Matthew Might) Date: Wed, 14 Mar 2012 17:01:02 -0600 Subject: [TYPES/announce] Call for participation: PLDI 2012 (June 11-16 in Beijing, China) Message-ID: The 2012 conference on Programming Language Design and Implementation (plus 30 co-located events!) will be held in Beijing, China from June 11-16. We invite all with an interest in programming language design, theory and implementation to attend! Registration is now open: https://regmaster3.com/2012conf/PLDI12/register.php (Early registration closes May 1st.) For more information on PLDI, please see: http://pldi12.cs.purdue.edu/ For updates via Facebook, please join: http://www.facebook.com/events/195323457176764/ For information on travel, please join: http://www.facebook.com/events/314574741939037/ For student information (including travel info): http://pldi12.cs.purdue.edu/content/students On behalf of the PLDI 2012 organizers, Matt Might From alain at frisch.fr Thu Mar 15 18:16:48 2012 From: alain at frisch.fr (Alain Frisch) Date: Thu, 15 Mar 2012 23:16:48 +0100 Subject: [TYPES/announce] ML workshop 2012: call for presentations Message-ID: <4F626A50.10901@frisch.fr> ======================================================================= CALL FOR PRESENTATIONS ACM SIGPLAN Workshop on ML Thursday, September 13th, 2012, Copenhagen, Denmark (co-located with ICFP) http://www.lexifi.com/ml2012 ======================================================================= The ML family of programming languages includes dialects known as Standard ML, OCaml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum where users, developers and researchers of ML languages and related technology can interact and discuss ongoing research, open problems and innovative applications. The format of ML 2012 will continue the return in 2010 and 2011 to a more informal model: a workshop with presentations selected from submitted abstracts. The workshop will not publish proceedings, so any contributions may be submitted for publication elsewhere. We hope that this format will encourage the presentation of exciting (if unpolished) research and deliver a lively workshop atmosphere. SCOPE ----- We seek research presentations on topics related to ML, including but not limited to * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Three kinds of submissions will be accepted: Research Presentations, Experience Reports and Demos. * Research Presentations: Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users. * Experience Reports: Users are invited to submit Experience Reports about their use of ML languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve. * Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.) Each presentation should take 20-25 minutes, except demos, which should take 10-15 minutes. The exact time will be decided based on the number of accepted submissions. SUBMISSION INSTRUCTIONS ----------------------- Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Submissions longer than a half a page should include a one-paragraph synopsis suitable for inclusion in the workshop program. Submissions must be uploaded to the following website before the submission deadline (2012-06-04): https://www.easychair.org/conferences/?conf=ml2012 For any question concerning the scope of the workshop or the submission process, please contact the program chair (alain at frisch.fr). IMPORTANT DATES --------------- * 2012-06-04: Submission * 2012-07-13: Notification * 2012-09-13: Workshop PROGRAM COMMITTEE ----------------- Alain Frisch (chair) (LexiFi) Anders Schack-Nielsen (SimCorp) Cedric Fournet (Microsoft Research) Francois Pottier (INRIA) Gian Ntzik (Imperial College) Jeremy Yallop Keiko Nakata (Institute of Cybernetics, Tallinn) Matthias Blume (Google) Oleg Kiselyov Stephen Weeks (Jane Street Capital) Tomas Petricek (University of Cambridge) STEERING COMMITTEE ------------------ Andreas Rossberg (Google) Chung-chieh Shan (Cornell University) Eijiro Sumii (chair) (Tohoku University) Jacques Garrigue (Nagoya University) Matthew Fluet (Rochester Institute of Technology) Robert Harper (Carnegie Mellon University) Yaron Minsky (Jane Street) From Brinkley.Chris at ssd.loral.com Thu Mar 15 19:11:15 2012 From: Brinkley.Chris at ssd.loral.com (Chris Brinkley) Date: Thu, 15 Mar 2012 23:11:15 +0000 Subject: [TYPES/announce] Industry job in type theory Message-ID: I am hoping to hire a type theorist. My employer, Palo Alto-based Space Systems Loral (www.ssloral.com) is the world's leading manufacturer of commercial satellites. I have recently been allowed to begin putting together a small "Engineering Computing" group, which currently includes a formal methods specialist and a (just hired) senior F# programmer, among others. I'm sure I don't have to tell you how extraordinary it is to have something like this in an industry setting. The type theorist req was just approved today, and should be posted on our company web page soon (I'll send a follow-up note when that is done.) Here is my language for the req: Position Description: Apply type theory based tools and concepts in development of knowledge based engineering applications. Collaborate on design of domain-specific type systems to capture engineering pragmatics for automation and validation. Design and develop practical software support for particular families of domain-specific dependent types. Mentor others in type theory and tools. Work independently and in an interdisciplinary team. Position Requirements: Good working knowledge of type theory in computer science and its applications in programming languages and theorem proving. Industry or academic experience using type theory based tools such as Coq or Agda. Experience applying type-theoretic concepts in software development. A high level of all-around sophistication in developing and maintaining highly reliable computationally oriented software systems. Please feel free to share this with anyone who might be or know of a promising candidate. Also feel free to contact me directly. Best regards, Chris Brinkley Engineering Computing Space Systems Loral Palo Alto, CA brinkley.chris at ssd.loral.com 650-852-6965 -------------- next part -------------- An HTML attachment was scrubbed... URL: From samth at ccs.neu.edu Thu Mar 15 20:13:39 2012 From: samth at ccs.neu.edu (Sam Tobin-Hochstadt) Date: Thu, 15 Mar 2012 20:13:39 -0400 Subject: [TYPES/announce] Second Call for Papers: Workshop on Script to Program Evolution (STOP 2012) Message-ID: CALL FOR PAPERS 3rd Workshop on Script to Program Evolution (co-located with ECOOP and PLDI) Beijing, China June 11, 2012 http://wrigstad.com/stop12/ OVERVIEW Recent years have seen increased use of scripting languages in large applications. Scripting languages optimize development time, especially early in the software life cycle, over safety and robustness. As the understanding of the system reaches a critical point and requirements stabilize, scripting languages become less appealing. Compromises made to optimize development time make it harder to reason about program correctness, harder to do semantic-preserving refactorings, and harder to optimize execution speed. Lack of type information makes code harder to navigate and to use correctly. In the worst cases, this situation leads to a costly and potentially error-prone rewrite of a program in a compiled language, losing the flexibility of scripting languages for future extension. Recently, pluggable type systems and annotation systems have been proposed. Such systems add compile-time checkable annotations without changing a program?s run-time semantics which facilitates early error checking and program analysis. It is believed that untyped scripts can be retrofitted to work with such systems. Furthermore, integration of typed and untyped code, for example, through use of gradual typing, allows scripts to evolve into safer programs more suitable for program analysis and compile-time optimizations. With few exceptions, practical reports are yet to be found. The STOP workshop focuses on the evolution of scripts, largely untyped code, into safer programs, with more rigid structure and more constrained behavior through the use of gradual/hybrid/pluggable typing, optional contract checking, extensible languages, refactoring tools, and the like. The goal is to further the understanding and use of such systems in practice, and connect practice and theory. CALL FOR CONTRIBUTIONS Abstracts, position papers, and status reports are welcome. Papers should be 1-2 pages in standard ACM SIGPLAN format. All submissions will be reviewed by the program committee. The accepted papers, after rework by the authors, will be published in an informal proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Papers are to be submitted electronically via the STOP website: http://wrigstad.com/stop12/ IMPORTANT DATES paper submission: 11:59 PM 30 March 2012 Eastern Daylight Time notification: 20 April 2012 camera-ready paper: 15 May 2012 conference date: 11 June 2012 PROGRAM COMMITTEE Avik Chaudhuri, Adobe Labs Kathryn Gray, Swansea University Arjun Guha, Brown University David Herman, Mozilla Research Manuel Hermenegildo, IMDEA Atsushi Igarashi, Kyoto University Ranjit Jhala, University of California, San Diego Sam Tobin-Hochstadt (Chair), Northeastern University From ggrov at staffmail.ed.ac.uk Fri Mar 16 08:11:41 2012 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Fri, 16 Mar 2012 12:11:41 +0000 Subject: [TYPES/announce] WING 2012: Second Call for Papers -- 3 weeks to go Message-ID: <40B3F6C9-8CE9-4605-8D6B-F7B74E76947C@staffmail.ed.ac.uk> [Please post - apologies for multiple copies.] ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- Second Call for Papers : 3 weeks to go --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. Releasing the software developer from this burden is crucial for ensuring the practical relevance of program verification. In the context of testing, suitable invariants have the potential of enabling high-coverage test-case generation. Thus, invariant generation is a key ingredient in a broad spectrum of tools that help to improve program reliability and understanding. As the design and implementation of reliable software remains an important issue, any progress in this area will have a significant impact. The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer-aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Groebner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis, and abstract interpretation. The aim of this workshop is to bring together researchers from these diverse fields. Scope ----- We encourage submissions presenting work in progress, tools under development, as well as work by PhD students, such that the workshop can become a forum for active dialogue between the groups involved in this new research area. 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 the following tools: - 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 Invited speaker ----------------- * Aditya Nori (Microsoft Research) Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Important Dates --------------- Submission deadline: April 06, 2012 Notification of acceptance: May 04, 2012 Final version due: June 08, 2012 Workshop: June 30, 2012 Submission ---------- WING 2012 encourages submissions in the following two categories: * Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. Given the informal style of the workshop, papers describing work in progress, with sufficient detail to assess the contribution, are also welcome. Original papers should not exceed 15 pages. * Extended abstracts: contain preliminary reports of work in progress, case studies, or tool descriptions. These will be judged based on the expected level of interest for the WING community. They will be included in the CEUR-WS proceedings. Extended abstracts should not exceed 5 pages. All submissions should conform to Springer's LNCS format. Formatting style files can be found at http://www.springer.de/comp/lncs/authors.html Technical details may be included in an appendix to be read at the reviewers' discretion and to be omitted in the final version. Please prepare your submission in accordance with the rules described above and submit a pdf file via https://www.easychair.org/?conf=wing2012 Publication ----------- All submissions will be peer-reviewed by the program committee. Accepted contributions will be published in archived electronic notes, as a volume of CEUR Workshop Proceedings. A special issue of the Journal of Science of Computer Programming with extended versions of selected papers will be published after the workshop. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Brinkley.Chris at ssd.loral.com Fri Mar 16 19:44:44 2012 From: Brinkley.Chris at ssd.loral.com (Chris Brinkley) Date: Fri, 16 Mar 2012 23:44:44 +0000 Subject: [TYPES/announce] Industry job in type theory Message-ID: This job is now posted at http://www.ssloral.com/html/careers/careers2.html To see the listing, go to the above link, then search for Job ID #2241. Also, I must apologize for my failure to mention originally that SS/L requires U.S. citizenship or permanent resident, refugee, or asylum status. Chris Brinkley From: Chris Brinkley Sent: Thursday, March 15, 2012 4:11 PM To: 'types-announce at lists.seas.upenn.edu' Cc: Chris Brinkley Subject: Industry job in type theory I am hoping to hire a type theorist. My employer, Palo Alto-based Space Systems Loral (www.ssloral.com) is the world's leading manufacturer of commercial satellites. I have recently been allowed to begin putting together a small "Engineering Computing" group, which currently includes a formal methods specialist and a (just hired) senior F# programmer, among others. I'm sure I don't have to tell you how extraordinary it is to have something like this in an industry setting. The type theorist req was just approved today, and should be posted on our company web page soon (I'll send a follow-up note when that is done.) Here is my language for the req: Position Description: Apply type theory based tools and concepts in development of knowledge based engineering applications. Collaborate on design of domain-specific type systems to capture engineering pragmatics for automation and validation. Design and develop practical software support for particular families of domain-specific dependent types. Mentor others in type theory and tools. Work independently and in an interdisciplinary team. Position Requirements: Good working knowledge of type theory in computer science and its applications in programming languages and theorem proving. Industry or academic experience using type theory based tools such as Coq or Agda. Experience applying type-theoretic concepts in software development. A high level of all-around sophistication in developing and maintaining highly reliable computationally oriented software systems. Please feel free to share this with anyone who might be or know of a promising candidate. Also feel free to contact me directly. Best regards, Chris Brinkley Engineering Computing Space Systems Loral Palo Alto, CA brinkley.chris at ssd.loral.com 650-852-6965 -------------- next part -------------- An HTML attachment was scrubbed... URL: From might at cs.utah.edu Sat Mar 17 22:37:13 2012 From: might at cs.utah.edu (Matt Might) Date: Sat, 17 Mar 2012 20:37:13 -0600 Subject: [TYPES/announce] Call for papers: NSAD 2012 (co-located with SAS) Message-ID: ********************************************************************** * * * The Fourth International Workshop on * * * * Numerical and Symbolic Abstract Domains (NSAD 2012) * * * * * * 10 September 2012, Deauville, France. Co-located with SAS'2012. * * * * http://nsad2012.ucombinator.org/ * * * ********************************************************************** Objectives Abstract domains are a key notion in Abstract Interpretation theory and practice. They embed the semantic choices, data structures and algorithmic aspects, and implementation decisions. The Abstract Interpretation framework provides constructive and systematic formal methods to design, compose, compare, study, prove, and apply abstract domains. Many abstract domains have been designed so far: numerical domains (intervals, congruences, polyhedra, polynomials, etc.), symbolic domains (shape domains, trees, etc.), but also domain operators (products, powersets, completions, etc.), which have been applied to several kinds of static analyses (safety, termination, probability, etc.). The Fourth International Workshop on Numerical and Symbolic Abstract Domains is intended to discuss on-going work and ideas in the field. NSAD 2012 will be co-located with SAS'2012. Scope The program of NSAD 2012 will primarily consist of presentations of refereed papers. Contributions are welcomed on all aspects of abstract domains, including, but not limited to: * numeric abstract domains * symbolic abstract domains * extrapolations and accelerations * compositions and operations on abstract domains * data structures and algorithms for abstract domains * novel applications of abstract domains * implementations * practical experiments and comparisons Submission All submitted papers will be peer-reviewed by the program committee. Submitted papers should not exceed 12 pages including bibliography, and follow the ENTCS_guidelines. Submitted papers may include, in addition, an appendix containing technical details, which reviewers may read or not, at their discretion. Papers must be written and presented in English, and describe original work that does not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. The NSAD 2012 proceedings will be published electronically in a volume of the Electronic Notes in Theoretical Computer Science series by ScienceDirect(c), Elsevier. To submit a paper, follow this link: https://www.easychair.org/conferences/?conf=nsad2012 Important dates Submission deadline: 6 June 2012 Notification: 15 July 2012 Final version: 7 August 2012 Workshop: 10 September 2012 Program Committee John P. Gallagher, Roskilde University / IMDEA-Software Institute Patricia M. Hill, BUGSENG / University of Leeds Isabella Mastroeni, Verona University Xavier Rival, INRIA Roquencourt / ENS Paris Axel Simon, Technical University Munich Pascal Sotin, ENS Paris David Van Horn, Northeastern University On behalf of the program co-chairs, Jan Midtgaard, Aarhus University Matt Might, University of Utah From wasowski at itu.dk Sun Mar 18 16:57:00 2012 From: wasowski at itu.dk (=?UTF-8?B?QW5kcnplaiBXxIVzb3dza2k=?=) Date: Sun, 18 Mar 2012 21:57:00 +0100 Subject: [TYPES/announce] PhD positions in Variability Modeling, Analysis, and Verification Message-ID: <4F664C1C.6040906@itu.dk> IT University seeks candidates for two PhD scholarships devoted to analysis of variability in safety critical systems. The students will be affiliated with the ARTEMIS VARIES project. VARIES is a European consortium of industrial partners and academic institutions that aims (i) to enable companies to make informed decisions on variability use in safety critical ES; (ii) to provide effective variability architectures and approaches for safety-critical ES; and (iii) to offer consistent, integrated and continuous variability management over the entire product life cycle. The PhD students employed at IT University in Copenhagen will be involved in the most technical part of the VARIES research agenda. The objective will be to work on designing of variability modeling languages and transformation tools. Furthermore we will work on analysis, test and verification techniques for these models, to establish legally required safety level for the systems relying on them. Students involved in the projects will be able to work closely with industrial partners in the project, and will have opportunities to influence international industrial standards in the area of variability modeling. Expected start date of employment: September 1st, 2012. Deadline for applications is: April 16, 2012 at 12.00 Copenhagen time. The deadline is strict. Ideal candidates have strong background in classical computer science, including compiler technology, semantics and verification. Preliminary research experience are well seen, too---including publications. We do require a strong engineering edge for these positions. Significant part of the work will be developing model-driven engineering tools, and applying them in industrial case studies. The successful applicants will join the lively international environment of the newly established Process and System Models Research Group at The IT University, with about a dozen of other PhD students. They will also be affiliated with a broader network of the basic research center on modeling of IT systems, MT-LAB (A VKR centre of excellence). If you have any specific questions regarding this PhD project, please contact Andrzej Wasowski at wasowski at itu.dk Application is electronic, through the general call at ITU, together with scholarships in other projects. Please see: https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=109051&DepartmentId=3439&MediaId=1282 or http://www.itu.dk/en/Forskning/Phd-uddannelsen/Calls-2012 There you can also find contact points regarding administrative matters in the application process. -- Andrzej W?sowski, PhD, http://www.itu.dk/~wasowski/ Associate prof., head of MSc Programme on Software Development IT University, Rued Langgaards Vej 7, 2300 Copenhagen, Denmark office 2M27, phone +45 7218 5086, fax +45 7218 5001 From frederic.blanqui at inria.fr Sun Mar 18 20:09:51 2012 From: frederic.blanqui at inria.fr (Frederic Blanqui) Date: Mon, 19 Mar 2012 08:09:51 +0800 Subject: [TYPES/announce] Call for paper - HOR 2012 in Nagoya, Japan In-Reply-To: <4F667919.1060705@inria.fr> References: <4F667919.1060705@inria.fr> Message-ID: <4F66794F.10501@inria.fr> ===================================================================== Call for papers 6th International Workshop on Higher-Order Rewriting HOR 2012 June 2, 2012, Nagoya, Japan Colocated with RTA'12 http://www.cs.gunma-u.ac.jp/events/hor/ ====================================================================== HOR is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. The following is a non-exhaustive list of topics for the workshop: * Applications: proof checking, type checking, theorem proving, functional programming, declarative programming, program transformation, using some notions of higher-order rewriting. * Foundations: pattern matching, unification, strategies, termination, syntactic properties, type theory, for higher-order rewriting. * Frameworks: graph rewriting, net rewriting, comparisons of different formats. * Implementation: explicit substitution, rewriting tools, compilation techniques. * Semantics: semantics of higher-order rewriting, higher-order abstract syntax, categorical rewriting. Important dates --------------- Paper submission: March 26, 2012 Notification: April 20, 2012 Final version: May 10, 2012 Workshop: June 2, 2012 Submissions ----------- Two categories of papers are solicited: - Category A: Extended abstracts of new results, describing work in progress, or problems in higher-order rewriting. - Category B: Short versions of recently published or submitted elsewhere articles on higher-order rewriting. Papers in this category are for presentation only, and not considered as candidates for the post-workshop proceedings. Papers in both categories should be between 2 and 5 pages, and should note the category (either A or B). Papers are formatted according to EPTCS style, and submitted electronically via the EasyChair submission website. Papers will be judged on relevance, originality, correctness and usefulness. Please address your questions to the PC chair: hamana at cs.gunma-u.ac.jp. Proceedings ----------- The proceedings of HOR 2012 will be made available on the HOR 2012 web page, and a printed version will be distributed at the workshop. Post-workshop proceedings of extended abstracts of selected contributions is planned to be published as a volume of EPTCS. Program Committee ------------------- Andreas Abel (Ludwig-Maximilians-University Munich, Germany) Frederic Blanqui (INRIA, France) Makoto Hamana (Gunma University, Japan) (chair) Stefan Kahrs (University of Kent, UK) Fer-Jan de Vries (University of Leicester, UK) Program and Organizing Chair ---------------------------- Makoto Hamana (Gunma University, Japan) From shilov at iis.nsk.su Mon Mar 19 03:51:50 2012 From: shilov at iis.nsk.su (=?koi8-r?B?7snLz8zByiD7yczP1w==?=) Date: Mon, 19 Mar 2012 14:51:50 +0700 Subject: [TYPES/announce] Final CFP (and deadline extension): PSSV workshop in Russia (July 1-2, 2012). Message-ID: <003301cd05a5$249a7f20$6dcf7d60$@nsk.su> Final Call for Papers (and deadline extension) The Third Workshop on Program Semantics, Specification and Verification: Theory and Applications July 1-2, 2012 in Nizhni Novgorod, Russia (PSSV 2012, http://agora.guru.ru/display.php?conf=csr2012&page=item009) affiliated with 7th International Computer Science Symposium in Russia (CSR-2012, http://agora.guru.ru/display.php?conf=csr2012), just 3 days ahead of META 2012, Third International Valentin Turchin Workshop on Metacomputation July 5-9, 2012, Pereslavl-Zalessky (120 km to the north-east from Moscow), Russia (http://meta2012.pereslavl.ru/index.html) Please refer http://pssv-conf.ru/ for PSSV archive. =========================================== Important dates (extended) Extended abstract submission: March 25, 2012 Notification: April 9, 2012 =========================================== Official language: English =========================================== Scope and Topics Research and work in progress papers are welcome. List of topics of interest includes (but is not limited to): * formalisms for program semantics; * formal models and semantics of programs and systems; * semantics of programming and specification languages; * formal description techniques; * logics for formal specification and verification; * deductive program verification; * automatic theorem proving; * model checking of programs and systems; * static analysis of programs; * formal approach to testing and validation; * program analysis and verification tools. =========================================== Program Chairs * Valery Nepomniaschy (Institute of Informatics Systems, Novosibirsk, Russia, vnep at iis.nsk.su) * Valery Sokolov (Yaroslavl State University, Yaroslavl, Russia, sokolov at uniyar.ac.ru) Program Committee (confirmed) * Natasha Alechina (University of Nottingham, UK), * Sergey Baranov (St.Petersburg Institute for Informatics and Automation, Russia), * Alexander Bolotov (University of Westminster, UK), * Nina Evtushenko (Tomsk State University, Russia), * Vladimir Itsykson (St. Petersburg State Polytech. University, Russia), * Andrei Klimov (Keldysh Institute of Applied Mathematics, Moscow, Russia), * Vladimir Klebanov (Karlsruhe Institute of Technology, Germany), * Boris Konev (University of Liverpool, UK), * Victor Kuliamin (Institute for System Programming, Moscow, Russia), * Irina Lomazova (Higher School of Economics, Moscow, Russia), * Andrey Rybalchenko (Technical University, Munich, Germany), * Nikolay Shilov (Institute of Informatics Systems, Novosibirsk, Russia), * Sergey Tverdyshev (SYSGO AG, Germany), * Vladimir Zakharov (Moscow State University, Russia). =========================================== Submission and Publication Program Committee invites submissions in the form of extended abstracts (up to 8 pages, Lecture Notes in Computer Science style) in English. Additional details may be included in an appendix up to 4 pages for Program Committee. Submissions should be in PDF format. They should be sent (as attachments) by e-mail with subject line "PSSV-2012" to Alexei Promsky (promsky at iis.nsk.su) and their abstracts should be sent (as attachments) to PSSV Chairs. The acknowledgment will be send during 3 days. Program committee plans to have regular sessions and posters presentations. All accepted papers will be published in the preliminary proceedings before the workshop and the volume of the proceedings will be distributed at the workshop. Selected papers will be published after the workshop in one of Russian peer-review journals. At least one author of every accepted paper should present a talk in the workshop. =========================================== Registration and fees Registration fee 1600 rubles (for all participants) via homepage of The 7th International Computer Science Symposium in Russia. From carbonem at itu.dk Mon Mar 19 06:27:16 2012 From: carbonem at itu.dk (Marco Carbone) Date: Mon, 19 Mar 2012 11:27:16 +0100 Subject: [TYPES/announce] ICE 2012 - Second Call for Papers (Deadline 4 April 2012) Message-ID: *[- Apologies for multiple copies -] ICE 2012 5th Interaction and Concurrency Experience June 16, 2012, Stockholm, Sweden http://www.artist-embedded.org/artist/-ICE-2012-.html Satellite workshop of DisCoTec 2012 http://discotec.ict.kth.se/ === Highlights === - Invited talks: Marcello Bonsangue & Ichiro Hasuo - Innovative selection procedure - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 30 March 2012................Abstract submission 04 April 2012................Full paper submission 18 April - 12 May 2012.......Reviews, rebuttal and PC discussion 16 May 2012..................Notification to authors 30 May 2012..................Camera-ready for pre-proceedings 16 June 2012.................ICE in Stockholm 15 Sept 2012.................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, but every experience focuses on a different specific topic (see "Previous Editions" at the end of this call) related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. The theme of ICE 2012 is ***Distributed coordination, execution models, and resilient interaction***. 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 interaction - 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 - Relating 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 whose access will be restricted to the authors and all the PC members who do not have a conflict of interests with the paper. The PC members post comments/questions that the authors shall reply to. As witnessed by the past four 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 will be 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 === Papers must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2012 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2012) and should not exceed 15 pages with the EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full versions of the best papers selected by the PC will be invited to appear in a special issue of the journal of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/). 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 === Lucia Acciai (University of Firenze, Italy) Luca Aceto (Reykjavik University, Iceland) Massimo Bartoletti (University of Cagliari, Italy) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, United Kingdom) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marco Carbone (co-chair) Vincenzo Ciancia (University of Amsterdam, The Netherlands) Pierre-Malo Denielou (Imperial College, United Kingdom) Cinzia Di Giusto (CEA, France) Tobias Heindel (CEA, France) Tom Hirschowitz (CNRS, France) Bartek Klin (Warsaw University, Poland) Ivan Lanese (University of Bologna/INRIA, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Bas Luttik (Technische Universiteit Eindhoven, The Netherlands) Manuel Mazzara (Newcastle University, United Kingdom) Mohammadreza Mousavi (Technische Universiteit Eindhoven, The Netherlands) Damien Pous (CNRS, France) Jens-Wolfhard Schicke-Uffmann (TU Braunschweig, Germany ) Alexandra Silva (co-chair) Ana Sokolova (University of Salzburg, Austria) Francesco Tiezzi (IMT Lucca, Italy) Emilio Tuosto (University of Leicester, United Kingdom) Erik de Vink (Technische Universiteit Eindhoven, The Netherlands) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alexandra Silva (Radboud University Nijmegen & CWI, The Netherlands; HasLab / INESC TEC, Portugal; co-chair) - Ana Sokolova (University of Salzburg, Austria) === Contact === ice2012 at easychair.org === Previous editions === The previous four editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland with focus on Synchronous and Asynchronous Interactions in Concurrent/ Distributed Systems, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy with focus on Structured Interactions, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and a special issue of MSCS is in preparation. * June 10th, 2010 in Amsterdam, The Netherlands with focus on Guaranteed Interactions, 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 with focus on Reliable and Contract-based Interactions, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and a special issue of SACS is now in preparation. === Workshop Sponsors === CEA-List Computer Science Department - University of Bologna* -------------- next part -------------- An HTML attachment was scrubbed... URL: From hilde at itu.dk Tue Mar 20 04:38:28 2012 From: hilde at itu.dk (Thomas Hildebrandt) Date: Tue, 20 Mar 2012 09:38:28 +0100 Subject: [TYPES/announce] CFP: MoRe4CPS (deadline April 16th) - First Workshop on Modelling and Reasoning for Cyber-Physical Systems Message-ID: <4F684204.1050401@itu.dk> Call for Papers - Call for Papers - Call for Papers - Call for Papers - Call for Papers First Workshop on Modelling and Reasoning for Cyber-Physical Systems (MoRe4CPS) (http://www.itu.dk/research/MoRe4CPS/) Technical University of Denmark, Kgs. Lyngby, July 3rd Co-located with the 8^th European Conference on Modelling Foundations and Applications (ECMFA-2012), July 2-5 (http://www2.imm.dtu.dk/conferences/ECMFA-2012) Deadline for submissions: April 16th, 2012 Notification: May 14th, 2012 Final Version: June 3rd, 2012 Cyber-physical systems are large-scale distributed systems, often viewed as networked embedded systems, where a large number of computational components are deployed in a physical environment. Each component collects information about and offers services to its environment. This information is processed either at the component, in the network or at a remote location, or in any combination of these. This workshop aims at connecting researchers working on mathematically well-founded and coherent models, methods, and tools that may serve as the foundation of a model-driven design methodology for cyber-physical systems. This means that design decisions, analysis, simulation, testing, code generation, etc. are always based upon models that reflect the relevant aspects of the design. This requires methods to maintain, manipulate, analyse and transform models in a coherent and meaningful way. All papers will be peer-reviewed and accepted papers will be published as a pre-proceeding appearing as a technical report and archived at CEUR (http://ceur-ws.org/). Selected papers will be invited to submission for subsequent publication in a journal (to be negotiated). Two kinds of papers can be submitted: 1. full papers up to 12 pages in easychair format presenting previously unpublished work 2. short papers (2-3) pages in easychair format presenting work in progress, abstract of previously published work or overview of research programmes (position paper) Papers should be submitted via Easychair (http://www.easychair.org/conferences/?conf=ecmfa-workshops2012) Topics of interest (in no particular order) include: * adaptivity * hybrid systems * embedded systems * distributed execution * spatial computation * declarative modelling * logics and logical frameworks * categorical models * event-based systems and models * context-awareness * pervasive computing * systems biology * healthcare systems * process calculi * static analysis * type systems * model checking * refinement * temporal properties with preferences * security * fractionated software Programme Committee: * Dieter Gollmann, Hamburg-Harburg * Thomas Hildebrandt (chair, organizer), IT University of Copenhagen * Marta Kwiatkowska, Oxford University * Flemming Nielson (organizer), Danish Technical University * Paulo Tabuada, University of California at Los Angeles * Mark-Oliver Stehr, SRI International * Huibiao Zhu, East China Normal University Logistics Travel, accommodation and registration information is available on the main ECMFA 2012 site (http://www2.imm.dtu.dk/conferences/ECMFA-2012/) Papers will only be published if at least one of its authors has registered for the workshop or for ECMFA as a whole by the time the final versions of papers are due. -------------- next part -------------- An HTML attachment was scrubbed... URL: From bmuller at glam.ac.uk Tue Mar 20 10:07:06 2012 From: bmuller at glam.ac.uk (Muller B (AT)) Date: Tue, 20 Mar 2012 14:07:06 +0000 Subject: [TYPES/announce] LAM'12 (Logics, Agents, and Mobility) extended deadlines Message-ID: Dear all, The deadlines for LAM'12 have been amended to be in line with the other workshops hosted at Petri Nets 2012 in Hamburg, Germany. THE NEW DEADLINES ARE: Submission: 15 April 2012 Notification of acceptance: 13 May 2012 Final version of papers: 1 June 2012 Please find the full Call for Papers below. Regards, Berndt. *** CALL FOR PAPERS *** 5th International Workshop on LOGICS, AGENTS, and MOBILITY (LAM?12), 25 or 26 June 2012, Hamburg, Germany, organised as satellite workshop at the 33rd Conference on Theory and Application of Petri Nets and Concurrency. *** NEWS: Submission Deadline is now 15 April 2012 *** NEWS: Julia Padberg will give an invited talk *** *** NEWS: LAM journal edition to be published this year *** Organisers: Berndt ?Bertie? M?ller (Farwer), University of Glamorgan Michael K?hler-Bussmeier, University of Hamburg Workshop Homepage: http://lam12.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 that can be used to describe and analyse dynamic or mobile systems. The main focus is on the field of logics and calculi for mobile agents, and multi-agent systems, but contributions in the area of modelling and implemantation of location-based, or resource-based applications are equally welcome. Many notions used in the theory of agents are derived from philosophy, logics, and linguistics (belief, desire, intention, speech act, etc.), and interdisciplinary discourse has proved fruitful for the advance of this domain. The workshop intends to encourage discussion and work across the boundaries of the traditional disciplines. Outside of academia, distributed systems are a reality and agent programming is beginning to establish itself as a serious contender amongst more traditional programming paradigms. For example, the deployment of large-scale pervasive infrastructures (mobile ad-hoc networks, mobile devices, RFIDs, etc.) raises a number of challenges for the modelling and programming of large-scale, open and highly-dynamic distributed systems. Logics and type systems with temporal or other kinds of modalities (e.g., relating to location, resource and/or security-awareness) play a central role in the semantic characterisation and verification of mobile agent systems. Recently, logics have handling some of these aspects have been introduced, but many open problems and research questions remain to be answered. The workshop is intended to showcase results and current work in the areas outlined above with a focus on logics and other formalisms assisting the specification, implementation, and verification of dynamic, mobile systems. * Scope of Interest * The main topics of interest include - specification and reasoning about agents, MAS, and mobile systems - modal and temporal logics - model-checking - treatment of location and resources in logics - location-based computation and planning (mobile apps, games, etc.) - security - 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 * Format of the Workshop * The workshop will be held as a one day event after the main conference. 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 * Julia Padberg (title of talk TBA) * Submission details * Authors are invited to submit 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?12 workshop. Submissions 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=lam12 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 * Submission Deadline: 15 April 2012 Notification of acceptance/rejection: 13 May 2012 Final version of papers due: 1 June 2012 Workshop: 25/26 June 2012 _______________________________________________ agents mailing list agents at cs.umbc.edu http://lists.cs.umbc.edu/mailman/listinfo/agents From H.W.Loidl at hw.ac.uk Tue Mar 20 11:10:07 2012 From: H.W.Loidl at hw.ac.uk (Hans-Wolfgang Loidl) Date: Tue, 20 Mar 2012 15:10:07 +0000 Subject: [TYPES/announce] Final CFP: TFP12, Trends in Functional Programming 2012, St Andrews, U.K., June 12-14, 2012 Message-ID: <20120320151007.1a262dc2@hw.ac.uk> [In short: submissions of papers & ext'd abstracts by March 26th; registration by April 11th; TFP12 symposium June 12-14th; Apologies for multiple copies of this call -- HWL ] FINAL CALL FOR PAPERS 13th International Symposium Trends in Functional Programming 2012 St Andrews, U.K. June 12-14, 2012 http://www.tifp.org/TFP12.html 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 2012 will be the main event of a week of functional programming extravaganza at the University of St Andrews. The week will start with the International Workshop on Trends in Functional Programming in Education, followed by TFP, followed by a workshop on 75 years of Lambda Calculus, an Erlang day, and a technical workshop on Patterns for MultiCores (ParaPhrase/Release projects). 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, and in Madrid (Spain) in 2011. 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 . 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 2012 program chair, Hans-Wolfgang Loidl, at tfp12 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 peer review 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 2012 website. Paper submission is done through TFP12's easychair page: https://www.easychair.org/conferences/?conf=tfp12 Important dates (2012): Full papers/extended abstracts submission: March 26th Notification of acceptance for presentation: April 4th Early registration deadline: April 11th Camera ready for draft proceeding: May 28th 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 two instances of TFP have been published as LNCS 6546 (TFP10) and LNCS 7193 (TFP11). 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 (2012): TFP 2012 Symposium: June 12-14th Student papers feedback: June 22nd Submission for formal review: July 9th Notification of acceptance for LNCS: September 17th Camera ready paper: October 15th REGISTRATION Registration for TFP12, 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 of April 11th, 2012. http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&compid=1 TFP 2012 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Symposium Organization Chair: Kevin Hammond, University of St. Andrews, UK Local Arrangements: Edwin Brady, Vladimir Janjic, University of St. Andrews, UK TFP 2012 PROGRAMME COMMITTEE Peter Achten, Radboud University Nijmegen, The Netherlands Jost Berthold, University of Copenhagen, Denmark Edwin Brady, University of St. Andrews, U.K. Matthias Blume, Google, U.S.A. Clemens Grelck, University of Amsterdam, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Graham Hutton, University of Nottingham, U.K Patricia Johann, University of Strathclyde, U.K. Hans-Wolfgang Loidl (PC Chair), Heriot-Watt University, U.K. Jay McCarthy, Brigham Young University, Utah, U.S.A. Rex Page, University of Oklahoma, U.S.A. Ricardo Pe?a, Complutense University of Madrid, Spain Kostis Sagonas, Uppsala University, Sweden Manuel Serrano, INRIA Sophia Antipolis, France Mary Sheeran, Chalmers, Sweden Nikhil Swamy, Microsoft Research, Redmond, U.S.A. Phil Trinder, Heriot-Watt University, U.K. Wim A Vanderbauwhede, University of Glasgow, U.K. Marko van Eekelen, Radboud University Nijmegen, The Netherlands David Van Horn, Northeastern University, U.S.A. Malcolm Wallace, Standard Chartered, U.K. Vikt?ria Zs?k, E?tv?s Lor?nd University, Hungary SPONSORS TFP 2012 is sponsored by Erlang Solutions Ltd. and the Scottish Informatics and Computer Science Alliance (SICSA). INVITED SPEAKER In this instance of TFP, an invited talk will be given by David A Turner, Professor emeritus at Middlesex University and at the University of Kent, inventor of Miranda, KRC and SASL. Prof Turner will be talking on the history of functional programming languages. LINKS Main TFP12 page: http://www.tifp.org/TFP12.html TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp12 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&compid=1 Facebook page: http://www.facebook.com/pages/TFP-Symposium-Series-on-Trends-in-Functional-Programming/118379188198725 -- Hans-Wolfgang Loidl School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Scotland, U.K. From bcpierce at cis.upenn.edu Tue Mar 20 11:46:55 2012 From: bcpierce at cis.upenn.edu (Pierce Benjamin C.) Date: Tue, 20 Mar 2012 11:46:55 -0400 Subject: [TYPES/announce] Oregon Programming Languages Summer School (with lecturers and topics) In-Reply-To: <20110114212852.GA26366@seas.upenn.edu> References: <20110114212852.GA26366@seas.upenn.edu> Message-ID: <6430979F-BC17-495D-BBEA-313A9658FF3A@cis.upenn.edu> This year's Oregon PL Summer School will take place from the 16th to the 28th of July. 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. This year's speakers and topics include: Logical relations Amal Ahmed, Northeastern University Category theory foundations Steve Awodey, Carnegie Mellon University Proofs as processes Robert Constable, Cornell University Polarization and focalization Pierre-Louis Curien, CNRS - Paris 7 University - INRIA Type theory foundations Robert Harper, Carnegie Mellon University Monads and all that John Hughes, Chalmers University and Quviq Compiler verification Xavier Leroy, INRIA Language-based security Andrew Myers, Cornell University Proof theory foundations Frank Pfenning, Carnegie Mellon University Software foundations in Coq Benjamin Pierce, University of Pennsylvania We hope you can join us for this excellent program! Zena Ariola Robert Constable Benjamin Pierce OPLSS 2012 organizers From adamc at csail.mit.edu Tue Mar 20 13:15:06 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Tue, 20 Mar 2012 13:15:06 -0400 Subject: [TYPES/announce] Call for papers: LFMTP'12 (colocated with ICFP'12) Message-ID: <4F68BB1A.10407@csail.mit.edu> ============================================================= Seventh International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'12) http://people.csail.mit.edu/adamc/lfmtp12/ Copenhagen, Denmark, September 9, 2012 Affiliated with the International Conference on Functional Programming (ICFP'12) CALL FOR PAPERS ------------------------------------------------------------- IMPORTANT DATES Paper submission: May 1, 2012 Author notification: June 1, 2012 Final versions due: June 21, 2012 Workshop day: September 9, 2012 ------------------------------------------------------------- Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their use in reasoning tasks ranging from the correctness of software to the properties of formal computational systems on the other hand have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressivity and lucidity of the reasoning process. The broad subject areas of LFMTP'12 are: * Encoding and reasoning about the meta-theory of programming languages and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Submission and other details concerning the workshop can be found at its website at http://people.csail.mit.edu/adamc/lfmtp12/. Program Committee: Nick Benton (Microsoft Research) Adam Chlipala (MIT, co-chair) Nils Anders Danielsson (Chalmers University) Elsa Gunter (University of Illinois, Urbana-Champaign) Daniel R. Licata (Carnegie Mellon University) Dale Miller (INRIA) Frank Pfenning (Carnegie Mellon University) Carsten Sch?rmann (IT University of Copenhagen, co-chair) Matthieu Sozeau (INRIA) From palmgren at math.su.se Tue Mar 20 17:29:37 2012 From: palmgren at math.su.se (Erik Palmgren) Date: Tue, 20 Mar 2012 22:29:37 +0100 Subject: [TYPES/announce] Second Announcement and CFP: 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK Message-ID: <9D073F0D-DC30-4E1F-A241-A0C164068B39@math.su.se> 8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK Second Announcement and Call for Papers The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner, Denmark, 20-21 August 2012. After a gap of fifteen years, the Scandinavian Logic Symposium is back. The Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS, http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark. As with previous editions of this conference, the aim of the programme is to reflect current activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic countries and Northwestern Russia will take the opportunity to contribute a talk and to meet with fellow logicians from the area. But needless to say, we also extend a warm welcome to logicians from further afield and plan to present a varied and interesting collection of invited and contributed talks. TOPICS The scope of SLS 2012 is broad, ranging over the whole area of mathematical and philosophical logic, and logical methods in computer science. Suitable topics include (but are not limited to): Proof Theory and Constructivism Model Theory (including Finite Model Theory) Set Theory Computability Theory Categorical Logic Logic and Provability Logic and Computer Science Logic and Linguistics Modal, Hybrid, Temporal, and Description Logic Logics of Games, Dynamics and Interaction Philosophy of Mathematics Philosophy of Computation Philosophy of Logic Philosophical Logic PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA: 7th Scandinavian Logic Symposium: Uppsala in 1996 6th Scandinavian Logic Symposium: Telemark in 1982 5th Scandinavian Logic Symposium: Aalborg in 1979 4th Scandinavian Logic Symposium: Jyv?skyl? in 1976 3rd Scandinavian Logic Symposium: Uppsala in 1973 2nd Scandinavian Logic Symposium: Oslo in 1971 1st Scandinavian Logic Symposium: ?bo in 1968 The proceedings of several of these meetings have been published in book form. INVITED SPEAKERS The Program Committee is delighted to announce the names of the four invited speakers: Nikolaj Bjorner Rosalie Iemhoff (sponsored by The Danish Network for the History and Philosophy of Mathematics) Per Martin-L?f Boban Velickovic SLS TUTORIALS On August 22nd, the day after the symposium finishes, a number of tutorials for PhD-students (or anyone else who is interested) will be given. These are intended to start from a relatively elementary level and lead on to current research problems. The following tutorial lectures have been confirmed so far: Lars Kristiansen - "Honest subrecursive degree theory" Sara Negri - "Labelled proof systems for modal logic" M. H. S?rensen - "Curry-Howard Isomorphism" RELATED EVENTS: Also note that Advances in Modal Logic (AiML) will be held on 22-25 August 2012, Copenhagen, Denmark. URL: http://hylocore.ruc.dk/aiml2012/ PROGRAM COMMITTEE Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm) Members: Torben Brauner (Roskilde) Peter Dybjer (Chalmers) Lars Kristiansen (Oslo) ?ystein Linnebo (Birkbeck) Sara Negri (Helsinki) Dag Normann (Oslo) Asger T?rnquist, (Vienna) Jouko V??n?nen (Helsinki) ORGANISING COMMITTEE Patrick Blackburn (RUC), Klaus Frovin J?rgensen (RUC), Stig Andur Petersen (RUC) SUBMISSIONS Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system https://www.easychair.org/conferences/?conf=sls2012 The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format. LOCATION Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from Central Copenhagen, and five minutes by train from Roskilde. ACCOMMODATION Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most conference attendees will book hotels in central Copenhagen, where there are many hotels in many price ranges. Hotel accommodation can also be found in Roskilde, though there the options are more limited. REGISTRATION The conference website will be found at: http://scandinavianlogic.weebly.com/ Details concerning registration will be posted there in due course. -------------- next part -------------- An HTML attachment was scrubbed... URL: From vs at ecs.soton.ac.uk Tue Mar 20 19:41:54 2012 From: vs at ecs.soton.ac.uk (Vladimiro Sassone) Date: Tue, 20 Mar 2012 23:41:54 +0000 Subject: [TYPES/announce] MFCS 2012: Call for papers References: <3311F61A-8842-4027-8C76-D1F477A37D38@ecs.soton.ac.uk> Message-ID: CALL FOR PAPERS - MFCS 2012 August 27 - 31, 2012, Bratislava, Slovakia www.mfcs.sk The series of MFCS symposia, organized in rotation by Poland, Slovakia, and the Czech Republic since 1972, has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together researchers who do not usually meet at specialized conferences. ====================================== IMPORTANT DATES Submission deadline: April 20, 2012 Acceptance notification: June 5, 2012 Final version: June 17, 2012 Conference: August 27 - 31, 2012 ====================================== INVITED SPEAKERS Georg Gottlob (U. Oxford) Rolf Niedermeier (TU Berlin) Antonino Salibra (U. Venice) Nicole Schweikardt (Goethe U. Frankfurt) Esko Ukkonen (U. Helsinki) Igor Walukiewicz (U. Bordeaux) Gerhard J. Woeginger (TU Eindhoven) Mihalis Yannakakis (Columbia U.) ======================================== MORE INFO at www.mfcs.sk ======================================== From carsten at itu.dk Wed Mar 21 04:38:04 2012 From: carsten at itu.dk (=?iso-8859-1?Q?Carsten_Sch=FCrmann?=) Date: Wed, 21 Mar 2012 09:38:04 +0100 Subject: [TYPES/announce] Open DemTech PhD positions @ ITU Message-ID: IT University seeks candidates for open PhD positions in the DemTech project. DemTech invites applications for several PhD positions on developing and evaluating trustworthy electronic election technology. A successful applicant will conduct research for example, on formal specification and verification of software to hold machines accountable for their actions, how to build domain specific proof assistants to assist this task, how to run trusted code in untrusted environments, how to develop software in a trust-preserving way, or to evaluate technology form a societal point of view. Expected start date of employment: September 1st, 2012. Deadline for applications is: April 16, 2012 at 12.00 Copenhagen time. The deadline is strict. Applicants should have a strong background and interest in some combination of the following areas of computer science: cryptography, formal methods, information security, logical frameworks, programming and specification languages, security protocol design, software engineering, and verification. As a PhD student you will be part of a vibrant research environment here at ITU with many international collaborations in computer and social science. Early demonstration of interest strongly encouraged. Please contact Carsten Schuermann (carsten at demtech.dk) or Joseph Kiniry (kiniry at demtech.dk) The application process is electronic and a part of the general call at ITU, together with scholarships in other projects. Please see: https://delta.hr-manager.net/ApplicationInit.aspx?ProjectId=109051&DepartmentId=3439&MediaId=1282 or http://www.itu.dk/en/Forskning/Phd-uddannelsen/Calls-2012 There you can also find contact points regarding administrative matters in the application process. Best regards, -- Joseph Kiniry and Carsten Schuermann -------------- next part -------------- An HTML attachment was scrubbed... URL: From pangjun at gmail.com Wed Mar 21 07:02:38 2012 From: pangjun at gmail.com (Jun PANG) Date: Wed, 21 Mar 2012 12:02:38 +0100 Subject: [TYPES/announce] ICTAC'12: Final Call For Papers Message-ID: Call for Papers ICTAC 2012 9th International Colloquium on Theoretical Aspects of Computing URL: http://www.iiitb.ac.in/ictac 24 - 27 September 2012, Bangalore, India ------------------------------------------------- The Colloquium will be held at the International Institute of Information Technology (IIIT), which is located in Electronics City of Bangalore. It is two hours by car from Bangalore International Airport (transport from airport will be provided to conference participants). Bangalore is internationally known as the Silicon Valley of the East with many hi-tech companies and research labs. Holding the conference in the Electronics City of Bangalore gives the conference participants valuable opportunity to discuss and network with the software practitioners and researchers in India?s Information Technology (IT) hub. This will be further facilitated via an Industry Day, a special feature of ICTAC 2012. ------------------------------------------------- SUBMISSION DEADLINES Regular and Short Paper submission deadline: 16 April 2012 ------------------------------------------------- BACKGROUND ICTAC 2012 is the 9th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2012 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. TOPICS The topics of the conference include, but are not limited to: * automata theory and formal languages; * principles and semantics of programming languages; * logics and their applications; * software architectures and their description languages; * relationship between software requirements, models and code; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented architectures: models and development methods; * models of concurrency, security, and mobility; * theory of parallel, distributed, grid and cloud computing; * real-time, embedded, hybrid and cyber-physical systems; * type and category theory in computer science; * models for learning and education; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. INDUSTRY DAY ICTAC 2012 will feature an Industry Day, a special feature being introduced to the ICTAC colloquium for the first time. One of the days of the conference is planned to be marked as Industry Day. The industry day will feature technical talks from the industry participants. These talks will be drawn from the papers submitted and accepted to the conference; however any such paper must have at least one co-author from the Industry and must be clearly marked for ?Industry Day? during submission. In addition, we plan to have tool demonstrations and posters by the companies in the exhibition floor. Participants from academia will thus also get a chance to mingle with the industry participants in an informal atmosphere, thereby getting a flavor of the ongoing activities in Bangalore?s IT industry. Industry Day Co-chairs: Sriram Rajamani (Microsoft Research) Satish Chandra (IBM Research) KEYNOTE SPEAKERS * Gernot Heiser, UNSW (for Industry Day) * Luke Ong, Oxford * Ganesan Ramalingam, Microsoft Research PUBLICATION AND SUBMISSION The proceedings of ICTAC 2012 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2012 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be either Regular Papers or Short Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 15 pages and Short Papers should be between 4 and 8 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers shall be submitted at http://www.easychair.org/conferences/?conf=ictac2012 All queries should be sent to: ictac2012 at iist.unu.edu IMPORTANT DATES: Paper submission deadline: 16 April 2012 Paper Accept/Reject Notification: 8 June 2012 Final paper submission: 29 June 2012 PROGRAM COMMITTEE * Ana Cavalcanti, University of York, UK * Supratik Chakraborty, IIT Mumbai, India * Satish Chandra, IBM Watson, USA * Yifeng Chen, Peking University, China * Meenakshi D?Souza, IIIT Bangalore, India * Thao Dang, Verimag, France * Frank S. deBoer, CWI, Netherlands * Xinyu Feng, USTC, China * John Fitzgerald, University of Newcastle, UK * Susanne Graf, Verimag, France * Lindsay Groves, Victoria University, New Zealand * Zhenjiang Hu, NII, Japan * Lei Ju, Shandong University, China * Moonzoo Kim, KAIST, Korea * Daniel Kroening, Oxford University, UK * Kim G. Larsen, Aalborg University, Denmark * Martin Leucker, TU Munich, Germany * Zhiming Liu, UNU-IIST, Macau SAR, China * Kamal Lodaya, Inst. of Mathematical Sciences, India * Annabelle McIver Macquarie University, Australia * Madhavan Mukund, Chennai Mathematical Inst., India * Kedar Namjoshi, Bell Labs, USA * Jun Pang, Univ. of Luxembourg, Luxembourg * Sanjiva Prasad, IIT Delhi, India * Geguang Pu, ECNU, China * Zongyan Qiu, Peking University, China * Anders P. Ravn, Aalborg University, Denmark * Abhik Roychoudhury, National University of Singapore, Singapore (Chair) * Diptikalyan Saha, IBM Research, India * Augusto Sampaio, UFPE, Brazil * Bikram Sengupta, IBM Research, India * R.K. Shyamasundar, TIFR, India * Sofiene Tahar, Concordia University, Canada * Kapil Vaswani, Microsoft Research, India * Wang Yi, Uppsala University, Sweden * Naijun Zhan, Chinese Academy of Sciences, China * Jianjun Zhao, Shanghai Jiao Tong University, China ORGANISING COMMITTEE * Meenakshi D? Souza, IIIT-B (General Chair) * Jun Pang, Univ. of Luxembourg (Publicity Chair) * Deepak D?Souza, Indian Institute of Science * Sumesh Divakaran, IIIT-B. STEERING COMMITTEE * John Fitzgerald, UK * Martin Leucker, Germany * Zhiming Liu, Macau SAR China (Chair) * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK From alastair.donaldson at imperial.ac.uk Wed Mar 21 07:24:14 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Wed, 21 Mar 2012 11:24:14 +0000 Subject: [TYPES/announce] Final CfP: SPIN 2012 - 19th International Workshop on Model Checking Software In-Reply-To: <4F4E4F58.7090102@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> <4F4E4F58.7090102@imperial.ac.uk> Message-ID: <4F69BA5E.5080100@imperial.ac.uk> Apologies for multiple copies *** SPIN 2012: FINAL CALL FOR PAPERS *** 19th International Workshop on Model Checking Software - SPIN 2012 Oxford, July 23-24 2012 http://qav.cs.ox.ac.uk/spin2012/ IMPORTANT DATES - Submission of abstracts: 26 March AoE (Anywhere on Earth) - Submission of full papers: 30 March AoE (Anywhere on Earth) - Notification of acceptance/rejection: 7 May - Final version due: 14 May - Workshop: July 23-24 AIMS AND SCOPE The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. 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 workshop. 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 workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: - 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 modelling 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 workshop INVITED SPEAKERS - Tom Ball Microsoft Research - Andrey Rybalchenko TU Munich - Andreas Zeller Saarland University INVITED TUTORIAL - Cristian Cadar Imperial College London 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 an international journal (journal to be confirmed). 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 workshop 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 workshop website: http://qav.cs.ox.ac.uk/spin2012/ At least one author of each accepted paper must attend the workshop and present the paper. ORGANISATION Programme Chairs: - Alastair F. Donaldson, Imperial College London, UK - David Parker, University of Oxford, UK Local Arrangements Chair: - Michael Tautschnig, University of Oxford, UK Programme Committee: - Christel Baier (University of Dresden, Germany) - Dirk Beyer (University of Passau, Germany) - Dragan Bosnacki (Eindhoven University of Technology, Netherlands) - Alessandro Cimatti (Fondazione Bruno Kessler, IRST, Italy) - Alastair Donaldson (Imperial College London, UK) - Stefan Edelkamp (TZI University Bremen, Germany) - Alex Groce (Oregon State University, USA) - Gerard Holzmann (NASA/JPL, USA) - Radu Iosif (VERIMAG, CNRS, France) - Stefan Leue (University of Konstanz, Germany) - Eric Mercer (Brigham Young University, USA) - Alice Miller (University of Glasgow, UK) - Madanlal Musuvathi (Microsoft Research, Redmond, USA) - David Parker (University of Oxford, UK) - Corina Pasareanu (NASA Ames, USA) - Doron Peled (Bar Ilan University, Israel) - Jaco van de Pol (University of Twente, Netherlands) - Kees Pronk (Delft University of Technology, Netherlands) - Shaz Qadeer (Microsoft Research, Redmond, USA) - Alastair Reid (ARM, UK) - Tayssir Touili (LIAFA, CNRS, France) - Helmut Veith (Vienna University of Technology, Austria) - Thomas Wahl (Northeastern University, 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) SPONSORSHIP The SPIN 2012 workshop is generously sponsored by: - ARM (http://www.arm.com) - Codeplay (http://www.codeplay.com) - Microsoft Research (http://research.microsoft.com/en-us) - Monoidics (http://www.monoidics.com) From p.ohearn at ucl.ac.uk Thu Mar 22 09:10:27 2012 From: p.ohearn at ucl.ac.uk (Peter O'Hearn) Date: Thu, 22 Mar 2012 13:10:27 +0000 Subject: [TYPES/announce] Post Doctoral Research Associate: CREST Centre, Software Systems Engineering, UCL Message-ID: Post Doctoral Research Associate: CREST Centre, Software Systems Engineering, UCL Duties and Responsibilities Applications are invited for a Research Associate post on an EPSRC-funded grant in the CREST centre at UCL, working on the relationship between Program Analysis and Search Based Optimization. We seek a candidate with a track record in either of these two areas (Analysis or SBSE). We welcome applications from those with expertise in either of these two areas and a willingness to develop the growing research agenda that lies at the interface between the two. The post is graded as a Research Grade 7 the salary for which ranges from ?29,249 per annum to ?35,938 per annum (plus a further London Allowance of ?2,795). The closing date is 22 April 2012. The Research Environment The post will be situated in the CREST centre, which is part of the Software Systems, Engineering group (SSE) within the Department of Computer Science at UCL. The CREST centre at UCL builds on the three foundations of Program Dependence, Information Theory and Optimisation Algorithms. On these three foundations are developed ways to analyse, understand and improve software, with applications throughout the spectrum of software development activities. The centre recently received both platform (?1.2m, 2009-2014) and programme (?6.7m, 2012-2018) grants from the EPSRC and has other current funding from other funders such as the EU, AHRC and Royal Society as well as cash gifts from HP, Google and Motorola. CREST also hosts a series of monthly workshops, the CREST Open Workshop Programme (the COWs). As of March 2012, there has been a total of 575 registrations from 286 different attendees, who came to CREST from 134 institutions spread over 29 countries. As the CREST website shows, these workshops have hosted presentations from some of the world?s leading scientist in Software Engineers from both Industry and Academia. Talks are video recorded and archived along with slides and other resources on the CREST website at http://crest.cs.ucl.ac.uk/ CREST is part of the Software Systems Engineering at UCL, one of the world?s leading Software Engineering groups. The group has three former ICSE chairs and membership of many editorial boards and programme committees. Its work is highly cited and used by ABB, Daimler, Ericsson, Google, HP, IBM, Microsoft and Motorola. UCL itself was founded in 1826 and was one of the two founding colleges of the University of London in 1836. UCL is the 13th Most cited University in the world (based on data from 1999 to 2009) and the most cited in Europe. Its current and former staff include 26 Nobel Prize winners and 3 winners of the fields medal. It is consistently ranked in the top twenty Universities in the world according to a wide variety of University ranking systems. The post is funded for 12 months in the first instance. Over the period of the appointment we anticipate a number of further future posts will appear since the CREST centre and the department have funding for ambitious and exciting development. Key Requirements Candidates should hold a PhD in a relevant subject, or will shortly be assessed for a PhD level qualification. Publication in relevant leading peer reviewed conferences and/or journals is essential. Further Details http://www.ucl.ac.uk/hr/jobs/index.php (job vacancy no. 1241607). If you have any queries regarding the vacancy or the application process, please e-mail crest-admin at cs.ucl.ac.uk or telephone +44 (0)20 7679 0325. Informal enquiries about the post are very welcome. Contact Professor Mark Harman (Mark.Harman at ucl.ac.uk). From Aart.Middeldorp at uibk.ac.at Thu Mar 22 11:09:20 2012 From: Aart.Middeldorp at uibk.ac.at (Aart Middeldorp) Date: Thu, 22 Mar 2012 16:09:20 +0100 Subject: [TYPES/announce] 3 year postdoctoral research position in Innsbruck Message-ID: <4F6B40A0.1000006@uibk.ac.at> The Computational Logic research group is looking for a postdoctoral researcher in connection with the FWF (Austrian Science Fund) project "Constrained Rewriting and SMT: Emerging Trends in Rewriting". The project runs for 3 years starting from 1 May 2012. The project is an international project with partners in Vienna and several universities in Japan. The postdoctoral researcher is expected to collaborate with researchers at Vienna University of Technology, Nagoya University and JAIST. Candidates must hold a PhD degree in computer science or mathematics. A background in computational logic (term rewriting, complexity, constraints) is desired. Knowledge of German and Japanese is not essential. Salary is paid according to the FWF funding scheme for postdocs (40 hours) and amounts to approximately EUR 47,000 per year (gross). Applications (including CV and two references) must be send by email to Aart Middeldorp aart dot middeldorp at uibk dot ac dot at no later than 22 April 2012. Informal inquiries are welcome at the same email address. The city of Innsbruck, which hosted the Olympic Winter Games in 1964, 1976 and 2012 (YOG), is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living. Further information is available from the following links: Computational Logic: http://cl-informatik.uibk.ac.at/ Institute of Computer Science: http://informatik.uibk.ac.at/ University of Innsbruck: http://www.uibk.ac.at/ City of Innsbruck: http://www.innsbruck.at/ -------------- next part -------------- A non-text attachment was scrubbed... Name: Aart_Middeldorp.vcf Type: text/x-vcard Size: 293 bytes Desc: not available URL: From hammer at cs.uni-saarland.de Thu Mar 22 11:24:40 2012 From: hammer at cs.uni-saarland.de (Christian Hammer) Date: Thu, 22 Mar 2012 16:24:40 +0100 Subject: [TYPES/announce] JSTools'12: Call for Participation Message-ID: <92B57360-57C9-4856-ADF4-A2E74BD645D7@cs.uni-saarland.de> Call for Participation JSTools 2012, Tools for JavaScript Analysis co-located with ECOOP and PLDI URL: http://csl.cs.uni-saarland.de/jstools12/ 13 June 2012, Beijing, China --------------------------- The JSTools workshop at ECOOP 2012 brings together researchers focused on static and dynamic tools for understanding and analyzing JavaScript code. We encourage researchers in these fields to attend, and to consider presenting their own work. ------------------------------------------------- SUBMISSION DEADLINES Submission deadline: 9 April 2012 ------------------------------------------------- FOCUS JavaScript has become a central concern for both performance and quality of Web applications, due to its vital role in the Web platform; this vital role means that a JavaScript program is often tightly bound with the Web page that contains it and with rich browser APIs. Thus, while JavaScript is now a focus of many strands of research work?static and dynamic program analysis, refactoring, and security to name a few?there are several significant challenges to overcome before the programs themselves can be tackled: ? The program itself is an increasingly slippery concept. ? Even simple programs tend to be composed of multiple script tags in a Web page, some of which refer to external source files and some of which contain inline code. ? Code is commonly added with handlers attached to various Web page elements. Depending on the particular structure of these tags, the semantics of the induced program can differ. ? Code is often loaded dynamically into a Web, for instance by dynamically creating new script tags in the current page. ? Web pages increasingly use concurrency. While JavaScript itself is single-threaded, execution in modern browsers sometimes is not entirely so. Even when it is, asynchronous styles such as AJAX can introduce non-determinism as to when pieces of code execute. To further complicate matters, even the initial parsing of the Web page is often not atomic from the point of view of the code. ? JavaScript is an extraordinarily dynamic language, in which many features that more-commonly have a fixed meaning, such as the ?new? expression, are subject to very dynamic behaviors. Additionally, dynamic code creation with ?eval? may invalidate static analysis results. This adds challenges to constructing a traditional internal form for analysis and optimization purposes, since even a simple statement can have globally-dependent behavior. ? JavaScript has given rise to variants, some of which, such as Action- Script used to program Flash, are also popular. Additionally, the JavaScript specification itself is evolving. More immediately, JavaScript on the Web makes heavy use of frameworks such as jQuery, which implement a rather different programming paradigm in JavaScript. All of these layer additional analysis complexity on top of JavaScript. Various research and project groups have addressed these challenges, and there is a growing body of infrastructure that can be used and extended to tack JavaScript. In this workshop, we hope to bring the builders and interested consumers of such tooling together. We plan to have a focus on tooling that, at least to some extent, addresses these challenges in practical ways. We want a combined focus on the research challenges the tools address and also a tutorial-like introduction to their use. TENTATIVE SPEAKER LIST ? Julian Dolby, IBM ? Bruno Dufour, University of Montreal ? Christian Hammer, CISPA, Saarland University ? Mark S. Miller, Google ? Anders M?ller, Aarhus University ? Phu Phung, Chalmers ? Peter Thiemann, University of Freiburg ? Jan Vitek, Purdue ? Adam Welc, Adobe SUBMISSIONS We welcome any submissions of work in this field: you may submit a paper, an abstract for a talk, or a talk abstract together with a supporting position paper. To submit, please e-mail submissions by April 9th to the organizers (dolby at us.ibm.com, hammer at cs.uni-saarland.edu, mgowri at in.ibm.com). Papers will be published in an ACM proceedings; if desired, slides from talks will be put online on the workshop Web site, but talks can also be kept unpublished if that is preferred so as not to preclude future publications in workshops and conferences. There will not be a separate program committee to review attendee submissions; the organizing committee will referee submissions for relevance, as we are looking for ongoing work more than finished research projects. ORGANIZERS Julian Dolby, IBM Thomas J. Watson Research Center, USA Chrisitan Hammer, CISPA, Saarland University, Germany Mangala Gowri, IBM Research, India -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 4860 bytes Desc: not available URL: From agoodloe at gmail.com Thu Mar 22 13:44:39 2012 From: agoodloe at gmail.com (Alwyn Goodloe) Date: Thu, 22 Mar 2012 13:44:39 -0400 Subject: [TYPES/announce] Job openings Message-ID: Two new opportunities for civil servant positions at NASA that might interest the types community. The candidate should be interested in reasoning rigorously about safety of civil aviation and space systems. The group has a history of applying interactive theorem proving, model checking, SMT solvers to verify safety of complex systems. Note that by safety we usually do not mean code level safety properties such as absence of buffer overflows, but system level safety such as aircraft x and y maintain safe level of separation. If interested, please go through USA Jobs - the website for federal jobs. *http://www.usajobs.gov/GetJob/ViewDetails/311977600 * *http://www.usajobs.gov/GetJob/ViewDetails/311978000 * The grade level is within the range of GS 11 - GS 13. A person's education and experience will determine where within this range they fall. Given that these are civil service positions, US Citizenship is required for both openings. -- Alwyn E. Goodloe, Ph.D. agoodloe at gmail.com Research Computer Engineer NASA Langley Research Center -------------- next part -------------- An HTML attachment was scrubbed... URL: From fairouz at cedar-forest.org Fri Mar 23 08:41:26 2012 From: fairouz at cedar-forest.org (Fairouz Kamareddine) Date: Fri, 23 Mar 2012 12:41:26 +0000 Subject: [TYPES/announce] Call for papers for the International Symposium on SCSS 2012 Message-ID: <4F6C6F76.9080201@cedar-forest.org> ----------------------------------------------------------- | CALL FOR PAPERS | CALL FOR PAPERS | CALL FOR PAPERS | ----------------------------------------------------------- SCSS 2012 http://www.cedar-forest.org/forest/events/scss2012/call.html International Symposium on Symbolic Computation in Software Science, December 15-17 2012 Gammarth, Tunisia Symbolic computation is the science of computing with symbolic objects (terms, formulae, programs, algebraic objects, geometrical objects, etc). Powerful symbolic algorithms have been developed during the past decades and have played an influential role in theorem proving, automated reasoning, software verification, model checking, rewriting, formalisation of mathematics, network security, Groebner bases, characteristic sets, etc. The international Symposium on "Symbolic Computation in Software Science" is the fourth in the SCSS workshop series. SCSS 2008 and 2010took place at the Research Institute for Symbolic Computation (RISC), Hagenberg, Austria, and, SCSS 2009 took place in Gammarth, Tunisia. These symposium grew out of internal workshops that bring together researchers from SCORE (Symbolic Computation Research Group) at the University of Tsukuba, Japan, Theorema Group at the Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria, SSFG (Software Science Foundation Group) at Kyoto University, Japan, and Sup'Com (Higher School of Communication of Tunis) at the University of Carthage, Tunisia. These workshops have been successful and in this new edition, we would like to extend the range of symbolic computation methods in their applications. In this symposium, we solicit papers on all aspects of symbolic computations and their applications. 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 and/or complexity analysis of algorithms/programs *extraction of specifications from algorithms *theorem proving methods and techniques *proof-carrying code *generation of inductive assertion for algorithm (programs) *algorithm (program) transformations *formalisation and computerisation of knowledge (maths, medicine, economy, etc.) *component-based programming *computational origami *query languages (in particular for XML documents) *semantic web and cloud computing SOFTWARE DEMO: SCSS 2012 will provide an opportunity for developers of software related to symbolic computation, to promote their software systems. SCSS 2012 will have a special session for software systems descriptions where authors can present their projects and demonstrate their software. Submission in this category of software demo should have a link to project pages and ideally a downloadable software. PAPER SUBMISSION: Submissions for full papers must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. Shorter papers, associated with system descriptions are welcome. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers will be reviewed and evaluated with respect to relevance, clarity, quality, originality, and impact. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. 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). Papers must be submitted electronically at the relevant area for SCSS12 on easyChair. A title and single-paragraph abstract should be submitted by June 15, and the full paper by June 21 (firm date). Notifications are expected by September 1, and final papers for the proceedings will be due by October 1 (firm date). PROCEEDINGS: The proceedings of SCSS 2012, will be published in advance of the meeting as a volume in either Electronic Notes in Theoretical Computer Science (ENTCS) or the British Computer Society's Electronic Workshops in Computing eWIC. After the Symposium, authors will be invited to submit a full version of their article for a special issue of the Journal of Symbolic Computation on SCSS 2012. These articles will be subjected to the normal peer review process of the Journal of Symbolic Computation. INVITED SPEAKERS: Gerad Huet (France) Kazuhiro Yokoyama (Japan) IMPORTANTS DATES: June 15, 2012: Paper title and abstract deadline June 21, 2012: Full paper deadline (firm) September 1, 2012: Author notification October 1, 2012: Final version deadline (firm) December 15-17, 2012: Symposium Honorary Chairs Prof. Nobuhiro Yamada (President of the University of Tsukuba, Japan) Prof. Lassaad El Asmi (President of the University of Carthage, Tunisia) General Chairs Prof. Adel Bouhoula (University of Carthage, Tunisia) Prof. Tetsuo Ida (University of Tsukuba, Japan) Programme Chair Prof. Fairouz Kamareddine (Heriot-Watt University, Edinburgh, UK) Local Organisation Chair Dr. Mohamed Becha Kaaniche (University of Carthage, Tunisia) Programme Committee Members Anas Abou El Kalam (Morocco) Serge Autexier (Germany) Mauricio Ayala-Rincon (Brazil) Henda Ben Ghezala (Tunisia) Iliano Cervesato (Qatar) Veronique Cortier (France) Mariangiola Dezani (Italy) Sihem Guemara (Tunisia) Sylvia Ghilezan (Serbia) Ahmed Hadj Kacem (Tunisia) Therese Hardin (France) Mohamed Jmail (Tunisia) Tudor Jebelean (Austria) Fairouz Kamareddine (UK) (chair) Temur Kutsia (Austria) Manuel Maarek (France) Mohammed Mezghiche (Algeria) Greg Michaelson (UK) Aart Middledorop (Austria) Ali Mili (USA) Yasuhiko Minamide (Japan) Mohammed Mosbah (France) Flavio de Moura (Brazil) Valeria de Paiva (USA) Riadh Robbana (Tunisia) Michael Rusinowitch (France) Amr Sabry (USA) Masahiko Sato (Japan) Yahya Slimani (Tunisia) Sofiene Tahar (Canada) Local Organising Committee Ryma Abassi (Tunisia) Mohamed Becha Kaaniche (Tunisia) (chair) Nizar Ben Neji (Tunisia) Nihel Ben Youssef (Tunisia) Hanen Boussi (Tunisia) Fadoua Ghourabi (Japan) Faten Labbene Ayachi (Tunisia) Oussama Mahjoub (Tunisia) We look forward to seeing you in beautiful Tunisia. From melvin.fitting at gmail.com Sat Mar 24 19:52:32 2012 From: melvin.fitting at gmail.com (Melvin Fitting) Date: Sat, 24 Mar 2012 19:52:32 -0400 Subject: [TYPES/announce] Conference on the Constructive in Logic Message-ID: Several talks at the conference announced below involve type theory either directly or implicitly, and so it is called to the attention of those on this list. CONFERENCE ANNOUNCEMENT AND CALL FOR PARTICIPATION THE CONSTRUCTIVE IN LOGIC AND APPLICATIONS. A 60TH BIRTHDAY CELEBRATION HONORING SERGEI ARTEMOV May 23?25, 2012, in the CUNY Graduate Center, 365 Fifth Avenue, New York City. ____________________ Constructivity is fundamental to the application of mathematics to the real world, whether in the exact sciences, the social sciences, or engineering. Constructive logics supporting this tradition have flourished over the last century. This conference is a celebration of the past and future of the constructive tradition. Distinguished logician Sergei Artemov is 60. He has made fundamental contributions exploring constructivity in logic, computer science, epistemology, game theory, and other areas. With this conference we honor his work, and by extension a subject whose content he has elucidated and whose boundaries he has expanded. ____________________ Scientific Committee: Anil Nerode (Cornell) and Melvin Fitting (CUNY) Web page: ConstructivityAtCUNY.com. Participants are invited to register, the registration is free. Contact email: Info at ConstructivityAtCUNY.com. Preliminary Program: May 23, talks from 9.00am - 5pm, followed by a wine and cheese party and a piano recital by Harvey Friedman. May 24, talks from 9:00am - 5:00pm, followed by the conference dinner. May 25, talks from 9:00am - 4:00pm. The confirmed speakers are: Arnon Avron (Tel Aviv University) Adam Brandenburger (New York University) Sam Buss (University of California San Diego) Robert Constable (Cornell University) Solomon Feferman (Stanford University) Melvin Fitting (City University of New York) Harvey Friedman (Ohio State University) Haim Gaifman (Columbia University) Dexter Kozen (Cornell University) Victor Marek (University of Kentucky) Robert Milnikel (Kenyon College) Joan Moschivakis (University of California Los Angeles) Yiannis Moschovakis (University of California Los Angeles) Pavel Naumov (McDaniel College) Anil Nerode (Cornell University) Rohit Parikh (City University of New York) Vaughan Pratt (Stanford University) Jeff Remmel (University of California San Diego) Bryan Renne (University of Amsterdam) Gerald Sacks (Harvard University /Massachusetts Institute of Technology) Andre Scedrov (University of Pennsylvania) Johan van Benthem (University of Amsterdam/Stanford University) From hamana at cs.gunma-u.ac.jp Mon Mar 26 10:48:14 2012 From: hamana at cs.gunma-u.ac.jp (Makoto Hamana) Date: Mon, 26 Mar 2012 23:48:14 +0900 (JST) Subject: [TYPES/announce] Final CFP: HOR'12 - extend deadline: March 29, 2012 Message-ID: <20120326144814.EDCC158DC5B@vc2.tech.gunma-u.ac.jp> ===================================================================== Final Call for Papers 6th International Workshop on Higher-Order Rewriting HOR 2012 June 2, 2012, Nagoya, Japan Colocated with RTA'12 http://www.cs.gunma-u.ac.jp/events/hor/ ====================================================================== HOR is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. The following is a non-exhaustive list of topics for the workshop: * Applications: proof checking, type checking, theorem proving, functional programming, declarative programming, program transformation, using some notions of higher-order rewriting. * Foundations: pattern matching, unification, strategies, termination, syntactic properties, type theory, for higher-order rewriting. * Frameworks: graph rewriting, net rewriting, comparisons of different formats. * Implementation: explicit substitution, rewriting tools, compilation techniques. * Semantics: semantics of higher-order rewriting, higher-order abstract syntax, categorical rewriting. Important dates --------------- Paper submission: ** EXTENDED: March 29, 2012 23:00 (GMT) ** Notification: April 20, 2012 Final version: May 10, 2012 Workshop: June 2, 2012 Invited speakers ---------------- * Zhenjiang Hu (National Institute of Informatics, Japan) Can Graph Transformation be Bidirectionalized? -- Bidirectional Semantics of Structural Recursion on Graphs -- * Another speaker to be announced Submissions ----------- Two categories of papers are solicited: - Category A: Extended abstracts of new results, describing work in progress, or problems in higher-order rewriting. - Category B: Short versions of recently published or submitted elsewhere articles on higher-order rewriting. Papers in this category are for presentation only, and not considered as candidates for the post-workshop proceedings. Papers in both categories should be between 2 and 5 pages, and should note the category (either A or B). Papers are formatted according to EPTCS style, and submitted electronically via the EasyChair submission website. Papers will be judged on relevance, originality, correctness and usefulness. Please address your questions to the PC chair: hamana at cs.gunma-u.ac.jp. Proceedings ----------- The proceedings of HOR 2012 will be made available on the HOR 2012 web page, and a printed version will be distributed at the workshop. Post-workshop proceedings of extended abstracts of selected contributions is planned to be published as a volume of EPTCS. Program Committee ------------------- Andreas Abel (Ludwig-Maximilians-University Munich, Germany) Frederic Blanqui (INRIA, France) Makoto Hamana (Gunma University, Japan) (chair) Stefan Kahrs (University of Kent, UK) Fer-Jan de Vries (University of Leicester, UK) Program and Organizing Chair ---------------------------- Makoto Hamana (Gunma University, Japan) From georg.moser at uibk.ac.at Mon Mar 26 16:50:54 2012 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 26 Mar 2012 22:50:54 +0200 Subject: [TYPES/announce] Call for Participation: RTA 2012 Message-ID: <4F70D6AE.1000604@uibk.ac.at> +===================================================================+ | | | CALL FOR PARTICIPATION | | | | International Conference on Rewriting Techniques and Applications | | | | RTA 2012 | | | | May 30 - June 1, 2012 | | Nagoya, Japan | | | | http://rta2012.trs.cm.is.nagoya-u.ac.jp/ | | | +===================================================================+ --------------------------------------------------------------------- -- REGISTRATION -- --------------------------------------------------------------------- For online registration visit: https://apollon.nta.co.jp/rta2012/ * Early registration closes on April 25 JST(GMT+9). * Online registration closes on May 9 JST(GMT+9). --------------------------------------------------------------------- -- ABOUT RTA -- --------------------------------------------------------------------- RTA 2012 is the 23rd International Conference on Rewriting Techniques and Applications, collocated with five satellite workshops, IFIP WG 1.6, IWC, WFLP, HOR and TTATT. --------------------------------------------------------------------- -- CONFERENCE VENUE -- --------------------------------------------------------------------- Noyori Memorial Hall, Higashiyama Campus of Nagoya University --------------------------------------------------------------------- -- RTA 2012 INVITED SPEAKERS -- --------------------------------------------------------------------- * Hirokazu Anai (FUJITSU LABORATORIES LTD / Kyushu University) * Claude Kirchner (INRIA & LORIA) * Sebastian Maneth (NICTA & University of New South Wales) --------------------------------------------------------------------- -- WORKSHOPS -- --------------------------------------------------------------------- * IFIP WG 1.6 IFIP Working Group 1.6 on Term Rewriting * IWC 1st International Workshop on Confluence * WFLP 21st International Workshop on Functional and (Constraint) Logic Programming * HOR 6th International Workshop on Higher-Order Rewriting * TTATT 1st International Workshop on Trends in Tree Automata and Tree Transducers --------------------------------------------------------------------- -- SCHEDULE -- --------------------------------------------------------------------- * May 28 IFIP WG 1.6 * May 29 IWC, WFLP * May 30 - June 1 RTA * June 2 HOR, TTATT --------------------------------------------------------------------- -- ASSOCIATED EVENTS -- --------------------------------------------------------------------- FLOPS 2012 11th International Symposium on Functional and Logic Programming May 23 - 25, Kobe, Japan http://www.org.kobe-u.ac.jp/flops2012/ * It takes about 70 minutes to go from Nagoya to Kobe by Shinkansen. --------------------------------------------------------------------- -- HOST CITY: NAGOYA, JAPAN -- --------------------------------------------------------------------- Nagoya is located at the center of Honshu (the main island of Japan) with a population of 2.24 million. Thanks to the rich water resources of the Kisogawa, Nagaragawa and Ibigawa Rivers, the fertile land which enjoy the blessings of the rivers, and other advantages including good transportation links, its people have lived affluent lives since early days. Nagoya has a long history and is the birthplace of three notable feudal lords, Oda Nobunaga, Toyotomi Hideyoshi and Tokugawa Ieyasu. Also in Nagoya, traditional industries like ceramics and textiles, and today's key industries like automobiles, aviation and machine tools have developed, and Nagoya has an important role in Japan's industrial society. Furthermore, the Central Japan International Airport (Centrair) opened in February 2005, and in March 2005, Expo 2005 Aichi Japan started. Centrair has flight connections with Frankfurt, Helsinki, Detroit, Tokyo Narita, etc. Today, Nagoya grabs attention and keeps on developing as a Japanese international city. You can see more detailed information from the website of Nagoya Convention & Visitors Bureau: http://www.ncvb.or.jp/en/contents/ For travel and accommodation information, please consult the RTA 2012 website: http://rta2012.trs.cm.is.nagoya-u.ac.jp/ RTA 2012 is organized by Nagoya University, Graduate School of Information Science and will take place in Higashiyama campus of Nagoya University. --------------------------------------------------------------------- -- REGISTRATION (again) -- --------------------------------------------------------------------- For online registration visit: https://apollon.nta.co.jp/rta2012/ * Early registration closes on April 25. * Online registration closes on May 9. --------------------------------------------------------------------- -- CONTACT -- --------------------------------------------------------------------- See http://rta2012.trs.cm.is.nagoya-u.ac.jp/ From paolini at di.unito.it Tue Mar 27 04:08:28 2012 From: paolini at di.unito.it (Luca Paolini) Date: Tue, 27 Mar 2012 10:08:28 +0200 Subject: [TYPES/announce] Intersection Types and Related Systems (ITRS 2012) -- Final Call Message-ID: <4F71757C.4020501@di.unito.it> ********************************************************************** Second CALL FOR PAPER Sixth Workshop on Intersection Types and Related Systems (ITRS 2012) June 29th, Dubrovnik (Croatia). http://itrs2012.di.unito.it/ Workshop held in conjunction with LICS 2012 ********************************************************************** ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. IMPORTANT DATES Abstract Submission: April 13 Author notification: April 30 Abstract final version due: June 10 EPTCS Post-proceedings Submission: before September 30th, 2012 SUBMISSION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (3-5 pages, max. 10 pages) in PDF format. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in EPTCS post-proceedings. TOPICS Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications for programming languages. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intesional types to characterize computational properties. PROGRAM COMMITTEE St?phane Lengrand (?cole Polytechnique) Koji Nakazawa (Kyoto Univ.) Luke Ong (Oxford Univ.) Luca Paolini (Univ. Torino), chair Frank Pfenning (Carniege Mellon Univ.) Betti Venneri (Univ. di Firenze) INFORMATION For further information, please contact Luca Paolini Email: paolini at di.unito.it From alastair.donaldson at imperial.ac.uk Tue Mar 27 05:39:08 2012 From: alastair.donaldson at imperial.ac.uk (Alastair Donaldson) Date: Tue, 27 Mar 2012 10:39:08 +0100 Subject: [TYPES/announce] SPIN Workshop 2012 - Deadline extended to 7 April In-Reply-To: <4F69BA5E.5080100@imperial.ac.uk> References: <4F057DD1.5090601@imperial.ac.uk> <4F4E4F58.7090102@imperial.ac.uk> <4F69BA5E.5080100@imperial.ac.uk> Message-ID: <4F718ABC.9010904@imperial.ac.uk> Apologies for multiple copies *** SPIN 2012: DEADLINE EXTENSION: 7 April *** 19th International Workshop on Model Checking Software - SPIN 2012 Oxford, July 23-24 2012 http://qav.cs.ox.ac.uk/spin2012/ IMPORTANT DATES - Submission of abstracts: extended to 7 April AoE (Anywhere on Earth) - Submission of full papers: extended to 7 April AoE (Anywhere on Earth) - Notification of acceptance/rejection: 7 May - Final version due: 14 May - Workshop: July 23-24 AIMS AND SCOPE The SPIN workshop is a forum for practitioners and researchers interested in state space-based techniques for the validation and analysis of software systems. 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 workshop. 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 workshop aims to encourage interactions and exchanges of ideas with all related areas in software engineering. Topics of interest include, but are not limited to: - 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 modelling 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 workshop INVITED SPEAKERS - Tom Ball Microsoft Research - Andrey Rybalchenko TU Munich - Andreas Zeller Saarland University INVITED TUTORIAL - Cristian Cadar Imperial College London 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 an international journal (journal to be confirmed). 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 workshop 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 workshop website: http://qav.cs.ox.ac.uk/spin2012/ At least one author of each accepted paper must attend the workshop and present the paper. ORGANISATION Programme Chairs: - Alastair F. Donaldson, Imperial College London, UK - David Parker, University of Oxford, UK Local Arrangements Chair: - Michael Tautschnig, University of Oxford, UK Programme Committee: - Christel Baier (University of Dresden, Germany) - Dirk Beyer (University of Passau, Germany) - Dragan Bosnacki (Eindhoven University of Technology, Netherlands) - Alessandro Cimatti (Fondazione Bruno Kessler, IRST, Italy) - Alastair Donaldson (Imperial College London, UK) - Stefan Edelkamp (TZI University Bremen, Germany) - Alex Groce (Oregon State University, USA) - Gerard Holzmann (NASA/JPL, USA) - Radu Iosif (VERIMAG, CNRS, France) - Stefan Leue (University of Konstanz, Germany) - Eric Mercer (Brigham Young University, USA) - Alice Miller (University of Glasgow, UK) - Madanlal Musuvathi (Microsoft Research, Redmond, USA) - David Parker (University of Oxford, UK) - Corina Pasareanu (NASA Ames, USA) - Doron Peled (Bar Ilan University, Israel) - Jaco van de Pol (University of Twente, Netherlands) - Kees Pronk (Delft University of Technology, Netherlands) - Shaz Qadeer (Microsoft Research, Redmond, USA) - Alastair Reid (ARM, UK) - Tayssir Touili (LIAFA, CNRS, France) - Helmut Veith (Vienna University of Technology, Austria) - Thomas Wahl (Northeastern University, 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) SPONSORSHIP The SPIN 2012 workshop is generously sponsored by: - ARM (http://www.arm.com) - Codeplay (http://www.codeplay.com) - Microsoft Research (http://research.microsoft.com/en-us) - Monoidics (http://www.monoidics.com) From dreyer at mpi-sws.org Tue Mar 27 07:51:48 2012 From: dreyer at mpi-sws.org (Derek Dreyer) Date: Tue, 27 Mar 2012 13:51:48 +0200 Subject: [TYPES/announce] HOPE 2012 (a new workshop co-located with ICFP): Call for Talk Proposals Message-ID: CALL FOR TALK PROPOSALS HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 9, 2012 Copenhagen, Denmark (the day before ICFP 2012) http://hope2012.mpi-sws.org HOPE is a *new workshop* that is intended to bring 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. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. --------------------- 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 hope2012 at mpi-sws.org. Deadline for talk proposals: June 8, 2012 (Friday) Notification of acceptance: July 1, 2012 (Sunday) Workshop: September 9, 2012 (Sunday) The submission website is now open: http://www.easychair.org/conferences/?conf=hope2012 --------------------- Workshop Organization --------------------- Program Co-Chairs: Amal Ahmed (Northeastern University) Derek Dreyer (MPI-SWS, Germany) Program Committee: Jim Laird (University of Bath) Rasmus M?gelberg (IT University of Copenhagen) Greg Morrisett (Harvard University) Aleks Nanevski (IMDEA Software Institute) David Naumann (Stevens Institute of Technology) Matthew Parkinson (Microsoft Research Cambridge) Fran?ois Pottier (INRIA Rocquencourt) Amr Sabry (Indiana University) Eijiro Sumii (Tohoku University) Nikhil Swamy (Microsoft Research Redmond) Nobuko Yoshida (Imperial College London) From samth at ccs.neu.edu Tue Mar 27 14:50:00 2012 From: samth at ccs.neu.edu (Sam Tobin-Hochstadt) Date: Tue, 27 Mar 2012 14:50:00 -0400 Subject: [TYPES/announce] Third Call for Papers: Workshop on Script to Program Evolution (STOP 2012) Message-ID: CALL FOR PAPERS 3rd Workshop on Script to Program Evolution (co-located with ECOOP and PLDI) Beijing, China June 11, 2012 http://wrigstad.com/stop12/ Submission site: http://continue2.cs.brown.edu/stop2012/ OVERVIEW Recent years have seen increased use of scripting languages in large applications. Scripting languages optimize development time, especially early in the software life cycle, over safety and robustness. As the understanding of the system reaches a critical point and requirements stabilize, scripting languages become less appealing. Compromises made to optimize development time make it harder to reason about program correctness, harder to do semantic-preserving refactorings, and harder to optimize execution speed. Lack of type information makes code harder to navigate and to use correctly. In the worst cases, this situation leads to a costly and potentially error-prone rewrite of a program in a compiled language, losing the flexibility of scripting languages for future extension. Recently, pluggable type systems and annotation systems have been proposed. Such systems add compile-time checkable annotations without changing a program?s run-time semantics which facilitates early error checking and program analysis. It is believed that untyped scripts can be retrofitted to work with such systems. Furthermore, integration of typed and untyped code, for example, through use of gradual typing, allows scripts to evolve into safer programs more suitable for program analysis and compile-time optimizations. With few exceptions, practical reports are yet to be found. The STOP workshop focuses on the evolution of scripts, largely untyped code, into safer programs, with more rigid structure and more constrained behavior through the use of gradual/hybrid/pluggable typing, optional contract checking, extensible languages, refactoring tools, and the like. The goal is to further the understanding and use of such systems in practice, and connect practice and theory. CALL FOR CONTRIBUTIONS Abstracts, position papers, and status reports are welcome. Papers should be 1-2 pages in standard ACM SIGPLAN format. All submissions will be reviewed by the program committee. The accepted papers, after rework by the authors, will be published in an informal proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Papers are to be submitted electronically via the STOP website: http://continue2.cs.brown.edu/stop2012/ IMPORTANT DATES paper submission: 11:59 PM 30 March 2012 Eastern Daylight Time notification: 20 April 2012 camera-ready paper: 15 May 2012 conference date: 11 June 2012 PROGRAM COMMITTEE Avik Chaudhuri, Adobe Labs Kathryn Gray, Swansea University Arjun Guha, Brown University David Herman, Mozilla Research Manuel Hermenegildo, IMDEA Atsushi Igarashi, Kyoto University Ranjit Jhala, University of California, San Diego From Lutz.Schroeder at dfki.de Tue Mar 27 16:28:06 2012 From: Lutz.Schroeder at dfki.de (Lutz Schroeder) Date: Tue, 27 Mar 2012 22:28:06 +0200 Subject: [TYPES/announce] =?iso-8859-15?q?PhD/Postdoc_Positions_in_Theoret?= =?iso-8859-15?q?ical_Computer_Science_at_FAU_Erlangen-N=FCrnberg?= Message-ID: <4F7222D6.4060808@dfki.de> [I would be grateful for further distribution of the job advertisement below] In the newly founded Theoretical Computer Science group (Chair 8) at the University of Erlangen-N?rnberg, several research positions are available that can be filled at the doctoral or post-doctoral level. These include project positions of up to two years, in the TV-L E13 or E14 pay scale depending on qualification of the applicant; project topics include - coalgebraic logic - probabilistic description logic - formal methods in mechanical engineering. Additionally, at least one position is available that is not tied to a specific research project but does carry a teaching obligation of 5h per week; in this case, research work can be positioned in any of the core fields of the group including - modal logic - knowledge representation - coalgebra - formal methods - program semantics - applications of semantic technologies Such positions can be filled at TV-L E13 for an initial appointment of three years, with a possibility of extension for another three years subject to provisions by German laws on temporal employment in academia; postdoctoral applicants from EU countries can be appointed at the A13 payscale ("akademischer Rat") (which pays better and has better benefits) for two periods of three years, with a possible extension of two periods of two years at the A14 payscale ("akademischer Oberrat") for candidates who successfully complete a habilitation during the first six years. Please send applications consisting of a cover letter, resume, and contact details of three references by email to lutz.schroeder at cs.fau.de. There is no particular application deadline; positions will be filled when suitable candidates are found. Best regards, Lutz -- -------------------------------------- Prof. Dr. Lutz Schr?der Chair of Theoretical Computer Science Department of Computer Science Friedrich-Alexander-Universit?t Erlangen-N?rnberg lutz.schroeder at informatik.uni-erlangen.de lutz.schroeder at cs.fau.de -------------------------------------- From tiezzi at dsi.unifi.it Wed Mar 28 03:52:02 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Wed, 28 Mar 2012 09:52:02 +0200 Subject: [TYPES/announce] Final Call for Papers: WWV 2012 Message-ID: <40868888-885D-4BFE-87F2-366F29D7A635@dsi.unifi.it> [Apologies for multiple copies] ******************************************************** Final Call for Papers WWV 2012 Automated Specification and Verification of Web Systems 8th International Workshop (as part of DisCoTec'12) http://users.dsic.upv.es/~jsilva/wwv2012/ June 16, 2012 - Stockholm, Sweden ******************************************************** IMPORTANT DATES Abstract Submission March 30, 2012 Full Paper Submission April 2, 2012 Acceptance Notification May 16, 2012 Camera Ready (pre-proceedings) May 30, 2012 Workshop June 16, 2012 Camera Ready (post-proceedings) July 4, 2012 SCOPE 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. 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. INVITED SPEAKER Jos? Luiz Fiadeiro (University of Leicester) 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 in PDF format and prepared in LaTeX using the EPTCS-style format (http://style.eptcs.org/) and should not exceed 15 pages (typeset 11 points). Submissions are handled using the EasyChair online system and can be uploaded using the following link: https://www.easychair.org/conferences/?conf=wwv2012 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. Workshop post-proceedings will be published as a volume of the EPTCS (Electronic Proceedings in Theoretical Computer Science, http://eptcs.org/) series. An open call for a special high-quality journal issue on the topic of the WWV workshop is envisaged. WORKSHOP CO-CHAIRS Josep Silva Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy PROGRAM COMMITTEE Jesus M. Almendros-Jimenez Universidad de Almeria, Spain Maria Alpuente Universitat Polit?cnica de Val?ncia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz University of Minho, Portugal Santiago Escobar Universitat Polit?cnica de Val?ncia, Spain Moreno Falaschi University of Siena, Italy Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Elie Najm Telecom ParisTech, France Rosario Pugliese University of Florence, Italy Antonio Ravara New University of Lisbon, Portugal Kostis Sagonas Uppsala University, Sweden Josep Silva Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom CONTACT wwv2012 at easychair.org From pierre.hyvernat at univ-savoie.fr Wed Mar 28 08:58:33 2012 From: pierre.hyvernat at univ-savoie.fr (Pierre Hyvernat) Date: Wed, 28 Mar 2012 14:58:33 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?R=E9alisabilit=E9_in_Chamb=E9ry_?= =?iso-8859-1?q?=235=2E=2E=2E?= Message-ID: <20120328125833.GA1047@d53> Apologies for multiple postings... ===== Greetings to all! This is the first (but late) official announcement for the fifth workshop "R?alisabilit? ? Chamb?ry". This year's workshop will take place from Tuesday the 5th of June to Friday the 8th of June. No specific "theme" was chosen this year, besides realizability in a broad sense. Partial information is gathered on the web page: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2012/ and you can (should) register for the workshop there: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2012/registration.php The invited speakers are: - Martin Hofmann (Munich), - Jean-Louis Krivine (Paris), - Jonas Frey (Paris), - Alexandre Miquel (Lyon). There will be 2 sessions for contributed talks, and PhD students are particularly encouraged to submit a talk. (There will be no official proceedings though.) For the first time, we will offer a couple of grants for students attending the workshop. Those grants will cover (part of) the cost of the travel and a room on the campus. We still don't know how many grants we will be able to award, but priority will be given to students presenting their work at the workshop. More details about contents of invited talks and schedule will be added to the web page when available. Meanwhile, feel free to register (via the web page), submit talks or contact me for additional details (or comments). Note: the workshop will be similar in spirit to the last one. There is no registration fee, but the organizing committee doesn't organize much besides the actual workshop. It will be possible to get a student room (on campus, very cheap, but only a bare room). Students will of course be given priority for those, but anyone may ask... Other possibilities for accommodation are given on the web page: http://lama.univ-savoie.fr/~hyvernat/Realisabilite2012/logistic.php Pierre Hyvernat -- There's nothing remarkable about it. All one has to do is hit the right keys at the right time and the instrument plays itself. -- J.S. Bach From dpw at cs.princeton.edu Wed Mar 28 15:02:43 2012 From: dpw at cs.princeton.edu (David Walker) Date: Wed, 28 Mar 2012 15:02:43 -0400 (EDT) Subject: [TYPES/announce] Postdoc Positions: Cornell and Princeton In-Reply-To: Message-ID: We invite applications for postdoctoral researchers at Cornell and Princeton in the areas of programming languages and networks. The positions are part of the Frenetic project, which seeks to develop new programming language abstractions for controlling, managing, 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 either programming languages or networks, 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. 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 Nate Foster (jnfoster at cs.cornell.edu) and David Walker (dpw at cs.princeton.edu). We especially welcome applications from women and members of under-represented minority groups. Nate Foster (Cornell) Jennifer Rexford (Princeton) Emin Gun Sirer (Cornell) David Walker (Princeton) ------------------------------ ------------------------------ 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 by developing new languages with the following essential features: (i) network-wide, correct-by-construction programming abstractions; (ii) support for fault-tolerance and scalability; (iii) mechanisms for coordinating with end-hosts and establishing trust; (iv) verification tools based on rigorous semantic foundations; and (v) compilers capable of generating efficient code for heterogeneous devices. From sartemov at gc.cuny.edu Wed Mar 28 18:29:36 2012 From: sartemov at gc.cuny.edu (Sergei Artemov) Date: Wed, 28 Mar 2012 18:29:36 -0400 Subject: [TYPES/announce] LFCS 2013, San Diego, January 6-8: First Call for Papers Message-ID: <4F7390D0.2050104@gc.cuny.edu> FIRST CALL FOR PAPERS SYMPOSIUM ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE 2013 (LFCS'13) San Diego, California, January 6-8, 2013 The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science. The LFCS series began with Logic at Botik, Pereslavl-Zalessky, 1989, and was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver), after which organization passed to Anil Nerode. LFCS Steering Committee: Anil Nerode - General Chair, Stephen Cook, Dirk van Dalen, Yuri Matiyasevich, J. Alan Robinson, Gerald Sacks, Dana Scott. LFCS Topics of interest include, but are not limited to: constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science. LFCS'13 Program Committee: Sergei Artemov (New York) - PC Chair; Steve Awodey (CMU); Alexandru Baltag (Oxford); Andreas Blass (Ann Arbor); Samuel Buss (San Diego); Walter Dean (Warwick); Rod Downey (Wellington, NZ); Ruy de Queiroz (Recife, Brazil); Antonio Montalban (Chicago); Rosalie Iemhoff (Ultrecht); Bakhadyr Khoussainov (Auckland, NZ); Roman Kuznets (Bern); Lawrence Moss (Bloomington, IN); Robert Lubarsky (Florida Atlantic University); Victor Marek (Lexington, KY); Franco Montagna (Siena); Anil Nerode (Cornell) - General LFCS Chair; Mati Pentus (Moscow); Jeffrey Remmel (San Diego); Bryan Renne (Amsterdam); Philip Scott (Ottawa); Alex Simpson (Edinburgh); Sonja Smets (Groningen); Michael Rathjen (Leeds); Alasdair Urquhart (Toronto); Michael Zakharyashchev (London). LFCS'13 Local Organizing Committee: Jeff Remmel (Chair), Samuel Buss, Victor Marek. Submission details. Proceedings will be published in the LNCS series. There will be a post-conference volume of selected works published in the Annals of Pure and Applied Logic. Submissions should be made electronically via http://www.easychair.org/LFCS13/. Submitted papers must be in pdf/12pt format and of no more than 15 pages, present work not previously published, and must not be submitted concurrently to another conference with refereed proceedings. LFCS has established the best student paper award and named it after John Barkley Rosser Sr. (1907--1989), a prominent American logician with fundamental contributions in both Mathematics and Computer Science. Important Dates: Submissions deadline (firm): September 10, 2012; Notification: October 5, 2012; Final papers for proceedings: October 15, 2012; Symposium dates: January 6 - 8, 2013. -------------- next part -------------- An HTML attachment was scrubbed... URL: From thiemann at informatik.uni-freiburg.de Wed Mar 28 23:58:49 2012 From: thiemann at informatik.uni-freiburg.de (Peter Thiemann) Date: Thu, 29 Mar 2012 14:58:49 +1100 Subject: [TYPES/announce] CALL FOR PARTICIPATION: FLOPS 2012 Message-ID: <4F73DDF9.6070608@informatik.uni-freiburg.de> CALL FOR PARTICIPATION: FLOPS 2012 ================================== Eleventh International Symposium on Functional and Logic Programming May 23-25, 2012 Takikawa Memorial Hall, Kobe University, Kobe, Japan http://www.org.kobe-u.ac.jp/flops2012/ *Early Registration: April 25 (Wed)* FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) and satellite workshops including WFLP 2012 will be held in the week after FLOPS at Nagoya, Japan. Invited Speakers @ FLOPS ================ - Tachio Terauchi (Graduate School of Information Science, Nagoya University). Automated Verification of Higher-order Functional Programs - Michael Codish (Department of Computer Science, Ben-Gurion University of the Negev). Programming with Boolean Satisfaction - Stephanie Weirich (School of Engineering and Applied Science, University of Pennsylvania). Dependently-typed programming in GHC See the full program at http://www.org.kobe-u.ac.jp/flops2012/program.html Register now at http://www.org.kobe-u.ac.jp/flops2012/index.html#REGISTRATION CONFERENCE ORGANIZERS GENERAL CHAIR ============= - Naoyuki Tamura (Kobe University, Japan) PROGRAM CO-CHAIRS ================= - Tom Schrijvers (Ghent University, Belgium) - Peter Thiemann (University of Freiburg, Germany) CONFERENCE SPONSORS =================== - Japan Society for Software Science and Technology (JSSST) SIGPPL - Information Science and Technology Center, Kobe University IN COOPERATION WITH =================== - ACM SIGPLAN - Asian Association for Foundation of Software (AAFS) - Association for Logic Programming (ALP) From alain.girault at inria.fr Thu Mar 29 03:15:34 2012 From: alain.girault at inria.fr (Alain Girault) Date: Thu, 29 Mar 2012 09:15:34 +0200 Subject: [TYPES/announce] LCTES 2012 - Call for Participation and WiP Submissions Message-ID: <4F740C16.3050001@inria.fr> ============================================================================ LCTES 2012 Languages, Compilers, Tools & Theory for Embedded Systems CALL FOR PARTICIPATION and SUBMISSION to WiP Beijing, China 12-13 June, 2012 http://lctes12.cs.purdue.edu/ ============================================================================ PROGRAM HIGHLIGHTS: - Two keynote speakers: + Gernot Heiser (University of New South Wales, Australia) and + Nicolas Halbwachs (VERIMAG, France) - Three more keynote speakers shared with PLDI: + Ole Agesen (VMWare) + Doug Lea (State University of New York at Oswego, USA) + Amer Diwan (University of Colorado, USA) - Two-day conference sessions - A work-in-progress session - Co-location with PLDI, ECOOP, ISMM and more ---------------------------------------------------------------------------- SUBMISSION TO WORK-IN-PROGRESS SESSION: LCTES 2012 features a Work-in-Progess (WiP) session which is devoted to the presentation of new and on-going research in embedded systems. The primary purpose of the WiP session is to provide researchers with an opportunity to discuss their evolving ideas and gather feedback from the embedded systems community at large. Of particular interest are ideas and contributions that present significant paradigm shifts, explore unique and unconventional approaches to important problems, or investigate fundamental departures from conventional wisdom in adopted solutions. Deadline for submission of 2-4 page extended abstracts describing exciting new, in-progress, and/or experimental research for the LCTES WiP session is April 6, 2012. Further information can be found at http://lctes12.cs.purdue.edu/content/work-progress-session ---------------------------------------------------------------------------- STUDENT TRAVEL GRANTS: - Students are strongly encouraged to submit papers and to attend LCTES 2012. Part of the travel expenses (USD 500 max.) can be covered by an LCTES student travel grant. In order to apply, young researchers are asked to send a short CV including a motivation why they feel eligible for an LCTES student travel grant. Please send your application to the LCTES General Chair Reinhard Wilhelm or to the Program Chairs Heiko Falk or Wang Yi. - Additional opportunities for funding exist: grants from Microsoft Research, NSF, ACM PAC). For further information, check http://pldi12.cs.purdue.edu/content/students ---------------------------------------------------------------------------- REGISTRATION: Registration for all the conferences is now open. Please check http://pldi12.cs.purdue.edu/content/registration to register. The early registration deadline is May 1st. ---------------------------------------------------------------------------- HOTEL: The conference hotel and venue is the Crowne Plaza Parkview. A limited block of rooms is set aside at the LCTES/PLDI rate (~180$). In order to reserve a room, please follow this link http://pldi12.cs.purdue.edu/content/registration We are looking forward to seeing you in Beijing in June! ============================================================================ General Chair: Reinhard Wilhelm Saarland University Saarbr?cken, Germany Program Chairs: Wang Yi Uppsala University, Sweden Heiko Falk Ulm University, Germany ============================================================================ -- ------------- Alain GIRAULT http://pop-art.inrialpes.fr/~girault INRIA senior researcher tel: +(33|0) 476 61 53 51 Head of the POP ART project-team fax: +(33|0) 476 61 52 52 ----------------------------------------------------------------------------- Sauvons la Recherche ! http://www.sauvonslarecherche.fr ----------------------------------------------------------------------------- From Chris.Hawblitzel at microsoft.com Thu Mar 29 17:27:12 2012 From: Chris.Hawblitzel at microsoft.com (Chris Hawblitzel) Date: Thu, 29 Mar 2012 21:27:12 +0000 Subject: [TYPES/announce] CFP: CPP 2012 - 2nd International Conference on Certified Programs and Proofs Message-ID: The Second International Conference on Certified Programs and Proofs (CPP 2012) CALL FOR PAPERS Kyoto, Japan December 13-15 2012 http://cpp12.kuis.kyoto-u.ac.jp/ co-located with APLAS 2012 http://aplas12.kuis.kyoto-u.ac.jp/ CPP is a new 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 CPP conference was held in Kenting, Taiwan during December 7-9, 2011. As with the first meeting, we plan to publish the proceedings 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, June 8, 2012 Paper Submission Deadline: Friday, June 15, 2012 Author Notification: Monday, August 27, 2012 Camera Ready: Monday, September 17, 2012 Conference: December 13-15, 2012 PROGRAM CO-CHAIRS: Chris Hawblitzel (Microsoft Research Redmond) Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique) GENERAL CHAIR: Jacques Garrigue (Nagoya University) PROGRAM COMMITTEE: Stefan Berghofer (Technical University Munich) Wei-Ngan Chin (National University of Singapore) Adam Chlipala (MIT) Mike Dodds (University of Cambridge) Amy Felty (University of Ottawa) Xinyu Feng (University of Science and Technology of China) Herman Geuvers (Radboud University, Nijmegen) Robert Harper (Carnegie Mellon University) Chris Hawblitzel (Microsoft Research Redmond) Gerwin Klein (NICTA) Laura Kovacs (Vienna University of Technology) Dale Miller (INRIA Saclay and LIX, Ecole Polytechnique) Rupak Majumdar (UCLA, Max Planck Institute for Software Systems) Lawrence Paulson (University of Cambridge) Frank Piessens (KU Leuven) Randy Pollack (Harvard and Edinburgh University) Bow-Yaw Wang (Academia Sinica) Santiago Zanella B?guelin (IMDEA Software Institute) ORGANIZING COMMITTEE: Jacques Garrigue and Atsushi Igarashi Email: cpp2012oc at math.nagoya-u.ac.jp CPP STEERING COMMITTEE: Andrew Appel (Princeton University) Nikolaj Bj?rner (Microsoft Research Redmond) Georges Gonthier (Microsoft Research Cambridge) John Harrison (Intel Corporation) Jean-Pierre Jouannaud (co-Chair) (INRIA and Tsinghua University) Gerwin Klein (NICTA) Tobias Nipkow (Technische Universit?t M?nchen) Zhong Shao (co-Chair) (Yale University) SUBMISSION INSTRUCTIONS: Papers should be submitted electronically online via the conference submission web page at URL: http://www.easychair.org/conferences/?conf=cpp2012 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. 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. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Neil.Ghani at cis.strath.ac.uk Fri Mar 30 06:53:54 2012 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Fri, 30 Mar 2012 11:53:54 +0100 Subject: [TYPES/announce] Workshop on Higher Dimensional Algebras, Categories, and Types Message-ID: <18C80B4F-5ACC-4929-AB69-A0EC9A1E6990@cis.strath.ac.uk> ================================ Call For Short Abstracts Workshop on Higher Dimensional Algebras, Categories, and Types June 20, Ljubljana, Slovenia ================================ The importance of higher dimensional structure for mathematics and computer science has been recognized for a long time. However, recent connections between homotopy theory and type theory have spurred new activity that is connecting previously unrelated topics. The workshop will be a place for meeting and dissemination of ideas between researchers from different areas who all use higher dimensional structures. Invited speakers: Thorsten Altenkirch Steve Awodey Emily Riehl To contribute a lecture please submit a 1 page A4 extended abstract through easychair. easychair.org/account/signin.cgi?fail=1;conf=hdact12 Submission deadline Sun April 15 (short extension possible on request) Author notification Sun April 29 Program Committee Nicola Gambino Neil Ghani Zhaohui Luo Erik Palmgren Randy Pollack Urs Schreiber Bas Spitters Thomas Streicher There will be a registration fee of E50 to cover costs which can be paid in cash at the event. There will be no separate post-proceedings for HDACT, as there is already an excellent venue for such papers: the MSCS special issue 'From Type Theory and Homotopy Theory to Univalent Foundations' Further information can be found at 4wft.fmf.uni-lj.si/hdact/ The workshop takes place straight after the Fourth Workshop on Formal Topology, details of which can be found at 4wft.fmf.uni-lj.si/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Pichardie at irisa.fr Fri Mar 30 09:24:29 2012 From: David.Pichardie at irisa.fr (David Pichardie) Date: Fri, 30 Mar 2012 09:24:29 -0400 Subject: [TYPES/announce] PxTP 2012 (IJCAR workshop) - second call for papers Message-ID: <3B514DFD-D099-4123-B805-B0EB737EA291@irisa.fr> *** Deadline extended to April 16th, 2012 *** ---------------------------------------------------------------------- The Second International Workshop on Proof Exchange for Theorem Proving (PxTP) http://pxtp2012.inria.fr associated with The International Joint Conference on Automated Reasoning (IJCAR), 2012 ---------------------------------------------------------------------- The goal of this workshop is to bring together researchers working on proof production from automated theorem provers with potential consumers of proofs. Machine-checkable proofs have been proposed for applications like proof-carrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning systems. For example, interactive theorem provers can import results from otherwise untrusted high-performance solvers, by means of proofs the solvers produce. In such situations, one automated reasoning tool can make use of the results of another, without having to trust that the second tool is sound. It is only necessary to be able to reconstruct a proof that the first tool will accept, in order to import the result without increasing the size of the trusted computing base. This simple idea of proof exchange for theorem proving becomes quite complicated under the real-world constraints of highly complex and heterogeneous proof producers and proof consumers. For example, even the issue of a standard proof format for a single class of solvers, like SMT solvers, is quite difficult to address, as different solvers use different inference systems. It may be quite challenging, from an engineering and possibly also theoretical point of view, to fit these into a single standard format. Emerging work from several groups proposes standard meta-languages or parametrized formats to achieve flexibility while retaining a universal proof language. ---------------------------------------------------------------------- Topics of interest for this workshop include all aspects of proof exchange among automated reasoning tools. More specifically, some suggested topics are: -- proposed proof formats for different classes of logic solvers (SAT, SMT, QBF, First-Order ATP, Higher-Order ATP, Rewriting, etc.). -- meta-languages and logical frameworks for proofs, particularly proof systems designed for solvers. -- proof checking tools and algorithms. -- proof translation and methods for importing proofs, including proof replaying or reconstruction. -- tools and case studies related to analyzing proofs produced by solvers, and proof metrics. -- applications relying on importing proofs from automated theorem provers, such as certified static analysis, proof-carrying code, or certified compilation. -- data structures and algorithms for improved proof production in solvers (for example, more time- or memory-efficient ways of representing proofs). ---------------------------------------------------------------------- Invited Speakers * Stephan Merz, Inria Nancy, France * Second Speaker: TBC ---------------------------------------------------------------------- Submissions Submitted papers must fall into one of the following two categories: * Short papers: up to 6 pages, work in progress, experience reports, tool presentations or position statements * Regular papers: 12-15 pages, research papers Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. Submissions should be in standard-conforming Postscript or PDF. Final versions should be prepared in LaTeX using the easychair.cls class file. To submit a paper, go to the EasyChair PxTP page http://www.easychair.org/conferences/?conf=pxtp2012 and follow the instructions there. PxTP will have no formal proceedings, but we intend to provide electronic proceedings on the CEUR-WS website. ---------------------------------------------------------------------- Important dates Submission of papers: April 16th, 2012 (* extended *) Notification: May 7th, 2012 Camera-ready versions due: May 21th, 2012 Workshop: June 30th, 2012 ---------------------------------------------------------------------- Program Committee Jasmin Blanchette, Technische Universit?t M?nchen, Germany Pascal Fontaine, University of Nancy, France John Harrison, Intel Corporation, USA Leonardo de Moura, Microsoft Research, USA David Pichardie (co-chair), INRIA Rennes, France Aaron Stump, The University of Iowa, USA Geoff Sutcliffe, University of Miami, USA Laurent Th?ry, INRIA Sophia-Antipolis, France Allen Van Gelder, University of California at Santa Cruz, USA Tjark Weber (co-chair), Uppsala University, Sweden ---------------------------------------------------------------------- From shankar at csl.sri.com Fri Mar 30 16:26:22 2012 From: shankar at csl.sri.com (Natarajan Shankar) Date: Fri, 30 Mar 2012 13:26:22 -0700 Subject: [TYPES/announce] Second Summer School on Formal Techniques, May 27-June 1, 2012 Message-ID: <1050.1333139182@positron.csl.sri.com> Second Summer School on Formal Techniques May 27- June 1, 2012 Menlo College, Atherton, CA http://fm.csl.sri.com/SSFT12 Formal verification techniques such as model checking, satisfiability, and static analysis have matured rapidly in recent years. This school, the second 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. This year, the school starts on Sun May 27 with a background course on Logic in Computer Science taught by Natarajan Shankar (SRI). The course is optional but highly recommended - it covers the prerequisites for the main lectures. 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/SSFT12 The lecturers at the school include Leonardo de Moura (MSR Redmond) and Bruno Dutertre (SRI): Satisfiability Modulo Theories Sumit Gulwani (MSR): Dimensions in Program Synthesis Daniel Kroening (Oxford): Verifying Concurrent Programs Ken McMillan: Abstraction, Decomposition, and Relevance Corina Pasareanu, Dimitra Giannakopoulou, Neha Rungta, Peter Mehlitz, and Oksana Tkachuk: Verifying Components in the Right Context The school will also include invited talks by distinguished researchers. The SSFT Steering Committee consists of Tom Ball (MSR Redmond), Lenore Zuck (UIC), and Natarajan Shankar (SRI). From Neil.Ghani at cis.strath.ac.uk Sat Mar 31 06:27:28 2012 From: Neil.Ghani at cis.strath.ac.uk (Neil Ghani) Date: Sat, 31 Mar 2012 11:27:28 +0100 Subject: [TYPES/announce] CfP : 6th Category Theory Seminar Message-ID: <51EDA393-9E3D-4265-9EC1-77F3A8885B6E@cis.strath.ac.uk> ============== Call for Participation 6th Scottish Category Theory Seminar 2pm, Friday 25 May ============== Category theory is a relatively new branch of mathematics which seeks to understand abstract mathematical structure. At its core, category theory contains a synthesis of algebraic, logical and geometric intuitions. This allows for both diverse applications and innovative insights in areas including pure mathematics, computer science, physics etc. The Scottish Category Theory Seminar provides a forum for discussion of all aspects of category, be they straight category theory or applications to other scientific fields. Our sixth meeting takes place on Friday 25 May 2012 and is focussed on the exciting developments that have taken place recently in Higher Dimensional Category Theory and its applications in homotopy theory and type theory. We intend the meeting to be attractive to mathematicians, computer scientists, physicists etc., and thus have aimed for talks which will be of interest to a broad audience of people who are curious about the latest developments in Higher Dimensional Category Theory. Speakers Thomas Streicher (University of Darmstadt), On Univalent Foundations Ondrej Rypacek (Kings College, London), A syntactical approach to weak omega-groupoids Simona Paoli (University of Leicester) n-typical n-fold groupoids Eric Finster (Ecole Polytechnique De Lausanne), Revising the Opetopes: Applications in Computer Science and Type Theory The meeting will take place at the Department of Computer and Information Sciences of the University of Strathclyde (Room 14.15, Livingston Tower, 26 Richmond Street, Glasgow). Refreshments will be available from 1pm and the talks start at 2pm. More details can be found at personal.cis.strath.ac.uk/~ng/SCT/sct250512.html The meeting will be followed by drinks in a nearby pub (from 17.30) and then dinner at a local restaurant (from 18.30). You are politely requested to contact us (email scotcats at cis.strath.ac.uk) by Friday 11 May if you are intending to attend the meeting and/or if you are intending to come to dinner so we can cater appropriately. The meeting has been sponsored by SICSA. ScotCats Organisers Neil Ghani Tom Leinster Alex Simpson From michele at dsi.unive.it Sat Mar 31 08:45:32 2012 From: michele at dsi.unive.it (Michele Bugliesi) Date: Sat, 31 Mar 2012 14:45:32 +0200 Subject: [TYPES/announce] PhD Scholarships at Ca' Foscari University, Venice Message-ID: <4F76FC6C.5040609@dsi.unive.it> Call for applications --------------------- 3-year PhD Program in Computer Science DAIS - Computer Science Ca' Foscari University of Venice, Italy . Deadline for application: October April 11th, 2012. Applications *must be received* by the deadline. . Start of program: September 2012 . Scholarship: Euro 13,600.00 per year (net). . Admission Requirements: A graduate degree equivalent to or higher than the Italian "Laurea Magistrale" degree (a five-year degree including a three-year undergraduate program followed by a two-year diploma) . Number of available positions with scholarship: 6. These include 3 thematic scholarship on the following subjects (a) Cloud-based techniques for privacy-preserving information mining (b) Calculations with resources and differentials (c) Classification models for non-vectorial data and 3 non-thematic scholarships, for which we welcome applications on all TYPES-relevant subjects. . The application form can be downloaded from the following link: http://www.unive.it/nqcontent.cfm?a_id=124585 The application must include: - Curriculum Vitae - Two recommendation letters - Information about degree and degree program - Research Statement (max 20,000 chars) . For more information, please contact phd at dais.unive.it -- The Department of Environmental Sciences, Informatics and Statistics (DAIS) has been established in January 2011 as a result of the amalgamation of the former Departments of Environmental Sciences, Computer Science, and Statistics - a merger motivated by the desire to mazimize the interaction among three disciplines that constitute key research drivers for the scientific and societal development of the future. The Department's academic and research staff are committed to work towards common research goals, leveraging the research strength in their areas of expertise to provide innovative solutions for the analysis and management of the information and the environmental systems underpinning a sustainable development of our society and the preservation of its cultural heritage. The Department brings together world-leading research groups contributing their expertise to research and teaching, at all levels. In particular, the Computer Science Laboratory has long been actively involved in research on Computer Vision and Pattern Recognition, Data-Intensive and Scalable Information Systems, Dependable Systems and Software Security, Formal Methods, Multimedia Information and Interaction Design. -- Michele Bugliesi, PhD Professor of Computer Science Dept. of Environmental Sciences Informatics & Statistics, Head Universit? Ca' Foscari Venezia http://www.dais.unive.it/~michele -- Michele Bugliesi, PhD Professor of Computer Science Dept. of Environmental Sciences Informatics and Statistics, Head Universit? Ca' Foscari Venezia http://www.dais.unive.it/~michele From giannini at di.unipmn.it Sat Mar 31 11:55:48 2012 From: giannini at di.unipmn.it (Paola Giannini) Date: Sat, 31 Mar 2012 17:55:48 +0200 Subject: [TYPES/announce] CS2Bio'12 Final Call for Papers & Extended Deadline Message-ID: <4F772904.5050009@di.unipmn.it> ================================================================= Final Call for papers & Etended Deadline (April 12) ================================================================= CS2Bio'12 3rd International Workshop on Interactions between Computer Science and Biology Affiliated to DisCoTec'12 16th of June 2012 Stockholm, Sweden http://cs2bio12.di.unipmn.it/ ================================================================= *** IMPORTANT DATES *** - Submission deadline (EXTENDED) : April 12, 2012 - Notification to authors: May 16, 2012 - Workshop: June 16, 2012 ================================================================= The aim of this workshop is to gather researchers in formal methods that are interested in the convergence of Computer Science, Biology and life sciences. In particular, we solicit contribution of original results that address both theoretical aspects of modeling and applied work on the comprehension of biological behavior. We encourage presentations of interdisciplinary work conducted by teams composed of both life and computer scientists. Papers selected for presentation at CS2Bio should either present the modeling a specific biological phenomenon using formal techniques, or a modeling, 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. *** SCOPE *** In general, topics of interest include, but are not limited to: Formal Biological Modeling: -- Formal methods for the representation of biological systems and their dynamics (rewrite systems, process calculi, graph grammars, hybrid systems, etc.); -- Theoretical links and comparison between different formal models for the modeling of biological processes; -- Quantitative (probabilistic, timed, stochastic, etc.) languages and calculi. -- Spatial (geometrical, topological) languages and calculi. Formal Testing and Validation of Biological Properties: -- Prediction of biological behavior from incomplete information; -- Model checking, abstract interpretation, type systems, etc. Tools and Simulation -- Modeling, analysis and simulation tools for systems biology; -- Emergence of properties in complex biological and medical systems; -- Tools for parallel, distributed, and multi-resolution simulation methods; -- Detailed biological case-studies. *** DISSEMINATION*** Proceedings of the workshop will be published in ENTCS. Quality permitting, a special issue of a Computer Science journal is planned. *** SUBMISSION GUIDELINES *** Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Authors should submit their papers via EasyChair (http://www.easychair.org/conferences/?conf=cs2bio12). Papers should take the form of a pdf file in ENTCS style and should not exceed 12 pages. If necessary, detailed proofs or other additional material can be added in an appendix (referees might review it at their discretion). We also encourage the submission of short papers, limited to 7 pages, presenting new tools or platforms for the modelling of biological systems. ================================================================= *** INVITED SPEAKERS *** - Jane Hillston (Lab for Foundation of Computer Science - Edinburgh, UK) - Gianluigi Zavattaro (Department of Computer Science - University of Bologna, IT) *** PROGRAM COMMITTEE *** - Luca Cardelli - Gabriel Ciobanu - Francesca Cordero - Erik de Vink (Co-chair) - Francois Fages - Jerome Feret - Jasmin Fisher - Paola Giannini (Co-chair) - Jane Hillston - Jean Krivine - Giancarlo Mauri - Emanuela Merelli - Paolo Milazzo - Gethin Norman - Ion Petre - David Safranek - Angelo Troina - Adelinde Uhrmacher - Verena Wolf *** STEERING COMMITTEE *** - Erik de Vink - Paola Giannini - Jean Krivine - Angelo Troina -- Paola Giannini Dipartimento di Informatica Universita' del Piemonte Orientale via Teresa Michel, 11 15100 Alessandria, Italy phone: (+39) 0131 360171 fax : (+39) 0131 360390 email: giannini at di.unipmn.it http://www.di.unito.it/~giannini From patrick.baillot at ens-lyon.fr Sat Mar 31 16:18:06 2012 From: patrick.baillot at ens-lyon.fr (Patrick Baillot) Date: Sat, 31 Mar 2012 22:18:06 +0200 Subject: [TYPES/announce] LCC2012: Call for papers Message-ID: <20120331221806.175177fwt88iimwu@webmail.ens-lyon.fr> CALL FOR PAPERS 13th International Workshop on LOGIC AND COMPUTATIONAL COMPLEXITY (LCC 2012) June 24, 2012, Dubrovnik, Croatia http://ptmat.fc.ul.pt/lcc2012/ The Logic and Computational Complexity Workshop, LCC 2012, will be held in Dubrovnik, Croatia, on Sunday, June 24, 2012, as an affiliated meeting of LICS~2012. The workshop aims at furthering an understanding of the fundamental relations between computational complexity and logic. Topics of interest include: -- complexity analysis for functional languages -- complexity in database theory -- complexity in formal methods -- complexity-theoretic type systems -- formal methods for complexity analysis of programs -- foundations of implicit computational complexity -- logical and machine-independent characterizations of complexity classes -- logics closely related to complexity classes -- proof complexity -- semantic approaches to complexity. The program will consist of sessions of contributed papers and invited talks. IMPORTANT DATES: Submissions due: April 13, 2012 Authors' notification: May 1, 2012 Submissions must be in English and in the form of abstracts of about 3-4 pages. Submissions published elsewhere or which are simultaneously being submitted to another conference or workshop are welcome. Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://www.easychair.org/conferences/?conf=lcc12 PROGRAM COMMITTEE: Albert Atserias (Barcelona), Patrick Baillot (Lyon), Arnold Beckmann (Swansea), Guillaume Bonfante (Nancy), Steve Cook (Toronto), J?rg Flum (Freiburg, co-chair), Martin Grohe (Berlin), Isabel Oitavem (Lisbon, co-chair), Thomas Schwentick (Dortmund), Denis Therien (Montreal). From michele at dsi.unive.it Sat Mar 31 18:39:44 2012 From: michele at dsi.unive.it (Michele Bugliesi) Date: Sun, 01 Apr 2012 00:39:44 +0200 Subject: [TYPES/announce] PhD Scholarships at Ca' Foscari University, Venice In-Reply-To: <4F776CA9.10100@dsi.unive.it> References: <4F776CA9.10100@dsi.unive.it> Message-ID: <4F7787B0.5040201@dsi.unive.it> Hi all, just to fix a typo on my previous post, and clarify that the application deadline for the PhD positions in Venice is April 11th, 2012. Apologies for the confusion. Regards, -- michele On 03/31/2012 10:44 PM, Michele Bugliesi wrote: > Call for applications > ------------------------ > > 3-year PhD Program in Computer Science > DAIS - Computer Science > Ca' Foscari University of Venice, Italy > > . Deadline for application: April 11th, 2012. > Applications *must be received* by the deadline. > > . Start of program: September 2012 > > . Scholarship: Euro 13,600.00 per year (net). > > . Admission Requirements: A graduate degree equivalent to > or higher than the Italian "Laurea Magistrale" degree > (a five-year degree including a three-year undergraduate > program followed by a two-year diploma) > > . Number of available positions with scholarship: 6. > These include 3 thematic scholarship on the following subjects > > (a) Cloud-based techniques for privacy-preserving information mining > (b) Calculations with resources and differentials > (c) Classification models for non-vectorial data > > and 3 non-thematic scholarships, for which we welcome applications > on all TYPES-relevant subjects. > > . The application form can be downloaded from the following link: > > http://www.unive.it/nqcontent.cfm?a_id=124585 > > The application must include: > - Curriculum Vitae > - Two recommendation letters > - Information about degree and degree program > - Research Statement (max 20,000 chars) > > . For more information, please contact phd at dais.unive.it > -- Michele Bugliesi, PhD Professor of Computer Science Dept. of Environmental Sciences Informatics and Statistics, Head Universit? Ca' Foscari Venezia http://www.dais.unive.it/~michele From jhala at cs.ucsd.edu Sun Apr 1 23:24:43 2012 From: jhala at cs.ucsd.edu (Ranjit Jhala) Date: Sun, 1 Apr 2012 20:24:43 -0700 Subject: [TYPES/announce] Call For Papers: APLAS 2012, 10th Asian Symposium on Programming Languages and Systems Message-ID: <69E96D6F-7F49-4CFD-A1DE-518927187519@cs.ucsd.edu> 10th Asian Symposium on Programming Languages and Systems ========================================================= Kyoto, Japan, December 13-15 2012 http://aplas12.kuis.kyoto-u.ac.jp/ co-located with CPP 2012 http://cpp12.kuis.kyoto-u.ac.jp/ Important Dates --------------- * Abstract Deadline : Jun 11, 2012 (Monday) * Submission Deadline : Jun 15, 2012 (Friday) * Notification : Aug 27, 2012 (Monday) * Camera-Ready : Sep 19, 2012 (Monday) * Conference : Dec 11-13, 2012 Background ---------- APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in 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-Verlag's LNCS. **The 2012 conference will be held at Kyoto, Japan.** Topics ------ The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: + semantics, logics, foundational theory; + design of languages and foundational calculi; + domain-specific languages; + type systems; + compilers, interpreters, abstract machines; + program derivation, synthesis and transformation; + program analysis, constraints, verification, model-checking; + software security; + concurrency, parallelism; + tools for programming, verification, implementation. APLAS 2012 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. Submission Information ---------------------- We solicit submissions in two categories: (a) *Regular research papers*: describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. (b) *System and Tool presentations*: describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page http://www.easychair.org/conferences/?conf=aplas2012 Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. Organizers ---------- **General Chair** Atsushi Igarashi, Kyoto Univ. **Program Chair** Ranjit Jhala, Univ. of California, San Diego aplas2012 at easychair.org **Program Committee** * Amal Ahmed, Northeastern Univ. * Satish Chandra, IBM * Juan Chen, Microsoft Research * Jean-Christophe Filliatre, LRI * Deepak Garg, MPI-SWS * Aarti Gupta, NEC Labs America * Arie Gurfinkel, SEI, Carnegie Mellon Univ. * Aquinas Hobor, Natl. Univ. Singapore * Chung-Kil Hur, MPI-SWS * Atsushi Igarashi, Kyoto Univ. * Ranjit Jhala, Univ. of California, San Diego * Thomas Jensen, INRIA * Akash Lal, Microsoft Research * Keiko Nakata, Institute of Cybernetics, Tallinn * James Noble, Victoria Univ. of Wellington * Luke Ong, Univ. of Oxford * Sungwoo Park, Pohang Univ. Sci. Tech. * Zvonimir Rakamaric, Univ. of Utah * Tachio Terauchi, Nagoya Univ. * Dimitrios Vytiniotis, Microsoft Research * Bow-Yaw Wang, Academia Sinica * Stephanie Weirich, Univ. of Pennsylvania * Eran Yahav, Technion * Xiangyu Zhang, Purdue Univ. * Jianjun Zhao, Shanghai Jiao Tong Univ. From hidaka at nii.ac.jp Sun Apr 1 23:34:44 2012 From: hidaka at nii.ac.jp (Soichiro Hidaka) Date: Mon, 02 Apr 2012 12:34:44 +0900 Subject: [TYPES/announce] NII Shonan Meetings - Call for seminar proposals Message-ID: <20120402123444G.hidaka@nii.ac.jp> <<< This is the third post. Proposals are received throughout the year, but the next deadline is June 15th.>>> NII SHONAN MEETINGS: CALL FOR PROPOSAL (1) Objective NII Shonan Meetings, following the well-known Dagstuhl Seminars, aim to promote informatics and informatics research at an international level, by providing yet another world's premier venue for world-class scientists, promising young researchers, and practitioners to come together in Asia to exchange their knowledge, discuss their research findings, and explore a cutting-edge informatics topics. The meetings are held in Shonan Village Center (near Tokyo), which offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. The friendly and open atmosphere is to promote a culture of communication and exchange among the meeting participants. The NII International Meetings are managed by National Institute of Informatics (NII) in Japan. (2) Scope and Style NII Shonan Meetings follow the style of the Dagstuhl Seminars. A meeting usually lasts for four days (Monday to Thursday) or shorter. It is initiated by at most three organizers (one from Asia), established leaders in their field, representing the different communities invited to the Seminar, preferably from different institutions. NII invites on their behalf about 25 to 35 researchers of international standing from academia and industry. Like Dagstuhl Seminars, an NII Shonan Meeting typically does not come with a fixed program. Instead, the pace and the program are guided by topics and presentations that evolve through discussions. In particular, NII does not require participants to submit a paper for presentation, or to give a presentation at all. On the contrary, NII encourages to present new ideas and work in progress. All administrate work of a meeting will be supported by the NII team in the preparation phase and during the seminars themselves, so that the organizers can focus on choosing research topics and selecting active researchers for the meeting. (3) Proposal Submissions NII invites international standing scientists to submit proposals for international meetings (with about 25-35 participants) on any topics of informatics. The proposal should clearly motivate the topic of your seminar and include the following items: - Meeting Title - Organizers (at most three, 1-page CV for each) - Proposed Dates for the Meeting - Description of the Meeting (1-2 pages, in English) - Invitation list (Title/First Name/Middle Name/Last Name/Affiliation/Email/URL/research list) The proposal should be submitted via the following EasyChair page: http://www.easychair.org/conferences/?conf=nim1 The proposal will be reviewed by the Academic Committee. Once the proposal is approved, our staff will help to organize the seminar. We welcome proposal submission anytime through a whole year, although submission is closed in June 15th & December 15th. Notification of acceptance is only made after about 40 days of each closing day. (4) Locations and Expenses The meetings are held in Shonan Village Center (near Tokyo), whose nearest train station can be accessed by a direct train from Narita International Airport, and offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. http://www.shonan-village.co.jp/svc/ The following rates cover overnight accommodation (single room) and full board (breakfast, lunch, and dinner) per day: - Meeting organizers: free - Participants from academia: 8000 Yen/day - Participants from industry and accompanying persons: 15,000 Yen/day (5) Organizing Committee Yoh'ichi Tohkura (NII): Chair Zhenjiang Hu (NII) Akiko Aizawa (NII) Hiroshi Hosobe (NII) Hiroyuki Kato (NII) Soichiro Hidaka (NII) (6) Inquiry Should you have any questions, please feel free to contact us by sending an email to shonan at nii.ac.jp More information about NII Shonan Meetings is available at the following website: http://www.nii.ac.jp/shonan/ ============================================================ Soichiro Hidaka National Institute of Informatics E-mail: hidaka at nii.ac.jp URL : http://research.nii.ac.jp/~hidaka ============================================================ From sescobar at dsic.upv.es Mon Apr 2 06:41:02 2012 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Mon, 2 Apr 2012 12:41:02 +0200 Subject: [TYPES/announce] 6th International School on Rewriting (ISR), July 16-20, 2012 References: <3BF4288F-C37B-4F6F-868B-7C35D38E6384@dsic.upv.es> Message-ID: <5B1FB717-B07B-4A89-9CF3-53AC8613E3B8@dsic.upv.es> Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th Universitat Politecnica de Valencia Valencia, Spain Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, and logic, and it is the basis of well-known programming paradigms like functional and equational programming, which are taught at the universitary level in many countries. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) and are implemented in popular systems like Mathematica, Autocad, and others. Rewriting techniques play a relevant role in computing research, education, and industry. The International School on Rewriting is promoted by the IFIP Working Group 1.6 Term Rewriting. The school is aimed at master and PhD students, researchers, and practitioners interested in the study of rewriting concepts and their applications. Two tracks are offered, including the lectures and the courses: - Track A: for newcomers in the field, or just for people who want to obtain a new, updated exposure. * Jose Meseguer. Introduction to Term Rewriting * Albert Rubio. Termination of Rewriting: Foundations and Automation * Santiago Escobar. A Rewriting-Based Specification and Programming Language: Maude * Beatriz Alarcon & Raul Gutierrez. Exercises on Term Rewriting - Track B: for those who want to get deeper in the most recent developments and applications of rewriting. * Maria Alpuente: Narrowing Techniques and Applications * Temur Kutsia: Matching, unification, and generalizations * Pierre Lescanne: Lambda Calculus: extensions and applications * Narciso Marti-Oliet: Rewriting Logic and Applications * Georg Moser: Automated Complexity Analysis of Term Rewriting Systems * Albert Oliveras: SAT and SMT techniques in Proof and Verification * Sophie Tison: Tree Automata, Turing Machines and Term Rewriting * Xavier Urbain: Certification of Rewriting Properties * Andrei Voronkov: Automated Reasoning and Theorem Proving Registration fees: 250 euro (early registration, before June 15, 2012) 350 euro (late registration, after June 15, 2012) Visit our web site for more information about registration and accommodation. The registration will be open in few weeks. For more information, please visit our web site or contact isr2012 at dsic.upv.es Organizing Committee: Salvador Lucas (chair) Beatriz Alarcon Santiago Escobar Marco A. Feliu Raul Gutierrez Sonia Santiago Alicia Villanueva From scott.west at inf.ethz.ch Mon Apr 2 08:06:34 2012 From: scott.west at inf.ethz.ch (Scott West) Date: Mon, 2 Apr 2012 14:06:34 +0200 Subject: [TYPES/announce] CfP: WAVE 2012, Workshop on Advances in Verification for Eiffel Message-ID: <4F79964A.70801@inf.ethz.ch> Workshop on Advances in Verification for Eiffel (WAVE) 2012 Co-located with TOOLS EUROPE 2012 29 May 2012, Prague, Czech Republic http://wave.inf.ethz.ch Call for Papers Correctness of software systems can be demonstrated by using static verification techniques such as theorem provers, model checkers and exhaustive testing. Static verifiers such as Spec# and ESC/Java have been developed for object-oriented languages. These verifiers have been shown to be feasible to apply to languages such as C# and Java, though the usability of the tools is still under investigation. The Eiffel language introduces significant challenges and opportunities for verification, both of correctness and for property checking. Eiffel's support for Design by Contract enables scalable and practical verification, while its expressive object-oriented model raises verification challenges that push state-of-the-art verification technology to the limit. This workshop focuses on advancing the state-of-the-art in verification technology for Eiffel. It will present work in progress as well as mature research and development results that address particular problems in verifying Eiffel software systems, both in terms of correctness and in terms of property checking (e.g., liveness or deadlock freedom for SCOOP programs). Research that demonstrates how verification techniques and tools for other languages (e.g., Java, C#, Ruby, Python) can be adapted or directly applied to Eiffel programs are particularly welcome, as are case studies or experiments in verification. Specific topics of interest at the workshop include, but are not limited to: - Theorem proving techniques applied to Eiffel programs - Denotational, operational and algebraic theories for contracts - Model checking applied to Eiffel programs - Automated testing techniques applied to Eiffel programs - Tools for verification of Eiffel programs - Verification techniques for other languages adapted to Eiffel programs - Verification techniques for other languages applied directly to Eiffel programs - Novel case studies or experiments in Eiffel verification - Proof-carrying code as applied to Eiffel - Techniques and tools for checking properties of Eiffel programs. Prospective authors are welcome to contact the workshop organisers to help clarify whether their work would be relevant to the workshop. Submissions The workshop solicits three types of papers: - Work-in-progress papers, demonstrating novel, promising or unusual research related to the topics above. These papers should be around 5-7 pages in LNCS format and should clear describe what is novel or promising about the work. - Research or experimental papers, demonstrating novel research results that are reasonably mature, and that would benefit from feedback and discussion at the workshop. These papers should be around 10-15 pages in LNCS format. - Tool papers, which describe novel tools for supporting verification. These papers should clearly describe what is novel about the tool, and should be around 5-7 pages in LNCS format. All papers will be peer-reviewed by the organisers and the programme committee, focusing on suitability for the workshop, novelty, and whether the work would lead to interesting discussions. Additional feedback will be provided during the workshop. Publication & Submission Accepted papers will appear in the workshop proceedings published as a CEUR workshop volume with an ISBN. A special issue of the Journal of Object Technology for extended versions of papers is under negotiation. Submission can be made through EasyChair, https://www.easychair.org/conferences/?conf=wave2012. Dates Submission: 24 April 2012 Notification: 8 May 2012 Camera ready copy: 15 May 2012 Workshop date: 29 May 2012 Workshop Organisers Richard Paige, University of York, UK Bertrand Meyer, ETH Zurich, Switzerland Scott West, ETH Zurich, Switzerland Program Committee To be announced From P.Achten at cs.ru.nl Mon Apr 2 08:27:47 2012 From: P.Achten at cs.ru.nl (Peter Achten) Date: Mon, 02 Apr 2012 14:27:47 +0200 Subject: [TYPES/announce] Second call for papers TFPIE 2012 Message-ID: <4F799B43.9070303@cs.ru.nl> CALL FOR PAPERS/PRESENTATIONS TFPIE 2012 International Workshop on Trends in Functional Programming in Education 2012 June 11 2012 University of St Andrews, Scotland http://www.cs.ru.nl/P.Achten/TFPIE_2012/TFPIE_2012_home.html *** NEW: The deadline to register for accommodations through the TFP website is March 26th, 2012. *** The deadline to submit articles/abstracts to TFPIE is May 20 The first International Workshop on Trends in Functional Programming in Education, TFPIE 2012, will be co-located with TFP 2012 at the University of St Andrews in Scotland. The goal of TFPIE is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where 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 chairs of TFPIE 2012 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). 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 2012 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 program committee will review, using prevailing academic standards, the articles accepted for presentation to select the best for publication in Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TOPICS OF INTEREST TFPIE 2012 welcomes submissions describing practical techniques used in the classroom, tools used and/or developed, 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: FP and beginning CS students FP in Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy If you are not sure if your work is appropriate for TFPIE 2012, please contact the PC chairs by e-mail at: tfpie2012 at cs.ru.nl . Program Committee Peter Achten, Radboud University Nijmegen Jost Berthold, University of Copenhagen Marc Feeley, University of Montreal Ralf Hinze, University of Oxford Shriram Krishnamurthi, Brown University Michel Mauny, ENSTA Paris Tech James McKinna, UK Marco T. Morazan, Seton Hall University Rinus Plasmeijer, Radboud University Nijmegen Simon Thompson, University of Kent Important Dates May 20 submission of abstract or article May 25 notification of acceptance June 11 TFPIE July 6 submission of formal paper September 10 notification of acceptance October 1 camera-ready paper Venue The University of St Andrews is Scotland's first university and the third oldest in the English-speaking world, founded in 1413. Over six centuries it has established a reputation as one of Europe's leading and most distinctive centers for teaching and research. St Andrews is situated on the east coast of Fife, Scotland, UK. The town is approximately 50 miles north-east of Edinburgh, 14 miles south-east of Dundee, 78 miles south of Aberdeen, and 82 miles east of Glasgow making it easily accessible by any means of transportation. Help on traveling to St Andrews can be found at: http://www.st-andrews.ac.uk/visiting/GettingtoStAndrews/ . Questions? If you have any questions, do not hesitate to contact us at: tfpie2012 at cs.ru.nl . From deligu at di.unito.it Mon Apr 2 08:50:00 2012 From: deligu at di.unito.it (Ugo de' Liguoro) Date: Mon, 02 Apr 2012 14:50:00 +0200 Subject: [TYPES/announce] CL&C 2012: deadline extension Message-ID: <4F79A078.8080208@di.unito.it> International Workshop on Classical Logic and Computation (CL&C'12) http://www.doc.ic.ac.uk/~svb/CLaC12 July, 8 2012 Warwick, England CL&C'12 is a satellite workshop of ICALP'12. IMPORTANT DATES Abstract submission (canceled) Deadline for submission: April, 23, 2012 (new) Notification of acceptance: June, 18, 2012 (new) Final version due: June, 28, 2012 (new) Workshop date: July, 8, 2012 INTRODUCTION CL&C'12 is the fourth of a conference series on Classical Logic and Computation. It intends to cover all work aiming to explore computational aspects of classical logic and mathematics. This year CL&C will be held as satellite workshop of ICALP'12 in Warwick: http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/ CL&C is focused on the interplay between program extraction from classical the exploration of the computational content of mathematical and logical principles. The scientific aim of this workshop is to bring together researchers from both fields and exchange ideas. SCOPE OF CL&C This workshop aims to support a fruitful exchange of ideas between the various lines of research on Classical Logic and Computation. Topics of interest include, but are not limited to, - version of lambda calculi adapted to represent classical logic; - design of programming languages inspired by classical logic; - cut-elimination for classical systems; - proof representation and proof search for classical logic; - translations of classical to intuitionistic proofs; - constructive interpretation of non-constructive principles; - witness extraction from classical proofs; - constructive semantics for classical logic (e.g. game semantics); - case studies (for any of the previous points). SUBMISSION AND PUBLICATION. This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic / position papers, as well as completed projects. We therefore ask for submission both of short abstracts and of longer papers. All submitted papers will be reviewed to normal standards. The PC recognises two kinds of papers: it will distinguish between accepted (full) papers that contain unpublished results not submitted elsewhere, and presentations of (short) papers about work in progress. The accepted papers will appear in EPTCS. In order to make a submission: - Format your file using the LNCS guidelines; there is a 15 page limit. - Use the submission instructions at https://www.easychair.org/conferences/?conf=clc2012 A participants' proceedings will be distributed at the workshop. PROGRAMME COMMITTEE * Herman Geuvers (Nijmegen) - chair * Stefano Berardi (Turin) * Steffen van Bakel (Imperial College London) * Silvia Ghilezan (Novi Sad) * Koji Nakazawa (Kyoto Univeristy) * Ugo de'Liguoro (Turin) CONTACT deligu at di.unito.it -------------- next part -------------- An HTML attachment was scrubbed... URL: From scott.west at inf.ethz.ch Mon Apr 2 08:54:27 2012 From: scott.west at inf.ethz.ch (Scott West) Date: Mon, 2 Apr 2012 14:54:27 +0200 Subject: [TYPES/announce] TOOLS Europe 2012: Call for Participation Message-ID: <4F79A183.5020704@inf.ethz.ch> ======================================================================== CALL FOR PARTICIPATION TOOLS EUROPE 2012 50th International Conference on Objects, Models, Components, Patterns The Triumph of Objects 29-31 May 2012, Prague, Czech Republic http://toolseurope2012.fit.cvut.cz/ Co-located with: ICMT 2012, SC 2012, TAP 2012, MSEPT 2012 ======================================================================== Becoming commonplace is a technology's ultimate proof of success. TOOLS Europe 2012 will celebrate the "triumph of objects" by welcoming researchers and practitioners who develop and use object-oriented techniques, models, components and patterns as enabling technologies in diverse domains. Started in 1989, the TOOLS conference series has played a major role in the development of object technology and, with its emphasis on practically useful results, has contributed to making it mainstream and ubiquitous. Invited Speakers: * Lionel Briand * Alan Kay (remote talk by video conference) * Bertrand Meyer Registration: Early registration, at a reduced price, will be open until 25 April 2012. http://toolseurope2012.fit.cvut.cz/index.php/registration.html Organization: Conference Chair - Bertrand Meyer, ETH Zurich, Eiffel Software, and ITMO Program Chairs - Carlo A. Furia, ETH Zurich - Sebastian Nanz, ETH Zurich Local Organization - Pavel Tvrdik, CTU Prague - Michal Valenta, CTU Prague - Jindra Vojikova, CTU Prague - Jan Chrastina, CTU Prague Publicity Chair - Scott West, ETH Zurich Accepted papers: * DroidSense: A Mobile Tool to Analyze Software Development Processes by Measuring Team Proximity. Luis Corral, Alberto Sillitti, Giancarlo Succi, Juri Strumpflohner and Jelena Vlasenko * Learning to Classify Bug Reports into Components. Ashish Sureka * Elucidative Development for Model-Based Documentation and Language Specification. Claas Wilke, Andreas Bartho, Julia Schroeter, Sven Karol and Uwe A?mann * Enhancing OSGi with Explicit, Vendor Independent Extra-functional Properties. Kamil Jezek, Premek Brada and Lukas Holy * Measuring Test Case Similarity to Support Test Suite Understanding. Michaela Greiler, Arie Van Deursen and Andy Zaidman * Quality Evaluation of Object-Oriented and Standard Mutation Operators Applied to C# Programs. Anna Derezinska and Marcin Rudnik * Non-interference on UML State-charts. Mart?n Ochoa, Jan J?rjens and Jorge Cuellar * Viewpoint Co-Evolution through Coarse-Grained Changes and Coupled Transformations. Manuel Wimmer, Nathalie Moreno and Antonio Vallecillo * 101companies: a community project on software technologies and software languages. Jean Marie Favre, Ralf Laemmel, Thomas Schmorleiz and Andrei Varanovich * Incremental Dynamic Updates with First-class Contexts. Erwann Wernli, Mircea Lungu and Oscar Nierstrasz * Efficient Method Lookup Customization for Smalltalk. Jan Kurs, Jan Vrany and Claus Gittinger * Representing Uniqueness Constraints in Object-Relational Mapping: The Natural Entity Framework. Mark Olah, David Mohr and Darko Stefanovic * Detection of Seed Methods for Quantification of Feature Confinement. Andrzej Olszak, Eric Bouwers, Bo Noerregaard Joergensen and Joost Visser * Multiparty Session C: Safe Parallel Programming with Message Optimisation. Nicholas Ng, Nobuko Yoshida and Kohei Honda * Identifying A Unifying Mechanism for the Implementation of Concurrency Abstractions on Multi-Language Virtual Machines. Stefan Marr and Theo D'Hondt * TimeSquare: Treat your Models with Logical Time. Julien Deantoni and Fr?d?ric Mallet * Poporo: A Formal Methods Tool for Fast-Checking of Social Network Privacy Policies. N?stor Cata?o, Sorren Hanvey and Camilo Rueda * Integrating Efficient Model Queries in State-of-the-art EMF Tools. G?bor Bergmann, ?bel Heged?s, ?kos Horv?th, Zolt?n Ujhelyi, Istvan Rath and Daniel Varro * Supporting Compile-Time Debugging and Precise Error Reporting in Meta-Programs. Yannis Lilis and Anthony Savidis * Fake Run-Time Selection of Template Arguments in C++. Daniel Langr, Pavel Tvrd?k, Tom?? Dytrych and Jerry P. Draayer * Assisted Behavior Driven Development Using Natural Language Processing. Mathias Soeken, Robert Wille and Rolf Drechsler * An object-oriented application framework for the development of real-time systems. Francesco Fiamberti, Daniela Micucci and Francesco Tisato * Turbo DiSL: Partial Evaluation for High-level Bytecode Instrumentation. Yudi Zheng, Danilo Ansaloni, Lukas Marek, Andreas Sewe, Walter Binder, Alex Villazon, Petr Tuma, Zhengwei Qi and Mira Mezini * Verification of snapshotable trees using access permissions and typestate. Hannes Mehnert and Jonathan Aldrich From ggrov at staffmail.ed.ac.uk Mon Apr 2 10:32:43 2012 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Mon, 2 Apr 2012 15:32:43 +0100 Subject: [TYPES/announce] WING 2012: Final Call for Papers -- Extended Deadline Message-ID: <33F636CF-6D4D-4B39-A02F-485A7B0414F5@staffmail.ed.ac.uk> [Please post - apologies for multiple copies.] *** Submission deadline extended to April 13, 2012 *** ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- Final Call for Papers --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. Releasing the software developer from this burden is crucial for ensuring the practical relevance of program verification. In the context of testing, suitable invariants have the potential of enabling high-coverage test-case generation. Thus, invariant generation is a key ingredient in a broad spectrum of tools that help to improve program reliability and understanding. As the design and implementation of reliable software remains an important issue, any progress in this area will have a significant impact. The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer-aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Groebner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis, and abstract interpretation. The aim of this workshop is to bring together researchers from these diverse fields. Scope ----- We encourage submissions presenting work in progress, tools under development, as well as work by PhD students, such that the workshop can become a forum for active dialogue between the groups involved in this new research area. 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 the following tools: - 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 Invited speaker ----------------- * Aditya Nori (Microsoft Research) Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Important Dates --------------- Submission deadline: April 13, 2012 Notification of acceptance: May 11, 2012 Final version due: June 08, 2012 Workshop: June 30, 2012 Submission ---------- WING 2012 encourages submissions in the following two categories: * Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. Given the informal style of the workshop, papers describing work in progress, with sufficient detail to assess the contribution, are also welcome. Original papers should not exceed 15 pages. * Extended abstracts: contain preliminary reports of work in progress, case studies, or tool descriptions. These will be judged based on the expected level of interest for the WING community. They will be included in the CEUR-WS proceedings. Extended abstracts should not exceed 5 pages. All submissions should conform to Springer's LNCS format. Formatting style files can be found at http://www.springer.de/comp/lncs/authors.html Technical details may be included in an appendix to be read at the reviewers' discretion and to be omitted in the final version. Please prepare your submission in accordance with the rules described above and submit a pdf file via https://www.easychair.org/?conf=wing2012 Publication ----------- All submissions will be peer-reviewed by the program committee. Accepted contributions will be published in archived electronic notes, as a volume of CEUR Workshop Proceedings. A special issue of the Journal of Science of Computer Programming with extended versions of selected papers will be published after the workshop. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From adamc at csail.mit.edu Mon Apr 2 10:34:57 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Mon, 02 Apr 2012 10:34:57 -0400 Subject: [TYPES/announce] Call for papers (deadline change): LFMTP'12 (colocated with ICFP'12) Message-ID: <4F79B911.7030809@csail.mit.edu> Apologies for the re-announcement; we've decided to shift the schedule later a bit, as reflected below. ============================================================= Seventh International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'12) http://people.csail.mit.edu/adamc/lfmtp12/ Copenhagen, Denmark, September 9, 2012 Affiliated with the International Conference on Functional Programming (ICFP'12) CALL FOR PAPERS ------------------------------------------------------------- IMPORTANT DATES Paper submission: May 14, 2012 Author notification: June 18, 2012 Final versions due: July 2, 2012 Workshop day: September 9, 2012 ------------------------------------------------------------- Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their use in reasoning tasks ranging from the correctness of software to the properties of formal computational systems on the other hand have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressivity and lucidity of the reasoning process. The broad subject areas of LFMTP'12 are: * Encoding and reasoning about the meta-theory of programming languages and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Submission and other details concerning the workshop can be found at its website at http://people.csail.mit.edu/adamc/lfmtp12/. Program Committee: Nick Benton (Microsoft Research) Adam Chlipala (MIT, co-chair) Nils Anders Danielsson (Chalmers University) Elsa Gunter (University of Illinois, Urbana-Champaign) Daniel R. Licata (Carnegie Mellon University) Dale Miller (INRIA) Frank Pfenning (Carnegie Mellon University) Carsten Sch?rmann (IT University of Copenhagen, co-chair) Matthieu Sozeau (INRIA) From carbonem at itu.dk Mon Apr 2 10:39:15 2012 From: carbonem at itu.dk (Marco Carbone) Date: Mon, 2 Apr 2012 16:39:15 +0200 Subject: [TYPES/announce] ICE 2012 - deadline EXTENSION (25 April 2012) Message-ID: Dear all, please consider submitting to ICE. The new deadline is 25 April 2012. *[- Apologies for multiple copies -] ICE 2012 5th Interaction and Concurrency Experience June 16, 2012, Stockholm, Sweden http://www.artist-embedded.org/artist/-ICE-2012-.html Satellite workshop of DisCoTec 2012 http://discotec.ict.kth.se/ === Highlights === - Invited talks: Marcello Bonsangue & Ichiro Hasuo - Innovative selection procedure - Special issue of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/) === Important Dates === 30 March 2012...............Abstract submission 04 April 2012 **25 April 2012***.................Full paper submission 18 April-12 May 2012 **26 April-11 May 2012**...Reviews, rebuttal 16 May 2012..................................................Notification to authors 30 May 2012..................................................Camera-ready 16 June 2012.................................................ICE in Stockholm 15 Sept 2012.................................................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, but every experience focuses on a different specific topic (see "Previous Editions" at the end of this call) related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. The theme of ICE 2012 is ***Distributed coordination, execution models, and resilient interaction***. 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 interaction - 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 - Relating 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 whose access will be restricted to the authors and all the PC members who do not have a conflict of interests with the paper. The PC members post comments/questions that the authors shall reply to. As witnessed by the past four 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 will be 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 === Papers must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2012 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2012) and should not exceed 15 pages with the EPTCS style (http://style.eptcs.org/). Accepted papers must be presented at the workshop by one of the authors. === Special Issue === Full versions of the best papers selected by the PC will be invited to appear in a special issue of the journal of Scientific Annals of Computer Science (http://www.info.uaic.ro/bin/Annals/). 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 === Lucia Acciai (University of Firenze, Italy) Luca Aceto (Reykjavik University, Iceland) Massimo Bartoletti (University of Cagliari, Italy) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, United Kingdom) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marco Carbone (co-chair) Vincenzo Ciancia (University of Amsterdam, The Netherlands) Pierre-Malo Denielou (Imperial College, United Kingdom) Cinzia Di Giusto (CEA, France) Tobias Heindel (CEA, France) Tom Hirschowitz (CNRS, France) Bartek Klin (Warsaw University, Poland) Ivan Lanese (University of Bologna/INRIA, Italy) Alberto Lluch Lafuente (IMT Lucca, Italy) Bas Luttik (Technische Universiteit Eindhoven, The Netherlands) Manuel Mazzara (Newcastle University, United Kingdom) Mohammadreza Mousavi (Technische Universiteit Eindhoven, The Netherlands) Damien Pous (CNRS, France) Jens-Wolfhard Schicke-Uffmann (TU Braunschweig, Germany ) Alexandra Silva (co-chair) Ana Sokolova (University of Salzburg, Austria) Francesco Tiezzi (IMT Lucca, Italy) Emilio Tuosto (University of Leicester, United Kingdom) Erik de Vink (Technische Universiteit Eindhoven, The Netherlands) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alexandra Silva (Radboud University Nijmegen & CWI, The Netherlands; HasLab / INESC TEC, Portugal; co-chair) - Ana Sokolova (University of Salzburg, Austria) === Contact === ice2012 at easychair.org === Previous editions === The previous four editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland with focus on Synchronous and Asynchronous Interactions in Concurrent/ Distributed Systems, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy with focus on Structured Interactions, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and a special issue of MSCS is in preparation. * June 10th, 2010 in Amsterdam, The Netherlands with focus on Guaranteed Interactions, 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 with focus on Reliable and Contract-based Interactions, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and a special issue of SACS is now in preparation. === Workshop Sponsors === CEA-List Computer Science Department - University of Bologna* -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.aldrich at cs.cmu.edu Tue Apr 3 00:19:38 2012 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Tue, 03 Apr 2012 00:19:38 -0400 Subject: [TYPES/announce] LaME'12 CFP: Languages for the Multi-core Era (ECOOP workshop) Message-ID: <4F7A7A5A.8010203@cs.cmu.edu> The Languages for the Multi-core Era workshop at ECOOP (co-located with PLDI) welcomes contributions to type systems for concurrency - Jonathan LaME?12 Call for Papers 2012 International Workshop on Languages for the Multi-core Era http://lame.dei.uc.pt June 13 2012, at ECOOP 2012, Beijing China http://ecoop12.cs.purdue.edu/ (also colocated with PLDI, ISMM, LCTES, the X10 workshop, and other events) LaME is an interactive venue for exposing, evaluating, and developing programming language support for concurrency. This workshop provides a forum for the proposal and discussion of creative ideas that spur the development of innovative or improved concurrency models, languages, run-time systems, libraries and tools for multicore programming. We solicit contributions in any of three forms, at https://www.easychair.org/conferences/?conf=lame12 1. Regular papers (of up to 8 pages) reporting mature or ongoing work in relevant foundational and theoretical aspects of concurrent programming, languages, tools, frameworks, case studies, and practical experience. Selected papers peer reviewed by the Program Committee will be presented at the workshop and included in the ACM digital library. 2. Position papers (of up to 2 pages) describing ongoing work of attendees. Position papers will be reviewed for scope and relevance, and distributed to all attendees before the workshop. 3. Solutions to the LaME'12 programming challenge (to be issued April 15, 2012). A session at the workshop will be devoted to brief presentations of solutions and their implications for the design and implementation of programming languages and parallel program development. Important dates Regular paper submission April 15, 2012 Regular paper notification May 13, 2012 Regular paper final copy May 25, 2012 Position paper submission May 20, 2012 Programming challenge submission May 20, 2012 Workshop June 13, 2012 Organizing Committee * Jonathan Aldrich (Carnegie Mellon University) http://www.cs.cmu.edu/~aldrich/ * Paulo Marques (University of Coimbra) http://pmarques.dei.uc.pt/ * Bruno Cabral (University of Coimbra) http://eden.dei.uc.pt/~bcabral/ * N?stor Cata?ho (University of Madeira) http://dme.uma.pt/pt/people/faculty/Nestor.Catano.html * Doug Lea (State University of New York at Oswego) http://gee.cs.oswego.edu/ Program Chair * Doug Lea (State University of New York at Oswego) http://gee.cs.oswego.edu/ Program Committee * Robert Bocchino (Carnegie Mellon University) http://www.cs.cmu.edu/~rbocchin/Home.html * Brian Goetz (Oracle) http://www.briangoetz.com/ * Philipp Haller (TypeSafe and EPFL) http://lampwww.epfl.ch/~phaller/ * Mark Miller (Google) http://research.google.com/pubs/author35958.html * Simon Peyton-Jones (Microsoft) http://research.microsoft.com/en-us/people/simonpj/ * Vivek Sarkar (Rice University) http://www.cs.rice.edu/~vs3/home/Vivek_Sarkar.html * Steve Vinoski (Basho) http://steve.vinoski.net/blog/ From rensink at cs.utwente.nl Tue Apr 3 09:16:40 2012 From: rensink at cs.utwente.nl (Arend Rensink) Date: Tue, 03 Apr 2012 15:16:40 +0200 Subject: [TYPES/announce] Santiago Zanella wins the EAPLS Best PhD Dissertation Award 2011 Message-ID: <4F7AF838.60306@cs.utwente.nl> It is the great pleasure of the European Association on Programming Languages and Systems to announce the outcome of the EAPLS Best Dissertation Award 2011. This award is given to the PhD student who has made the most original and influential contribution to the area of Programming Languages and Systems, and has graduated in the period from November 2010 up to November 2011 at a European academic institute. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. The winner of this second edition of the EAPLS Dissertation Award is Dr. Santiago Zanella B?guelin ?cole nationale sup?rieure des mines de Paris for his dissertation on Formal Certification of Game-Based Cryptographic Proofs The winner was selected by a committee of international experts. Details on the procedure can be found at http://eapls.org/pages/phd_award/. The candidate theses were judged on originality, impact, relevance, and quality of writing. The jury concluded unanimously that Dr. Zanella's dissertation is an outstanding piece of work; it ended first amidst some very strong contenders. A very short summary of the qualities of the thesis: * It contains important results in a notoriously difficult area, by bringing together the different fields of cryptography and programming languages, with essential contributions from probability and complexity; * It has a potentially high impact, as already shown by the large number of citations; * It has very wide scope, including theory, tool implementation and non-toy case studies; * Despite the complexity of the subject matter, it is very well-written and readable. The EAPLS heartily congratulates Dr. Zanella as well as his supervisor, Gilles Barthe, with winning the award. We believe that the quality of the work is a clear sign of a long and fruiful academic career in the area of Programming Languages and Systems. -- Arend Rensink http://www.cs.utwente.nl/~rensink Department of Computer Science mailto:rensink at cs.utwente.nl University of Twente tel: +31 53 489 4862 P.O. Box 217, NL-7500 AE Enschede, Netherlands fax: +31 53 489 3247 From might at cs.utah.edu Tue Apr 3 10:11:58 2012 From: might at cs.utah.edu (Matthew Might) Date: Tue, 3 Apr 2012 08:11:58 -0600 Subject: [TYPES/announce] PLDI 2012: Student travel grants available Message-ID: <97D0641D-99DF-43BA-8372-DC6C0FD53F2B@cs.utah.edu> Student travel grants are available for PLDI 2012, and the organizers remind and encourage students to apply for them. * Dates: 11?16 June * Location: Beijing * Co-located events PLDI - Programming Language Design and Implementation ECOOP - European Conference on Object-Oriented Programming ISMM - International Symposium on Memory Management LCTES - Languages, Compilers, Tools and Theory for Embedded Systems Asia-Pacific Programming Languages and Compilers Workshop * Web site: http://pldi12.cs.purdue.edu * Invited speakers Ole Agesen (VMWare) Doug Lea (SUNY) Amer Diwan (Google) Martin Odersky (EPFL) Tobias Wrigstad (Uppsala) Gernot Heiser (NICTA) Nicolas Halbwachs (VERIMAG) Rob O'Callahan (Mozilla) These conferences and workshop are a forum where researchers, developers, educators, and practitioners exchange information on the latest practical and experimental work in the design and implementation of programming languages, object technology, memory systems, and embedded tools and compilers. * Travel grant information Apply: http://pldi12.cs.purdue.edu/content/students Volunteer: http://ecoop12.cs.purdue.edu/content/call-student-volunteers (Deadline 15 April) Register: http://pldi12.cs.purdue.edu/content/registration Facebook: http://www.facebook.com/events/221514727865075/ Travel: http://www.facebook.com/events/314574741939037/ ECOOP PhD Symposium: http://ecoop12.cs.purdue.edu/content/ecoop-2012-doctoral-symposium PLDI Student Research Competition: http://pldi12.cs.purdue.edu/content/pldi-2012-student-research-competition On behalf of the PLDI 2012 organizers, Matt Might From tiezzi at dsi.unifi.it Tue Apr 3 11:24:22 2012 From: tiezzi at dsi.unifi.it (Francesco Tiezzi) Date: Tue, 3 Apr 2012 17:24:22 +0200 Subject: [TYPES/announce] WWV 2012 - EXTENDED Deadline (Paper submission: April 25, 2012) Message-ID: <6DF0706D-9B93-4DED-A52D-FEC6EBCF7646@dsi.unifi.it> [Apologies for multiple copies] ******************************************************** Deadline for abstract and paper submission to WWV 2012 has been extended: Abstract submission (new date): April 17, 2012 Paper submission (new date): April 25, 2012 ******************************************************** ******************************************************** Call for Papers WWV 2012 Automated Specification and Verification of Web Systems 8th International Workshop (as part of DisCoTec'12) http://users.dsic.upv.es/~jsilva/wwv2012/ June 16, 2012 - Stockholm, Sweden ******************************************************** IMPORTANT DATES Abstract Submission April 17, 2012 (EXTENDED) Full Paper Submission April 25, 2012 (EXTENDED) Acceptance Notification May 16, 2012 Camera Ready (pre-proceedings) May 30, 2012 Workshop June 16, 2012 Camera Ready (post-proceedings) July 4, 2012 SCOPE 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. 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. INVITED SPEAKER Jos? Luiz Fiadeiro (University of Leicester) 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 in PDF format and prepared in LaTeX using the EPTCS-style format (http://style.eptcs.org/) and should not exceed 15 pages (typeset 11 points). Submissions are handled using the EasyChair online system and can be uploaded using the following link: https://www.easychair.org/conferences/?conf=wwv2012 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. Workshop post-proceedings will be published as a volume of the EPTCS (Electronic Proceedings in Theoretical Computer Science, http://eptcs.org/) series. An open call for a special high-quality journal issue on the topic of the WWV workshop is envisaged. WORKSHOP CO-CHAIRS Josep Silva Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy PROGRAM COMMITTEE Jesus M. Almendros-Jimenez Universidad de Almeria, Spain Maria Alpuente Universitat Polit?cnica de Val?ncia, Spain Demis Ballis University of Udine, Italy Daniela Da Cruz University of Minho, Portugal Santiago Escobar Universitat Polit?cnica de Val?ncia, Spain Moreno Falaschi University of Siena, Italy Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Elie Najm Telecom ParisTech, France Rosario Pugliese University of Florence, Italy Antonio Ravara New University of Lisbon, Portugal Kostis Sagonas Uppsala University, Sweden Josep Silva Universitat Polit?cnica de Val?ncia, Spain Francesco Tiezzi IMT Institute for Advanced Studies Lucca, Italy Emilio Tuosto University of Leicester, United Kingdom CONTACT wwv2012 at easychair.org From andrei at chalmers.se Wed Apr 4 03:41:01 2012 From: andrei at chalmers.se (Andrei Sabelfeld) Date: Wed, 4 Apr 2012 09:41:01 +0200 Subject: [TYPES/announce] Assistant Professor position at Chalmers Message-ID: <4F7BFB0D.3000202@chalmers.se> Dear all, We're looking for a talented and ambitions Assistant Professor in Information and Communication Technology at Chalmers University of Technology, Gothenburg, Sweden. The position includes at least 80% research time and prestigious status of Area of Advance at Chalmers: http://www.chalmers.se/en/areas-of-advance/ict/Pages/default.aspx The area of types is well in scope of the position. Please, help spread the word! Application deadline: May 1, 2012 Further info and application link: http://web1.reachmee.com/i003/chalmers/se/vacdetail.aspx?commadseqno=502&postback%20=%20vacancies.aspx Best regards, -Andrei From esslli2012stus at loriweb.org Wed Apr 4 04:06:55 2012 From: esslli2012stus at loriweb.org (Rasmus K. Rendsvig) Date: Wed, 04 Apr 2012 10:06:55 +0200 Subject: [TYPES/announce] Final CfP (Ext.): ESSLLI 2012 Student Session In-Reply-To: <4EE9E448.8080204@loriweb.org> References: <4EE9E448.8080204@loriweb.org> Message-ID: <4F7C011F.5000600@loriweb.org> [apologies for multiple postings] *** PLEASE DISTRIBUTE TO STUDENTS *** Final Call for Papers *ESSLLI 2012 STUDENT SESSION* Held during The 24th European Summer School in Logic, Language and Information Opole, Poland, August 6-17, 2012 *EXTENDED DEADLINE: APRIL 30, 2012* http://loriweb.org/ESSLLI2012StuS/ *ABOUT:* The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience. ESSLLI 2012 will feature a wide range of foundational and advanced courses and workshops in all areas of Logic, Language, and Computation. Consult the main ESSLLI website (link below) for further information. *SPRINGER PRIZES FOR BEST PAPER AND BEST POSTER* In 2012, Springer has again continued its generous support for the Student Session by offering EUR 1000 in prizes. These include a a EUR 500 for Best Paper and EUR 500 for Best Poster. The prizes are awarded best on the reviews of the submission as well as the oral presentation. *INSTRUCTIONS FOR AUTHORS:* Authors must be students, i.e., may not have received the Ph.D. degree before August 2012. All submissions must be in PDF format and be submitted to the conference EasyChair website. Submissions may be singly or jointly authored. No one may submit more than one singly and one jointly authored paper. There are two types of papers. Long papers of up to 8 pages will be considered for both oral presentation and the poster session. Short papers of up to 4 pages will be considered as submissions for the poster session. We strive for posters getting the longest possible exposure during ESSLLI 2012. Submissions must be anonymous, without any identifying information ready for blind peer review, and must be must be received by *April 30, 2012*. More detailed guidelines regarding submission can be found on the Student Session website: http://loriweb.org/ESSLLI2012StuS/ Links to previous years' proceedings are also available there. *IMPORTANT DATES: *Submission of papers: April 30 Notification deadline: June 10 (in time to make early registration for ESSLLI with reduced fee) Submission of camera-ready papers: July 1 Conference dates: August 6-17 *PROCEEDINGS *All accepted papers will be available in online proceedings. A Springer volume in the LNCS series with the best papers of 2008-2009 have been published, and a similar volume for 2010-2011 is in preparation. We aspire to a forthcoming volume for 2012-2013. *FURTHER INFORMATION:* Please direct inquiries about submission procedures or other matters relating to the Student Session to esslli2012stus at loriweb.org. For general inquiries about ESSLLI 2012, please consult the main ESSLLI 2012 page, http://esslli2012.pl/. Kind regards, The ESSLLI 2012 Students Session Organization Committee, Rasmus K. Rendsvig (Roskilde University) (chair) Anders Johannsen (University of Copenhagen) Dominik Klein (Tilburg University) Margot Colinet (Universit? de Paris 7) Matthijs Westera (Universiteit van Amsterdam) Maxim Haddad (University of Osnabr?ck) Niels Beuck (Hamburg University) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bove at chalmers.se Wed Apr 4 04:25:42 2012 From: bove at chalmers.se (Ana Bove) Date: Wed, 4 Apr 2012 10:25:42 +0200 Subject: [TYPES/announce] Two Assistant Professors position in Basic Sciences at Chalmers Message-ID: <4F7C0586.2060509@chalmers.se> Dear all, We're looking for two talented and ambitions Assistant Professors in areas related to basic sciences at Chalmers University of Technology, Gothenburg, Sweden. The position includes at least 80% research time and financing for one PhD student. The area of types is well in scope of the positions. Please, help spread the word! Application deadline: May 1, 2012 Further info and application link: http://web1.reachmee.com/i003/chalmers/se/vacdetail.aspx?commadseqno=510&postback%20=%20vacancies.aspx Best regards, -- -- Ana Bove http://www.cse.chalmers.se/~bove Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg From alur at seas.upenn.edu Wed Apr 4 09:39:08 2012 From: alur at seas.upenn.edu (Rajeev Alur) Date: Wed, 04 Apr 2012 09:39:08 -0400 Subject: [TYPES/announce] Post-doc positions in NSF's multi-university Expeditions project on Software Synthesis Message-ID: <4F7C4EFC.60206@seas.upenn.edu> Postdoctoral Research Positions in 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. 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). More information on the project, along with the list of Principal Investigators, is available at http://excape.cis.upenn.edu/ ExCAPE has funding available for multiple post-doctoral research positions starting Fall 2012. 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. Each post-doctoral researcher will be advised by two PIs, and will be expected to split time between the institutions of the two mentors. To apply, following material should be submitted electronically, by April 30, 2012, to Liz Ng (wng at seas.upenn.edu): 1. Candidate's CV 2. Two representative publications 3. Statement of research (1-2 pages) 4. Two or three letters of reference For more information, feel free to contact any of the PIs. From amal at ccs.neu.edu Wed Apr 4 09:55:00 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Wed, 4 Apr 2012 09:55:00 -0400 Subject: [TYPES/announce] LOLA 2012: Call for Talk Proposals Message-ID: <1008CCA9-1BEB-4EC3-80AA-C5939C02FAD2@ccs.neu.edu> ============================================================ *** CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in 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 short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bengt at chalmers.se Wed Apr 4 16:35:59 2012 From: bengt at chalmers.se (Bengt Nordstrom) Date: Wed, 4 Apr 2012 22:35:59 +0200 Subject: [TYPES/announce] Call for papers: Types for Proofs and Programs Message-ID: Call for papers: Types for Proofs and Programs ---------------------------------------------- The post-proceedings of TYPES 2011, which was held in Bergen, are open to everyone, also those who did not participate in the conference. We welcome submissions on any topic related to TYPES, including but not limited to the following: - 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. - Formalisation of mathematics using type theory. Important dates --------------- Paper submission deadline: 2012-06-01 Notification of acceptance: 2012-10-31 Details ------- * Papers must be submitted using EasyChair: https://www.easychair.org/conferences/?conf=types2011 * Authors have the option to include an attachment (.zip or .tgz) containing mechanised proofs, but reviewers are not obliged to take these attachments into account. Attachments will not be published together with the papers. * The post-proceedings will be published in LIPIcs (Leibniz International Proceedings in Informatics, http://www.dagstuhl.de/en/publications/lipics), an open-access series of conference proceedings. * Authors of accepted papers retain copyright, but are expected to sign an author agreement with Schloss Dagstuhl?Leibniz-Zentrum f?r Informatik, see http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/. * For information about how to prepare submissions, see http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/. * Page limit: 15 pages. * In case of questions, contact one of the editors. Editors ------- Nils Anders Danielsson University of Gothenburg Bengt Nordstr?m Chalmers University of Technology Program committee ----------------- Andreas Abel Ludwig-Maximilians-Universit?t M?nchen Hugo Herbelin INRIA Paris-Rocquencourt Zhaohui Luo Royal Holloway University of London Claudio Sacerdoti Coen University of Bologna Tarmo Uustalu Tallinn University of Technology From gorel at cs.lth.se Thu Apr 5 05:06:21 2012 From: gorel at cs.lth.se (=?iso-8859-1?Q?G=F6rel_Hedin?=) Date: Thu, 5 Apr 2012 11:06:21 +0200 Subject: [TYPES/announce] 2nd CFP: SLE 2012 - International Conference on Software Language Engineering Message-ID: <964E991D-E313-4801-B340-5CBDCB18EFC3@cs.lth.se> ======================================================================== Second CALL FOR PAPERS Fifth International Conference on Software Language Engineering (SLE 2012) Sept 25-28, 2012, Dresden, Germany (Co-located with GPCE 2012) General chair: Uwe Assmann, Dresden University of Technology, Germany Program co-chairs: Krzysztof Czarnecki, Waterloo University, Canada G?rel Hedin, Lund University, Sweden http://planet-sl.org/sle2012 ======================================================================== The 5th International Conference on Software Language Engineering (SLE 2012) is devoted to topics related to artificial languages in software engineering. SLE's foremost mission is to encourage and organize communication among communities that have traditionally looked at software languages from different and yet complementary perspectives. Thus, of particular relevance to SLE are technologies, methods, experiments, and case studies on software languages from modelware, grammarware and ontologyware perspectives. IMPORTANT DATES Abstract submission deadline : June 4, 2012 Article submission deadline : June 11, 2012 Notification to authors : August 3, 2012 Camera-ready papers for preproceedings : September 3, 2012 Camera-ready papers for postproceedings : October 28, 2012 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 (Springer LNCS style). - 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. - 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. 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. Submitted articles must not have been previously published or currently be submitted for publication elsewhere. PROCEEDINGS All submitted papers will be reviewed by at least three members of the program committee. As for previous instances of SLE, all accepted papers will be made available at the conference in the pre-proceedings and published in the post-proceedings of the conference, which will appear in Springer's Lecture Notes in Computer Science series. Authors will have the opportunity to revise their accepted paper for the pre- and post-proceedings. All papers must be formatted according to the Springer?s Lecture Notes in Computer Science style. SCOPE The term "software language" refers to artificial languages used in software development including general-purpose programming languages, domain-specific languages, modeling and meta-modeling languages, data models, and ontologies. Examples include general purpose modeling languages such as UML, but also 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" also comprises APIs and collections of design patterns that define a language implicitly. Software language engineering is the application of systematic, disciplined, and quantifiable approaches to the development (design, implementation, testing, deployment), use, 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. EAPLS BEST PAPER AWARD The best reviewed papers submitted to SLE and GPCE will be candidates for the 2012 SLE/GPCE Best Paper Award given by EAPLS. Out of these candidates, an independent EAPLS committee will select the award winner. 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: Examples are formalisms for grammars, schemas, ontologies, and metamodels; tools that detect inconsistencies in metamodels or analyze grammars to build a parser; and formal logics and proof assistants that verify properties of language specifications. - Language implementation techniques: These include advances in traditional compiler generator tools such as parser/scanner generators, attribute grammar systems, term-rewriting systems, functional-programming-based combinator libraries; also of interest are metamodel-based and ontology tools implementing constraint, rule, view, transformation, and query formalisms and engines. - Program and model transformation tools: Examples are tools that support program refinement and refactoring, model-based development, aspect and model weaving, model extraction, metamodeling, model transformations, reasoning on models, round-trip engineering, and runtime system transformation. - Composition, integration, and mapping tools for managing different aspects of software languages or different manifestations of given language: Examples are tools for mapping between the concrete and abstract syntax of a language and for managing textual and graphical concrete syntax for the same or closely related languages. - Transformations and transformation languages between languages and models: transformation descriptions and tools or XML/RDF/ontology/object/relational mappings; also, reasoning for and about transformations. - Language evolution: Included are extensible languages and type systems and their supporting tools and language conversion tools. Ontologies and APIs, when considered as languages, are subject to evolution; thus tools and techniques that assist developers in using a new version of an ontology or an API or a competing implementation in a program are also of interest. - 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. - 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. PROGRAM COMMITTEE Emilie Balland, INRIA Bordeaux - Sud-Ouest, France Paulo Borba, Federal University of Pernambuco, Brazil Claus Brabrand, IT University of Copenhagen, Denmark Jordi Cabot, ?cole des Mines de Nantes, France Krzysztof Czarnecki, University of Waterloo, Canada (co-chair) Dragan Gasevic, Athabasca University, Canada Jeremy Gibbons, University of Oxford, UK Jeff Gray, University of Alabama, USA G?rel Hedin, Lund University, Sweden (co-chair) Markus Herrmannsdoerfer, Technische Universit?t M?nchen, Germany Zhenjiang Hu, National Institute of Informatics, Japan Paul Klint, CWI, Amsterdam, The Netherlands Julia Lawall, INRIA/LIP6, France Kim Mens, Universit? catholique de Louvain, Belgium Mira Mezini, Technische Universit?t Darmstadt, Germany Daniel Moody, Ozemantics Pty Ltd, Sydney, Australia Pierre-Etienne Moreau, Ecole de Mines de Nancy, France Peter Mosses, Swansea University, UK Ralf M?ller, Hamburg University of Technology, Germany Klaus Ostermann, University of Marburg, Germany Bijan Parsia, University of Manchester, UK Arnd Poetzsch-Heffter, Technische Universit?t Kaiserslautern, Germany Lukas Renggli, Google, Zurich, Switzerland Bernhard Rumpe, Aachen University, Germany Joao Saraiva, Universidade do Minho, Portugal Michael Schwartzbach, University of Aarhus, Denmark Friedrich Steimann, Fernuniversit?t in Hagen, Germany Mark van den Brand, Eindhoven University of Technology, The Netherlands Eric Van Wyk, University of Minnesota, USA Jeff Z. Pan, University of Aberdeen, UK Steffen Zschaler, King's College, London, UK From Didier.Galmiche at loria.fr Sat Apr 7 05:55:40 2012 From: Didier.Galmiche at loria.fr (Didier.Galmiche at loria.fr) Date: Sat, 07 Apr 2012 11:55:40 +0200 Subject: [TYPES/announce] CFP Workshop LRPP 2012 (affiliated with IJCAR 2012) Message-ID: <4F800F1C.70308@loria.fr> ----------------------------------------------------------------------- Call For Papers Workshop on Logics for Resources, Processes and Programs (LRPP 2012) 1st July 2012, Manchester, UK (affiliated with IJCAR 2012, Manchester, UK) http://www.loria.fr/~galmiche/LRPP2012.html ---------------------------------------------------------------------- A one day workshop on `Logics for Resources, Processes, and Programs' will be held the 1st July 2012 in conjunction with the IJCAR 2012 Conference in Manchester, UK, with D. Galmiche and D. Pym as organizers. The purpose of this workshop would be to discuss recent results on logics, including systems formulated in the style of Hoare and Hennessy-Milner, for modelling resources, processes, programs, and their interactions. We envisage a range of perspectives: proof-theoretic foundations, including decidability and complexity; semantic foundations (e.g., new resource semantics); specification of properties and behaviours; verification and analysis of programs and systems. It should help to establish and publicize a research agenda for such logics and their use in the development of trusted systems. The workshop is intended to provide a forum for discussion between researchers interested in logics of resources (from foundations to related calculi and applications) and researchers interested in languages and methods for specification of mobile, distributed, concurrent systems and their verification. Topics of interest include, but are not restricted to, the following: - Logics for resources: semantics and proof theory; - Process calculi, concurrency, resource-distribution; - Reasoning about programs and systems; - Extensions of logics; e.g., with modalities; - Languages of assertions, languages based on resource logics (query languages, pointers, trees, and graphs) and reasoning; - Theorem proving and model checking in resource logics: decision procedures, strategies, complexity results. KEYNOTE SPEAKER Peter O'Hearn (UCL, London,UK) SUBMISSIONS Researchers interested in presenting their works are invited to send an extended abstract (up to 10 pages) by e-mail submissions of Postscript files to D. Galmiche (Didier.Galmiche at loria.fr) and D. Pym (d.j.pym at abdn.ac.uk) before May 15 2012. Papers will be reviewed by peers, typically members of the Programme Committee. Additional information will be available through WWW address: http://www.loria.fr/~galmiche/LRPP2012.html. Hardcopies of the preliminary proceedings will be distributed at the workshop and a Special Issue of a Journal on these topics is expected after the workshop. PROGRAM COMMITTEE J. Brotherston (UCL, London, UK) M. Collinson (University of Aberdeen, Scotland) D. Galmiche (LORIA, Nancy, France: Co-chair) J. Harland (RMIT University, Melbourne, Australia) M. Hennessy (Trinity College, Dublin, Ireland) D. Larchey-Wendling (LORIA, Nancy, France) F. Pfenning (CMU, Pittsburgh, USA) D. Pym (University of Aberdeen, Scotland: Co-chair) IMPORTANT DATES Submissions: May 15, 2012 Notifications: May 29, 2012 Final papers: June 10, 2004 Workshop date: July 1st, 2012 MORE INFORMATION E-mail: Didier.Galmiche at loria.fr and d.j.pym at abdn.ac.uk From cbraga at ic.uff.br Sat Apr 7 09:32:54 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Sat, 7 Apr 2012 10:32:54 -0300 Subject: [TYPES/announce] LSFA 2012: Call For Papers References: Message-ID: [ please distribute - apologies for multiple copies ] LSFA 2012: Call For Papers 7th Workshop on Logical and Semantic Frameworks, with Applications Rio de Janeiro, Brazil September 29-30, 2012 http://www.uff.br/lsfa/ Important Dates Paper submission deadline: June 1st, 2012 Author notification: July 14th, 2012 Camera-ready: August 5th, 2012 Conference: September 29-30, 2012 Invited speakers (confirmed) * Torben Brauner (Roskilde University, Denmark) * Maribel Fernandez (King?s College London, UK) * Edward Hermann Haeusler (PUC-Rio, Brazil) * Alexandre Miquel (Universite Paris 7, France) 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. In its seventh edition, the workshop will be at Pontificia Universidade Cat?lica do Rio de Janeiro (PUC-Rio). Previous editions of this conference were held in Belo Horizonte (2011), Natal (2010), Brasilia (2009), Salvador (2008), Ouro Preto (2007), Natal (2006). The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and the use of such techniques and results, from the practical side. 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 2012 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. This year post-proceedings will be published as in previous years. After the workshop, according to the quantity and quality of selected papers, the authors will be invited to submit full versions of their works that will be also reviewed to high standards. Post-proceedings and Special Issues were already published in the Logic Journal of IGPL, the Journal of Algorithms, ENTCS, and TCS. Submissions 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 EPTCS style. The submission should be in the form of a PDF file uploaded to LSFA 2012 page at Easychair until the submission deadline in June 1st, by midnight, Central European Standard Time (GMT+1). The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration and the proceedings will be published as a volume of EPTCS. After the workshop, according to the quantity and quality of selected papers, the authors will be invited to submit full versions of their works that will be also reviewed to high standards. At least one of the authors should register at the conference. The paper presentation should be in English. Scientific Committee * Carlos Areces (Univeridad Nacional de Cordoba, Argentine) * Arnon Avron (Tel-Aviv University, Israel) * Patrick Baillot (Ens de Lyon, France) * Veronica Becher (Universidad de Buenos Aires, Argentine) * Marcelo Coniglio (Unicamp, Brazil) * Thierry Coquand (University of Gothenburg, Sweden) * Hans van Ditmarsch (University of Sevilla, Spain) * Clare Dixon (The University of Liverpool, UK) * Marcelo Finger (IME-USP, Brazil) * Edward Hermann Haeusler (PUC-Rio, Brazil) * Delia Kesner (Universite Paris Diderot, France) (co-chair) * Luis da Cunha Lamb (UFRGS, Brazil) * Ian Mackie (Ecole Polytechnique, France) * Joao Marcos (UFRN, Brazil) * Georg Moser (University of Innsbruck, Austria) * Koji Nakazawa (Kyoto University, Japan) * Vivek Nigam (Ludwig-Maximilians-Universitat Munchen, Germany) * Luca Paolini (Universita di Torino, Italy) * Elaine Pimentel (Univalle, Colombia) * Simona Ronchi Della Rocca (Universita di Torino, Italy) * Mauricio Ayala-Rincon (UnB, Brazil) * Luis Menasche Schechter (UFRJ, Brazil) * Sheila Veloso (UFRJ, Brazil) * Daniel Ventura (UFG, Brazil) * Petrucio Viana (UFF, Brazil) (co-chair) Organization * Departamento de Ci?ncia da Computa??o, UnB * Departamento de Filosofia, Departamento de Inform?tica, PUC-Rio * Instituto de Matem?tica e Estat?stica, UFF Organizing Committee * Christiano Braga (UFF) * Renata de Freitas (UFF) (chair) * Luiz Carlos Pereira (PUC-Rio, UFRJ) * Mauricio Ayala-Rincon (UnB, Brazil) From adamc at csail.mit.edu Sat Apr 7 11:41:54 2012 From: adamc at csail.mit.edu (Adam Chlipala) Date: Sat, 07 Apr 2012 11:41:54 -0400 Subject: [TYPES/announce] Call for proposals: The 4th Coq Workshop Message-ID: <4F806042.7010901@csail.mit.edu> ========================================================================================= The Fourth Coq Workshop (2012) http://coq.inria.fr/coq-workshop/2012 Colocated with the 3rd International Conference on Interactive Theorem Proving (ITP 2012) Princeton, NJ, USA Call for Proposals ========================================================================================= 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. This year, we are open to many ideas on how to use the workshop time. Some suggestions to drive proposals include sessions on tool demonstrations or lessons learned from teaching Coq. Venue: ITP, Princeton. Important Dates: * June 1: Deadline for proposal submission * June 15: Acceptance notification * August 12: Workshop in Princeton Submission URL: https://www.easychair.org/conferences/?conf=coq4 Program committee * Yves Bertot, INRIA, France * Arthur Chargueraud, MPI-SWS, Germany * Adam Chlipala (chair), MIT, USA * Chung-Kil Hur, MPI-SWS, Germany * Assia Mahboubi, INRIA, France * Zhong Shao, Yale, USA * Bas Spitters, Nijmegen, Netherlands * Jean-Baptiste Tristan, Oracle, USA * Vladimir Voevodsky, IAS, USA Contact: Adam Chlipala From swarat at rice.edu Sat Apr 7 20:41:20 2012 From: swarat at rice.edu (Swarat Chaudhuri) Date: Sat, 07 Apr 2012 19:41:20 -0500 Subject: [TYPES/announce] Call for papers: Numerical Software Verification (NSV 2012) In-Reply-To: <4F80D5ED.5060308@rice.edu> References: <4F80D5ED.5060308@rice.edu> Message-ID: <4F80DEB0.1080309@rice.edu> Apologies for multiple copies -------------------------------------------------------------------- NSV 2012: Fifth International Workshop on Numerical Software Verification July 7-8, 2012 Berkeley, California, USA [Colocated with CAV 2012] Web Page: http://www.cs.rice.edu/~sc40/NSV/12/ Submission deadline April 27, 2012 (Friday) Submission URL http://www.easychair.org/conferences/?conf=nsv2012 Notification of acceptance May 15, 2012 Final version due June 1st, 2012 Registration Please register through the CAV 2012 registration system Workshop July 7-8, 2012 Organizers: Swarat Chaudhuri, Rice University, USA Sriram Sankaranarayanan, University of Colorado, USA Program Committee: Erika Abraham, RWTH, Aachen, Germany Azadeh Farzan, University of Toronto, Canada Georgios Fainekos, Arizona State University, USA Eric Goubault, CEA, Saclay, France Franjo Ivancic, NEC Laboratories America, USA Sylvie Putot, CEA, Saclay, France Stefan Ratschan, Czech Academy of Sciences Scope: The NSV workshop is dedicated to the current development and future prospects of numerical software verification techniques. The scope of the workshop includes, but is not restricted to, the following topics: * Models and abstraction techniques for numerical programs * Formal specification, verification, and synthesis of numerical programs * Quality of finite precision implementations * Propagation of uncertainties, deterministic and probabilistic models * Tradeoffs between quality of service and resource (for example energy) consumption in programs * Hybrid systems verification and synthesis * Application domains such as embedded software, scientific computing, and multimedia, graphics, and gaming. The two-day workshop will include several invited talks, presentations of contributed papers, and discussion periods. The contributed papers will be distributed before-hand on the CAV memory stick. Submissions: We seek submissions of contributed papers of length between 3 and 8 pages (larger submissions are also possible --- for this, please contact the organizers in advance). The title and the name of the authors should appear at the top of the first page. Please submit your paper at the easychair link provided. There will be no formal workshop proceedings---therefore, the work will be considered "unpublished". At least one author of each contributed paper is expected to register and attend to present the work. -------------- next part -------------- An HTML attachment was scrubbed... URL: From cezarykaliszyk at gmail.com Mon Apr 9 01:02:17 2012 From: cezarykaliszyk at gmail.com (Cezary Kaliszyk) Date: Mon, 9 Apr 2012 07:02:17 +0200 Subject: [TYPES/announce] UITP'12: Second Call for Papers Message-ID: [Apologies if you receive multiple copies] ------------------------------------------ --- Second Call for Papers --- 10th International Workshop on User Interfaces for Theorem Provers (UITP 2012) 11.07.2012, Bremen, Germany, Part of CICM 2012 http://www.informatik.uni-bremen.de/uitp12/ While interactive theorem provers have found many new application areas in the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. More and more, this is becoming an obstacle for the wider adoption of theorem proving technologies outside the academic community. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with interactive proof systems, be it theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. For the forthcoming 10th UITP workshop, we invite contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. Topics covered include, but are not limited to: * Application-specific interaction mechanisms or designs for prover interfaces; * Experiments and evaluation of prover interfaces; * Languages and tools for authoring, exchanging and presenting proof; * Implementation techniques (e.g. web services, custom middleware, DSLs); * Integration of interfaces and tools to explore and construct proof; * Representation and manipulation of mathematical knowledge or objects; * Visualisation of mathematical objects and proof; * System descriptions. Submitted papers should describe previously unpublished work (completed or in progress), and not be longer than twelve pages. We encourage concise but relevant papers. Submissions should be in PDF format, and typeset with the EasyChair LaTeX document class (which can be downloaded from www.easychair.org), or in similar style. Submission will be via EasyChair. All papers will be peer reviewed by members of the programme committee and selected by the organizers in accordance with the referee reports. Proceedings Accepted papers will appear in the workshop proceedings, which will be available in printed form at the workshop. After the workshop, revised papers can be submitted to a postproceedings, which will appear in an archivable electronic format, preferably published open access. Important Dates Submission deadline: 01.05.2012 Acceptance notification: 01.06.2012 Camera-ready copy: 15.06.2012 Program Committee: David Aspinall, University of Edinburgh, UK Serge Autexier, DFKI, Germany Christoph Benzmueller, Articulate Software, USA Herman Geuvers, Radboud University Nijmegen, the Netherlands Cezary Kaliszyk, University of Innsbruck, Austria, (PC co-chair) Christoph L?th, DFKI, Germany (PC co-chair) Adam Naumowicz, University of Bia?ystok, Poland Claudio Sacerdoti Coen, University of Bologna, Italy Geoff Sutcliffe, University of Miami, United States Enrico Tassi, INRIA, France Josef Urban, Radboud University Nijmegen, the Netherlands Makarius Wenzel, Universit? Paris-Sud 11, France More information about the workshop series can be found at the UITP Interest Group web page www.uitp-ig.org. -- Cezary Kaliszyk, University of Innsbruck, http://cl-informatik.uibk.ac.at/~cek/ From t.kitamura at aist.go.jp Mon Apr 9 07:35:57 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Mon, 9 Apr 2012 20:35:57 +0900 Subject: [TYPES/announce] *Deadline Extended* CFP : ICFEM 2012 - 14th International Conference on Formal Engineering Methods Message-ID: The deadlines of abstract submissions and paper submissions to ICFEM 2012 have been extended as follows. Abstract Submission Deadline (Extended): 16th April, 2012 Full Paper Submission Deadline (Extended): 23th April, 2012 We are looking forward to your submissions. ************************************************************ ICFEM 2012: 14th International Conference on Formal Engineering Methods CALL FOR PAPERs 12th-16th, November, 2012 Kyoto Research Park, Kyoto, Japan URL: http://www.jaist.ac.jp/icfem2012 ************************************************************ ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2012 will be hosted by National Institute of Advanced Industrial Science and Technology (AIST) and Japan Advanced Institute of Science and Technology (JAIST), which will be held in Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find many historical sites which have been designated as World Heritage there. We are looking forward to your submissions. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Formal methods for cloud computing/robotics/cyber-physical systems/ medical devices/aeronautics/railway * Formal methods for self-* systems * Formal methods for software safety, security, reliability and dependability * Experiments involving verified systems * Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc) * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2012 submission page (https://www.easychair.org/conferences/?conf=icfem2012), handled by the EasyChair conference system. IMPORTANT DATES Abstract Submission Deadline (Extended): 16th April, 2012 Full Paper Submission Deadline (Extended): 23th April, 2012 Acceptance/Rejection Notification: 18th June, 2012 Camera Ready Copy Due: 16th July, 2012 Conference: 12th-16th, November, 2012. ORGANIZATION COMMITTEE General Chairs: Kokichi Futatsugi, JAIST, Japan Shaoying Liu, Hosei Uni., Japan Conference Chair: Hitoshi Ohsaki, AIST, Japan Program Chairs: Kenji Taguchi, AIST, Japan Toshiaki Aoki, JAIST, Japan Steering Committee: Keijiro Araki, Kyushu University, Japan Michael Butler, University of Southampton, UK Jin Song Dong, National University of Singapore, Singapore He Jifeng, East China Normal University, China Shaoying Liu (Chair), Hosei University, Japan Jeff Offutt, George Mason University, USA Shengchao Qin, University of Teesside, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Cyrille Artho (AIST, Japan) Richard Banach (University of Manchester, UK) Nikolaj Bjorner(Microsoft Research Redmond, USA) Jonathan P. Bowen (University of Westminster, UK) Michael Butler (University of Southampton, UK) Sagar Chaki (CMU/SEI, USA) Rance Cleaveland (University of Maryland/Reactive Systems, USA) Jim Davies (Oxford University, UK) Zhenhua Duan (Xidian University, China) Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain) Andy Galloway (University of York, UK) Stefania Gnesi (ISTI-CNR, Italy) Wolfgang Grieskamp (Google, USA) Klaus Havelund (NASA JPL, USA) Daniel Jackson (MIT, USA) Thierry Jeron (INRIA, France) Gerwin Klein (NICTA, Australia) Weiqiang Kong (Kyushu University, Japan) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Engineering College of Aarhus, Denmark) Insup Lee (University of Pennsylvania, USA) Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany) Xuandong Li (Nanjing University, China) Yuan-Fang Li (Monash University, Australia) Zhiming Liu (UNU/IIST, Macau) Dominique Mery (Nancy University and LORIA, France) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Alexandre Mota (CIn-UFPE, Brasil) Shin Nakajima (NII, Japan) Kazuhiro Ogata (JAIST, Japan) Jose Nuno Oliveira (Universidade do Minho, Portugal) Jun Pang (University of Luxembourg, Luxembourg) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) S. Ramesh (General Motors India, India) Alexander Romanovsky (Newcastle University, UK) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Greame Smith (The University of Queensland, Australia) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Yih-Kuen Tsay (National Taiwan University, Taiwan) Viktor Vafeiadis (MPI-SWS, Germany) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Wang Yi (Uppsala University, Sweden) Jian Zhang (Chinese Academy of Sciences, China) Huibiao Zhu (East China Normal University, China) -- Takashi KITAMURA Ph.D. t.kitamura at aist.go.jp National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan -------------- next part -------------- An HTML attachment was scrubbed... URL: From ddino at eecs.qmul.ac.uk Tue Apr 10 05:36:00 2012 From: ddino at eecs.qmul.ac.uk (Dino Distefano) Date: Tue, 10 Apr 2012 10:36:00 +0100 Subject: [TYPES/announce] R&D Engineer at Monoidics, high-tech SME specialising in automatic program analysis Message-ID: <4120BC2B-E3EC-41CF-90E2-A3655CA3C0E2@eecs.qmul.ac.uk> Monoidics Ltd (www.monoidics.com), a high-tech SME specialising in automatic formal verification and producer of the INFER static analyzer is looking for: R&D Engineer Qualifications and skills required: *Strong programming skills + C and C++ on linux and Windows + functional languages, preferably OCaml + Java and scripting languages a plus + database programming a plus + testing tools a plus + web development a plus *System skills + embedded systems + system programming a plus *Experience + experience with complex software and algorithms + static analysis and verification + compiler development a plus + formal methods a plus + theory of concurrency and concurrent programming a plus + masters in computer science (or an equivalent mix of qualification and experience). Starting date: May 1st, 2012, or as soon as possible thereafter. Location: Shoreditch, East London, UK Salary: Competitive Apply: jobs at monoidics.com =============================================================== About Monoidics: Monoidics specialises in automatic formal verification and analysis of software. Founded in 2009, this growing company's mission is to bring verification and program analysis research to the forefront of industrial practice. Based in London, Monoidics operates world-wide and has strong links with key industrial partners in safety critical systems in Europe, USA, and Japan. =============================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From Patricia.Johann at cis.strath.ac.uk Tue Apr 10 06:16:50 2012 From: Patricia.Johann at cis.strath.ac.uk (Patricia Johann) Date: Tue, 10 Apr 2012 11:16:50 +0100 (BST) Subject: [TYPES/announce] 75YLC call for participation Message-ID: Attached is a flyer with a call for participation at the Workshop on 75 Years of the Lambda Calculus on 15 June. The flyer includes the workshop programme and registration information; the programme includes invited talks by Roger Hindley, Fairouz Kamareddine, Chris Hankin, and Henk Barendregt. The workshop is affiliated with Trends in Functional Programming. Best wishes, -patty -------------- next part -------------- A non-text attachment was scrubbed... Name: 75YLC call for participation.docx Type: application/vnd.openxmlformats-officedocument.wordprocessingml.document Size: 97490 bytes Desc: URL: From Peter.Sewell at cl.cam.ac.uk Tue Apr 10 09:13:25 2012 From: Peter.Sewell at cl.cam.ac.uk (Peter Sewell) Date: Tue, 10 Apr 2012 14:13:25 +0100 Subject: [TYPES/announce] Post-Doc positions - Semantics of Real-World Computer Systems Message-ID: [Please bring these to the attention of any suitable candidates - thanks, Peter] ********************************************************************* Faculty of Computer Science and Technology University of Cambridge We are seeking a Research Associate and a Senior Research Associate to join a lively group working on the semantics of real-world computer systems. Our recent work has focussed on the relaxed-memory concurrency that real systems exhibit, including work on the memory models of multiprocessors (x86, Power, ARM) and of programming languages (C11/C++11, Java), verified compilation of concurrent programming languages to multiprocessors, the semantic theory of relaxed-memory concurrency, and the development of tool support for semantics; some details can be found at http://www.cl.cam.ac.uk/~pes20/weakmemory/. We now plan to continue some of the above and also to look more broadly at areas where rigorous semantics can be applied to the engineering of systems software. RA: Salary ??27,578-??35,938 pa Reference NR15622 SRA: Salary ??37,012-??46,846 pa Reference NR15612 For the RA position you should have a PhD (which should be submitted by the start date) or equivalent experience; for the SRA position you should have an appropriate level of postdoctoral experience. For either, a keen interest in developing and applying rigorous semantic techniques for real-world systems is essential, ideally with a strong background in one or more of the following: * Programming Language Semantics and Type Systems * Automated Reasoning Tools * Concurrency * Program Verification * Static and Dynamic Analysis * Operating Systems * Compilers The position is funded by the EPSRC grant EP/H005633 (http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/H005633/1), led by Peter Sewell (http://www.cl.cam.ac.uk/~pes20/), to whom enquiries should be addressed. Applications should include: * a Curriculum Vitae * a brief statement of the particular contribution you would like to make to the project * a completed form CHRIS6: http://www.admin.cam.ac.uk/offices/hr/forms/chris6/ * the names and contact details (postal and e-mail addresses) of two or three referees. Start date: as soon as possible. The currently funded project runs until end 2014. Applications should be sent, preferably by email in pdf format, to personnel-admin at cl.cam.ac.uk. Postal Address: Personnel-Admin, University of Cambridge, Computer Laboratory, 15 JJ Thomson Avenue, Cambridge, CB3 0FD. * Limit of tenure: up to 2 years If in doubt about whether the RA or SRA position is appropriate, please quote both references. Closing Date: 4 May 2012 ********************************************************************* From vicki.chamberlin at cs.man.ac.uk Tue Apr 10 09:52:31 2012 From: vicki.chamberlin at cs.man.ac.uk (Vicki Chamberlin) Date: Tue, 10 Apr 2012 14:52:31 +0100 Subject: [TYPES/announce] The Turing Centenary Conference, Manchester, June 22-25: 2nd Call for Papers Message-ID: <4F843B1F.90007@cs.man.ac.uk> THE TURING CENTENARY CONFERENCE Manchester, UK, June 22-25, 2012 http://www.turing100.manchester.ac.uk/ Second announcement, call for submissions and call for participation. Features: (1) Ten Turing Award winners, a Templeton Award winner and Garry Kasparov as invited speakers (2) GBP 20,000 worth best paper award program, including GBP 5,000 best paper award (3) Two panels and two public lectures (4) Turing Fellowship award ceremony (5) Computer chess programme (6) Competition of programs proving theorems (7) and many more ... For more details please check http://www.turing100.manchester.ac.uk/. Note that the registration is now open. SPEAKERS Confirmed invited speakers: - Fred Brooks (University of North Carolina) - Rodney Brooks (MIT) - Vint Cerf (Google) - Ed Clarke (Carnegie Mellon University) - Jack Copeland (University of Canterbury, New Zealand) - George Francis Rayner Ellis (University of Cape Town) - David Ferrucci (IBM) - Tony Hoare (Microsoft Research) - Garry Kasparov (Kasparov Chess Foundation) - Samuel Klein (Wikipedia) - Don Knuth (Stanford University) - Yuri Matiyasevich (Institute of Mathematics, St. Petersburg) - Hans Meinhardt (Max-Planck Institute for Developmental Biology) - Roger Penrose (University of Oxford) - Adi Shamir (Weizmann Institute of Science) - Michael Rabin (Harvard University) - Leslie Valiant (Harvard University) - Manuela M. Veloso (Carnegie Mellon University) - Andrew Yao (Tsinghua University) Confirmed panel speakers: - Ron Brachman (Yahoo Labs) - Steve Furber (The University of Manchester) - Carole Goble (The University of Manchester) - Pat Hayes (Institute for Human and Machine Cognition, Pensacola) - Bertrand Meyer (Swiss Federal Institute of Technology) - Moshe Vardi (Rice University) SUBMISSIONS: The Turing Centenary Conference will include invited talks and a poster session. Submissions are sought in several areas of computer science, mathematics and biology. Submissions of two kinds are welcome: - Regular papers - Research reports All submitted papers must be in the PDF format and between 3 and 15 pages long. All submissions will be evaluated by the programme committee. Submission is through the EasyChair system, https://www.easychair.org/conferences/?conf=turing100. Regular papers must include original work not submitted before or during the Turing-100 reviewing period to any other event with published proceedings or a journal. All submitted regular papers will be considered eligible for the best paper awards. Research reports can contain work in progress and/or be based on previously submitted work. They will not be eligible for the best paper awards. *** Areas *** Submissions are welcome in all areas of computer science, mathematics and biology listed below: - computation theory - logic in computation - artificial intelligence - social aspects of computation - models of computation - program analysis - mathematics of evolution and emergence - knowledge processing - natural language processing - cryptography - machine learning - cognitive science - mathematical biology *** Schedule and conference proceedings *** The submission deadline is April 16. All submissions will be evaluated by the programme committee. Authors will be notified by acceptance or rejection on or before May 1st.At least one author of every accepted paper must register for the conference, attend it and present the paper at the poster session. All accepted papers will be published in the conference proceedings and available at the conference. The instructions on preparing final versions for the proceedings will appear on the Turing-100 Web site. *** Submissions and Best paper awards *** A subset of accepted regular papers will be selected by the programme committee for the second round of reviewing. The authors of the selected papers will be invited to submit revised versions of their papers by May 16. The programme committee will make decisions on best paper awards by June 14. All papers receiving the award will be published in a book dedicated to the conference and published after the conference. This book will also contain some papers by invited and panel speakers. In the case of doubts about the relevance of your paper to the conference and for all other queries please contact programme chair Andrei Voronkov at andrei at voronkov.com . See http://www.turing100.manchester.ac.uk/index.php/submission for more details. BEST PAPER AWARDS: A subset of poster session submissions will be selected as candidates for best paper awards: - The best paper award of GBP 5,000 - The best young researcher best paper award of GBP 3,000 - The second best paper award of GBP 2,500 - The second best young researcher best paper award of GBP 1,500 - Sixteen (16) awards of GBP 500 each See http://www.turing100.manchester.ac.uk/index.php/submission/bestpaper for more details. REGISTRATION: The number of participants is limited. Register early to avoid disappointment! To register, access https://www.easychair.org/conferences/?conf=turing100 and click on "Registration". *** Registration fees *** All fees are in Pound Sterling. early (on or before May 3)late (May 4 or later) Student280330 Regular380450 To qualify for a student registration you must be a full-time student on June 23, 2012. The registration fees include - Attendance of sessions - Conference reception - Conference dinner - Coffee breaks and lunches - Poster session proceedings There will be a travel support programme for students and attendees from countries where getting funding for travel is hardly possible. For more details about registration check http://www.turing100.manchester.ac.uk/index.php/registration. DATES: April 16:Poster session submission deadline May 1:Poster session notification and selection of candidates for awards May 15:Final versions of poster session papers May 16:Submission of full versions of papers selected for awards June 14:Best paper award decisions June 22-25:Conference July 15:Final versions of papers selected for awards CHAIRS: Honorary Chairs: Rodney Brooks (MIT) Roger Penrose (Oxford) Conference Chairs: Matthias Baaz (Vienna University of Technology) Andrei Voronkov (The University of Manchester) Turing Fellowships Chair: Barry Cooper (University of Leeds) Theorem Proving Competition Chair: Geoff Sutcliffe (University of Miami) Programme Chair Andrei Voronkov (The University of Manchester) -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Tue Apr 10 11:00:02 2012 From: brucker at spamfence.net (Achim D. Brucker) Date: Tue, 10 Apr 2012 17:00:02 +0200 Subject: [TYPES/announce] Call for Participation: Tests and Proofs (TAP 2012) in Prague Message-ID: <20120410150001.GA21981@shinanogawa.brucker.ch> Apologies for duplicates. ======================================================================== CALL FOR PARTICIPATION TESTS and PROOFS 2012 (TOOLS EUROPE 2012) 6th International Conference on Tests & Proofs May 31 - June 1, 2012, Prague, Czech Republic http://lifc.univ-fcomte.fr/tap2012/ Co-located with: ICMT 2012, SC 2012, MSEPT 2012 as part of TOOLS 2012: http://toolseurope2012.fit.cvut.cz/ ======================================================================== The TAP conference is devoted to the convergence of proofs and tests. It combines ideas from both sides for the advancement of software quality. Keynote Speakers ================ * Andreas Kuehlmann , Coverity The Technology and Psychology of Testing Your Code as You Develop It (abstract ) * Corina Pasareanu , NASA Ames Research Center Combining Model Checking and Symbolic Execution for Software Testing (abstract ) * Mehdi Jazayeri, University of Lugano. Software Composition: Why, what, and how Registration: ============= Early registration, at a reduced price, will be open until 25 April 2012. http://toolseurope2012.fit.cvut.cz/index.php/registration.html Organization: ============= Conference Chair Bertrand Meyer, ETH Zurich, Eiffel Software, and ITMO Program Chairs Achim D. Brucker, SAP Research, Germany Jacques Julliand, University of Franche-Comt? Local Organization Pavel Tvrdik, CTU Prague Michal Valenta, CTU Prague Jindra Vojikova, CTU Prague Jan Chrastina, CTU Prague Program: ======== Thursday 31th May, 09:00-10:30: Invited Talk * Andreas Kuehlmann, Coverity: The Technology and Psychology of Testing Your Code as You Develop It Thursday, 11:00-13:00: Paper session Model-Based Testing * Malte Lochau, Ina Schaefer, Jochen Kamischke and Sascha Lity. Incremental Model-based Testing of Delta-oriented Software Product Lines * Hernan Ponce De Leon, Stefan Haar and Delphine Longuet. Conformance Relations for Labeled Event Structures * Joseph Kiniry, Daniel M. Zimmerman and Ralph Hyland. Testing Library Specifications by Verifying Conformance Tests * Chedor Sebastien, Thierry J?ron and Morvan Christophe. Test generation from recursive tiles systems Thursday, 14:30-15:30: Paper session Scenario and UML-Based Testing * Nadia Creignou, Uwe Egly and Martina Seidl. A Framework for the Specification of Random SAT and QSAT Formulas * Jens Br?ning, Martin Gogolla, Lars Hamann and Mirco Kuhlmann. Evaluating and Debugging OCL Expressions in UML Models * Uwe Egly, Sebastian Gabmeyer, Martina Seidl, Hans Tompits, .... Towards Scenario-Based Testing of UML Diagrams Thursday, 16:00-17:00: Tutorial * Nikolay Kosmatov, Nicky Williams. Automated Structural Testing with PathCrawler Friday 1st June, 09:00-10:30: Invited Talk of SC * Mehdi Jazayeri, University of Lugano. Software Composition: Why, what, and how Friday 11:00-13:00: Invited Talk of TAP * Corina Pasareanu. NASA. Combining Model Checking and Symbolic Execution for Software Testing Friday, 14:30-15:30: Paper session Test and Model-checking * Martin Sulzmann and Axel Zechner Constructive Finite Trace Analysis with Linear Temporal Logic * Alessandro Armando, Roberto Carbone, Giancarlo Pellegrino, Alessio Merlo and Davide Balzarotti. From Model-checking to Automated Testing of Security Protocols: Bridging the Gap Friday, 16:00-17:30: Paper session Test of Complex Data Structures * Valerio Senni and Fabio Fioravanti. Generation of test data structures using Constraint Logic Programming * Valeria Bengolea, Nazareno Aguirre, Darko Marinov and Marcelo Frias. Coverage Criteria on RepOK to Reduce Bounded Exhaustive Test Suites * Matthieu Carlier, Catherine Dubois and Arnaud Gotlieb. A first step in the design of a formally verified constraint-based testing tool: FocalTest -- Dr. Achim D. Brucker, SAP Research, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch From maribel.fernandez at kcl.ac.uk Wed Apr 11 05:53:53 2012 From: maribel.fernandez at kcl.ac.uk (maribel Fernandez) Date: Wed, 11 Apr 2012 10:53:53 +0100 Subject: [TYPES/announce] CFP: IWS 2012 at IJCAR, Manchester, 1 July 2012 In-Reply-To: <4F394D32.1070105@kcl.ac.uk> References: <4F394D32.1070105@kcl.ac.uk> Message-ID: <4F8554B1.2060801@kcl.ac.uk> Please circulate this CFP, thanks! --------------------------------------------------------------------------------------------------------------------- IWS 2012 at IJCAR: CALL FOR PAPERS 2nd Joint International Workshop on Strategies in Rewriting, Proving and Programming 1 July 2012, Manchester, UK http://www.dcs.kcl.ac.uk/staff/maribel/IWS2012/IWS2012.html **** Submission: 27 April 2012 **** AIM AND TOPICS: Strategies are ubiquitous in automated reasoning engines, high level programming languages, verification tools, and affect their useability, performance and practical impact. They control search (for proofs or models), transformation (of programs), access (to resources) and modelling. Work on strategies and search plans remains often hidden in implementations of theorem provers, proof assistants, model builders, interpreters, SAT and SMT solvers, decision procedures for satisfiability, termination provers and verifiers. The 2nd IWS Workshop provides a forum to present research on strategies, focusing on the following topics: * Strategies in automated theorem provers, automated model builders, decision procedures and their combinations, SAT and SMT solvers; * Strategies and tacticals in interactive theorem provers and proof assistants; * Strategies in interpreters of programming languages, rewriting engines and termination provers; * Strategies in program analysers and tools for verification modulo theories; * Performance evaluation: empirical evaluation, comparison and optimisation of strategies; * Strategy analysis: evaluation, comparison, and optimisation of strategies by mathematical approaches to model search spaces and measure search complexity; * Strategy languages: essential constructs, meta-level features, design, implementation and application; * Applications and case studies where strategies play a major role. Papers on strategies in automated reasoning, programming languages and software verification are equally welcome, as the workshop aims at facilitating synergies. IMPORTANT DATES: All in 2012: # Submission: 27 April # Notification: 27 May # Preliminary proceedings version due: 6 June # Submission for final proceedings: 9 September # Notification: 9 November # Final version: 2 December SUBMISSION AND PUBLICATION: There are three categories of submissions: Regular: This is for typical workshop papers. Authors submit an abstract (max 5 pages). Accepted abstracts are presented at the workshop and included in the preliminary proceedings, available at the workshop. After the workshop, authors of accepted abstracts are invited to submit a full version (max 15 pages), which is refereed again for inclusion in the final workshop proceedings, to be published in EPTCS (http://eptcs.org/). Abstract-only: This is for preliminary research that may not be ready to develop into a full paper afterthe workshop. Authors submit an abstract (max 5 pages). Accepted abstracts are presented at the workshop and included only in the preliminary proceedings. Presentation-only: This is for papers in the scope of the workshop that have been or will be published elsewhere. They may be submitted in full (max 15 pages), indicating where the paper appears. If accepted, one page including title, authors, abstract as in the published paper, and a reference to the full paper, is included in the preliminary proceedings. Authors are strongly encouraged to produce their papers in LaTeX and must indicate the submission category. All submissions are through https://www.easychair.org/account/signin.cgi?conf=iws2012 also reachable from the workshop web site. PROGRAMME COMMITTEE: Maria Paola Bonacina (Co-Chair) (Universita degli Studi di Verona) Dan Dougherty, Worcester Polytechnic Institute Bruno Dutertre (SRI International) Maribel Fernandez (Co-Chair) (King's College London) Mnacho Echenim (Universite de Grenoble) Swen Jacobs (EPFL) Helene Kirchner (INRIA) Salvador Lucas (Universidad Politecnica de Valencia) Christophe Ringeissen (INRIA) Stephan Schulz (eprover.org) CONTACT: mariapaola.bonacina at univr.it and Maribel.Fernandez at kcl.ac.uk ----------------------------------------------------------------------------------------------- From pangjun at gmail.com Wed Apr 11 07:30:34 2012 From: pangjun at gmail.com (Jun PANG) Date: Wed, 11 Apr 2012 13:30:34 +0200 Subject: [TYPES/announce] ICTAC 2012 - deadline extended by 1 week Message-ID: ICTAC 2012 deadline has been extended by one week. Papers are due on 23 April 2012. In addition, this year ICTAC 2012 has a special feature - an Industry Day. Tool demos are being active sought for Industry Day. Please see the following CFP for details. ------------------------------------------------------------------------ Call for Papers ICTAC 2012 9th International Colloquium on Theoretical Aspects of Computing URL: http://www.iiitb.ac.in/ictac 24 - 27 September 2012, Bangalore, India ------------------------------------------------- The Colloquium will be held at the International Institute of Information Technology (IIIT), which is located in Electronics City of Bangalore. It is two hours by car from Bangalore International Airport (transport from airport will be provided to conference participants). Bangalore is internationally known as the Silicon Valley of the East with many hi-tech companies and research labs. Holding the conference in the Electronics City of Bangalore gives the conference participants valuable opportunity to discuss and network with the software practitioners and researchers in India's Information Technology (IT) hub. This will be further facilitated via an Industry Day, a special feature of ICTAC 2012. ------------------------------------------------- SUBMISSION DEADLINES Regular and Short Paper submission deadline: 23 April 2012 ------------------------------------------------- BACKGROUND ICTAC 2012 is the 9th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2012 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. TOPICS The topics of the conference include, but are not limited to: * automata theory and formal languages; * principles and semantics of programming languages; * logics and their applications; * software architectures and their description languages; * relationship between software requirements, models and code; * software specification, refinement, verification and testing; * model checking and theorem proving; * formal techniques in software testing; * models of object and component systems; * coordination and feature interaction; * integration of theories, formal methods and tools for engineering computing systems; * service-oriented architectures: models and development methods; * models of concurrency, security, and mobility; * theory of parallel, distributed, grid and cloud computing; * real-time, embedded, hybrid and cyber-physical systems; * type and category theory in computer science; * models for learning and education; * case studies, theories, tools and experiments of verified systems; * domain-specific modeling and technology: examples, frameworks and experience. INDUSTRY DAY ICTAC 2012 will feature an Industry Day, a special feature being introduced to the ICTAC colloquium for the first time. One of the days of the conference is planned to be marked as Industry Day. The industry day will feature technical talks from the industry participants. These talks will be drawn from the papers submitted and accepted to the conference; however any such paper must have at least one co-author from the Industry and must be clearly marked "For Industry Day:" in the title during submission. In addition, we plan to have tool demonstrations and posters by the companies in the exhibition floor. Participants from academia will thus also get a chance to mingle with the industry participants in an informal atmosphere, thereby getting a flavor of the ongoing activities in Bangalore's IT industry. In addition to research papers, we welcome tool demo papers from industry participants. Proposals for tool demos should be submitted in the same way and in the same format as research papers; a 2-4 page description of the tool is sufficient. Selected tool demos will be scheduled on the industry day. Such submissions should also be marked for "For Industry Day:" in the title during submission. Industry Day Co-chairs: Satish Chandra (IBM Research) Sriram Rajamani (Microsoft Research) KEYNOTE SPEAKERS * Gernot Heiser, UNSW (for Industry Day) * Luke Ong, Oxford * Ganesan Ramalingam, Microsoft Research PUBLICATION AND SUBMISSION The proceedings of ICTAC 2012 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2012 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be either Regular Papers or Short Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 15 pages and Short Papers should be between 4 and 8 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers shall be submitted at http://www.easychair.org/conferences/?conf=ictac2012 All queries should be sent to: ictac2012 at iist.unu.edu IMPORTANT DATES: Paper submission deadline: 23 April 2012 Paper Accept/Reject Notification: 14 June 2012 Final paper submission: 6 July 2012 PROGRAM COMMITTEE * Ana Cavalcanti, University of York, UK * Supratik Chakraborty, IIT Mumbai, India * Satish Chandra, IBM Watson, USA * Yifeng Chen, Peking University, China * Meenakshi D'Souza, IIIT Bangalore, India * Thao Dang, Verimag, France * Frank S. deBoer, CWI, Netherlands * Xinyu Feng, USTC, China * John Fitzgerald, University of Newcastle, UK * Susanne Graf, Verimag, France * Lindsay Groves, Victoria University, New Zealand * Zhenjiang Hu, NII, Japan * Lei Ju, Shandong University, China * Moonzoo Kim, KAIST, Korea * Daniel Kroening, Oxford University, UK * Kim G. Larsen, Aalborg University, Denmark * Martin Leucker, TU Munich, Germany * Zhiming Liu, UNU-IIST, Macau SAR, China * Kamal Lodaya, Inst. of Mathematical Sciences, India * Annabelle McIver Macquarie University, Australia * Madhavan Mukund, Chennai Mathematical Inst., India * Kedar Namjoshi, Bell Labs, USA * Jun Pang, Univ. of Luxembourg, Luxembourg * Sanjiva Prasad, IIT Delhi, India * Geguang Pu, ECNU, China * Zongyan Qiu, Peking University, China * Anders P. Ravn, Aalborg University, Denmark * Abhik Roychoudhury, National University of Singapore, Singapore (Chair) * Diptikalyan Saha, IBM Research, India * Augusto Sampaio, UFPE, Brazil * Bikram Sengupta, IBM Research, India * R.K. Shyamasundar, TIFR, India * Sofiene Tahar, Concordia University, Canada * Kapil Vaswani, Microsoft Research, India * Wang Yi, Uppsala University, Sweden * Naijun Zhan, Chinese Academy of Sciences, China * Jianjun Zhao, Shanghai Jiao Tong University, China ORGANISING COMMITTEE * Meenakshi D' Souza, IIIT-B (General Chair) * Jun Pang, Univ. of Luxembourg (Publicity Chair) * Deepak D'Souza, Indian Institute of Science * Sumesh Divakaran, IIIT-B. STEERING COMMITTEE * John Fitzgerald, UK * Martin Leucker, Germany * Zhiming Liu, Macau SAR China (Chair) * Tobias Nipkow, Germany * Augusto Sampaio, Brazil * Natarajan Shankar, USA * Jim Woodcock, UK From amal at ccs.neu.edu Wed Apr 11 14:06:09 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Wed, 11 Apr 2012 14:06:09 -0400 Subject: [TYPES/announce] LOLA 2012: Final Call for Talk Proposals Message-ID: <8F538964-0F03-4A36-A494-A9531899C015@ccs.neu.edu> ============================================================ *** FINAL CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in 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 short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From viktor at mpi-sws.org Thu Apr 12 05:02:02 2012 From: viktor at mpi-sws.org (Viktor Vafeiadis) Date: Thu, 12 Apr 2012 11:02:02 +0200 Subject: [TYPES/announce] POPL'13: Final call for proposals for co-located events Message-ID: <32CB341B-EF62-49B9-9632-55CD5A9B02DD@mpi-sws.org> *** POPL'13: Final Call for proposals for co-located events *** Event dates: 20 -- 22, 26 January 2013 Location: Rome, Italy Deadline: ** 22 April 2012 ** Notification: 30 May 2012 Proposals are invited for workshops and other events to be co-located with POPL 2013. Events can either be sponsored by SIGPLAN or supported through in-cooperation status. For more information and submission details, please visit: http://matt.might.net/events/popl/2013/call-for-events/ http://popl.mpi-sws.org/2013/ From mattia.petrolo at gmail.com Thu Apr 12 05:12:31 2012 From: mattia.petrolo at gmail.com (Mattia Petrolo) Date: Thu, 12 Apr 2012 11:12:31 +0200 Subject: [TYPES/announce] Workshop Cross Perspectives on Proof Systems Message-ID: ============================================================== *** CROSS PERSPECTIVES ON PROOF SYSTEMS AND THEIR SIGNIFICANCE *** http://ls.inf.uni-tuebingen.de/hypotheses/proofsystems.html May 3, 2012 - ENS, 45 rue d'Ulm 75005 Paris ============================================================== PROGRAM 9h30 - 10h30 Patrick Blackburn (University of Roskilde) Hybrid Proof Theory 10h30 - 11h30 Zoran Petric & Kosta Dosen (Mathematical Institute, SANU) Invariants for Classifcation of Propositional Formulae 11h30 - 11h45 coffee break 11h45 - 12h45 Dale Miller (INRIA & LIX/Ecole Polytechnique) Focused sequent calculus proof systems 12h45 - 14h30 lunch 14h30 - 15h30 Francesca Poggiolesi (IHPST-Universit? Paris 1) Analytic Logic of Proofs 15h30 - 16h30 Didier Galmiche (LORIA?UHP Nancy 1) Label-free Calculi for Intuitionistic Modal Logics 16h30 - 16h45 coffee break 16h45 - 17h45 Thomas Piecha (Universit?t T?bingen) Symmetries in the sequent calculus 17h45 - 18h General discussion/conclusion ABSTRACTS http://ls.informatik.uni-tuebingen.de/hypotheses/proofsystems.html Local organizers Francesca Poggiolesi (poggiolesi at gmail.com) and Mattia Petrolo ( mattia.petrolo at univ-paris-diderot.fr) -------------- next part -------------- An HTML attachment was scrubbed... URL: From bpientka at cs.mcgill.ca Thu Apr 12 18:47:17 2012 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Thu, 12 Apr 2012 18:47:17 -0400 Subject: [TYPES/announce] Postdoc / PhD position in Computer Science, McGill University Message-ID: ================================================== POSTDOC / PHD POSITION IN COMPUTER SCIENCE School of Computer Science McGill University, Montreal, Canada ================================================= We have a one year postdoc position (possible extension for a second year) and one funded PhD position in the area of of logical frameworks, type theory, and programming languages. Applicants should have a background in at least one of the following areas: logic, type systems, logical frameworks, theorem proving and/or design and implementation of functional programming languages. The positions are funded through the Canadian and the Quebec government at the same levels as the federal and provincial scholarships and are part of two related projects: * Proofware: establishing trustworthy computing through programming with proofs * Promis : Th?orie des preuves ? la pratique de la d?monstration automatique The postdoc position is available immediately and we are looking to fill it by 1 Sept, 2012 the latest. McGill University is the top research university in Canada (tied with U. of Toronto) and ranks consistently among the top 25 universities in the world. It is an English language university located in the heart of Montreal, the second largest French-speaking city in the world. Montreal has a reputation for its cosmopolitan atmosphere, history, cultural and sport activities, and excellent restaurants. The city consistently ranks among the most livable cities in world, and the cost of living is among the lowest for cities of its size. For more information for prospective students: http://www.cs.mcgill.ca/prospective-students/graduate/GeneralInfo If interested, send a brief reseach statement, CV to Brigitte Pientka (bpientka at cs.mcgill.ca) by 1 May, 2012. Additional material, such as letters of recommendation, will be requested if necessary. Early expression of interest is encouraged. Fluency in French is an asset, but is not required. From sescobar at dsic.upv.es Fri Apr 13 08:49:33 2012 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Fri, 13 Apr 2012 08:49:33 -0400 Subject: [TYPES/announce] Last CfP: UNIF 2012 - 26th International Workshop on Unification References: Message-ID: <8A12AB1D-1C4B-4DE5-BD5B-B72D68F23E47@dsic.upv.es> Call for Papers UNIF 2012 The 26th International Workshop on Unification http://unif2012.cs.man.ac.uk July 1st, 2012, Manchester, UK Satellite event of IJCAR 2012 UNIF 2012 is the 26th event in a series of international meetings devoted to unification theory and its applications. UNIF 2012 is a satellite event of the the 6th International Joint Conference on Automated Reasoning (IJCAR 2012) which is part of the Alan Turing Year 2012, and collocated with The Alan Turing Centenary Conference. Previous editions of UNIF have taken place mostly in Europe, but also in USA and Japan. For more details on previous UNIF workshops, please see the UNIF homepage at . The aim of UNIF 2012, 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. This includes scientific presentations, but also descriptions of applications and software using unification as a strong component. 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 and applications of unification. Submissions and Publication: Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in LNCS style through the EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=unif2012 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. We envisage publication of a special issue of a journal dedicated to UNIF after the event. Important Dates: # Submission: April 27 # Notification: May 18 # Final version: June 1 # Workshop: July 1 Programme Committee: # Franz Baader, TU Dresden, Germany # Christoph Benzmueller, Free University Berlin, Germany # Santiago Escobar, Universitat Politecnica de Valencia, Spain (co-chair) # Maribel Fernandez, King's College London, UK # Silvio Ghilardi, Universita degli Studi di Milano, Italy # Rosalie Iemhoff, Utrecht University, The Netherlands # Konstantin Korovin, University of Manchester, UK (co-chair) # Jordi Levy, IIIA - CSIC, Spain # Christopher Lynch, Clarkson University, USA # George Metcalfe, Vanderbilt University, USA # Paliath Narendran, University at Albany, USA # Vladimir Rybakov, Manchester Metropolitan University, UK (co-chair) For more information, please contact any of the three chairs Santiago Escobar, Konstantin Korovin, Vladimir Rybakov From might at cs.utah.edu Fri Apr 13 10:16:50 2012 From: might at cs.utah.edu (Matt Might) Date: Fri, 13 Apr 2012 08:16:50 -0600 Subject: [TYPES/announce] Second call for participation: PLDI 2012 (June 11-16 in Beijing, China) Message-ID: The 2012 conference on Programming Language Design and Implementation (plus 30 co-located events!) will be held in Beijing, China from June 11-16. We invite all with an interest in programming language design, theory and implementation to attend! Registration is open: https://regmaster3.com/2012conf/PLDI12/register.php (Early registration closes May 1st.) For more information on PLDI, please see: http://pldi12.cs.purdue.edu/ For updates via Facebook, please join: http://www.facebook.com/events/195323457176764/ For information on travel, please join: http://www.facebook.com/events/314574741939037/ For student information (including travel info): http://pldi12.cs.purdue.edu/content/students On behalf of the PLDI 2012 organizers, Matt Might From cbraga at ic.uff.br Sat Apr 14 10:40:50 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Sat, 14 Apr 2012 11:40:50 -0300 Subject: [TYPES/announce] CFP SBLP 2012 Message-ID: [Apologies for multiple copies of this CFP.] ============================================================ CALL FOR PAPERS 16th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Natal, Rio Grande do Norte, Brazil September 24-28, 2012 http://www.cbsoft.dimap.ufrn.br ============================================================ IMPORTANT DATES Paper abstract submission (15 lines): April 27th, 2012 (extended) Full paper submission: May 4th, 2012 (extended) Notification of acceptance: June 4th, 2012 Final papers due: June 29th, 2012 INTRODUCTION The 16th Brazilian Symposium on Programming Languages, SBLP 2012, will be held in Natal, Brazil, on September 24-28, 2012. 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 3rd Brazilian Conference on Software: Theory and Practice, CBSoft 2012, http://www.cbsoft.dimap.ufrn.br, which will host four traditional, well-established symposia: * XXVI Brazilian Symposium on Software Engineering (SBES) * XVI Brazilian Symposium on Programming Languages (SBLP) * XV Brazilian Symposium on Formal Methods (SBMF) * VI Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2012 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. 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. Full papers submitted in English will be published in a volume of the Lecture Notes in Computer Science (LNCS), by Springer, to be distributed in the conference. 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. 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 2011, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. Submissions should be done using SBLP 2012 installation of the EasyChair conference management system at http://www.easychair.org/conferences/?conf=sblp2012. GENERAL CO-CHAIRS N?lio Cacho, UFRN Gibeon Aquino, UFRN Martin Musicante, UFRN PROGRAMME CHAIRS Francisco Heron de Carvalho Junior, UFC Luis Soares Barbosa, Univ. do Minho PROGRAMME COMMITTEE * Alberto Pardo, Univ. de La Republica * Alex Garcia, IME * Alvaro Freitas Moreira, UFRGS * Andr? Rauber Du Bois, UFPel * Andre Santos, UFPE * Carlos Camarao, UFMG * Christiano Braga, UFF * Fernando Castor Filho, UFPE * Fernando Quint?o Pereira, UFMG * Francisco Heron de Carvalho Junior, UFC (co-chair) * Joao Saraiva, Universidade do Minho * Jo?o F. Ferreira, Teesside University * Jonathan Aldrich, Carnegie Mellon Univ. * Jose Luiz Fiadeiro, Univ. of Leicester * Lucilia Figueiredo, UFOP * Luis Soares Barbosa, Univ. do Minho (co-chair) * 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 * Paulo Borba, UFPE * Peter Mosses, Swansea University * Qiu Zongyang, Peking 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 amal at ccs.neu.edu Sat Apr 14 16:09:09 2012 From: amal at ccs.neu.edu (Amal Ahmed) Date: Sat, 14 Apr 2012 16:09:09 -0400 Subject: [TYPES/announce] LOLA 2012: Call for Talk Proposals (deadline extended) Message-ID: *** Submission deadline extended to April 19th *** ============================================================ *** CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Thursday 19th April 2012 (extended) Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in 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 short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google) -------------- next part -------------- An HTML attachment was scrubbed... URL: From paolini at di.unito.it Sun Apr 15 02:55:26 2012 From: paolini at di.unito.it (Luca Paolini) Date: Sun, 15 Apr 2012 08:55:26 +0200 Subject: [TYPES/announce] ITRS 2012 - Deadline extension Message-ID: <4F8A70DE.4080309@di.unito.it> ********************************************************************** Sixth Workshop on Intersection Types and Related Systems (ITRS 2012) June 29th, Dubrovnik (Croatia). http://itrs2012.di.unito.it/ Workshop held in conjunction with LICS 2012 ********************************************************************** ITRS 2010 workshop aims to bring together researchers working on both the theory and practical applications of systems based on intersection types and related approaches. IMPORTANT DATES Title & Short Abstract: April 19 Abstract Submission: April 21 Author notification: May 7 Abstract final version due: June 10 EPTCS Post-proceedings Submission: before September 30th, 2012 SUBMISSION The submission is in two stages. (1) Before the workshop, authors are invited to submit an extended abstract (3-5 pages, max. 10 pages) in PDF format. (2) After the workshop, authors of accepted papers will be invited to submit full versions, which will be referred for inclusion in EPTCS post-proceedings. TOPICS Possible topics for submitted papers include, but are not limited to: - Formal properties of systems with intersection types. - Results for related systems, such as union types, refinement types, or singleton types. - Applications to lambda calculus and similar systems. - Applications to pi-calculus and similar systems. - Applications for programming languages. - Applications for other areas, such as database query languages and program extraction from proofs. - Related approaches using behavioural/intesional types to characterize computational properties. PROGRAM COMMITTEE St?phane Lengrand (?cole Polytechnique) Koji Nakazawa (Kyoto Univ.) Luke Ong (Oxford Univ.) Luca Paolini (Univ. Torino), chair Frank Pfenning (Carniege Mellon Univ.) Betti Venneri (Univ. di Firenze) INFORMATION For further information, please contact Luca Paolini Email: paolini at di.unito.it From web.alessio.guglielmi at gmail.com Mon Apr 16 14:06:00 2012 From: web.alessio.guglielmi at gmail.com (Alessio Guglielmi) Date: Mon, 16 Apr 2012 19:06:00 +0100 Subject: [TYPES/announce] University of Bath Prize Fellow Message-ID: <4f8c5f8b.ce7f0e0a.7ff2.4cbf@mx.google.com> Hello, I would like to advertise the following positions at the University of Bath. In particular we are looking for applicants in the area `Software verification and correctness?. Ciao, -Alessio Software verification and correctness We aim to build on the existing strengths within the Mathematical Foundations group in the Department of Computer Science. The group comprises Prof Guy McCusker and Dr Jim Laird (semantics), Dr Alessio Guglielmi (proof theory), Dr John Power (category theory) and Prof James Davenport (computer algebra). We seek to strengthen its activities via the appointment of a Prize Fellow in software verification & correctness, to be understood broadly, to complement existing expertise; it would also be desirable to strengthen connections with other groups in the department, particularly with Dr Marina De Vos and Dr Julian Padget in the Intelligent Systems group. The Fellow would be coming into a well-resourced, lively group that runs a weekly seminar series, which once a month is jointly held with Swansea's Proofs, Complexity and Verification seminar. The Math Foundations group belongs to the Wessex Theory Seminar, comprising the Computer Science Departments of Bath, Oxford, Southampton, Cambridge, Imperial College, Queen Mary, Sussex and Swansea. The group has a good track record of nurturing early career researchers. For informal inquiries contact Prof Guy McCusker: G.A.McCusker AT bath.ac.uk ------------------------------------------------------------------------------------- Prize Fellow - Department of Computer Science Salary: Starting from ?37,012, rising to ?44,166 Closing Date: Monday 21 May 2012 Interview Date: See advert Reference: JK1000 To further enhance our academic base, we are making a strategic investment in recruiting University of Bath Prize Fellows across all disciplines. This is an opportunity for outstanding post-doctoral researchers to develop their academic career in a supportive and well-resourced research environment. In the Faculty of Science we will appoint a total of six Fellows to further strengthen and develop areas of existing research excellence. In the Department of Computer Science we invite applications in the areas of: * Machine Learning * Software Verification and Correctness * Modelling Behaviour Transmission Details of these priority areas and the Faculty-wide appointment process can be found here: . The Fellows will be expected to pursue an independent programme of research, including publishing in top quality journals and securing external research grants. The initial appointment will be to a fixed-term Research Fellow post with the expectation of transfer to a permanent lectureship at the end of year two, or exceptionally at the end of year three. Applicants should upload a CV and a 2-page outline of their research plans over the next 3-5 years, showing how these complement and enhance existing research within the relevant priority area. Interviews will take place on Friday 29th June or Monday 2nd July 2012. From shao at cs.yale.edu Mon Apr 16 17:01:44 2012 From: shao at cs.yale.edu (Zhong Shao) Date: Mon, 16 Apr 2012 17:01:44 -0400 Subject: [TYPES/announce] Post-Doctoral and Researcher Positions at Yale University Message-ID: <201204162101.q3GL1ioh001750@lux.cs.yale.edu> The FLINT group at Yale University (http://flint.cs.yale.edu) is seeking applicants for post-doctoral and researcher positions in the broad area of programming languages and formal methods. The successful applicants will be expected to participate in a rigorous research program on topics such as certified programming, proof assistants and automation, certified OS kernels and compilers, and formal semantics. Applicants must have a Ph.D. in Computer Science or a closely related field. The term of the postdoc position is one year with an option to renew for up to three years; the term of the researcher position (as an associate research scientist) is similar but can be extended further based on the availablity of funding. Starting date is negotiable. Interested applicants should email a CV, research statement, and the names of three references with their email addresses to Zhong Shao (Email: zhong.shao at yale.edu). Professor Zhong Shao Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520-8285, USA Phone: +1 (203) 432 6828 Email: zhong.shao at yale.edu From james.cheney at gmail.com Tue Apr 17 06:07:17 2012 From: james.cheney at gmail.com (James Cheney) Date: Tue, 17 Apr 2012 11:07:17 +0100 Subject: [TYPES/announce] XLDI 2012: Cross-Model Language Design and Implementation (2nd Call for Papers) Message-ID: CALL FOR PAPERS XLDI 2012 First international workshop on Cross-Model Language Design and Implementation http://workshops.inf.ed.ac.uk/xldi2012/ Affiliated with ICFP 2012, Copenhagen, Denmark Sponsored by ACM SIGPLAN September 9, 2012 (Sunday before ICFP) There has recently been a burst of systems research advocating high-performance commodity "big data" or "massively parallel" computing models, often using simpler high-level languages or interfaces as front-ends. This work is often described as part of a shift towards a new "cloud computing" paradigm, but these buzzwords mask the major problems these techniques face: both big data and massively parallel systems currently employ systems-based methods and testing regimes that cannot offer guarantees of safety, security, correctness and evolvability. Language-based techniques, particularly formalization, verification, abstraction, and representation independence, offer the promise to reconcile the performance benefits of new execution models with the advantages of modern programming languages. Cross-model programming is not a new problem: for example, smooth integration of relational database programming models into general-purpose programming languages has been a long-standing challenge, with some approaches now in mainstream use (such as Microsoft's LINQ). But in the last few years there has been a dramatic increase in the number of domain-specific languages or libraries for interfacing with different computing models (data-parallelism, sensor networks, MapReduce-style fault-tolerant parallelism, distributed programming, Bayesian inference engines, declarative networking, or multi-tier Web programming), as well as techniques for language-integrated querying or processing data over other data models. Cross-model programs that execute in multiple (possibly heterogeneous) environments have much more challenging security, debugging, validation, and optimization problems. - Language designs for simplifying cross-model programming with database queries, data parallelism, networking, distributed programming, Web programming, or security primitives. - Formalizations or comparisons of existing languages, libraries or extensions for integrating multiple execution models - Monads, comprehensions, arrows, applicative functors, formlets, and other abstractions for combining or embedding models - Compilation and implementation techniques for cross-model programs - Type systems (polymorphism, dependent types, GADTs, modal types, refinement types) to support safe cross-model programming - Domain-specific embedded languages or libraries, syntax extensions, meta-programming facilities, or staged computation. - Language support for programming with XML, RDF, JSON, or other data interchange formats, or for programming Web services or other distributed programming formalisms. - Techniques for securing, debugging, performance profiling, optimization, or provenance tracking in cross-model programs. INVITED SPEAKERS: - Fritz Henglein (DIKU, University of Copenhagen) - Christopher Re (University of Wisconsin) SUBMISSIONS: Submission should consist of short papers of at most 3 pages in ACM SIGPLAN conference format (sigplanconf.cls). Submissions will be accepted electronically. The submission site will be advertised around one month before the submission deadline. Simultaneous submission to another workshop, conference or journal is not allowed. An author of each accepted paper is expected to present the paper at the workshop. There will be no formal proceedings, but submissions will be made available from the workshop web page. Authors will retain the copyright. IMPORTANT DATES: Submission: May 15 Notification: July 1 Final papers due: August 1 Workshop: September 9 ICFP 2012: September 10-12 ORGANIZATION: Program committee: James Cheney, University of Edinburgh (co-chair) Kathleen Fisher, Tufts University Matthew Fluet, Rochester Institute of Technology Nate Foster, Cornell University Torsten Grust, University of Tuebingen (co-chair) Anastasios Kementsietsidis, IBM Research Shriram Krishnamurthi, Brown University Peter Thiemann, University of Freiburg Atsushi Ohori, Tohoku University Jan van den Bussche, University of Hasselt From J.T.Jeuring at uu.nl Tue Apr 17 09:28:32 2012 From: J.T.Jeuring at uu.nl (Johan Jeuring) Date: Tue, 17 Apr 2012 15:28:32 +0200 Subject: [TYPES/announce] Conference on Intelligent Computer Mathematics, call for work-in-progress papers In-Reply-To: <65C6AF62-7D10-4934-A313-0B8CFE373DD5@uu.nl> References: <65C6AF62-7D10-4934-A313-0B8CFE373DD5@uu.nl> Message-ID: <14AE164F-240E-4CB7-ACA0-67EF681EE8EA@uu.nl> CICM 2012 - Conference on Intelligent Computer Mathematics July 9-13, 2012 at Jacobs University, Bremen, Germany http://www.informatik.uni-bremen.de/cicm2012/ Call for work-in-progress papers ---------------------------------------------------------------- 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 Conference on Intelligent Computer Mathematics offers a venue for discussing these areas and their synergy. The conference will be organized by Serge Autexier and Michael Kohlhase at Jacobs University in Bremen and consist of five tracks: Artificial Intelligence and Symbolic Computation (AISC) Co-Chairs: John A. Campbell, Jacques Carette Calculemus Chair: Gabriel Dos Reis Digital Mathematical Libraries (DML) Chair: Petr Sojka Mathematical Knowledge Management (MKM) Chair: Makarius Wenzel Systems and Projects Chair: Volker Sorge The overall programme will be organized by the General Program Chair Johan Jeuring. Invited talks will be given by: Yannis Haralambous, D?partement Informatique, T?l?com Bretagne Conor McBride, Department of Computer and Information Sciences, University of Strathclyde Cezar Ionescu, Potsdam Institute for Climate Impact Research ---------------------------------------------------------------- Work in progress ---------------------------------------------------------------- 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. ---------------------------------------------------------------- Important dates ---------------------------------------------------------------- Submission deadline: 6 May 2012 Notification of acceptance: 27 May 2012 Camera ready copies due: 3 June 2012 Conference: 9-13 July 2012 From nielson at imm.dtu.dk Tue Apr 17 12:33:24 2012 From: nielson at imm.dtu.dk (Flemming Nielson) Date: Tue, 17 Apr 2012 18:33:24 +0200 Subject: [TYPES/announce] PhD positions in Formal Methods for Safety and Security at DTU Message-ID: <0C199DDB-B9EB-45E5-AE1C-6A3F3F2E5D50@imm.dtu.dk> (Applicants with a types background are welcome to apply) *** PLEASE POST TO ANYONE INTERESTED *** We are happy to announce two attractive PhD positions in Formal Methods for Safety and Security at The Technical University of Denmark (DTU). The positions are for three years starting summer / early Autumn 2012 and will be part of the SESAMO project funded by EU ARTEMIS and comprising 14 industrial and 6 academic partners. Terms of appointment are compatible with entry level industrial positions; further details and information about the application procedure can be found on http://www.dtu.dk/English/About_DTU/vacancies.aspx?guid=2d6f5f2f-da7d-4bbf-af83-56c648eab4bd The call closes on May 14'th 2012. Flemming Nielson & Hanne Riis Nielson *** PLEASE POST TO ANYONE INTERESTED *** 3 -------------- next part -------------- An HTML attachment was scrubbed... URL: From Stephan.Merz at loria.fr Wed Apr 18 09:09:03 2012 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 18 Apr 2012 15:09:03 +0200 Subject: [TYPES/announce] post-doc position at MSR/INRIA Message-ID: <81DBF215-75A3-47EA-B672-96ECA7607221@loria.fr> I originally posted this announcement a while ago, but due to some requests we received, we decided to extend the application deadline to May 15. If you are interested, please send us your application. Informal inquiries are also welcome. Stephan ---- Research team: Tools for Proofs, MSR-INRIA Joint Centre ======================================================= The Microsoft Research-INRIA Joint Centre is offering a 2-year position for a post-doctoral researcher to contribute to a proof development environment for TLA+ developed in the Tools for Proofs project (see http://www.msr-inria.inria.fr). Research Context ================ TLA+ is a language for specifying and reasoning about systems, including concurrent and distributed systems. It is based on first-order logic, set theory, temporal logic, and a module system. TLA+ and its tools have been used in industry for over a decade. More recently, we have extended TLA+ to include hierarchically structured formal proofs that are independent of any proof checker. We have released several versions of the TLAPS proof checker (http://msr-inria.inria.fr/~doligez/tlaps/) and integrated it into the TLA+ Toolbox, an IDE for the TLA+ tools (http://research.microsoft.com/en-us/um/people/lamport/tla/toolbox.html). TLAPS and the Toolbox support the top-down development of proofs and the checking of individual proof steps independently of the rest of the proof. This helps users focus on the part of the proof they are working on. Although still lacking important features, TLAPS is already a powerful tool and has been used for a few verification projects, including a proof of the safety properties of a Byzantine-fault tolerant consensus algorithm (http://research.microsoft.com/en-us/um/people/lamport/tla/byzpaxos.html). TLAPS consists of the Proof Manager (PM, an interpreter for the proof language that computes the proof obligations corresponding to each proof step) and an extensible list of backend provers. Current backends include the tableau prover Zenon, an encoding of TLA+ as an object logic in the Isabelle proof assistant, and a generic backend for SMT solvers. When possible, we expect backend provers to produce a detailed proof that is then checked by Isabelle. In this way, we can obtain high assurance of correctness as well as satisfactory automation. The current version of the PM handles only the "action" part of TLA+: first-order formulas with primed and unprimed variables, where a variable v is considered to be unrelated to its primed version v'. This allows us to translate non-temporal proof obligations to standard first-order logic, without the overhead associated with an encoding of temporal logic into first-order logic. Description of the activity of the post-doc =========================================== You will work with other members of the project, including Leslie Lamport, Damien Doligez, and Stephan Merz, on the extension of the TLA+ proof language to temporal operators. This extension poses interesting conceptual and practical problems. In particular, the new translation must smoothly extend the existing one since temporal proof steps rely on action-level subproofs. You will have the primary responsibility for designing and implementing algorithms to generate corresponding proof obligations. As time permits and depending on your interests, you will have the opportunity to contribute to further improving the proof checker. This may include: - adding support for certain TLA+ features that are not yet handled by the PM, such as recursive operator definitions and elaborate patterns for variable bindings; - finding what improvements are needed by verifying real examples, perhaps including liveness of the aforementioned consensus algorithm; - integrating new backends to improve the automation of proofs; - adding validation of proofs by backends whose proofs are not now checked. Skills and profile of the candidate =================================== You should have a solid knowledge of logic and set theory as well as good implementation skills related to symbolic theorem proving. Of particular relevance are parsing and compilation techniques. Our tools are mainly implemented in OCaml. Experience with temporal and modal logics, Isabelle, Java or Eclipse would be a plus. Given the geographical distribution of the members of the team, we highly value a good balance between the ability to work in a team and the capacity to propose initiatives. Location ======== The Microsoft Research-INRIA Joint Centre is located on the Campus of INRIA Saclay south of Paris, near the Le Guichet RER station. Starting date ============= The normal starting date of the contract would be September 2012, but we can arrange for an extremely well-qualified candidate to start sooner. Contact ======= Candidates should send a resume and the name and e-mail addresses of one or two references to Damien Doligez . The deadline for application is May 15, 2012. This announcement is available at < http://www.msr-inria.inria.fr/Members/doligez/post-doc-position-2012/view > From hirokawa at jaist.ac.jp Thu Apr 19 02:12:00 2012 From: hirokawa at jaist.ac.jp (Nao Hirokawa) Date: Thu, 19 Apr 2012 15:12:00 +0900 Subject: [TYPES/announce] IWC 2012 & CoCo 2012: Call for Participation and Provers Message-ID: <20120419151200.7aa5581b.hirokawa@jaist.ac.jp> This is a joint call for participation and provers for IWC 2012 and CoCo 2012. ====================================================================== Call for Participation IWC 2012 1st International Workshop on Confluence 29 May 2012, Nagoya, Japan, collocated with RTA 2012 http://cl-informatik.uibk.ac.at/events/iwc-2012/ ====================================================================== 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 23rd International Conference on Rewriting Techniques and Applications (RTA 2012). During the workshop the 1st Confluence Competition (CoCo 2012) takes place (see below). IMPORTANT DATES: * early registration April 25, 2012 JST (GMT+9) * registration May 9, 2012 JST (GMT+9) * workshop May 29, 2012 JST (GMT+9) Please register at: https://apollon.nta.co.jp/rta2012/ INVITED SPEAKERS: * Vincent van Oostrom Utrecht University * Yoshihito Toyama Tohoku University ACCEPTED PAPERS: * Bertram Felgenhauer: A Proof Order for Decreasing Diagrams * Dominik Klein and Nao Hirokawa: Confluence of Non-Left-Linear TRSs via Relative Termination (Extended Abstract) * Christian Nemeth, Harald Zankl and Nao Hirokawa: IaCOP - Interface for the Administration of COPS * Kristoffer Rose: A Case for Completion Modulo Equivalence * Thomas Sternagel, Ren? Thiemann, Harald Zankl and Christian Sternagel: Recording Completion for Finding and Certifying Proofs in Equational Logic * Hans Zantema: Automatically Finding Non-Confluent Examples in Abstract Rewriting ORGANISING COMMITTEE: * Nao Hirokawa JAIST * Aart Middeldorp University of Innsbruck * Naoki Nishida Nagoya University ====================================================================== Second Call for Provers CoCo 2012 1st Confluence Competition http://coco.nue.riec.tohoku.ac.jp/2012/ ====================================================================== Recently, several new implementations of confluence proving/disproving tools are reported and interest for proving/disproving confluence "automatically" has been grown. CoCo aims to foster the development of techniques for proving/disproving confluence automatically by setting up a dedicated and fair confluence competition among confluence proving/disproving tools. The 1st Confluence Competition (CoCo 2012) runs during the 1st International Workshop on Confluence (IWC 2012), which is collocated with the 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) at Nagoya University, Japan. In this competition a category for first-order term rewrite systems will be run. Other categories (e.g., higher-order) will be considered if there are tools and problems. IMPORTANT DATES: * registration April 1, 2012 - May 15, 2012 * system description April 15, 2012 - May 15, 2012 * tool submission May 1, 2012 - May 15, 2012 * competition May 29, 2012 REGISTRATION/SUBMISSION: Registration and tool submission will be via the email address: coco-sc [AT] jaist.ac.jp Tools must be able to read input files written in the old TPDB format. The output of the tools must contain an answer in the first line followed by some proof argument understandable for human experts. Valid answers are YES (the input is confluent) and NO (the input is not confluent). Every other answer is interpreted as the tool could not determine the status of the input. For more information including competition rules, see http://coco.nue.riec.tohoku.ac.jp/ All registered tool authors are asked to submit a one-page system description paper in EasyChair style. Submission is via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2012 These papers will appear in the proceedings of IWC 2012. ORGANISING COMMITTEE: * Takahito Aoto Tohoku University (chair) * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck From Dejan.Nickovic at ait.ac.at Thu Apr 19 07:27:46 2012 From: Dejan.Nickovic at ait.ac.at (Nickovic Dejan) Date: Thu, 19 Apr 2012 13:27:46 +0200 Subject: [TYPES/announce] CfP: FORMATS'12 - 10th International Conference on Formal Modeling and Analysis of Timed Systems Message-ID: <7E6452B3D693BB45A4C92F20A9331B5A788319FAEC@MAILBOX.arc.local> CALL FOR PAPERS FORMATS 2012 10th International Conference on Formal Modeling and Analysis of Timed Systems Imperial College London, London, United Kingdom 18-20 September, 2012 http://go.warwick.ac.uk/formats2012/ (Co-located with QEST 2012) -------------------------------------------------------------------------------- Objective and Scope: Timing aspects of systems from a variety of computer science domains have been treated independently by different communities. Researchers interested in semantics, verification and performance analysis study models such as timed automata and timed Petri nets, the digital design community focuses on propagation and switching delays, while designers of embedded controllers have to take account of the time taken by controllers to compute their responses after sampling the environment. Timing-related questions in these separate disciplines do have their particularities. However, there is a growing awareness that there are basic problems that are common to all of them. In particular, all these sub-disciplines treat systems whose behavior depends upon combinations of logical and temporal constraints; namely, constraints on the temporal distances between occurrences of events. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modeling and analysis of timed systems. Typical topics include (but are not limited to): * Foundations and Semantics: Theoretical foundations of timed systems and languages; comparison between different models (timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). * Methods and Tools: Techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (scheduling, worst-case execution time analysis, optimization, model checking, testing, constraint solving, etc.). * Applications: Adaptation and specialization of timing technology in application domains in which timing plays an important role (real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunications). -------------------------------------------------------------------------------- Important Dates: * Abstract submission: 7 May 2012 * Paper submission: 11 May 2012 * Notification: 15 June 2012 * Final version due: 7 July 2012 -------------------------------------------------------------------------------- Program Chairs: Marcin Jurdzi?ski, University of Warwick, UK Dejan Nickovic, AIT, Austria -------------------------------------------------------------------------------- QEST/FORMATS Keynote Speaker: Moshe Y. Vardi, Rice University, USA FORMATS Invited Speakers: Twan Basten, Eindhoven University of Technology, The Netherlands Kim G. Larsen, Aalborg University, Denmark -------------------------------------------------------------------------------- Submission and Publication: The proceedings of FORMATS 2012 will be published by Springer in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate references to and comparison with related work. Simultaneous submission to other conferences with published proceedings is not allowed. Submissions should not exceed 15 pages, and should 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. You can submit your paper to FORMATS 2012 using its EasyChair site https://www.easychair.org/account/signin.cgi?conf=formats2012 -- Dejan Nickovic Scientist Department Safety and Security Business Unit Safe and Autonomous Systems AIT Austrian Institute of Technology GmbH Donau-City-Stra?e 1 ?| ?1220 Vienna ?| Austria T +43(0) 50550-4021 | M +43(0) 66488-390038 ?| ?F +43(0) 50550-4150 dejan.nickovic at ait.ac.at ?| ?http://www.ait.ac.at ? FN: 115980 i HG Wien ?| ?UID: ATU14703506 This email and any attachments thereto, is intended only for use by the addressee(s) named herein and may contain legally privileged and/or confidential information. If you are not the intended recipient, please notify the sender by return e-mail or by telephone and delete this message from your system and any printout thereof. Any unauthorized use, reproduction, or dissemination of this message is strictly prohibited. Please note that e-mails are susceptible to change. AIT Austrian Institute of Technology GmbH shall not be liable for the improper or incomplete transmission of the information contained in this communication, nor shall it be liable for any delay in its receipt. From pmt6sbc at maths.leeds.ac.uk Thu Apr 19 21:51:29 2012 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 20 Apr 2012 02:51:29 +0100 (BST) Subject: [TYPES/announce] 2nd Call for Informal Presentations at Turing Centenary Conference, Cambridge, UK Message-ID: <201204200151.q3K1pTiJ019342@maths.leeds.ac.uk> ********************************************************************** 2nd CALL FOR INFORMAL PRESENTATIONS - DEADLINE MAY 11th, 2012: TURING CENTENARY CONFERENCE http://www.cie2012.eu Computability in Europe 2012: How the World Computes University of Cambridge Cambridge, 18-23 June 2012 Registrations for this year's CiE are already reaching record levels. CiE 2012 is one of a series of special events, running throughout the Alan Turing Year, celebrating Turing's unique impact on mathematics, computing, computer science, informatics, morphogenesis, artificial intelligence, philosophy and computational aspects of physics, biology, linguistics, economics and the wider scientific world. CiE 2012 is planned to be an event worthy of the remarkable scientific career it commemorates, and will be the largest ever conference centred on the Computability Theoretic legacy of Turing and his contemporaries. PLENARY SPEAKERS include: Andrew Hodges (Oxford, Special Invited Lecture), Ian Stewart (Warwick, Special Public Lecture), Dorit Aharonov (Jerusalem), Veronica Becher (Buenos Aires), Lenore Blum (Carnegie Mellon, The 2012 APAL Lecture), Rodney Downey (Wellington), Yuri Gurevich (Microsoft, The EACSL Lecture), Juris Hartmanis (Cornell), Richard Jozsa (Cambridge, jointly organised lecture with King's College), Stuart Kauffman (Vermont/ Santa Fe), James Murray (Oxford/Princeton, Microsoft Research Lecture), Stuart Shieber (Harvard), Paul Smolensky (Johns Hopkins) and Leslie Valiant (Harvard, jointly organised lecture with King's College). SUBMISSION OF ABSTRACTS OF INFORMAL PRESENTATIONS are invited for this historic event. For submission details, see: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/give-page.php?12 SUBMISSION DEADLINE for Informal Presentations: MAY 11, 2012 Authors will be notified of acceptance, usually within two weeks of submission. All accepted papers become eligible for consideration for post-conference journals: COMPUTABILITY will consider journal versions of papers presented at CiE conferences as a general rule; and there will be special issues of Logical Methods in Computer Science (LMCS), Annals of Pure and Applied Logic (APAL) and the Journal of Computational Biology. CiE 2012 CONFERENCE TOPICS include, but not exclusively - * Admissible sets * Algorithms * Analog computation * Artificial intelligence * Automata theory * Bioinformatics * Classical computability and degree structures * Cognitive science and modelling * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational biology * Computational creativity * Computational learning and complexity * Computational linguistics * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Emerging and Non-standard Models of Computation * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Machine learning * Mathematical models of emergence * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems * Natural Computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebras and concurrent systems * Programming language semantics * Proof mining and applications * Proof theory and computability * Proof complexity * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Semantics and logic of computation * Swarm intelligence and self-organisation * Type systems and type theory * Uncertain Reasoning * Weak systems of arithmetic and applications We particularly welcome submissions in emergent areas, such as bioinformatics and natural computation, where they have a basic connection with computability. CiE 2012 will have a special relationship to the scientific legacy of Alan Turing, reflected in the broad theme: How the World Computes, with all its different layers of meaning. Contributions which are directly related to the visionary and seminal work of Turing will be particularly welcome. SPECIAL SESSIONS include: * Cryptography, Complexity, and Randomness Chairs: Rod Downey and Jack Lutz Speakers so far: Eric Allender, Laurent Bienvenu, Lance Fortnow, Valentine Kabanets, Omer Reingold, Alexander Shen + Panel Discussion on Future Directions * The Turing Test and Thinking Machines Chairs: Mark Bishop and Rineke Verbrugge Speakers: Bruce Edmonds, John Preston, Susan Sterrett, Kevin Warwick, Jiri Wiedermann + Panel Discussion on Future Directions * Computational Models After Turing: The Church-Turing Thesis and Beyond Chairs: Martin Davis and Wilfried Sieg Speakers: Giuseppe Longo, Peter Nemeti, Stewart Shapiro, Matthew Szudzik, Philip Welch, Michiel van Lambalgen * Morphogenesis/Emergence as a Computability Theoretic Phenomenon Chairs: Philip Maini and Peter Sloot Speakers: Jaap Kaandorp, Shigeru Kondo, Nick Monk, John Reinitz, James Sharpe, Jonathan Sherratt * Open Problems in the Philosophy of Information Chairs: Pieter Adriaans and Benedikt Loewe Speakers: Patrick Allo, Luis Antunes, Mark Finlayson, Amos Golan, Ruth Millikan + Panel Discussion on Future Directions * The Universal Turing Machine, and History of the Computer Chairs: Jack Copeland and John Tucker Speakers so far: Steven Ericsson-Zenith, Ivor Grattan-Guinness, Mark Priestley, Robert I. Soare + Panel Discussion There will be the annual Women in Computability Workshop, supported by a grant from Elsevier, with contributions from Lenore Blum, Dorit Aharonov and Ann Copestake. PROGRAMME COMMITTEE: * Samson Abramsky (Oxford) * Pieter Adriaans (Amsterdam) * Franz Baader (Dresden) * Arnold Beckmann (Swansea) * Mark Bishop (London) * Paola Bonizzoni (Milan) * Luca Cardelli (Cambridge) * Douglas Cenzer (Gainesville) * S Barry Cooper (Leeds, Co-chair) * Ann Copestake (Cambridge) * Anuj Dawar (Cambridge, Co-chair) * Solomon Feferman (Stanford) * Bernold Fiedler (Berlin) * Luciano Floridi (Hertfordshire) * Martin Hyland (Cambridge) * Marcus Hutter (Canberra) * Viv Kendon (Leeds) * Stephan Kreutzer (Oxford) * Ming Li (Waterloo) * Benedikt Loewe (Amsterdam) * Angus MacIntyre (London) * Philip Maini (Oxford) * Larry Moss (Bloomington) * Amitabha Mukerjee (Kanpur) * Damian Niwinski (Warsaw) * Dag Normann (Oslo) * Prakash Panangaden (Montreal) * Jeff Paris (Manchester) * Brigitte Pientka (Montreal) * Helmut Schwichtenberg (Munich) * Wilfried Sieg (Carnegie Mellon) * Mariya Soskova (Sofia) * Bettina Speckmann (Eindhoven) * Christof Teuscher (Portland) * Peter van Emde Boas (Amsterdam) * Jan van Leeuwen (Utrecht) * Rineke Verbrugge (Groningen) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit abstracts of their proposed presentations (in PDF-format, max 1 page) for CiE 2012. We particularly invite papers that build bridges between different parts of the research community. ORGANISING COMMITTEE: Arnold Beckmann (Swansea), Luca Cardelli (Cambridge), S Barry Cooper (Leeds), Ann Copestake (Cambridge), Anuj Dawar (Cambridge, Chair), Martin Hyland (Cambridge), Benedikt Loewe (Amsterdam), Arno Pauly (Cambridge), Andrew Pitts (Cambridge) The conference is sponsored by the ASL, EACSL, EATCS, Elsevier, the IET, IFCoLog, King's College Cambridge, Science Magazine, The University of Cambridge and Microsoft Research. For a small poster to download and display: http://www.mathcomp.leeds.ac.uk/turing2012/WScie12/Images/cie12.poster.1000x1400.png Contact: Anuj Dawar - anuj.dawar(at)cl.cam.ac.uk or cie-2012 at cl.cam.ac.uk ********************************************************************** From esslli2012stus at loriweb.org Fri Apr 20 06:01:25 2012 From: esslli2012stus at loriweb.org (Rasmus K. Rendsvig) Date: Fri, 20 Apr 2012 12:01:25 +0200 Subject: [TYPES/announce] Grants and Reminder: ESSLLI 2012 Student Session (deadline April 30) In-Reply-To: <4EE9E448.8080204@loriweb.org> References: <4EE9E448.8080204@loriweb.org> Message-ID: <4F9133F5.1020604@loriweb.org> [apologies for multiple postings] * * *** PLEASE Forward to students who could have interest in attending this years ESSLLI*** Reminder and Grants Info *ESSLLI 2012 STUDENT SESSION* Held during The 24th European Summer School in Logic, Language and Information Opole, Poland, August 6-17, 2012 *EXTENDED DEADLINE: APRIL 30, 2012* http://loriweb.org/ESSLLI2012StuS/ This is a reminder of the final, extended deadline for submission to the ESSLLI 2012 Student Session and a notification that the ESSLLI 2012 OC are offering grants in form of waived fees to selected students. Preferences will be given to students actively participating in the Student Session. The deadline for submitting to the ESSLLI 2012 StuS is***APRIL 30*** For more information of grant application, instructions for authors and important dates, please refer to the Student Session website: http://loriweb.org/ESSLLI2012StuS/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From maffeis at doc.ic.ac.uk Sat Apr 21 05:06:12 2012 From: maffeis at doc.ic.ac.uk (Sergio Maffeis) Date: Sat, 21 Apr 2012 10:06:12 +0100 Subject: [TYPES/announce] PLAS 2012: Call for participation Message-ID: <4F927884.5050302@doc.ic.ac.uk> *********************************************************************** Call for Participation Seventh ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS 2012) http://www.doc.ic.ac.uk/PLAS2012 June 15, 2012 Co-located with PLDI 2012, Beijing, China *********************************************************************** ABOUT PLAS PLAS aims to provide a forum for exploring and evaluating ideas on the use of programming language and program analysis techniques to improve the security of software systems. Strongly encouraged are proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and important problems. 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 and algorithms * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Security concerns for web programming languages * Language design for security in new domains such as cloud computing and embedded platforms * Applications, case studies, and implementations of these techniques IMPORTANT DATES Early registration: May 1, 2012. PLAS 2010 workshop: June 15, 2012. STUDENT TRAVEL GRANTS Thanks to our sponsors, we are offering some travel grants to student attendees of PLAS. Precedence will be given to applicants from developing contries or authors of accepted papers. The application is handled by the PLDI travel grants system: http://pldi12.cs.purdue.edu/content/students PRELIMINARY PROGRAM Invited speaker: * Andrew Myers (Cornell University). Regular papers: * Security-Policy Monitoring and Enforcement with JavaMOP. Soha Hussein, Patrick Meredith and Grigore Rosu. * Development of secured systems by mixing programs, specifications and proofs in an object-oriented programming environment. Damien Doligez, Mathieu Jaume and Renaud Rioboo. * Hash-Flow Taint Analysis of Higher-Order Programs. Shuying Liang and Matthew Might. * Typing Illegal Information Flows as Program Effects. Ana Almeida Matos and Jos? Fragoso Santos. * Towards a Taint Mode for Cloud Computing Web Applications. Luciano Bello and Alejandro Russo. * Knowledge-Oriented Secure Multiparty Computation. Piotr Mardziel, Michael Hicks, Jonathan Katz and Mudhakar Srivatsa. Position papers: * Security Correctness for Secure Nested Transactions. Dominic Duggan and Ye Wu. * A generic approach for security policies composition. Alejandro Hernandez and Flemming Nielson. * Static Flow-Sensitive & Context-Sensitive Information-flow Analysis for Software Product Lines. Eric Bodden. PROGRAM COMMITTEE Sruthi Bandhakavi (Google Inc.) Avik Chaudhuri (Adobe Systems) Stephen Chong (Harvard University) Yuxin Deng (Shanghai Jiao Tong University) Feng Dengguo (Chinese Academy of Sciences) Marieke Huisman (University of Twente) Sergio Maffeis (Imperial College London) [co-chair] Prasad Naldurg (Microsoft Research India) Marco Pistoia (IBM T. J. Watson Research Center) Tamara Rezk (INRIA) [co-chair] David Sands (Chalmers University) Zhong Shao (Yale University) From jv at informatik.uni-bonn.de Sat Apr 21 16:51:09 2012 From: jv at informatik.uni-bonn.de (=?ISO-8859-15?Q?Janis_Voigtl=E4nder?=) Date: Sat, 21 Apr 2012 22:51:09 +0200 Subject: [TYPES/announce] Call for Papers - Haskell Symposium 2012 - six weeks to go Message-ID: <4F931DBD.5040508@informatik.uni-bonn.de> ======================================================================== "Haskell 2012" ACM SIGPLAN Haskell Symposium 2012 Copenhagen, Denmark 13th September, 2012 (directly after ICFP) CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2012/ ======================================================================== The ACM SIGPLAN Haskell Symposium 2012 will be co-located with the 2012 International Conference on Functional Programming (ICFP), in Copenhagen, Denmark. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Functional Pearls, being elegant, instructive examples of using Haskell; * Experience Reports, general practice and experience with Haskell, e.g., in an education or industry context. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (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, based on running (perhaps prototype) software rather than necessarily on novel research results. Such short demo proposals should explain why a demonstration would be of interest to the Haskell community. 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. In addition to printed proceedings, 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 proposals, assessed for relevance by the PC, will be published on the symposium web page, but not formally published in the proceedings. Submission Details: =================== * Abstract Submission: Thu 31st May 2012 * Submission Deadline: Sun 3rd June 2012, 11:00 am, UTC * Author Notification: Wed 27th June 2012 * Final Papers Due : Tue 10th July 2012 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. Demo proposals are limited to 2-page abstracts, in the same format. "Functional Pearls", "Experience Reports", and "Demo 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=haskell2012 Programme Committee: ==================== * Amal Ahmed, Northeastern University * Jost Berthold, University of Copenhagen * Nils Anders Danielsson, University of Gothenburg * Iavor Diatchki, Galois Inc. * Jeremy Gibbons, University of Oxford * Jurriaan Hage, Utrecht University * Zhenjiang Hu, National Institute of Informatics Tokyo * Daan Leijen, Microsoft Research * Ben Lippmeier, University of New South Wales * Simon Peyton Jones, Microsoft Research * Colin Runciman, University of York * Eijiro Sumii, Tohoku University * Janis Voigtl?nder (chair), University of Bonn * Brent Yorgey, University of Pennsylvania Links: ====== * http://www.haskell.org/haskell-symposium (the permanent web page of the Haskell Symposium) * http://www.haskell.org/haskell-symposium/2012 (the 2012 Haskell Symposium web page) * http://www.icfpconference.org/icfp2012 (the ICFP 2012 web page) -- Jun.-Prof. Dr. Janis Voigtl?nder http://www.iai.uni-bonn.de/~jv/ mailto:jv at iai.uni-bonn.de From ggrov at staffmail.ed.ac.uk Mon Apr 23 05:05:30 2012 From: ggrov at staffmail.ed.ac.uk (Gudmund Grov) Date: Mon, 23 Apr 2012 10:05:30 +0100 Subject: [TYPES/announce] WING 2012: Call for Presentations Message-ID: <7D1D62BD-6009-41D0-AC3D-E8AD55C38946@staffmail.ed.ac.uk> [Please post - apologies for multiple copies.] ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- Call for Presentations --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. This workshop aims to bring together researchers from the diverse field of invariant generation to discuss recent developments. Scope ----- We encourage ONE-PAGE ABSTRACT submissions on work in progress, new ideas, tools under development, as well as work by PhD students, to be presented at WING 2012. 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 the following tools: - 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 ---------- Submissions need not be original. Extended versions of submissions may have been published previously, or submitted concurrently with or after WING 2012 to another workshop, conference or a journal. Submission is by email to: wing2012 at easychair.org Please submit a ONE-PAGE abstract in PDF. Important Dates --------------- Submission deadline: May 15, 2012 Notification of acceptance: May 18, 2012 Workshop: June 30, 2012 Invited Speakers ---------------- * Aditya Nori (Microsoft Research) Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Student Support ---------------- Students will pay a reduced fee, and the difference will be reimbursed after the workshop. Publication ----------- Extended versions of accepted contributions may be submitted later to a special issue of the Journal of Science of Computer Programming. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From t.kitamura at aist.go.jp Mon Apr 23 21:36:23 2012 From: t.kitamura at aist.go.jp (Takashi KITAMURA) Date: Tue, 24 Apr 2012 10:36:23 +0900 Subject: [TYPES/announce] *Deadline extended (30th April)* CFP: ICFEM 2012 - 14th International Conference on Formal Engineering Methods Message-ID: The deadlines of full paper submissions to ICFEM 2012 have been extended again as follows. Full Paper Submission Deadline (Extended): 30th April, 2012 We are looking forward to your submissions. ************************************************************ ICFEM 2012: 14th International Conference on Formal Engineering Methods CALL FOR PAPERs 12th-16th, November, 2012 Kyoto Research Park, Kyoto, Japan URL: http://www.jaist.ac.jp/icfem2012 ************************************************************ ICFEM will come back to Japan in 2012 again! Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work that promises to bring practical and tangible benefit. ICFEM 2012 will be hosted by National Institute of Advanced Industrial Science and Technology (AIST) and Japan Advanced Institute of Science and Technology (JAIST), which will be held in Kyoto, JAPAN. Kyoto is the ancient capital of JAPAN, where you can find many historical sites which have been designated as World Heritage there. We are looking forward to your submissions. AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their practical applications will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Formal methods for cloud computing/robotics/cyber-physical systems/ medical devices/aeronautics/railway * Formal methods for self-* systems * Formal methods for software safety, security, reliability and dependability * Experiments involving verified systems * Formal methods used in certifying products under international standards (ISO 26262, IEC 61508, etc) * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2012 submission page (https://www.easychair.org/conferences/?conf=icfem2012), handled by the EasyChair conference system. IMPORTANT DATES Full Paper Submission Deadline (Extended): 30th April, 2012 Acceptance/Rejection Notification: 18th June, 2012 Camera Ready Copy Due: 16th July, 2012 Conference: 12th-16th, November, 2012. ORGANIZATION COMMITTEE General Chairs: Kokichi Futatsugi, JAIST, Japan Shaoying Liu, Hosei Uni., Japan Conference Chair: Hitoshi Ohsaki, AIST, Japan Program Chairs: Kenji Taguchi, AIST, Japan Toshiaki Aoki, JAIST, Japan Steering Committee: Keijiro Araki, Kyushu University, Japan Michael Butler, University of Southampton, UK Jin Song Dong, National University of Singapore, Singapore He Jifeng, East China Normal University, China Shaoying Liu (Chair), Hosei University, Japan Jeff Offutt, George Mason University, USA Shengchao Qin, University of Teesside, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Cyrille Artho (AIST, Japan) Richard Banach (University of Manchester, UK) Nikolaj Bjorner(Microsoft Research Redmond, USA) Jonathan P. Bowen (University of Westminster, UK) Michael Butler (University of Southampton, UK) Sagar Chaki (CMU/SEI, USA) Rance Cleaveland (University of Maryland/Reactive Systems, USA) Jim Davies (Oxford University, UK) Zhenhua Duan (Xidian University, China) Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain) Andy Galloway (University of York, UK) Stefania Gnesi (ISTI-CNR, Italy) Wolfgang Grieskamp (Google, USA) Klaus Havelund (NASA JPL, USA) Daniel Jackson (MIT, USA) Thierry Jeron (INRIA, France) Gerwin Klein (NICTA, Australia) Weiqiang Kong (Kyushu University, Japan) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Engineering College of Aarhus, Denmark) Insup Lee (University of Pennsylvania, USA) Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany) Xuandong Li (Nanjing University, China) Yuan-Fang Li (Monash University, Australia) Zhiming Liu (UNU/IIST, Macau) Dominique Mery (Nancy University and LORIA, France) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Alexandre Mota (CIn-UFPE, Brasil) Shin Nakajima (NII, Japan) Kazuhiro Ogata (JAIST, Japan) Jose Nuno Oliveira (Universidade do Minho, Portugal) Jun Pang (University of Luxembourg, Luxembourg) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) S. Ramesh (General Motors India, India) Alexander Romanovsky (Newcastle University, UK) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Greame Smith (The University of Queensland, Australia) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Yih-Kuen Tsay (National Taiwan University, Taiwan) Viktor Vafeiadis (MPI-SWS, Germany) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Wang Yi (Uppsala University, Sweden) Jian Zhang (Chinese Academy of Sciences, China) Huibiao Zhu (East China Normal University, China) -- Takashi KITAMURA Ph.D. t.kitamura at aist.go.jp National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 From pierre.geneves at inria.fr Tue Apr 24 05:08:01 2012 From: pierre.geneves at inria.fr (Pierre Geneves) Date: Tue, 24 Apr 2012 11:08:01 +0200 Subject: [TYPES/announce] PhD position in modal logics and type systems for web programming languages Message-ID: <4F966D71.1040909@inria.fr> Applications are invited for a PhD position at INRIA Grenoble, France. The appointment will be in the areas of type systems for web programming languages such as XQuery and logical reasoning for the automated verification of web information systems. The WAM project at INRIA Grenoble seeks to establish logical foundations and automated reasoning techniques with applications concerning, but not limited to, web programming languages, web engineering, static analysis of programs manipulating web data. Detailed information on the topic and on previous relevant research are available online: http://www.inria.fr/en/institute/recruitment/offers/phd/campaign-2012/%28view%29/details.html?id=PNGFK026203F3VBQB6G68LOE1&LOV5=4509&LG=EN&Resultsperpage=20&nPostingID=6364&nPostingTargetID=11632&option=52&sort=DESC&nDepartmentID=28 The fellowship is offered for a period of 36 months and can start as soon as september 2012, depending on the candidate availability. The position is under the supervision of Pierre Geneves (CNRS) and Cecile Roisin (UPMF). Applicants should have interests in the aforementioned areas with a concern in the intersection of theory and practice. Applications must be made online through the above URL, before May 4th 2012. Informal enquiries about the position are welcomed. Please contact Pierre Geneves and Cecile Roisin. http://www.pierresoft.com/pierre.geneves/ http://wam.inrialpes.fr/people/roisin/ From scott.west at inf.ethz.ch Tue Apr 24 07:55:25 2012 From: scott.west at inf.ethz.ch (Scott West) Date: Tue, 24 Apr 2012 13:55:25 +0200 Subject: [TYPES/announce] 2nd CfP: WAVE 2012 (extended deadline), Workshop on Advances in Verification for Eiffel Message-ID: <4F9694AD.3020205@inf.ethz.ch> Workshop on Advances in Verification for Eiffel (WAVE) 2012 Co-located with TOOLS EUROPE 2012 29 May 2012, Prague, Czech Republic http://wave.inf.ethz.ch SUBMISSION DEADLINE EXTENDED Call for Papers Correctness of software systems can be demonstrated by using static verification techniques such as theorem provers, model checkers and exhaustive testing. Static verifiers such as Spec# and ESC/Java have been developed for object-oriented languages. These verifiers have been shown to be feasible to apply to languages such as C# and Java, though the usability of the tools is still under investigation. The Eiffel language introduces significant challenges and opportunities for verification, both of correctness and for property checking. Eiffel's support for Design by Contract enables scalable and practical verification, while its expressive object-oriented model raises verification challenges that push state-of-the-art verification technology to the limit. This workshop focuses on advancing the state-of-the-art in verification technology for Eiffel. It will present work in progress as well as mature research and development results that address particular problems in verifying Eiffel software systems, both in terms of correctness and in terms of property checking (e.g., liveness or deadlock freedom for SCOOP programs). Research that demonstrates how verification techniques and tools for other languages (e.g., Java, C#, Ruby, Python) can be adapted or directly applied to Eiffel programs are particularly welcome, as are case studies or experiments in verification. Specific topics of interest at the workshop include, but are not limited to: - Theorem proving techniques applied to Eiffel programs - Denotational, operational and algebraic theories for contracts - Model checking applied to Eiffel programs - Automated testing techniques applied to Eiffel programs - Tools for verification of Eiffel programs - Verification techniques for other languages adapted to Eiffel programs - Verification techniques for other languages applied directly to Eiffel programs - Novel case studies or experiments in Eiffel verification - Proof-carrying code as applied to Eiffel - Techniques and tools for checking properties of Eiffel programs. Prospective authors are welcome to contact the workshop organisers to help clarify whether their work would be relevant to the workshop. Submissions The workshop solicits three types of papers: - Work-in-progress papers, demonstrating novel, promising or unusual research related to the topics above. These papers should be around 5-7 pages in LNCS format and should clear describe what is novel or promising about the work. - Research or experimental papers, demonstrating novel research results that are reasonably mature, and that would benefit from feedback and discussion at the workshop. These papers should be around 10-15 pages in LNCS format. - Tool papers, which describe novel tools for supporting verification. These papers should clearly describe what is novel about the tool, and should be around 5-7 pages in LNCS format. All papers will be peer-reviewed by the organisers and the programme committee, focusing on suitability for the workshop, novelty, and whether the work would lead to interesting discussions. Additional feedback will be provided during the workshop. Publication & Submission Accepted papers will appear in the workshop proceedings published as a CEUR workshop volume with an ISBN. A special issue of the Journal of Object Technology for extended versions of papers is under negotiation. Submission can be made through EasyChair, https://www.easychair.org/conferences/?conf=wave2012. Dates Submission: 2 May 2012 (new) Notification: 8 May 2012 Camera ready copy: 15 May 2012 Workshop date: 29 May 2012 Workshop Organisers Richard Paige, University of York, UK Bertrand Meyer, ETH Zurich, Switzerland Scott West, ETH Zurich, Switzerland Program Committee To be announced From jose.proenca at cs.kuleuven.be Tue Apr 24 08:21:45 2012 From: jose.proenca at cs.kuleuven.be (=?iso-8859-1?Q?Jos=E9_Proen=E7a?=) Date: Tue, 24 Apr 2012 14:21:45 +0200 Subject: [TYPES/announce] FOCLASA'12 Call For Papers References: Message-ID: <4706BFFF-CC01-4473-807E-1DFC57333BC4@cs.kuleuven.be> Call for Papers FOCLASA'12 11th International Workshop on Foundations of Coordination Languages and Self Adaptation A Satellite Workshop of CONCUR'12 http://foclasa.lcc.uma.es September 8th, 2012, Newcastle upon Tyne, UK FOCLASA 2012 is a satellite workshop of the 23rd International Conference on Concurrency Theory (CONCUR 2012). The goal is to provide a venue where researchers and practitioners on the topics given below can meet, exchange ideas and problems, identify some of the key and fundamental issues related to coordination languages and self adaptive systems, explore together and disseminate solutions. The proceedings will be published as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series. Following the tradition of the past editions, we plan to have a special issue of Science of Computer Programming (SCP) dedicated to extended versions of selected publications of this workshop. Download the call for papers: http://foclasa.lcc.uma.es/documents/cfp-foclasa12.pdf IMPORTANT DATES Abstract submission: May 25th, 2012 Paper submission: June 1st, 2012 Notification: July 2nd, 2012 Final version: July 16th, 2012 Workshop: September 8th, 2012 TOPICS OF INTEREST Topics of interest include (but are not limited to): - Theoretical models for component and service coordination, service composition and concurrent system modeling - Applications and usability studies for the aforementioned theoretical models, interaction and coordination challenges in various application domains - Languages and specification protocols for component and service interaction, their semantics, expressiveness, validation and verification, type checking, static and dynamic analysis - "Software as a service" models and dynamic software architectures, like mobile agent-based systems, self-organizing, self-adaptive and self-reconfigurable applications, cloud computing, etc - Tools and environments for the development of concurrent, customizable, self-monitoring, self-adaptive and self-reconfigurable applications - Algorithms, mathematical models and realization frameworks for quality-of-service observation, storage, history-based analysis in self-adaptive systems (queuing models, load balancing, fault- tolerance analysis, machine learning systems) In particular, practice, experience and methodologies from the following areas are solicited as well: * Business process modeling * Cloud computing * Component-based systems * Grid computing * Large-scale distributed systems * Multi-agent systems * Peer-to-peer systems * Service-oriented computing INVITER SPEAKER Sebastian Uchitel (Imperial College London) PAPER SUBMISSION Submissions must describe authors' original research work and their results. Description of work-in- progress with concrete results is also encouraged. The contributions should not exceed 15 pages formatted according to the style of the Electronic Proceedings in Theoretical Computer Science (EPTCS), and should be submitted as Portable Document Format (PDF) files using the EasyChair submission site. Submitting an abstract does not put any obligation on the authors to submit a full paper. Abstracts without an accompanying full paper by the paper submission deadline are automatically considered withdrawn. The authors are, however, encouraged to explicitly withdraw their abstract, if they decide not to submit a full paper. All submissions will be reviewed by an international program committee who will make a selection among the submissions based on the novelty, soundness and applicability of the presented ideas and results. Concurrent submission to other venues (conferences, workshops or journal) and submission of papers under consideration elsewhere are not allowed. A printed version of the proceedings will be distributed among participants during the workshop. The proceedings of the workshop will be published as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series. Participants will give a presentation of their papers in twenty minutes, followed by a ten-minute round of questions and discussion on participants' work. Following the tradition of the past editions, we plan to have a special issue of an international scientific journal devoted to FOCLASA 2012. Selected participants will be invited to submit an extended version of their papers after the workshop. These extended versions will be reviewed by an international program committee, which will decide on their final publication on the special issue. In the last few editions of FOCLASA, a special issue of Science of Computer Programming has been dedicated to this workshop. PROGRAM COMMITTEE CHAIRS Natallia Kokash, Leiden University, The Netherlands Ant?nio Ravara, New University of Lisbon, Portugal PROGRAM COMMITTEE Bernhard Beckert, Karlsruhe Institute of Technology, Germany Martin Berger, University of Sussex, UK Carlos Canal, University of Malaga, Spain Holger Giese, University of Potsdam, Germany Ludovic Henrio, INRIA Sophia Antipolis, France Thomas Hildebrandt, IT University of Copenhagen, Denmark Paola Inverardi, Universit? dell'Aquila, Italy Zhiming Liu, United Nations University, China Ant?nia Lopes, University of Lisbon, Portugal MohammadReza Mousavi, Eindhoven University of Technology, The Netherlands Jos? Proen?a, Katholieke Universiteit Leuven, Belgium Pascal Poizat, University of Evry, France Ant?nio Ravara, New University of Lisbon, Portugal Carolyn Talcott, SRI International, USA Francesco Tiezzi, IMT Lucca Institute for Advanced Studies, Italy Marjan Sirjani, Reykjavik University, Iceland Mirko Viroli, University of Bologna, Italy STEERING COMMITTEE Farhad Arbab, CWI, The Netherlands Ant?nio Brogi, University of Pisa, Italy Carlos Canal, University of Mal?ga, Spain Jean-Marie Jacquet, University of Namur, Belgium Ernesto Pimentel, University of Mal?ga, Spain Gwen Sala?n, Grenoble INP - INRIA Grenoble - LIG, France Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm From nipkow at in.tum.de Tue Apr 24 15:48:57 2012 From: nipkow at in.tum.de (Tobias Nipkow) Date: Tue, 24 Apr 2012 21:48:57 +0200 Subject: [TYPES/announce] Isabelle Users Workshop 2012 Message-ID: <4F9703A9.7070807@in.tum.de> CALL FOR PAPERS Isabelle Users Workshop 2012 http://in.tum.de/~nipkow/Isabelle2012 Associated with Interactive Theorem Proving (ITP 2012) Princeton, NJ, USA This informal workshop is intended to bring together Isabelle users and developers. Participants are invited to present their research and projects, including applications of Isabelle, internal developments, add-on tools, etc. Well-argued position papers (e.g. describing proposed extensions) are also welcome, and reports on work in progress. Please submit a paper (or extended abstract) of up to 20 pages. These will be reviewed informally and accepted papers will form part of the programme. Time permitting, the workshop will include demonstrations or briefings by the development team. There will also be opportunities to discuss issues of interest to the Isabelle community. Papers should be submitted (in PDF) using EasyChair. No formal proceedings will be published, but accepted papers will be available on the workshop website. Submission URL: http://www.easychair.org/conferences/?conf=isabelle2012 Important Dates: * Paper submission deadline: June 15 * Notification of acceptance: June 29 * Workshop: August 12 Organisers: Tobias Nipkow, Larry Paulson and Makarius Wenzel From hilde at itu.dk Tue Apr 24 15:51:47 2012 From: hilde at itu.dk (Thomas Hildebrandt) Date: Tue, 24 Apr 2012 21:51:47 +0200 Subject: [TYPES/announce] 2nd CFP (Deadline extended, May 5th): First Workshop on Modelling and Reasoning for Cyber-Physical Systems (MoRe4CPS) Message-ID: <4F970453.5040808@itu.dk> 2nd Call For Papers: First Workshop on Modelling and Reasoning for Cyber-Physical Systems (MoRe4CPS) (Extended Deadline) Co-located with the 8^th European Conference on Modelling Foundations and Applications (ECMFA-2012), July 2-5 (http://www2.imm.dtu.dk/conferences/ECMFA-2012) Technical University of Denmark, Kgs. Lyngby, Workshop: July 3rd Deadline for submissions: May 5th (extended), 2012 Notification: May 21th (extended), 2012 Final Version: June 3rd, 2012 Cyber-physical systems are large-scale distributed systems, often viewed as networked embedded systems, where a large number of computational components are deployed in a physical environment. Each component collects information about and offers services to its environment. This information is processed either at the component, in the network or at a remote location, or in any combination of these. This workshop aims at connecting researchers working on mathematically well-founded and coherent models, methods, and tools that may serve as the foundation of a model-driven design methodology for cyber-physical systems. This means that design decisions, analysis, simulation, testing, code generation, etc. are always based upon models that reflect the relevant aspects of the design. This requires methods to maintain, manipulate, analyse and transform models in a coherent and meaningful way. All papers will be peer-reviewed and accepted papers will be published as a pre-proceeding appearing as a technical report and archived at CEUR (http://ceur-ws.org/). Selected papers will be invited to submission for subsequent publication in a journal (to be negotiated). Two kinds of papers can be submitted: 1. full papers up to 12 pages in easychair format presenting previously unpublished work 2. short papers (2-6) pages in easychair format presenting work in progress, abstract of previously published work or overview of research programmes (position paper) Papers should be submitted via Easychair (http://www.easychair.org/conferences/?conf=ecmfa-workshops2012) Topics of interest (in no particular order) include: * adaptivity * hybrid systems * embedded systems * distributed execution * spatial computation * declarative modelling * logics and logical frameworks * categorical models * event-based systems and models * context-awareness * pervasive computing * systems biology * healthcare systems * process calculi * static analysis * type systems * model checking * refinement * temporal properties with preferences * security * fractionated software Programme Committee: * Dieter Gollmann, Hamburg-Harburg * Thomas Hildebrandt (chair, organizer), IT University of Copenhagen * Marta Kwiatkowska, Oxford University * Flemming Nielson (organizer), Danish Technical University * Paulo Tabuada, University of California at Los Angeles * Mark-Oliver Stehr, SRI International * Huibiao Zhu, East China Normal University Logistics Travel, accommodation and registration information is available on the main ECMFA 2012 site (http://www2.imm.dtu.dk/conferences/ECMFA-2012/) Papers will only be published if at least one of its authors has registered for the workshop or for ECMFA as a whole by the time the final versions of papers are due. The workshop is sponsored by MT-LAB (http://www.mt-lab.dk/) and IDEA4CPS (http://www.idea4cps.dk/en/home/). -------------- next part -------------- An HTML attachment was scrubbed... URL: From cezarykaliszyk at gmail.com Wed Apr 25 09:59:29 2012 From: cezarykaliszyk at gmail.com (Cezary Kaliszyk) Date: Wed, 25 Apr 2012 15:59:29 +0200 Subject: [TYPES/announce] UITP'12: Final Call for Papers Message-ID: [Apologies if you receive multiple copies] *** Post-proceedings will appear in EPTCS *** ------------------------------------------------ --- Final Call for Papers --- 10th International Workshop on User Interfaces for Theorem Provers (UITP 2012) 11.07.2012, Bremen, Germany, Part of CICM 2012 http://www.informatik.uni-bremen.de/uitp12/ While interactive theorem provers have found many new application areas in the last years, the system interfaces have often not enjoyed the same attention as the proof engines themselves. In many cases, interfaces remain relatively basic and under-designed. More and more, this is becoming an obstacle for the wider adoption of theorem proving technologies outside the academic community. The User Interfaces for Theorem Provers workshop series provides a forum for researchers interested in improving human interaction with interactive proof systems, be it theorem provers, formal method tools, and other tools manipulating and presenting mathematical formulas. For the forthcoming 10th UITP workshop, we invite contributions from the theorem proving, formal methods and tools, and HCI communities, both to report on experience with existing systems, and to discuss new directions. Topics covered include, but are not limited to: * Application-specific interaction mechanisms or designs for prover interfaces; * Experiments and evaluation of prover interfaces; * Languages and tools for authoring, exchanging and presenting proof; * Implementation techniques (e.g. web services, custom middleware, DSLs); * Integration of interfaces and tools to explore and construct proof; * Representation and manipulation of mathematical knowledge or objects; * Visualisation of mathematical objects and proof; * System descriptions. Submitted papers should describe previously unpublished work (completed or in progress), and not be longer than twelve pages. We encourage concise but relevant papers. Submissions should be in PDF format, and typeset with the EasyChair LaTeX document class (which can be downloaded from www.easychair.org), or in similar style. Submission are via EasyChair. All papers will be peer reviewed by members of the programme committee and selected by the organizers in accordance with the referee reports. Proceedings Accepted papers will appear in the workshop proceedings, which will be available in printed form at the workshop. After the workshop, revised papers can be submitted to a postproceedings, which will appear in EPTCS. Important Dates Submission deadline: 01.05.2012 Acceptance notification: 01.06.2012 Camera-ready copy: 15.06.2012 Program Committee: David Aspinall, University of Edinburgh, UK Serge Autexier, DFKI, Germany Christoph Benzmueller, Articulate Software, USA Herman Geuvers, Radboud University Nijmegen, the Netherlands Cezary Kaliszyk, University of Innsbruck, Austria, (PC co-chair) Christoph L?th, DFKI, Germany (PC co-chair) Adam Naumowicz, University of Bia?ystok, Poland Claudio Sacerdoti Coen, University of Bologna, Italy Geoff Sutcliffe, University of Miami, United States Enrico Tassi, INRIA, France Josef Urban, Radboud University Nijmegen, the Netherlands Makarius Wenzel, Universit? Paris-Sud 11, France -- Cezary Kaliszyk, University of Innsbruck, http://cl-informatik.uibk.ac.at/~cek/ From cbraga at ic.uff.br Thu Apr 26 09:18:57 2012 From: cbraga at ic.uff.br (Christiano Braga) Date: Thu, 26 Apr 2012 10:18:57 -0300 Subject: [TYPES/announce] Last CFP: SBMF 2012 Message-ID: [Apologies for multiple copies of this call.] ===SBMF 2012=== 15th BRAZILIAN SYMPOSIUM ON FORMAL METHODS http://cbsoft.dimap.ufrn.br/ Natal, Brazil September 23-28, 2012 Abstract Submission: May 08, 2012 (American Samoa Time Zone) Paper Submission: May 14, 2012 (American Samoa Time Zone) CALL FOR PAPERS =============== SBMF 2012 is the fifteenth of a series of events devoted to the development, dissemination and use of formal methods for the construction of high-quality computational systems. It is now a well-established event, with an international reputation. Keynote speakers will be * John Rushby, SRI International, Menlo Park CA, USA * Wolfram Schulte, Microsoft Research, Redmond WA, USA The symposium will be part of a larger event, CBSoft, the Brazilian Conference on Software: Theory and Practice (http://cbsoft.dimap.ufrn.br/) including as well as SBMF three other symposia: *XXVI Brazilian Symposium on Software Engineering (SBES); *XVI Brazilian Symposium on Programming Languages (SBLP); *VI Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS). CBSoft will be held in Natal, an important city in research and development in both academic and industrial areas. It is also known as "City of the Dunes", with a Park of Dunes measuring 8 kilometers of extension and 1,8 kilometer of width. Its sea is of calm, blue and crystal clear waters. The south coast comprises 15 beaches with dunes, cliffs, coconut trees, hills, reefs and some natural swimming pools. The aim of SBMF is to provide a venue for the presentation and discussion of high-quality papers, from researchers with a broad range of interests in formal methods, on recent developments in this field. The topics include, but are not limited to, the following: -Well-founded specification and des